%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM697^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 : n014.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:58 AM UTC 2026
% Result : Theorem 0.10s 0.17s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 24 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 99 ( 7 ~; 6 |; 0 &; 84 @)
% ( 0 <=>; 2 =>; 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 : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 ^; 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_nat,type,
nat: $tType ).
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_suc,type,
suc: nat > nat ).
thf(tp_x,type,
x: nat ).
thf(tp_y,type,
y: nat ).
thf(1,axiom,
! [Xx: nat] :
( ( pl @ Xx @ n_1 )
= ( suc @ Xx ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz4a) ).
thf(2,axiom,
! [Xx: nat,Xy: nat] :
( ( more @ Xy @ Xx )
=> ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz25) ).
thf(3,axiom,
more @ y @ x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(4,conjecture,
moreis @ y @ ( suc @ x ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz25a) ).
thf(5,negated_conjecture,
( ( moreis @ y @ ( suc @ x ) )
= $false ),
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,plain,
( ( moreis @ y @ ( suc @ x ) )
= $false ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [Xx: nat] :
( ( pl @ Xx @ n_1 )
= ( suc @ Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( more @ Xy @ Xx )
=> ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( more @ y @ x )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(10,plain,
( ( ~ ( moreis @ y @ ( suc @ x ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(11,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xy @ Xx )
| ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(12,plain,
( ( more @ y @ x )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(13,plain,
( ( ! [Xx: nat,Xy: nat] :
( ~ ( more @ Xy @ Xx )
| ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(14,plain,
( ( ! [Xx: nat] :
( ( pl @ Xx @ n_1 )
= ( suc @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(15,plain,
( ( ~ ( moreis @ y @ ( suc @ x ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
! [SV1: nat] :
( ( ! [SY3: nat] :
( ~ ( more @ SY3 @ SV1 )
| ( moreis @ SY3 @ ( pl @ SV1 @ n_1 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(17,plain,
! [SV2: nat] :
( ( ( pl @ SV2 @ n_1 )
= ( suc @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( moreis @ y @ ( suc @ x ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(19,plain,
! [SV1: nat,SV3: nat] :
( ( ~ ( more @ SV3 @ SV1 )
| ( moreis @ SV3 @ ( pl @ SV1 @ n_1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(20,plain,
! [SV1: nat,SV3: nat] :
( ( ( ~ ( more @ SV3 @ SV1 ) )
= $true )
| ( ( moreis @ SV3 @ ( pl @ SV1 @ n_1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(21,plain,
! [SV1: nat,SV3: nat] :
( ( ( more @ SV3 @ SV1 )
= $false )
| ( ( moreis @ SV3 @ ( pl @ SV1 @ n_1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(22,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,21,18,17]) ).
thf(23,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM697^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.10/0.15 % Computer : n014.cluster.edu
% 0.10/0.15 % Model : x86_64 x86_64
% 0.10/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.15 % Memory : 8046.5625MB
% 0.10/0.15 % OS : Linux 6.8.0-71-generic
% 0.10/0.15 % CPULimit : 300
% 0.10/0.15 % WCLimit : 300
% 0.10/0.15 % DateTime : Tue Oct 6 13:34:56 UTC 2026
% 0.10/0.15 % CPUTime :
% 0.10/0.15 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.17
% 0.10/0.17 No.of.Axioms: 3
% 0.10/0.17
% 0.10/0.17 Length.of.Defs: 0
% 0.10/0.17
% 0.10/0.17 Contains.Choice.Funs: false
% 0.10/0.17
% 0.10/0.17 ********************************
% 0.10/0.17 * All subproblems solved! *
% 0.10/0.17 ********************************
% 0.10/0.17 % 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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 0.10/0.17
% 0.10/0.17 %**** Beginning of derivation protocol ****
% 0.10/0.17 % SZS output start CNFRefutation
% See solution above
% 0.10/0.17
% 0.10/0.17 %**** End of derivation protocol ****
% 0.10/0.17 %**** no. of clauses in derivation: 23 ****
% 0.10/0.17 %**** clause counter: 22 ****
% 0.10/0.17
% 0.10/0.17 % 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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------