%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM418^1 : TPTP v9.3.1. Released v3.6.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 : n018.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:17:50 AM UTC 2026
% Result : Theorem 4.56s 2.32s
% Output : Refutation 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 8 ( 7 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 39 ( 4 ~; 0 |; 0 &; 35 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-4 aty)
% Number of variables : 23 ( 18 ^; 2 !; 3 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(three_decl,type,
three: ( $i > $i ) > $i > $i ).
thf(plus_decl,type,
plus: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(three_def,definition,
( three
= ( ^ [A: $i > $i,B: $i] : ( A @ ( A @ ( A @ B ) ) ) ) ) ).
thf(plus_def,definition,
( plus
= ( ^ [A: ( $i > $i ) > $i > $i,B: ( $i > $i ) > $i > $i,C: $i > $i,D: $i] : ( A @ C @ ( B @ C @ D ) ) ) ) ).
thf(1,conjecture,
? [A: ( $i > $i ) > $i > $i] :
( ( plus @ A @ three )
= three ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ? [A: ( $i > $i ) > $i > $i] :
( ( plus @ A @ three )
= three ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: ( $i > $i ) > $i > $i] :
( ( ^ [B: $i > $i,C: $i] : ( A @ B @ ( B @ ( B @ ( B @ C ) ) ) ) )
= ( ^ [B: $i > $i,C: $i] : ( B @ ( B @ ( B @ C ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: ( $i > $i ) > $i > $i] :
( ( ^ [B: $i > $i,C: $i] : ( A @ B @ ( B @ ( B @ ( B @ C ) ) ) ) )
!= ( ^ [B: $i > $i,C: $i] : ( B @ ( B @ ( B @ C ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: ( $i > $i ) > $i > $i] :
( ( ^ [B: $i > $i,C: $i] : ( A @ B @ ( B @ ( B @ ( B @ C ) ) ) ) )
!= ( ^ [B: $i > $i,C: $i] : ( B @ ( B @ ( B @ C ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
$false,
inference(pre_uni,[status(thm)],[5:[bind(A,$thf( ^ [B: $i > $i] : ^ [C: $i] : C ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM418^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.08 % 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.11/0.26 % Computer : n018.cluster.edu
% 0.11/0.26 % Model : x86_64 x86_64
% 0.11/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.26 % Memory : 8046.5625MB
% 0.11/0.26 % OS : Linux 6.8.0-71-generic
% 0.11/0.26 % CPULimit : 300
% 0.11/0.26 % WCLimit : 300
% 0.11/0.26 % DateTime : Tue Sep 29 12:01:41 UTC 2026
% 0.11/0.26 % CPUTime :
% 0.11/0.26 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.97/0.76 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.35/1.03 % [INFO] Parsing done (259ms).
% 1.72/1.05 % [INFO] Running in sequential loop mode.
% 2.34/1.49 % [INFO] eprover registered as external prover.
% 2.60/1.50 % [INFO] Scanning for conjecture ...
% 2.79/1.65 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.79/1.68 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.79/1.68 % [INFO] Problem is higher-order (TPTP THF).
% 2.79/1.69 % [INFO] Type checking passed.
% 2.79/1.69 % [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 ...
% 4.56/2.32 % [INFO] Killing All external provers ...
% 4.56/2.32 % Time passed: 1911ms (effective reasoning time: 1260ms)
% 4.56/2.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)>
% 4.56/2.32 % Axioms used in derivation (0):
% 4.56/2.32 % No. of inferences in proof: 6
% 4.56/2.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1911 ms resp. 1260 ms w/o parsing
% 4.56/2.35 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.56/2.36 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------