%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM755_8 : TPTP v9.3.1. Released v8.0.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 : 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:52 AM UTC 2026
% Result : Theorem 3.12s 11.62s
% Output : Refutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 116 ( 10 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 412 ( 64 ~; 29 |; 2 &; 292 @)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 76 ( 0 ^; 76 !; 0 ?; 76 :)
% 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(moref_decl,type,
moref: frac > frac > $o ).
thf(pf_decl,type,
pf: frac > frac > frac ).
thf(eq_decl,type,
eq: frac > frac > $o ).
thf(lessf_decl,type,
lessf: frac > frac > $o ).
thf(8,axiom,
! [A: frac,B: frac] :
( ~ ( B @ ( A @ eq ) )
=> ( ~ ( B @ ( A @ moref ) )
=> ( B @ ( A @ lessf ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz41a) ).
thf(26,plain,
! [A: frac,B: frac] :
( ~ ( B @ ( A @ eq ) )
=> ( ~ ( B @ ( A @ moref ) )
=> ( B @ ( A @ lessf ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(27,plain,
! [B: frac,A: frac] :
( ( B @ ( A @ lessf ) )
| ( B @ ( A @ moref ) )
| ( B @ ( A @ eq ) ) ),
inference(cnf,[status(esa)],[26]) ).
thf(7,axiom,
! [A: frac,B: frac,C: frac] :
( ( B @ ( A @ lessf ) )
=> ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ lessf ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz62c) ).
thf(23,plain,
! [A: frac,B: frac,C: frac] :
( ( B @ ( A @ lessf ) )
=> ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ lessf ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(24,plain,
! [A: frac,B: frac] :
( ( B @ ( A @ lessf ) )
=> ! [C: frac] : ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ lessf ) ) ),
inference(miniscope,[status(thm)],[23]) ).
thf(25,plain,
! [C: frac,B: frac,A: frac] :
( ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ lessf ) )
| ~ ( B @ ( A @ lessf ) ) ),
inference(cnf,[status(esa)],[24]) ).
thf(3,axiom,
z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(10,plain,
z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(5,axiom,
! [A: frac,B: frac] :
~ ( ( ( B @ ( A @ eq ) )
=> ~ ( B @ ( A @ moref ) ) )
=> ~ ~ ( ( ( B @ ( A @ moref ) )
=> ~ ( B @ ( A @ lessf ) ) )
=> ~ ( ( B @ ( A @ lessf ) )
=> ~ ( B @ ( A @ eq ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz41b) ).
thf(12,plain,
! [A: frac,B: frac] :
~ ( ( ( B @ ( A @ eq ) )
=> ~ ( B @ ( A @ moref ) ) )
=> ( ( ( B @ ( A @ moref ) )
=> ~ ( B @ ( A @ lessf ) ) )
=> ~ ( ( B @ ( A @ lessf ) )
=> ~ ( B @ ( A @ eq ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(13,plain,
~ ( ! [A: frac,B: frac] :
( ( B @ ( A @ eq ) )
=> ~ ( B @ ( A @ moref ) ) )
=> ( ! [A: frac,B: frac] :
( ( B @ ( A @ moref ) )
=> ~ ( B @ ( A @ lessf ) ) )
=> ~ ! [A: frac,B: frac] :
( ( B @ ( A @ lessf ) )
=> ~ ( B @ ( A @ eq ) ) ) ) ),
inference(miniscope,[status(thm)],[12]) ).
thf(14,plain,
! [F: frac,E: frac,D: frac,C: frac,B: frac,A: frac] :
( ( ~ ( F @ ( E @ eq ) )
| ~ ( F @ ( E @ lessf ) ) )
& ( ~ ( D @ ( C @ lessf ) )
| ~ ( D @ ( C @ moref ) ) )
& ( ~ ( B @ ( A @ moref ) )
| ~ ( B @ ( A @ eq ) ) ) ),
inference(cnf,[status(esa)],[13]) ).
thf(16,plain,
! [B: frac,A: frac] :
( ~ ( B @ ( A @ lessf ) )
| ~ ( B @ ( A @ moref ) ) ),
inference(cnfConj,[status(thm)],[14]) ).
thf(18,plain,
! [B: frac,A: frac] :
( ~ ( B @ ( A @ lessf ) )
| ~ ( B @ ( A @ moref ) ) ),
inference(simp,[status(thm)],[16]) ).
thf(34,plain,
! [B: frac,A: frac] :
( ( ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) )
!= ( B @ ( A @ moref ) ) )
| ~ ( B @ ( A @ lessf ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,18]) ).
thf(35,plain,
! [B: frac,A: frac] :
( ( ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) )
!= ( B @ ( A @ moref ) ) )
| ~ ( B @ ( A @ lessf ) ) ),
inference(simp,[status(thm)],[34]) ).
thf(36,plain,
~ ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ lessf ) ),
inference(pattern_uni,[status(thm)],[35:[bind(A,$thf( z @ ( x @ pf ) )),bind(B,$thf( z @ ( y @ pf ) ))]]) ).
thf(75,plain,
! [C: frac,B: frac,A: frac] :
( ( ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ lessf ) )
!= ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ lessf ) ) )
| ~ $true
| ~ ( B @ ( A @ lessf ) ) ),
inference(paramod_ordered,[status(thm)],[25,36]) ).
thf(76,plain,
! [C: frac,B: frac,A: frac] :
( ( ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ lessf ) )
!= ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ lessf ) ) )
| ~ ( B @ ( A @ lessf ) ) ),
inference(simp,[status(thm)],[75]) ).
thf(77,plain,
~ ( y @ ( x @ lessf ) ),
inference(pattern_uni,[status(thm)],[76:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z ))]]) ).
thf(87,plain,
! [B: frac,A: frac] :
( ( ( B @ ( A @ lessf ) )
!= ( y @ ( x @ lessf ) ) )
| ~ $true
| ( B @ ( A @ moref ) )
| ( B @ ( A @ eq ) ) ),
inference(paramod_ordered,[status(thm)],[27,77]) ).
thf(88,plain,
! [B: frac,A: frac] :
( ( ( B @ ( A @ lessf ) )
!= ( y @ ( x @ lessf ) ) )
| ( B @ ( A @ moref ) )
| ( B @ ( A @ eq ) ) ),
inference(simp,[status(thm)],[87]) ).
thf(89,plain,
( ( y @ ( x @ moref ) )
| ( y @ ( x @ eq ) ) ),
inference(pattern_uni,[status(thm)],[88:[bind(A,$thf( x )),bind(B,$thf( y ))]]) ).
thf(6,axiom,
! [A: frac,B: frac,C: frac] :
( ( B @ ( A @ eq ) )
=> ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ eq ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz62b) ).
thf(20,plain,
! [A: frac,B: frac,C: frac] :
( ( B @ ( A @ eq ) )
=> ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ eq ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(21,plain,
! [A: frac,B: frac] :
( ( B @ ( A @ eq ) )
=> ! [C: frac] : ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ eq ) ) ),
inference(miniscope,[status(thm)],[20]) ).
thf(22,plain,
! [C: frac,B: frac,A: frac] :
( ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ eq ) )
| ~ ( B @ ( A @ eq ) ) ),
inference(cnf,[status(esa)],[21]) ).
thf(15,plain,
! [B: frac,A: frac] :
( ~ ( B @ ( A @ moref ) )
| ~ ( B @ ( A @ eq ) ) ),
inference(cnfConj,[status(thm)],[14]) ).
thf(31,plain,
! [B: frac,A: frac] :
( ( ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) )
!= ( B @ ( A @ moref ) ) )
| ~ $true
| ~ ( B @ ( A @ eq ) ) ),
inference(paramod_ordered,[status(thm)],[10,15]) ).
thf(32,plain,
! [B: frac,A: frac] :
( ( ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) )
!= ( B @ ( A @ moref ) ) )
| ~ ( B @ ( A @ eq ) ) ),
inference(simp,[status(thm)],[31]) ).
thf(33,plain,
~ ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ eq ) ),
inference(pattern_uni,[status(thm)],[32:[bind(A,$thf( z @ ( x @ pf ) )),bind(B,$thf( z @ ( y @ pf ) ))]]) ).
thf(46,plain,
! [C: frac,B: frac,A: frac] :
( ( ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ eq ) )
!= ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ eq ) ) )
| ~ $true
| ~ ( B @ ( A @ eq ) ) ),
inference(paramod_ordered,[status(thm)],[22,33]) ).
thf(47,plain,
! [C: frac,B: frac,A: frac] :
( ( ( C @ ( B @ pf ) @ ( C @ ( A @ pf ) @ eq ) )
!= ( z @ ( y @ pf ) @ ( z @ ( x @ pf ) @ eq ) ) )
| ~ ( B @ ( A @ eq ) ) ),
inference(simp,[status(thm)],[46]) ).
thf(48,plain,
~ ( y @ ( x @ eq ) ),
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z ))]]) ).
thf(1,conjecture,
y @ ( x @ moref ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz63a) ).
thf(2,negated_conjecture,
~ ( y @ ( x @ moref ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(9,plain,
~ ( y @ ( x @ moref ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(109,plain,
( $false
| $false ),
inference(rewrite,[status(thm)],[89,48,9]) ).
thf(110,plain,
$false,
inference(simp,[status(thm)],[109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM755_8 : TPTP v9.3.1. Released v8.0.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.13/10.41 % Computer : n018.cluster.edu
% 0.13/10.41 % Model : x86_64 x86_64
% 0.13/10.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.41 % Memory : 8046.5625MB
% 0.13/10.41 % OS : Linux 6.8.0-71-generic
% 0.13/10.41 % CPULimit : 300
% 0.13/10.41 % WCLimit : 300
% 0.13/10.41 % DateTime : Sat Sep 26 04:02:31 UTC 2026
% 0.13/10.41 % CPUTime :
% 0.13/10.41 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.17/10.74 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.17/10.83 % [INFO] Parsing done (93ms).
% 0.17/10.84 % [INFO] Running in sequential loop mode.
% 1.32/11.03 % [INFO] eprover registered as external prover.
% 1.32/11.03 % [INFO] Scanning for conjecture ...
% 1.32/11.08 % [INFO] Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ...
% 1.32/11.09 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 1.32/11.11 % [INFO] Problem is typed first-order (TPTP TFF).
% 1.32/11.11 % [INFO] Type checking passed.
% 1.32/11.11 % [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.12/11.62 % [INFO] Killing All external provers ...
% 3.12/11.62 % Time passed: 1087ms (effective reasoning time: 775ms)
% 3.12/11.62 % 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.12/11.62 % Axioms used in derivation (5): satz41b, m, satz62b, satz62c, satz41a
% 3.12/11.62 % No. of inferences in proof: 40
% 3.12/11.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1087 ms resp. 775 ms w/o parsing
% 3.12/11.65 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.12/11.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------