%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM681_8 : TPTP v9.3.1. Released v8.0.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 : n005.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 : Sun Sep 27 08:09:36 AM UTC 2026
% Result : Theorem 9.28s 4.75s
% Output : Refutation 9.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 112 ( 32 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 357 ( 58 ~; 30 |; 2 &; 242 @)
% ( 0 <=>; 25 =>; 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 : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 78 ( 0 ^; 78 !; 0 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_decl,type,
x: nat ).
thf(y_decl,type,
y: nat ).
thf(z_decl,type,
z: nat ).
thf(pl_decl,type,
pl: nat > nat > nat ).
thf(less_decl,type,
less: nat > nat > $o ).
thf(more_decl,type,
more: nat > nat > $o ).
thf(3,axiom,
( ( z @ ( x @ pl ) )
= ( z @ ( y @ pl ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i) ).
thf(11,plain,
( ( z @ ( x @ pl ) )
= ( z @ ( y @ pl ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(12,plain,
( ( z @ ( y @ pl ) )
= ( z @ ( x @ pl ) ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(7,axiom,
! [A: nat,B: nat] :
( ( A != B )
=> ( ~ ( B @ ( A @ more ) )
=> ( B @ ( A @ less ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10a) ).
thf(28,plain,
! [A: nat,B: nat] :
( ( A != B )
=> ( ~ ( B @ ( A @ more ) )
=> ( B @ ( A @ less ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(29,plain,
! [B: nat,A: nat] :
( ( B @ ( A @ less ) )
| ( B @ ( A @ more ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[28]) ).
thf(30,plain,
! [B: nat,A: nat] :
( ( B @ ( A @ less ) )
| ( B @ ( A @ more ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[29]) ).
thf(1,conjecture,
x = y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz20b) ).
thf(2,negated_conjecture,
x != y,
inference(neg_conjecture,[status(cth)],[1]) ).
thf(9,plain,
x != y,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(10,plain,
y != x,
inference(lifteq,[status(thm)],[9]) ).
thf(53,plain,
! [B: nat,A: nat] :
( ( B != y )
| ( A != x )
| ( B @ ( A @ less ) )
| ( B @ ( A @ more ) ) ),
inference(paramod_ordered,[status(thm)],[30,10]) ).
thf(54,plain,
! [A: nat] :
( ( A != x )
| ( y @ ( A @ less ) )
| ( y @ ( A @ more ) ) ),
inference(pattern_uni,[status(thm)],[53:[bind(A,$thf( A )),bind(B,$thf( y ))]]) ).
thf(86,plain,
( ( y @ ( x @ less ) )
| ( y @ ( x @ more ) ) ),
inference(simp,[status(thm)],[54]) ).
thf(6,axiom,
! [A: nat,B: nat,C: nat] :
( ( B @ ( A @ less ) )
=> ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ less ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19c) ).
thf(25,plain,
! [A: nat,B: nat,C: nat] :
( ( B @ ( A @ less ) )
=> ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(26,plain,
! [A: nat,B: nat] :
( ( B @ ( A @ less ) )
=> ! [C: nat] : ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ less ) ) ),
inference(miniscope,[status(thm)],[25]) ).
thf(27,plain,
! [C: nat,B: nat,A: nat] :
( ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ less ) )
| ~ ( B @ ( A @ less ) ) ),
inference(cnf,[status(esa)],[26]) ).
thf(37,plain,
! [C: nat,B: nat,A: nat] :
( ( ( z @ ( y @ pl ) )
!= ( C @ ( B @ pl ) ) )
| ( z @ ( x @ pl ) @ ( C @ ( A @ pl ) @ less ) )
| ~ ( B @ ( A @ less ) ) ),
inference(paramod_ordered,[status(thm)],[12,27]) ).
thf(38,plain,
! [A: nat] :
( ( z @ ( x @ pl ) @ ( z @ ( A @ pl ) @ less ) )
| ~ ( y @ ( A @ less ) ) ),
inference(pattern_uni,[status(thm)],[37:[bind(A,$thf( A )),bind(B,$thf( y )),bind(C,$thf( z ))]]) ).
thf(5,axiom,
! [A: nat,B: nat] :
~ ( ( ( A = B )
=> ~ ( B @ ( A @ more ) ) )
=> ~ ~ ( ( ( B @ ( A @ more ) )
=> ~ ( B @ ( A @ less ) ) )
=> ~ ( ( B @ ( A @ less ) )
=> ( A != B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10b) ).
thf(14,plain,
! [A: nat,B: nat] :
~ ( ( ( A = B )
=> ~ ( B @ ( A @ more ) ) )
=> ( ( ( B @ ( A @ more ) )
=> ~ ( B @ ( A @ less ) ) )
=> ~ ( ( B @ ( A @ less ) )
=> ( A != B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(15,plain,
~ ( ! [A: nat,B: nat] :
( ( A = B )
=> ~ ( B @ ( A @ more ) ) )
=> ( ! [A: nat,B: nat] :
( ( B @ ( A @ more ) )
=> ~ ( B @ ( A @ less ) ) )
=> ~ ! [A: nat,B: nat] :
( ( B @ ( A @ less ) )
=> ( A != B ) ) ) ),
inference(miniscope,[status(thm)],[14]) ).
thf(16,plain,
! [F: nat,E: nat,D: nat,C: nat,B: nat,A: nat] :
( ( ( E != F )
| ~ ( F @ ( E @ less ) ) )
& ( ~ ( D @ ( C @ less ) )
| ~ ( D @ ( C @ more ) ) )
& ( ~ ( B @ ( A @ more ) )
| ( A != B ) ) ),
inference(cnf,[status(esa)],[15]) ).
thf(19,plain,
! [B: nat,A: nat] :
( ( A != B )
| ~ ( B @ ( A @ less ) ) ),
inference(cnfConj,[status(thm)],[16]) ).
thf(23,plain,
! [B: nat,A: nat] :
( ~ ( B @ ( A @ less ) )
| ( A != B ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(24,plain,
! [A: nat] :
~ ( A @ ( A @ less ) ),
inference(simp,[status(thm)],[23]) ).
thf(165,plain,
! [B: nat,A: nat] :
( ( ( z @ ( x @ pl ) @ ( z @ ( A @ pl ) @ less ) )
!= ( B @ ( B @ less ) ) )
| ~ $true
| ~ ( y @ ( A @ less ) ) ),
inference(paramod_ordered,[status(thm)],[38,24]) ).
thf(166,plain,
! [B: nat,A: nat] :
( ( ( z @ ( x @ pl ) @ ( z @ ( A @ pl ) @ less ) )
!= ( B @ ( B @ less ) ) )
| ~ ( y @ ( A @ less ) ) ),
inference(simp,[status(thm)],[165]) ).
thf(167,plain,
~ ( y @ ( x @ less ) ),
inference(pattern_uni,[status(thm)],[166:[bind(A,$thf( x )),bind(B,$thf( z @ ( x @ pl ) ))]]) ).
thf(225,plain,
( $false
| ( y @ ( x @ more ) ) ),
inference(rewrite,[status(thm)],[86,167]) ).
thf(226,plain,
y @ ( x @ more ),
inference(simp,[status(thm)],[225]) ).
thf(8,axiom,
! [A: nat,B: nat,C: nat] :
( ( B @ ( A @ more ) )
=> ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19a) ).
thf(31,plain,
! [A: nat,B: nat,C: nat] :
( ( B @ ( A @ more ) )
=> ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(32,plain,
! [A: nat,B: nat] :
( ( B @ ( A @ more ) )
=> ! [C: nat] : ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ),
inference(miniscope,[status(thm)],[31]) ).
thf(33,plain,
! [C: nat,B: nat,A: nat] :
( ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
| ~ ( B @ ( A @ more ) ) ),
inference(cnf,[status(esa)],[32]) ).
thf(316,plain,
! [C: nat,B: nat,A: nat] :
( ( ( y @ ( x @ more ) )
!= ( B @ ( A @ more ) ) )
| ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[226,33]) ).
thf(317,plain,
! [C: nat,B: nat,A: nat] :
( ( ( y @ ( x @ more ) )
!= ( B @ ( A @ more ) ) )
| ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ),
inference(simp,[status(thm)],[316]) ).
thf(318,plain,
! [A: nat] : ( A @ ( y @ pl ) @ ( A @ ( x @ pl ) @ more ) ),
inference(pattern_uni,[status(thm)],[317:[bind(A,$thf( x )),bind(B,$thf( y ))]]) ).
thf(327,plain,
! [A: nat] : ( A @ ( y @ pl ) @ ( A @ ( x @ pl ) @ more ) ),
inference(simp,[status(thm)],[318]) ).
thf(329,plain,
! [A: nat] :
( ( ( z @ ( y @ pl ) )
!= ( A @ ( y @ pl ) ) )
| ( z @ ( x @ pl ) @ ( A @ ( x @ pl ) @ more ) ) ),
inference(paramod_ordered,[status(thm)],[12,327]) ).
thf(330,plain,
z @ ( x @ pl ) @ ( z @ ( x @ pl ) @ more ),
inference(pattern_uni,[status(thm)],[329:[bind(A,$thf( z ))]]) ).
thf(17,plain,
! [B: nat,A: nat] :
( ~ ( B @ ( A @ more ) )
| ( A != B ) ),
inference(cnfConj,[status(thm)],[16]) ).
thf(20,plain,
! [B: nat,A: nat] :
( ~ ( B @ ( A @ more ) )
| ( A != B ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(21,plain,
! [A: nat] :
~ ( A @ ( A @ more ) ),
inference(simp,[status(thm)],[20]) ).
thf(372,plain,
$false,
inference(rewrite,[status(thm)],[330,21]) ).
thf(373,plain,
$false,
inference(simp,[status(thm)],[372]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM681_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.13 % 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.26/0.51 % Computer : n005.cluster.edu
% 0.26/0.51 % Model : x86_64 x86_64
% 0.26/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.26/0.51 % Memory : 8046.5625MB
% 0.26/0.51 % OS : Linux 6.8.0-71-generic
% 0.26/0.51 % CPULimit : 300
% 0.26/0.51 % WCLimit : 300
% 0.26/0.51 % DateTime : Sat Sep 26 03:43:31 UTC 2026
% 0.26/0.52 % CPUTime :
% 0.26/0.52 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
% 1.38/1.37 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.86/1.64 % [INFO] Parsing done (273ms).
% 1.86/1.67 % [INFO] Running in sequential loop mode.
% 2.66/2.25 % [INFO] eprover registered as external prover.
% 2.66/2.26 % [INFO] Scanning for conjecture ...
% 2.86/2.38 % [INFO] Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ...
% 3.02/2.43 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 3.02/2.49 % [INFO] Problem is typed first-order (TPTP TFF).
% 3.21/2.50 % [INFO] Type checking passed.
% 3.21/2.51 % [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 ...
% 9.28/4.74 % [INFO] Killing All external provers ...
% 9.28/4.74 % Time passed: 4017ms (effective reasoning time: 3061ms)
% 9.28/4.74 % 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)>
% 9.28/4.75 % Axioms used in derivation (5): satz10b, i, satz19c, satz10a, satz19a
% 9.28/4.75 % No. of inferences in proof: 47
% 9.28/4.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4017 ms resp. 3061 ms w/o parsing
% 9.60/4.82 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.60/4.82 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------