%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM417^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 : 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 : Wed Sep 30 08:17:50 AM UTC 2026
% Result : Theorem 143.60s 140.37s
% Output : Refutation 143.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 6 ( 6 unt; 0 typ; 2 def)
% Number of atoms : 6 ( 4 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 38 ( 2 ~; 0 |; 0 &; 36 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-4 aty)
% Number of variables : 5 ( 5 ^; 0 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(ten_decl,type,
ten: ( $i > $i ) > $i > $i ).
thf(mult_decl,type,
mult: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(ten_def,definition,
( ten
= ( ^ [A: $i > $i,B: $i] : ( A @ ( A @ ( A @ ( A @ ( A @ ( A @ ( A @ ( A @ ( A @ ( A @ B ) ) ) ) ) ) ) ) ) ) ) ) ).
thf(mult_def,definition,
( mult
= ( ^ [A: ( $i > $i ) > $i > $i,B: ( $i > $i ) > $i > $i,C: $i > $i] : ( A @ ( B @ C ) ) ) ) ).
thf(1,conjecture,
( ( mult @ ( mult @ ten @ ten ) @ ( mult @ ten @ ten ) )
= ( mult @ ( mult @ ( mult @ ten @ ten ) @ ten ) @ ten ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
( ( mult @ ( mult @ ten @ ten ) @ ( mult @ ten @ ten ) )
!= ( mult @ ( mult @ ( mult @ ten @ ten ) @ ten ) @ ten ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
$false,
inference(simp,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM417^1 : TPTP v9.3.1. Released v3.6.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.10/0.21 % Computer : n003.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Tue Sep 29 12:01:04 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 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.89/0.79 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.23/1.01 % [INFO] Parsing done (221ms).
% 1.23/1.03 % [INFO] Running in sequential loop mode.
% 2.12/1.43 % [INFO] eprover registered as external prover.
% 2.12/1.43 % [INFO] Scanning for conjecture ...
% 2.32/1.55 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.32/1.58 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.32/1.58 % [INFO] Problem is higher-order (TPTP THF).
% 2.32/1.58 % [INFO] Type checking passed.
% 2.32/1.59 % [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 ...
% 143.60/140.36 % [INFO] Killing All external provers ...
% 143.60/140.36 % Time passed: 140012ms (effective reasoning time: 139327ms)
% 143.60/140.36 % 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)>
% 143.60/140.37 % Axioms used in derivation (0):
% 143.60/140.37 % No. of inferences in proof: 4
% 143.60/140.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 140012 ms resp. 139327 ms w/o parsing
% 143.94/140.43 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 143.94/140.43 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------