%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM784^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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 Oct 7 10:35:13 AM UTC 2026
% Result : Theorem 0.07s 0.23s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 55 ( 36 unt; 0 typ; 0 def)
% Number of atoms : 251 ( 66 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 411 ( 123 ~; 60 |; 4 &; 210 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 2 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 : 89 ( 0 ^; 89 !; 0 ?; 89 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_rat,type,
rat: $tType ).
thf(tp_is,type,
is: rat > rat > $o ).
thf(tp_less,type,
less: rat > rat > $o ).
thf(tp_more,type,
more: rat > rat > $o ).
thf(tp_x0,type,
x0: rat ).
thf(tp_y0,type,
y0: rat ).
thf(1,axiom,
! [Xx0: rat,Xy0: rat] :
~ ( ( ( is @ Xx0 @ Xy0 )
=> ~ ( more @ Xx0 @ Xy0 ) )
=> ~ ~ ( ( ( more @ Xx0 @ Xy0 )
=> ~ ( less @ Xx0 @ Xy0 ) )
=> ~ ( ( less @ Xx0 @ Xy0 )
=> ~ ( is @ Xx0 @ Xy0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81b) ).
thf(2,axiom,
! [Xa: $o] :
( ~ ~ Xa
=> Xa ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',et) ).
thf(3,axiom,
( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(4,conjecture,
~ ( less @ x0 @ y0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81c) ).
thf(5,negated_conjecture,
( ( ~ ( less @ x0 @ y0 ) )
= $false ),
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,plain,
( ( ~ ( less @ x0 @ y0 ) )
= $false ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [Xx0: rat,Xy0: rat] :
~ ( ( ( is @ Xx0 @ Xy0 )
=> ~ ( more @ Xx0 @ Xy0 ) )
=> ~ ~ ( ( ( more @ Xx0 @ Xy0 )
=> ~ ( less @ Xx0 @ Xy0 ) )
=> ~ ( ( less @ Xx0 @ Xy0 )
=> ~ ( is @ Xx0 @ Xy0 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( ! [Xa: $o] :
( ~ ~ Xa
=> Xa ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( ~ ( more @ x0 @ y0 )
=> ( is @ x0 @ y0 ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(10,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(11,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( is @ Xx0 @ Xy0 )
| ~ ( more @ Xx0 @ Xy0 ) )
& ! [Xx0: rat,Xy0: rat] :
( ~ ( more @ Xx0 @ Xy0 )
| ~ ( less @ Xx0 @ Xy0 ) )
& ! [Xx0: rat,Xy0: rat] :
( ~ ( less @ Xx0 @ Xy0 )
| ~ ( is @ Xx0 @ Xy0 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(12,plain,
( ( ! [Xa: $o] :
( ~ Xa
| Xa ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(13,plain,
( ( ( more @ x0 @ y0 )
| ( is @ x0 @ y0 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(14,plain,
( ( ( more @ x0 @ y0 )
| ( is @ x0 @ y0 ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(15,plain,
( ( ! [Xa: $o] :
( ~ Xa
| Xa ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(16,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( is @ Xx0 @ Xy0 )
| ~ ( more @ Xx0 @ Xy0 ) )
& ! [Xx0: rat,Xy0: rat] :
( ~ ( more @ Xx0 @ Xy0 )
| ~ ( less @ Xx0 @ Xy0 ) )
& ! [Xx0: rat,Xy0: rat] :
( ~ ( less @ Xx0 @ Xy0 )
| ~ ( is @ Xx0 @ Xy0 ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(17,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(18,plain,
( ( ~ ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( is @ SX0 @ SX1 )
| ~ ( more @ SX0 @ SX1 ) )
| ~ ~ ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( more @ SX0 @ SX1 )
| ~ ( less @ SX0 @ SX1 ) )
| ~ ! [SX0: rat,SX1: rat] :
( ~ ( less @ SX0 @ SX1 )
| ~ ( is @ SX0 @ SX1 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[16]) ).
thf(19,plain,
( ( ( more @ x0 @ y0 )
= $true )
| ( ( is @ x0 @ y0 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(20,plain,
! [SV1: $o] :
( ( ~ SV1
| SV1 )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[15]) ).
thf(21,plain,
( ( ~ $true
| $true )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[15]) ).
thf(22,plain,
( ( ~ $false
| $false )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[15]) ).
thf(23,plain,
( ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( is @ SX0 @ SX1 )
| ~ ( more @ SX0 @ SX1 ) )
| ~ ~ ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( more @ SX0 @ SX1 )
| ~ ( less @ SX0 @ SX1 ) )
| ~ ! [SX0: rat,SX1: rat] :
( ~ ( less @ SX0 @ SX1 )
| ~ ( is @ SX0 @ SX1 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(24,plain,
! [SV1: $o] :
( ( ( ~ SV1 ) = $true )
| ( SV1 = $true ) ),
inference(extcnf_or_pos,[status(thm)],[20]) ).
thf(25,plain,
( ( ( ~ $true ) = $true )
| ( $true = $true ) ),
inference(extcnf_or_pos,[status(thm)],[21]) ).
thf(26,plain,
( ( ( ~ $false ) = $true )
| ( $false = $true ) ),
inference(extcnf_or_pos,[status(thm)],[22]) ).
thf(27,plain,
( ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( is @ SX0 @ SX1 )
| ~ ( more @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[23]) ).
thf(28,plain,
( ( ~ ~ ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( more @ SX0 @ SX1 )
| ~ ( less @ SX0 @ SX1 ) )
| ~ ! [SX0: rat,SX1: rat] :
( ~ ( less @ SX0 @ SX1 )
| ~ ( is @ SX0 @ SX1 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[23]) ).
thf(29,plain,
! [SV1: $o] :
( ( SV1 = $false )
| ( SV1 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(30,plain,
( ( $true = $false )
| ( $true = $true ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(31,plain,
( ( $false = $false )
| ( $false = $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(32,plain,
( ( ! [SX0: rat,SX1: rat] :
( ~ ( is @ SX0 @ SX1 )
| ~ ( more @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[27]) ).
thf(33,plain,
( ( ~ ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( more @ SX0 @ SX1 )
| ~ ( less @ SX0 @ SX1 ) )
| ~ ! [SX0: rat,SX1: rat] :
( ~ ( less @ SX0 @ SX1 )
| ~ ( is @ SX0 @ SX1 ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[28]) ).
thf(34,plain,
! [SV2: rat] :
( ( ! [SY3: rat] :
( ~ ( is @ SV2 @ SY3 )
| ~ ( more @ SV2 @ SY3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(35,plain,
( ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( more @ SX0 @ SX1 )
| ~ ( less @ SX0 @ SX1 ) )
| ~ ! [SX0: rat,SX1: rat] :
( ~ ( less @ SX0 @ SX1 )
| ~ ( is @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(36,plain,
! [SV3: rat,SV2: rat] :
( ( ~ ( is @ SV2 @ SV3 )
| ~ ( more @ SV2 @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(37,plain,
( ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( more @ SX0 @ SX1 )
| ~ ( less @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[35]) ).
thf(38,plain,
( ( ~ ! [SX0: rat,SX1: rat] :
( ~ ( less @ SX0 @ SX1 )
| ~ ( is @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[35]) ).
thf(39,plain,
! [SV3: rat,SV2: rat] :
( ( ( ~ ( is @ SV2 @ SV3 ) )
= $true )
| ( ( ~ ( more @ SV2 @ SV3 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[36]) ).
thf(40,plain,
( ( ! [SX0: rat,SX1: rat] :
( ~ ( more @ SX0 @ SX1 )
| ~ ( less @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[37]) ).
thf(41,plain,
( ( ! [SX0: rat,SX1: rat] :
( ~ ( less @ SX0 @ SX1 )
| ~ ( is @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[38]) ).
thf(42,plain,
! [SV3: rat,SV2: rat] :
( ( ( is @ SV2 @ SV3 )
= $false )
| ( ( ~ ( more @ SV2 @ SV3 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(43,plain,
! [SV4: rat] :
( ( ! [SY4: rat] :
( ~ ( more @ SV4 @ SY4 )
| ~ ( less @ SV4 @ SY4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(44,plain,
! [SV5: rat] :
( ( ! [SY5: rat] :
( ~ ( less @ SV5 @ SY5 )
| ~ ( is @ SV5 @ SY5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(45,plain,
! [SV3: rat,SV2: rat] :
( ( ( more @ SV2 @ SV3 )
= $false )
| ( ( is @ SV2 @ SV3 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[42]) ).
thf(46,plain,
! [SV6: rat,SV4: rat] :
( ( ~ ( more @ SV4 @ SV6 )
| ~ ( less @ SV4 @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(47,plain,
! [SV7: rat,SV5: rat] :
( ( ~ ( less @ SV5 @ SV7 )
| ~ ( is @ SV5 @ SV7 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(48,plain,
! [SV6: rat,SV4: rat] :
( ( ( ~ ( more @ SV4 @ SV6 ) )
= $true )
| ( ( ~ ( less @ SV4 @ SV6 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(49,plain,
! [SV7: rat,SV5: rat] :
( ( ( ~ ( less @ SV5 @ SV7 ) )
= $true )
| ( ( ~ ( is @ SV5 @ SV7 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[47]) ).
thf(50,plain,
! [SV6: rat,SV4: rat] :
( ( ( more @ SV4 @ SV6 )
= $false )
| ( ( ~ ( less @ SV4 @ SV6 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(51,plain,
! [SV7: rat,SV5: rat] :
( ( ( less @ SV5 @ SV7 )
= $false )
| ( ( ~ ( is @ SV5 @ SV7 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(52,plain,
! [SV6: rat,SV4: rat] :
( ( ( less @ SV4 @ SV6 )
= $false )
| ( ( more @ SV4 @ SV6 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[50]) ).
thf(53,plain,
! [SV7: rat,SV5: rat] :
( ( ( is @ SV5 @ SV7 )
= $false )
| ( ( less @ SV5 @ SV7 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[51]) ).
thf(54,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[17,53,52,45,31,30,29,19]) ).
thf(55,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM784^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.18 % Computer : n013.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Oct 6 13:37:51 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.23
% 0.07/0.23 No.of.Axioms: 3
% 0.07/0.23
% 0.07/0.23 Length.of.Defs: 0
% 0.07/0.23
% 0.07/0.23 Contains.Choice.Funs: false
% 0.07/0.23 .
% 0.07/0.23
% 0.07/0.23 ********************************
% 0.07/0.23 * All subproblems solved! *
% 0.07/0.23 ********************************
% 0.07/0.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:54,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.23
% 0.07/0.23 %**** Beginning of derivation protocol ****
% 0.07/0.23 % SZS output start CNFRefutation
% See solution above
% 0.07/0.23
% 0.07/0.23 %**** End of derivation protocol ****
% 0.07/0.23 %**** no. of clauses in derivation: 55 ****
% 0.07/0.23 %**** clause counter: 54 ****
% 0.07/0.23
% 0.07/0.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:54,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------