%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM657^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 : n006.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:54 AM UTC 2026
% Result : Theorem 3.76s 1.72s
% Output : Refutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 25 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 173 ( 53 ~; 15 |; 2 &; 84 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_decl,type,
x: nat ).
thf(y_decl,type,
y: nat ).
thf(less_decl,type,
less: nat > nat > $o ).
thf(more_decl,type,
more: nat > nat > $o ).
thf(1,conjecture,
~ ( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10h) ).
thf(2,negated_conjecture,
~ ~ ( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ~ ( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( more @ x @ y )
| ( x = y ) ),
inference(cnf,[status(esa)],[7]) ).
thf(9,plain,
( ( y = x )
| ( more @ x @ y ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(3,axiom,
less @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(10,plain,
less @ x @ y,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(5,axiom,
! [A: nat,B: nat] :
~ ( ( ( A = B )
=> ~ ( more @ A @ B ) )
=> ~ ~ ( ( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ( ( less @ A @ B )
=> ( A != B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10b) ).
thf(12,plain,
! [A: nat,B: nat] :
~ ( ( ( A = B )
=> ~ ( more @ A @ B ) )
=> ( ( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ( ( less @ A @ B )
=> ( A != B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(13,plain,
~ ( ! [A: nat,B: nat] :
( ( A = B )
=> ~ ( more @ A @ B ) )
=> ( ! [A: nat,B: nat] :
( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ! [A: nat,B: nat] :
( ( less @ A @ B )
=> ( A != B ) ) ) ),
inference(miniscope,[status(thm)],[12]) ).
thf(14,plain,
! [F: nat,E: nat,D: nat,C: nat,B: nat,A: nat] :
( ( ( A != B )
| ~ ( more @ A @ B ) )
& ( ~ ( more @ C @ D )
| ~ ( less @ C @ D ) )
& ( ~ ( less @ E @ F )
| ( E != F ) ) ),
inference(cnf,[status(esa)],[13]) ).
thf(16,plain,
! [B: nat,A: nat] :
( ~ ( more @ A @ B )
| ~ ( less @ A @ B ) ),
inference(cnfConj,[status(thm)],[14]) ).
thf(20,plain,
! [B: nat,A: nat] :
( ~ ( more @ A @ B )
| ~ ( less @ A @ B ) ),
inference(simp,[status(thm)],[16]) ).
thf(27,plain,
! [B: nat,A: nat] :
( ~ ( more @ A @ B )
| ~ $true
| ( ( less @ x @ y )
!= ( less @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[10,20]) ).
thf(28,plain,
! [B: nat,A: nat] :
( ~ ( more @ A @ B )
| ( ( less @ x @ y )
!= ( less @ A @ B ) ) ),
inference(simp,[status(thm)],[27]) ).
thf(29,plain,
~ ( more @ x @ y ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( x )),bind(B,$thf( y ))]]) ).
thf(30,plain,
( ( y = x )
| $false ),
inference(rewrite,[status(thm)],[9,29]) ).
thf(31,plain,
y = x,
inference(simp,[status(thm)],[30]) ).
thf(17,plain,
! [B: nat,A: nat] :
( ~ ( less @ A @ B )
| ( A != B ) ),
inference(cnfConj,[status(thm)],[14]) ).
thf(21,plain,
! [B: nat,A: nat] :
( ( A != B )
| ~ ( less @ A @ B ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(22,plain,
! [A: nat] :
~ ( less @ A @ A ),
inference(simp,[status(thm)],[21]) ).
thf(23,plain,
! [A: nat] :
( ~ $true
| ( ( less @ x @ y )
!= ( less @ A @ A ) ) ),
inference(paramod_ordered,[status(thm)],[10,22]) ).
thf(24,plain,
! [A: nat] :
( ( less @ x @ y )
!= ( less @ A @ A ) ),
inference(simp,[status(thm)],[23]) ).
thf(25,plain,
! [A: nat] :
( ( x != A )
| ( y != A ) ),
inference(simp,[status(thm)],[24]) ).
thf(26,plain,
y != x,
inference(simp,[status(thm)],[25]) ).
thf(32,plain,
$false,
inference(simplifyReflect,[status(thm)],[31,26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM657^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.10 % 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.26 % Computer : n006.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Tue Sep 29 12:32:09 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 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.70 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.31/0.81 % [INFO] Parsing done (110ms).
% 1.31/0.82 % [INFO] Running in sequential loop mode.
% 1.73/1.13 % [INFO] eprover registered as external prover.
% 1.73/1.14 % [INFO] Scanning for conjecture ...
% 2.00/1.18 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 2.13/1.20 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.13/1.21 % [INFO] Problem is higher-order (TPTP THF).
% 2.13/1.22 % [INFO] Type checking passed.
% 2.13/1.22 % [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.76/1.71 % [INFO] Killing All external provers ...
% 3.76/1.72 % Time passed: 1331ms (effective reasoning time: 895ms)
% 3.76/1.72 % 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.76/1.72 % Axioms used in derivation (2): l, satz10b
% 3.76/1.72 % No. of inferences in proof: 27
% 3.76/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1331 ms resp. 895 ms w/o parsing
% 3.76/1.78 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.76/1.78 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------