%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:52:25 AM UTC 2026
% Result : Theorem 2.20s 1.32s
% Output : Refutation 2.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 6 ( 3 unt; 0 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 : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 0 ^; 5 !; 3 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(r1_decl,type,
r1: $i > $i > $o ).
thf(p201_decl,type,
p201: $i > $o ).
thf(p101_decl,type,
p101: $i > $o ).
thf(1,conjecture,
~ ? [A: $i] :
~ ( ~ ( ( A @ p101 )
& ( A @ p201 ) )
| ~ ! [B: $i] :
( ~ ( ( B @ p101 )
& ( B @ p201 ) )
| ~ ( B @ ( A @ r1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
~ ( ~ ( ( A @ p101 )
& ( A @ p201 ) )
| ~ ! [B: $i] :
( ~ ( ( B @ p101 )
& ( B @ p201 ) )
| ~ ( B @ ( A @ r1 ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ~ ? [A: $i] :
~ ( ~ ( ( A @ p101 )
& ( A @ p201 ) )
| ~ ! [B: $i] :
( ~ ( ( B @ p101 )
& ( B @ p201 ) )
| ~ ( B @ ( A @ r1 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i] : ( A @ ( A @ r1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
thf(11,plain,
! [A: $i] : ( A @ ( A @ r1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(13,plain,
$false,
inference(e,[status(thm)],[4,11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.13/0.38 % Computer : n003.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri Sep 25 23:10:23 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.59/0.70 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.72/0.78 % [INFO] Parsing done (85ms).
% 0.72/0.79 % [INFO] Running in sequential loop mode.
% 1.13/0.97 % [INFO] eprover registered as external prover.
% 1.13/0.98 % [INFO] Scanning for conjecture ...
% 1.13/1.02 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 1.44/1.04 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.44/1.04 % [INFO] Problem is first-order (TPTP FOF).
% 1.44/1.04 % [INFO] Type checking passed.
% 1.44/1.05 % [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.20/1.32 % External prover 'e' found a proof!
% 2.20/1.32 % [INFO] Killing All external provers ...
% 2.20/1.32 % Time passed: 837ms (effective reasoning time: 531ms)
% 2.20/1.32 % 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.20/1.32 % Axioms used in derivation (1): reflexivity
% 2.20/1.32 % No. of inferences in proof: 6
% 2.20/1.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 837 ms resp. 531 ms w/o parsing
% 2.20/1.36 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.20/1.36 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------