%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM660^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/sandbox/solver/bin/eprover /export/starexec/sandbox/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:49 AM UTC 2026
% Result : Theorem 0.00s 0.12s
% Output : CNFRefutation 0.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 101 ( 42 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 95 ( 19 ~; 9 |; 0 &; 58 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_nat,type,
nat: $tType ).
thf(tp_less,type,
less: nat > nat > $o ).
thf(tp_more,type,
more: nat > nat > $o ).
thf(tp_x,type,
x: nat ).
thf(tp_y,type,
y: nat ).
thf(1,axiom,
! [Xx: nat,Xy: nat] :
( ( more @ Xx @ Xy )
=> ( less @ Xy @ Xx ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz11) ).
thf(2,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(3,conjecture,
( ~ ( less @ y @ x )
=> ( y = x ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz13) ).
thf(4,negated_conjecture,
( ( ~ ( less @ y @ x )
=> ( y = x ) )
= $false ),
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,plain,
( ( ~ ( less @ y @ x )
=> ( y = x ) )
= $false ),
inference(unfold_def,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( more @ Xx @ Xy )
=> ( less @ Xy @ Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ~ ( more @ x @ y )
=> ( x = y ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(8,plain,
( ( ~ ( less @ y @ x ) )
= $true ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(9,plain,
( ( y = x )
= $false ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(10,plain,
( ( y != x )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(11,plain,
( ( ~ ( more @ x @ y )
=> ( x = y ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(12,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( more @ Xx @ Xy )
=> ( less @ Xy @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(13,plain,
( ( ~ ( less @ y @ x ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(14,plain,
( ( y != x )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(15,plain,
( ( ! [SX0: nat,SX1: nat] :
( ~ ( more @ SX0 @ SX1 )
| ( less @ SX1 @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(16,plain,
( ( ~ ~ ( more @ x @ y )
| ( x = y ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(17,plain,
( ( less @ y @ x )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(18,plain,
( ( y = x )
= $false ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(19,plain,
! [SV1: nat] :
( ( ! [SY2: nat] :
( ~ ( more @ SV1 @ SY2 )
| ( less @ SY2 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(20,plain,
( ( ( ~ ~ ( more @ x @ y ) )
= $true )
| ( ( x = y )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(21,plain,
! [SV2: nat,SV1: nat] :
( ( ~ ( more @ SV1 @ SV2 )
| ( less @ SV2 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(22,plain,
( ( ( ~ ( more @ x @ y ) )
= $false )
| ( ( x = y )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV2: nat,SV1: nat] :
( ( ( ~ ( more @ SV1 @ SV2 ) )
= $true )
| ( ( less @ SV2 @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[21]) ).
thf(24,plain,
( ( ( more @ x @ y )
= $true )
| ( ( x = y )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[22]) ).
thf(25,plain,
! [SV2: nat,SV1: nat] :
( ( ( more @ SV1 @ SV2 )
= $false )
| ( ( less @ SV2 @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[17,25,24,18]) ).
thf(27,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM660^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.02 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Oct 6 13:32:37 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.00/0.12
% 0.00/0.12 No.of.Axioms: 2
% 0.00/0.12
% 0.00/0.12 Length.of.Defs: 0
% 0.00/0.12
% 0.00/0.12 Contains.Choice.Funs: false
% 0.00/0.12
% 0.00/0.12 ********************************
% 0.00/0.12 * All subproblems solved! *
% 0.00/0.12 ********************************
% 0.00/0.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.00/0.12
% 0.00/0.12 %**** Beginning of derivation protocol ****
% 0.00/0.12 % SZS output start CNFRefutation
% See solution above
% 0.00/0.12
% 0.00/0.12 %**** End of derivation protocol ****
% 0.00/0.12 %**** no. of clauses in derivation: 27 ****
% 0.00/0.12 %**** clause counter: 26 ****
% 0.00/0.12
% 0.00/0.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------