%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM700^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 : n012.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:34:59 AM UTC 2026
% Result : Theorem 0.10s 0.13s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 129 ( 35 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 182 ( 22 ~; 18 |; 0 &; 136 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 ^; 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_nat,type,
nat: $tType ).
thf(tp_less,type,
less: nat > nat > $o ).
thf(tp_lessis,type,
lessis: nat > nat > $o ).
thf(tp_more,type,
more: nat > nat > $o ).
thf(tp_moreis,type,
moreis: nat > nat > $o ).
thf(tp_n_1,type,
n_1: nat ).
thf(tp_pl,type,
pl: nat > nat > nat ).
thf(tp_x,type,
x: nat ).
thf(tp_y,type,
y: nat ).
thf(1,axiom,
! [Xx: nat,Xy: nat] :
( ( more @ Xy @ Xx )
=> ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz25) ).
thf(2,axiom,
! [Xx: nat,Xy: nat] :
( ( less @ Xx @ Xy )
=> ~ ( moreis @ Xx @ Xy ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10h) ).
thf(3,axiom,
! [Xx: nat,Xy: nat] :
( ~ ( more @ Xx @ Xy )
=> ( lessis @ Xx @ Xy ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10e) ).
thf(4,axiom,
less @ y @ ( pl @ x @ n_1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(5,conjecture,
lessis @ y @ x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz26) ).
thf(6,negated_conjecture,
( ( lessis @ y @ x )
= $false ),
inference(negate_conjecture,[status(cth)],[5]) ).
thf(7,plain,
( ( lessis @ y @ x )
= $false ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( more @ Xy @ Xx )
=> ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(9,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( less @ Xx @ Xy )
=> ~ ( moreis @ Xx @ Xy ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(10,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xx @ Xy )
=> ( lessis @ Xx @ Xy ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(11,plain,
( ( less @ y @ ( pl @ x @ n_1 ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(12,plain,
( ( ~ ( lessis @ y @ x ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(13,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xy @ Xx )
| ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(14,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( less @ Xx @ Xy )
| ~ ( moreis @ Xx @ Xy ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(15,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( more @ Xx @ Xy )
| ( lessis @ Xx @ Xy ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(16,plain,
( ( less @ y @ ( pl @ x @ n_1 ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(17,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( more @ Xx @ Xy )
| ( lessis @ Xx @ Xy ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(18,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( less @ Xx @ Xy )
| ~ ( moreis @ Xx @ Xy ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(19,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xy @ Xx )
| ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(20,plain,
( ( ~ ( lessis @ y @ x ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(21,plain,
! [SV1: nat] :
( ( ! [SY6: nat] :
( ( more @ SV1 @ SY6 )
| ( lessis @ SV1 @ SY6 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(22,plain,
! [SV2: nat] :
( ( ! [SY7: nat] :
( ~ ( less @ SV2 @ SY7 )
| ~ ( moreis @ SV2 @ SY7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(23,plain,
! [SV3: nat] :
( ( ! [SY8: nat] :
( ~ ( more @ SY8 @ SV3 )
| ( moreis @ SY8 @ ( pl @ SV3 @ n_1 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(24,plain,
( ( lessis @ y @ x )
= $false ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(25,plain,
! [SV4: nat,SV1: nat] :
( ( ( more @ SV1 @ SV4 )
| ( lessis @ SV1 @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(26,plain,
! [SV5: nat,SV2: nat] :
( ( ~ ( less @ SV2 @ SV5 )
| ~ ( moreis @ SV2 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(27,plain,
! [SV3: nat,SV6: nat] :
( ( ~ ( more @ SV6 @ SV3 )
| ( moreis @ SV6 @ ( pl @ SV3 @ n_1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(28,plain,
! [SV4: nat,SV1: nat] :
( ( ( more @ SV1 @ SV4 )
= $true )
| ( ( lessis @ SV1 @ SV4 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[25]) ).
thf(29,plain,
! [SV5: nat,SV2: nat] :
( ( ( ~ ( less @ SV2 @ SV5 ) )
= $true )
| ( ( ~ ( moreis @ SV2 @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[26]) ).
thf(30,plain,
! [SV3: nat,SV6: nat] :
( ( ( ~ ( more @ SV6 @ SV3 ) )
= $true )
| ( ( moreis @ SV6 @ ( pl @ SV3 @ n_1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[27]) ).
thf(31,plain,
! [SV5: nat,SV2: nat] :
( ( ( less @ SV2 @ SV5 )
= $false )
| ( ( ~ ( moreis @ SV2 @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[29]) ).
thf(32,plain,
! [SV3: nat,SV6: nat] :
( ( ( more @ SV6 @ SV3 )
= $false )
| ( ( moreis @ SV6 @ ( pl @ SV3 @ n_1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[30]) ).
thf(33,plain,
! [SV5: nat,SV2: nat] :
( ( ( moreis @ SV2 @ SV5 )
= $false )
| ( ( less @ SV2 @ SV5 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[31]) ).
thf(34,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[16,33,32,28,24]) ).
thf(35,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM700^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03 % 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.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Oct 6 13:35:01 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 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.10/0.13
% 0.10/0.13 No.of.Axioms: 4
% 0.10/0.13
% 0.10/0.13 Length.of.Defs: 0
% 0.10/0.13
% 0.10/0.13 Contains.Choice.Funs: false
% 0.10/0.13
% 0.10/0.13 ********************************
% 0.10/0.13 * All subproblems solved! *
% 0.10/0.13 ********************************
% 0.10/0.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:4,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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:34,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.13
% 0.10/0.13 %**** Beginning of derivation protocol ****
% 0.10/0.13 % SZS output start CNFRefutation
% See solution above
% 0.10/0.13
% 0.10/0.13 %**** End of derivation protocol ****
% 0.10/0.13 %**** no. of clauses in derivation: 35 ****
% 0.10/0.13 %**** clause counter: 34 ****
% 0.10/0.13
% 0.10/0.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:4,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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:34,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------