%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM660^1 : TPTP v9.3.1. Released v3.7.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 : n020.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:55 AM UTC 2026
% Result : Theorem 3.07s 1.99s
% Output : Refutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 5 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 32 ( 7 ~; 0 |; 0 &; 18 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 ^; 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_decl,type,
x: nat ).
thf(y_decl,type,
y: nat ).
thf(more_decl,type,
more: nat > nat > $o ).
thf(less_decl,type,
less: nat > nat > $o ).
thf(1,conjecture,
( ~ ( less @ y @ x )
=> ( y = x ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz13) ).
thf(2,negated_conjecture,
~ ( ~ ( less @ y @ x )
=> ( y = x ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ( ~ ( less @ y @ x )
=> ( y = x ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(10,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: nat,B: nat] :
( ( more @ A @ B )
=> ( less @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz11) ).
thf(13,plain,
! [A: nat,B: nat] :
( ( more @ A @ B )
=> ( less @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(15,plain,
$false,
inference(e,[status(thm)],[5,10,13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM660^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % 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.09/0.19 % Computer : n020.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 12:33:49 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/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.90/0.77 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.26/0.96 % [INFO] Parsing done (187ms).
% 1.26/0.97 % [INFO] Running in sequential loop mode.
% 1.86/1.38 % [INFO] eprover registered as external prover.
% 1.86/1.39 % [INFO] Scanning for conjecture ...
% 2.07/1.47 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.23/1.50 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.23/1.52 % [INFO] Problem is higher-order (TPTP THF).
% 2.23/1.52 % [INFO] Type checking passed.
% 2.23/1.53 % [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.07/1.98 % External prover 'e' found a proof!
% 3.07/1.99 % [INFO] Killing All external provers ...
% 3.07/1.99 % Time passed: 1648ms (effective reasoning time: 1005ms)
% 3.07/1.99 % 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.07/1.99 % Axioms used in derivation (2): m, satz11
% 3.07/1.99 % No. of inferences in proof: 8
% 3.07/1.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1648 ms resp. 1005 ms w/o parsing
% 3.07/2.02 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.07/2.02 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------