%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU894^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n010.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 : Wed Sep 30 08:29:32 AM UTC 2026
% Result : Theorem 3.46s 2.22s
% Output : Refutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 13 ( 12 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 50 ( 2 ~; 0 |; 9 &; 27 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 3 ^; 12 !; 9 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(1,conjecture,
! [A: $i > $i] :
? [B: $i > $i] :
( ( ! [C: ( $i > $i ) > $o] :
( ( ( C @ A )
& ! [D: $i > $i] :
( ( C @ D )
=> ( C
@ ^ [E: $i] : ( A @ ( D @ E ) ) ) ) )
=> ( C @ B ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( C = D ) ) ) )
=> ? [C: $i] :
( ( A @ C )
= C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM15_0_pme) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i] :
? [B: $i > $i] :
( ( ! [C: ( $i > $i ) > $o] :
( ( ( C @ A )
& ! [D: $i > $i] :
( ( C @ D )
=> ( C
@ ^ [E: $i] : ( A @ ( D @ E ) ) ) ) )
=> ( C @ B ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( C = D ) ) ) )
=> ? [C: $i] :
( ( A @ C )
= C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i] :
? [B: $i > $i] :
( ( ! [C: ( $i > $i ) > $o] :
( ( ( C @ A )
& ! [D: $i > $i] :
( ( C @ D )
=> ( C
@ ^ [E: $i] : ( A @ ( D @ E ) ) ) ) )
=> ( C @ B ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( C = D ) ) ) )
=> ? [C: $i] :
( ( A @ C )
= C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(29,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU894^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.10/0.18 % Computer : n010.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 14:44:48 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.87/0.77 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.18/0.96 % [INFO] Parsing done (188ms).
% 1.18/0.98 % [INFO] Running in sequential loop mode.
% 1.75/1.37 % [INFO] eprover registered as external prover.
% 1.75/1.38 % [INFO] Scanning for conjecture ...
% 1.92/1.47 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.10/1.51 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.10/1.51 % [INFO] Problem is higher-order (TPTP THF).
% 2.10/1.51 % [INFO] Type checking passed.
% 2.10/1.52 % [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 ...
% 3.46/2.21 % External prover 'e' found a proof!
% 3.46/2.21 % [INFO] Killing All external provers ...
% 3.46/2.21 % Time passed: 1887ms (effective reasoning time: 1230ms)
% 3.46/2.21 % 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)>
% 3.46/2.21 % Axioms used in derivation (0):
% 3.46/2.21 % No. of inferences in proof: 4
% 3.46/2.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1887 ms resp. 1230 ms w/o parsing
% 3.46/2.25 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.46/2.25 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------