%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM691^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 : n007.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:59 AM UTC 2026
% Result : Theorem 9.55s 3.74s
% Output : Refutation 9.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 173 ( 53 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 577 ( 87 ~; 66 |; 3 &; 396 @)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 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(u_decl,type,
u: nat ).
thf(more_decl,type,
more: nat > nat > $o ).
thf(pl_decl,type,
pl: nat > nat > nat ).
thf(7,axiom,
! [A: nat,B: nat,C: nat,D: nat] :
( ( more @ A @ B )
=> ( ( ~ ( more @ C @ D )
=> ( C = D ) )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz22b) ).
thf(27,plain,
! [A: nat,B: nat,C: nat,D: nat] :
( ( more @ A @ B )
=> ( ( ~ ( more @ C @ D )
=> ( C = D ) )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(28,plain,
! [A: nat,B: nat] :
( ( more @ A @ B )
=> ! [C: nat,D: nat] :
( ( ~ ( more @ C @ D )
=> ( C = D ) )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(miniscope,[status(thm)],[27]) ).
thf(29,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ( ~ ( more @ A @ B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) )
& ( ~ ( more @ A @ B )
| ( C != D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(cnf,[status(esa)],[28]) ).
thf(31,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ~ ( more @ A @ B )
| ( C != D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ),
inference(cnfConj,[status(thm)],[29]) ).
thf(32,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ( C != D )
| ~ ( more @ A @ B )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ),
inference(lifteq,[status(thm)],[31]) ).
thf(33,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ A @ B )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ C ) ) ),
inference(simp,[status(thm)],[32]) ).
thf(1,conjecture,
( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz23) ).
thf(2,negated_conjecture,
~ ( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(8,plain,
~ ( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
& ( ( pl @ x @ z )
!= ( pl @ y @ u ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ),
inference(cnfConj,[status(thm)],[9]) ).
thf(4,axiom,
( ~ ( more @ z @ u )
=> ( z = u ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
thf(16,plain,
( ~ ( more @ z @ u )
=> ( z = u ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(17,plain,
( ( more @ z @ u )
| ( z = u ) ),
inference(cnf,[status(esa)],[16]) ).
thf(18,plain,
( ( u = z )
| ( more @ z @ u ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(6,axiom,
! [A: nat,B: nat,C: nat,D: nat] :
( ( ~ ( more @ A @ B )
=> ( A = B ) )
=> ( ( more @ C @ D )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz22a) ).
thf(20,plain,
! [A: nat,B: nat,C: nat,D: nat] :
( ( ~ ( more @ A @ B )
=> ( A = B ) )
=> ( ( more @ C @ D )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(21,plain,
! [A: nat,B: nat] :
( ( ~ ( more @ A @ B )
=> ( A = B ) )
=> ! [C: nat,D: nat] :
( ( more @ C @ D )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(miniscope,[status(thm)],[20]) ).
thf(22,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ( ~ ( more @ A @ B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) )
& ( ( A != B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(cnf,[status(esa)],[21]) ).
thf(23,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ~ ( more @ A @ B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ),
inference(cnfConj,[status(thm)],[22]) ).
thf(49,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ~ ( more @ A @ B )
| ~ ( more @ C @ D )
| ~ $true
| ( ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) )
!= ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ) ) ),
inference(paramod_ordered,[status(thm)],[23,10]) ).
thf(50,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ~ ( more @ A @ B )
| ~ ( more @ C @ D )
| ( ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) )
!= ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ) ) ),
inference(simp,[status(thm)],[49]) ).
thf(51,plain,
( ~ ( more @ x @ y )
| ~ ( more @ z @ u ) ),
inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z )),bind(D,$thf( u ))]]) ).
thf(158,plain,
( ( u = z )
| ~ ( more @ x @ y )
| ~ $true
| ( ( more @ z @ u )
!= ( more @ z @ u ) ) ),
inference(paramod_ordered,[status(thm)],[18,51]) ).
thf(159,plain,
( ( u = z )
| ~ ( more @ x @ y )
| ( ( more @ z @ u )
!= ( more @ z @ u ) ) ),
inference(simp,[status(thm)],[158]) ).
thf(160,plain,
( ( u = z )
| ~ ( more @ x @ y ) ),
inference(pattern_uni,[status(thm)],[159:[]]) ).
thf(3,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(13,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(14,plain,
( ( more @ x @ y )
| ( x = y ) ),
inference(cnf,[status(esa)],[13]) ).
thf(15,plain,
( ( y = x )
| ( more @ x @ y ) ),
inference(lifteq,[status(thm)],[14]) ).
thf(11,plain,
( ( pl @ x @ z )
!= ( pl @ y @ u ) ),
inference(cnfConj,[status(thm)],[9]) ).
thf(12,plain,
( ( pl @ y @ u )
!= ( pl @ x @ z ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(34,plain,
( ( y != x )
| ( u != z ) ),
inference(simp,[status(thm)],[12]) ).
thf(35,plain,
( ( more @ x @ y )
| ( x != x )
| ( u != z )
| ( y != y ) ),
inference(paramod_ordered,[status(thm)],[15,34]) ).
thf(36,plain,
( ( more @ x @ y )
| ( u != z )
| ( y != y ) ),
inference(simp,[status(thm)],[35]) ).
thf(37,plain,
( ( more @ x @ y )
| ( u != z ) ),
inference(pattern_uni,[status(thm)],[36:[]]) ).
thf(90,plain,
( ( more @ z @ u )
| ( more @ x @ y )
| ( z != z )
| ( u != u ) ),
inference(paramod_ordered,[status(thm)],[18,37]) ).
thf(91,plain,
( ( more @ z @ u )
| ( more @ x @ y )
| ( u != u ) ),
inference(simp,[status(thm)],[90]) ).
thf(92,plain,
( ( more @ z @ u )
| ( more @ x @ y ) ),
inference(pattern_uni,[status(thm)],[91:[]]) ).
thf(24,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ( A != B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ),
inference(cnfConj,[status(thm)],[22]) ).
thf(25,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ( A != B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ),
inference(lifteq,[status(thm)],[24]) ).
thf(26,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ B @ C )
| ( more @ ( pl @ A @ B ) @ ( pl @ A @ C ) ) ),
inference(simp,[status(thm)],[25]) ).
thf(38,plain,
( ( more @ x @ y )
| ~ ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) )
| ( y != y ) ),
inference(paramod_ordered,[status(thm)],[15,10]) ).
thf(39,plain,
( ( more @ x @ y )
| ~ ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) ) ),
inference(pattern_uni,[status(thm)],[38:[]]) ).
thf(995,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ B @ C )
| ( more @ x @ y )
| ~ $true
| ( ( more @ ( pl @ A @ B ) @ ( pl @ A @ C ) )
!= ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) ) ) ),
inference(paramod_ordered,[status(thm)],[26,39]) ).
thf(996,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ B @ C )
| ( more @ x @ y )
| ( ( more @ ( pl @ A @ B ) @ ( pl @ A @ C ) )
!= ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) ) ) ),
inference(simp,[status(thm)],[995]) ).
thf(997,plain,
( ~ ( more @ z @ u )
| ( more @ x @ y ) ),
inference(pattern_uni,[status(thm)],[996:[bind(A,$thf( x )),bind(B,$thf( z )),bind(C,$thf( u ))]]) ).
thf(1274,plain,
( ( more @ x @ y )
| ~ $true
| ( more @ x @ y )
| ( ( more @ z @ u )
!= ( more @ z @ u ) ) ),
inference(paramod_ordered,[status(thm)],[92,997]) ).
thf(1275,plain,
( ( more @ x @ y )
| ( ( more @ z @ u )
!= ( more @ z @ u ) ) ),
inference(simp,[status(thm)],[1274]) ).
thf(1276,plain,
more @ x @ y,
inference(pattern_uni,[status(thm)],[1275:[]]) ).
thf(1312,plain,
( ( u = z )
| ~ $true ),
inference(rewrite,[status(thm)],[160,1276]) ).
thf(1313,plain,
u = z,
inference(simp,[status(thm)],[1312]) ).
thf(1380,plain,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ),
inference(rewrite,[status(thm)],[10,1313]) ).
thf(1602,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ A @ B )
| ~ $true
| ( ( more @ ( pl @ A @ C ) @ ( pl @ B @ C ) )
!= ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ) ),
inference(paramod_ordered,[status(thm)],[33,1380]) ).
thf(1603,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ A @ B )
| ( ( more @ ( pl @ A @ C ) @ ( pl @ B @ C ) )
!= ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ) ),
inference(simp,[status(thm)],[1602]) ).
thf(1604,plain,
~ ( more @ x @ y ),
inference(pattern_uni,[status(thm)],[1603:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z ))]]) ).
thf(1621,plain,
~ $true,
inference(rewrite,[status(thm)],[1604,1276]) ).
thf(1622,plain,
$false,
inference(simp,[status(thm)],[1621]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM691^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % 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.11/0.20 % Computer : n007.cluster.edu
% 0.11/0.20 % Model : x86_64 x86_64
% 0.11/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.20 % Memory : 8046.5625MB
% 0.11/0.20 % OS : Linux 6.8.0-71-generic
% 0.11/0.20 % CPULimit : 300
% 0.11/0.20 % WCLimit : 300
% 0.11/0.20 % DateTime : Tue Sep 29 12:37:25 UTC 2026
% 0.11/0.20 % CPUTime :
% 0.11/0.20 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.89/0.78 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.98 % [INFO] Parsing done (195ms).
% 1.21/0.99 % [INFO] Running in sequential loop mode.
% 1.79/1.37 % [INFO] eprover registered as external prover.
% 1.79/1.38 % [INFO] Scanning for conjecture ...
% 1.96/1.46 % [INFO] Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ...
% 1.96/1.49 % [INFO] Axiom selection finished. Selected 5 axioms (removed 0 axioms).
% 2.11/1.52 % [INFO] Problem is higher-order (TPTP THF).
% 2.11/1.52 % [INFO] Type checking passed.
% 2.11/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 ...
% 9.55/3.73 % [INFO] Killing All external provers ...
% 9.55/3.74 % Time passed: 3397ms (effective reasoning time: 2736ms)
% 9.55/3.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.55/3.74 % Axioms used in derivation (4): satz22b, n, satz22a, m
% 9.55/3.74 % No. of inferences in proof: 59
% 9.55/3.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3397 ms resp. 2736 ms w/o parsing
% 9.55/3.79 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.55/3.79 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------