%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM742_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 : n018.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:49 AM UTC 2026
% Result : Theorem 9.70s 3.86s
% Output : Refutation 9.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 131 ( 12 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 327 ( 45 ~; 43 |; 0 &; 220 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 75 ( 0 ^; 75 !; 0 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(frac_type,type,
frac: $tType ).
thf(x_decl,type,
x: frac ).
thf(y_decl,type,
y: frac ).
thf(z_decl,type,
z: frac ).
thf(lessf_decl,type,
lessf: frac > frac > $o ).
thf(eq_decl,type,
eq: frac > frac > $o ).
thf(4,axiom,
z @ ( y @ lessf ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(13,plain,
z @ ( y @ lessf ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
( ~ ( y @ ( x @ lessf ) )
=> ( y @ ( x @ eq ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(11,plain,
( ~ ( y @ ( x @ lessf ) )
=> ( y @ ( x @ eq ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(12,plain,
( ( y @ ( x @ eq ) )
| ( y @ ( x @ lessf ) ) ),
inference(cnf,[status(esa)],[11]) ).
thf(7,axiom,
! [A: frac,B: frac] :
( ( B @ ( A @ eq ) )
=> ( A @ ( B @ eq ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz38) ).
thf(18,plain,
! [A: frac,B: frac] :
( ( B @ ( A @ eq ) )
=> ( A @ ( B @ eq ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(19,plain,
! [B: frac,A: frac] :
( ( A @ ( B @ eq ) )
| ~ ( B @ ( A @ eq ) ) ),
inference(cnf,[status(esa)],[18]) ).
thf(135,plain,
! [B: frac,A: frac] :
( ( ( y @ ( x @ eq ) )
!= ( B @ ( A @ eq ) ) )
| ( A @ ( B @ eq ) )
| ~ $true
| ( y @ ( x @ lessf ) ) ),
inference(paramod_ordered,[status(thm)],[12,19]) ).
thf(136,plain,
! [B: frac,A: frac] :
( ( ( y @ ( x @ eq ) )
!= ( B @ ( A @ eq ) ) )
| ( A @ ( B @ eq ) )
| ( y @ ( x @ lessf ) ) ),
inference(simp,[status(thm)],[135]) ).
thf(137,plain,
( ( x @ ( y @ eq ) )
| ( y @ ( x @ lessf ) ) ),
inference(pattern_uni,[status(thm)],[136:[bind(A,$thf( x )),bind(B,$thf( y ))]]) ).
thf(8,axiom,
! [A: frac,B: frac,C: frac] :
( ( B @ ( A @ lessf ) )
=> ( ( C @ ( B @ lessf ) )
=> ( C @ ( A @ lessf ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz50) ).
thf(20,plain,
! [A: frac,B: frac,C: frac] :
( ( B @ ( A @ lessf ) )
=> ( ( C @ ( B @ lessf ) )
=> ( C @ ( A @ lessf ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(21,plain,
! [A: frac,B: frac] :
( ( B @ ( A @ lessf ) )
=> ! [C: frac] :
( ( C @ ( B @ lessf ) )
=> ( C @ ( A @ lessf ) ) ) ),
inference(miniscope,[status(thm)],[20]) ).
thf(22,plain,
! [C: frac,B: frac,A: frac] :
( ( C @ ( A @ lessf ) )
| ~ ( C @ ( B @ lessf ) )
| ~ ( B @ ( A @ lessf ) ) ),
inference(cnf,[status(esa)],[21]) ).
thf(192,plain,
! [C: frac,B: frac,A: frac] :
( ( ( z @ ( y @ lessf ) )
!= ( C @ ( B @ lessf ) ) )
| ( C @ ( A @ lessf ) )
| ~ $true
| ~ ( B @ ( A @ lessf ) ) ),
inference(paramod_ordered,[status(thm)],[13,22]) ).
thf(193,plain,
! [C: frac,B: frac,A: frac] :
( ( ( z @ ( y @ lessf ) )
!= ( C @ ( B @ lessf ) ) )
| ( C @ ( A @ lessf ) )
| ~ ( B @ ( A @ lessf ) ) ),
inference(simp,[status(thm)],[192]) ).
thf(194,plain,
! [A: frac] :
( ( z @ ( A @ lessf ) )
| ~ ( y @ ( A @ lessf ) ) ),
inference(pattern_uni,[status(thm)],[193:[bind(A,$thf( A )),bind(B,$thf( y )),bind(C,$thf( z ))]]) ).
thf(1,conjecture,
z @ ( x @ lessf ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz51a) ).
thf(2,negated_conjecture,
~ ( z @ ( x @ lessf ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(10,plain,
~ ( z @ ( x @ lessf ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(229,plain,
! [A: frac] :
( ( ( z @ ( A @ lessf ) )
!= ( z @ ( x @ lessf ) ) )
| ~ $true
| ~ ( y @ ( A @ lessf ) ) ),
inference(paramod_ordered,[status(thm)],[194,10]) ).
thf(230,plain,
! [A: frac] :
( ( ( z @ ( A @ lessf ) )
!= ( z @ ( x @ lessf ) ) )
| ~ ( y @ ( A @ lessf ) ) ),
inference(simp,[status(thm)],[229]) ).
thf(231,plain,
~ ( y @ ( x @ lessf ) ),
inference(pattern_uni,[status(thm)],[230:[bind(A,$thf( x ))]]) ).
thf(264,plain,
( ( x @ ( y @ eq ) )
| $false ),
inference(rewrite,[status(thm)],[137,231]) ).
thf(265,plain,
x @ ( y @ eq ),
inference(simp,[status(thm)],[264]) ).
thf(9,axiom,
! [A: frac] : ( A @ ( A @ eq ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).
thf(23,plain,
! [A: frac] : ( A @ ( A @ eq ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(24,plain,
! [A: frac] : ( A @ ( A @ eq ) ),
inference(cnf,[status(esa)],[23]) ).
thf(6,axiom,
! [A: frac,B: frac,C: frac,D: frac] :
( ( B @ ( A @ lessf ) )
=> ( ( C @ ( A @ eq ) )
=> ( ( D @ ( B @ eq ) )
=> ( D @ ( C @ lessf ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz45) ).
thf(15,plain,
! [A: frac,B: frac,C: frac,D: frac] :
( ( B @ ( A @ lessf ) )
=> ( ( C @ ( A @ eq ) )
=> ( ( D @ ( B @ eq ) )
=> ( D @ ( C @ lessf ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(16,plain,
! [A: frac,B: frac] :
( ( B @ ( A @ lessf ) )
=> ! [C: frac] :
( ( C @ ( A @ eq ) )
=> ! [D: frac] :
( ( D @ ( B @ eq ) )
=> ( D @ ( C @ lessf ) ) ) ) ),
inference(miniscope,[status(thm)],[15]) ).
thf(17,plain,
! [D: frac,C: frac,B: frac,A: frac] :
( ( D @ ( C @ lessf ) )
| ~ ( D @ ( B @ eq ) )
| ~ ( C @ ( A @ eq ) )
| ~ ( B @ ( A @ lessf ) ) ),
inference(cnf,[status(esa)],[16]) ).
thf(34,plain,
! [E: frac,D: frac,C: frac,B: frac,A: frac] :
( ( ( A @ ( A @ eq ) )
!= ( E @ ( C @ eq ) ) )
| ( E @ ( D @ lessf ) )
| ~ $true
| ~ ( D @ ( B @ eq ) )
| ~ ( C @ ( B @ lessf ) ) ),
inference(paramod_ordered,[status(thm)],[24,17]) ).
thf(35,plain,
! [E: frac,D: frac,C: frac,B: frac,A: frac] :
( ( ( A @ ( A @ eq ) )
!= ( E @ ( C @ eq ) ) )
| ( E @ ( D @ lessf ) )
| ~ ( D @ ( B @ eq ) )
| ~ ( C @ ( B @ lessf ) ) ),
inference(simp,[status(thm)],[34]) ).
thf(36,plain,
! [C: frac,B: frac,A: frac] :
( ( A @ ( C @ lessf ) )
| ~ ( C @ ( B @ eq ) )
| ~ ( A @ ( B @ lessf ) ) ),
inference(pattern_uni,[status(thm)],[35:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( D )),bind(E,$thf( A ))]]) ).
thf(46,plain,
! [C: frac,B: frac,A: frac] :
( ( A @ ( C @ lessf ) )
| ~ ( C @ ( B @ eq ) )
| ~ ( A @ ( B @ lessf ) ) ),
inference(simp,[status(thm)],[36]) ).
thf(514,plain,
! [C: frac,B: frac,A: frac] :
( ( ( x @ ( y @ eq ) )
!= ( C @ ( B @ eq ) ) )
| ( A @ ( C @ lessf ) )
| ~ $true
| ~ ( A @ ( B @ lessf ) ) ),
inference(paramod_ordered,[status(thm)],[265,46]) ).
thf(515,plain,
! [C: frac,B: frac,A: frac] :
( ( ( x @ ( y @ eq ) )
!= ( C @ ( B @ eq ) ) )
| ( A @ ( C @ lessf ) )
| ~ ( A @ ( B @ lessf ) ) ),
inference(simp,[status(thm)],[514]) ).
thf(516,plain,
! [A: frac] :
( ( A @ ( x @ lessf ) )
| ~ ( A @ ( y @ lessf ) ) ),
inference(pattern_uni,[status(thm)],[515:[bind(A,$thf( A )),bind(B,$thf( y )),bind(C,$thf( x ))]]) ).
thf(2273,plain,
! [A: frac] :
( ( ( z @ ( y @ lessf ) )
!= ( A @ ( y @ lessf ) ) )
| ( A @ ( x @ lessf ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,516]) ).
thf(2274,plain,
! [A: frac] :
( ( ( z @ ( y @ lessf ) )
!= ( A @ ( y @ lessf ) ) )
| ( A @ ( x @ lessf ) ) ),
inference(simp,[status(thm)],[2273]) ).
thf(2275,plain,
z @ ( x @ lessf ),
inference(pattern_uni,[status(thm)],[2274:[bind(A,$thf( z ))]]) ).
thf(2289,plain,
$false,
inference(rewrite,[status(thm)],[2275,10]) ).
thf(2290,plain,
$false,
inference(simp,[status(thm)],[2289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM742_8 : TPTP v9.3.1. Released v8.0.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.12/0.38 % Computer : n018.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sat Sep 26 03:59:20 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 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.85/0.96 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/1.15 % [INFO] Parsing done (186ms).
% 1.22/1.16 % [INFO] Running in sequential loop mode.
% 1.72/1.55 % [INFO] eprover registered as external prover.
% 1.72/1.56 % [INFO] Scanning for conjecture ...
% 1.90/1.65 % [INFO] Found a conjecture (or negated_conjecture) and 7 axioms. Running axiom selection ...
% 1.90/1.68 % [INFO] Axiom selection finished. Selected 7 axioms (removed 0 axioms).
% 2.06/1.70 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.06/1.71 % [INFO] Type checking passed.
% 2.06/1.71 % [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.70/3.86 % [INFO] Killing All external provers ...
% 9.70/3.86 % Time passed: 3337ms (effective reasoning time: 2688ms)
% 9.70/3.86 % 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.70/3.86 % Axioms used in derivation (6): satz50, satz37, l, satz45, satz38, k
% 9.70/3.86 % No. of inferences in proof: 45
% 9.70/3.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3337 ms resp. 2688 ms w/o parsing
% 9.70/3.88 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.70/3.88 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------