## TSTP Solution File: LCL666+1.001 by Leo-III---1.7.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Leo-III---1.7.0
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 18 04:12:36 EDT 2022

% Result   : Theorem 2.65s 1.53s
% Output   : Refutation 2.77s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :    9 (   3 unt;   3 typ;   0 def)
%            Number of atoms       :   18 (   0 equ;   0 cnn)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   54 (  20   ~;   6   |;   6   &;  22   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :    8 (   0   ^   5   !;   3   ?;   8   :)

%------------------------------------------------------------------------------
thf(r1_type,type,
r1: \$i > \$i > \$o ).

thf(p201_type,type,
p201: \$i > \$o ).

thf(p101_type,type,
p101: \$i > \$o ).

thf(1,conjecture,
~ ? [A: \$i] :
~ ( ~ ! [B: \$i] :
( ~ ( r1 @ A @ B )
| ~ ( ( p201 @ B )
& ( p101 @ B ) ) )
| ~ ( ( p201 @ A )
& ( p101 @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

thf(2,negated_conjecture,
~ ~ ? [A: \$i] :
~ ( ~ ! [B: \$i] :
( ~ ( r1 @ A @ B )
| ~ ( ( p201 @ B )
& ( p101 @ B ) ) )
| ~ ( ( p201 @ A )
& ( p101 @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
~ ~ ? [A: \$i] :
~ ( ~ ! [B: \$i] :
( ~ ( r1 @ A @ B )
| ~ ( ( p201 @ B )
& ( p101 @ B ) ) )
| ~ ( ( p201 @ A )
& ( p101 @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
! [A: \$i] : ( r1 @ A @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

thf(10,plain,
! [A: \$i] : ( r1 @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(18,plain,
\$false,
inference(e,[status(thm)],[4,10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14  % Command  : run_Leo-III %s %d
% 0.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Sep  1 23:39:59 EDT 2022
% 0.14/0.35  % CPUTime  :
% 0.82/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.11/0.89  % [INFO] 	 Parsing done (105ms).
% 1.11/0.90  % [INFO] 	 Running in sequential loop mode.
% 1.44/1.10  % [INFO] 	 eprover registered as external prover.
% 1.44/1.10  % [INFO] 	 cvc4 registered as external prover.
% 1.44/1.10  % [INFO] 	 Scanning for conjecture ...
% 1.44/1.15  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ...
% 1.67/1.17  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.67/1.17  % [INFO] 	 Problem is first-order (TPTP FOF).
% 1.67/1.18  % [INFO] 	 Type checking passed.
% 1.67/1.18  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ...
% 2.65/1.53  % External prover 'e' found a proof!
% 2.65/1.53  % [INFO] 	 Killing All external provers ...
% 2.65/1.53  % Time passed: 1055ms (effective reasoning time: 626ms)
% 2.65/1.53  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.65/1.53  % Axioms used in derivation (1): reflexivity
% 2.65/1.53  % No. of inferences in proof: 6
% 2.65/1.53  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1055 ms resp. 626 ms w/o parsing
% 2.77/1.55  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.77/1.55  % [INFO] 	 Killing All external provers ...
%------------------------------------------------------------------------------
```