%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM784^1 : TPTP v9.3.1. Released v3.7.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 : n019.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:18:10 AM UTC 2026
% Result : Theorem 4.22s 2.51s
% Output : Refutation 4.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 4 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 201 ( 51 ~; 15 |; 2 &; 116 @)
% ( 0 <=>; 17 =>; 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 : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(rat_type,type,
rat: $tType ).
thf(x0_decl,type,
x0: rat ).
thf(y0_decl,type,
y0: rat ).
thf(more_decl,type,
more: rat > rat > $o ).
thf(is_decl,type,
is: rat > rat > $o ).
thf(less_decl,type,
less: rat > rat > $o ).
thf(1,conjecture,
~ ( less @ x0 @ y0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81c) ).
thf(2,negated_conjecture,
~ ~ ( less @ x0 @ y0 ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ~ ( less @ x0 @ y0 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
less @ x0 @ y0,
inference(polarity_switch,[status(thm)],[6]) ).
thf(5,axiom,
! [A: rat,B: rat] :
~ ( ( ( is @ A @ B )
=> ~ ( more @ A @ B ) )
=> ~ ~ ( ( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ( ( less @ A @ B )
=> ~ ( is @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81b) ).
thf(11,plain,
! [A: rat,B: rat] :
~ ( ( ( is @ A @ B )
=> ~ ( more @ A @ B ) )
=> ( ( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ( ( less @ A @ B )
=> ~ ( is @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(12,plain,
~ ( ! [A: rat,B: rat] :
( ( is @ A @ B )
=> ~ ( more @ A @ B ) )
=> ( ! [A: rat,B: rat] :
( ( more @ A @ B )
=> ~ ( less @ A @ B ) )
=> ~ ! [A: rat,B: rat] :
( ( less @ A @ B )
=> ~ ( is @ A @ B ) ) ) ),
inference(miniscope,[status(thm)],[11]) ).
thf(13,plain,
! [F: rat,E: rat,D: rat,C: rat,B: rat,A: rat] :
( ( ~ ( is @ A @ B )
| ~ ( more @ A @ B ) )
& ( ~ ( more @ C @ D )
| ~ ( less @ C @ D ) )
& ( ~ ( less @ E @ F )
| ~ ( is @ E @ F ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(16,plain,
! [B: rat,A: rat] :
( ~ ( less @ A @ B )
| ~ ( is @ A @ B ) ),
inference(cnfConj,[status(thm)],[13]) ).
thf(18,plain,
! [B: rat,A: rat] :
( ~ ( less @ A @ B )
| ~ ( is @ A @ B ) ),
inference(simp,[status(thm)],[16]) ).
thf(27,plain,
! [B: rat,A: rat] :
( ~ $true
| ~ ( is @ A @ B )
| ( ( less @ x0 @ y0 )
!= ( less @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[7,18]) ).
thf(28,plain,
! [B: rat,A: rat] :
( ~ ( is @ A @ B )
| ( ( less @ x0 @ y0 )
!= ( less @ A @ B ) ) ),
inference(simp,[status(thm)],[27]) ).
thf(29,plain,
~ ( is @ x0 @ y0 ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).
thf(3,axiom,
( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(8,plain,
( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,plain,
( ( more @ x0 @ y0 )
| ( is @ x0 @ y0 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(15,plain,
! [B: rat,A: rat] :
( ~ ( more @ A @ B )
| ~ ( less @ A @ B ) ),
inference(cnfConj,[status(thm)],[13]) ).
thf(17,plain,
! [B: rat,A: rat] :
( ~ ( more @ A @ B )
| ~ ( less @ A @ B ) ),
inference(simp,[status(thm)],[15]) ).
thf(22,plain,
! [B: rat,A: rat] :
( ~ ( more @ A @ B )
| ~ $true
| ( ( less @ x0 @ y0 )
!= ( less @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[7,17]) ).
thf(23,plain,
! [B: rat,A: rat] :
( ~ ( more @ A @ B )
| ( ( less @ x0 @ y0 )
!= ( less @ A @ B ) ) ),
inference(simp,[status(thm)],[22]) ).
thf(24,plain,
~ ( more @ x0 @ y0 ),
inference(pattern_uni,[status(thm)],[23:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).
thf(25,plain,
( $false
| ( is @ x0 @ y0 ) ),
inference(rewrite,[status(thm)],[9,24]) ).
thf(26,plain,
is @ x0 @ y0,
inference(simp,[status(thm)],[25]) ).
thf(36,plain,
~ $true,
inference(rewrite,[status(thm)],[29,26]) ).
thf(37,plain,
$false,
inference(simp,[status(thm)],[36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM784^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % 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.23 % Computer : n019.cluster.edu
% 0.12/0.23 % Model : x86_64 x86_64
% 0.12/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.23 % Memory : 8046.5625MB
% 0.12/0.23 % OS : Linux 6.8.0-71-generic
% 0.12/0.23 % CPULimit : 300
% 0.12/0.23 % WCLimit : 300
% 0.12/0.23 % DateTime : Tue Sep 29 12:55:47 UTC 2026
% 0.12/0.23 % CPUTime :
% 0.12/0.23 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.22/0.93 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.51/1.09 % [INFO] Parsing done (160ms).
% 1.51/1.10 % [INFO] Running in sequential loop mode.
% 2.32/1.53 % [INFO] eprover registered as external prover.
% 2.32/1.54 % [INFO] Scanning for conjecture ...
% 2.32/1.59 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 2.48/1.62 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.48/1.64 % [INFO] Problem is higher-order (TPTP THF).
% 2.48/1.64 % [INFO] Type checking passed.
% 2.48/1.64 % [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 ...
% 4.22/2.51 % [INFO] Killing All external provers ...
% 4.22/2.51 % Time passed: 2072ms (effective reasoning time: 1398ms)
% 4.22/2.51 % 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)>
% 4.22/2.51 % Axioms used in derivation (2): satz81b, m
% 4.22/2.51 % No. of inferences in proof: 25
% 4.22/2.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2072 ms resp. 1398 ms w/o parsing
% 4.22/2.55 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.22/2.55 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------