TSTP Solution File: SYN986+1.002 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN986+1.002 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 08:31:02 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 19 unt; 3 typ; 0 def)
% Number of atoms : 176 ( 46 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 352 ( 38 ~; 40 |; 8 &; 262 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-3 aty)
% Number of variables : 94 ( 0 ^ 82 !; 12 ?; 94 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_r,type,
r: $i > $i > $i > $o ).
thf(tp_succ,type,
succ: $i > $i ).
thf(tp_zero,type,
zero: $i ).
thf(1,axiom,
! [Y: $i,X: $i,Z: $i,Z1: $i] :
( ( r @ Y @ X @ Z )
=> ( ( r @ Z @ X @ Z1 )
=> ( r @ Y @ ( succ @ X ) @ Z1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp2) ).
thf(2,axiom,
! [Y: $i] : ( r @ Y @ zero @ ( succ @ Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp1) ).
thf(3,conjecture,
? [Z2: $i,Z1: $i,Z0: $i] :
( ( r @ zero @ zero @ Z2 )
& ( r @ zero @ Z2 @ Z1 )
& ( r @ zero @ Z1 @ Z0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ck) ).
thf(4,negated_conjecture,
( ( ? [Z2: $i,Z1: $i,Z0: $i] :
( ( r @ zero @ zero @ Z2 )
& ( r @ zero @ Z2 @ Z1 )
& ( r @ zero @ Z1 @ Z0 ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,plain,
( ( ? [Z2: $i,Z1: $i,Z0: $i] :
( ( r @ zero @ zero @ Z2 )
& ( r @ zero @ Z2 @ Z1 )
& ( r @ zero @ Z1 @ Z0 ) ) )
= $false ),
inference(unfold_def,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [Y: $i,X: $i,Z: $i,Z1: $i] :
( ( r @ Y @ X @ Z )
=> ( ( r @ Z @ X @ Z1 )
=> ( r @ Y @ ( succ @ X ) @ Z1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ! [Y: $i] : ( r @ Y @ zero @ ( succ @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(8,plain,
( ( ~ ? [Z2: $i,Z1: $i,Z0: $i] :
( ( r @ zero @ zero @ Z2 )
& ( r @ zero @ Z2 @ Z1 )
& ( r @ zero @ Z1 @ Z0 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,plain,
( ( ! [Z2: $i,Z1: $i] :
( ~ ( r @ zero @ zero @ Z2 )
| ~ ( r @ zero @ Z2 @ Z1 )
| ! [Z0: $i] :
~ ( r @ zero @ Z1 @ Z0 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(10,plain,
( ( ! [Y: $i,X: $i,Z: $i] :
( ~ ( r @ Y @ X @ Z )
| ! [Z1: $i] :
( ~ ( r @ Z @ X @ Z1 )
| ( r @ Y @ ( succ @ X ) @ Z1 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(11,plain,
( ( ! [Y: $i] : ( r @ Y @ zero @ ( succ @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(12,plain,
( ( ! [Y: $i,X: $i,Z: $i] :
( ~ ( r @ Y @ X @ Z )
| ! [Z1: $i] :
( ~ ( r @ Z @ X @ Z1 )
| ( r @ Y @ ( succ @ X ) @ Z1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(13,plain,
( ( ! [Z2: $i,Z1: $i] :
( ~ ( r @ zero @ zero @ Z2 )
| ~ ( r @ zero @ Z2 @ Z1 )
| ! [Z0: $i] :
~ ( r @ zero @ Z1 @ Z0 ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(14,plain,
! [SV1: $i] :
( ( r @ SV1 @ zero @ ( succ @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(15,plain,
! [SV2: $i] :
( ( ! [SY8: $i,SY9: $i] :
( ~ ( r @ SV2 @ SY8 @ SY9 )
| ! [SY10: $i] :
( ~ ( r @ SY9 @ SY8 @ SY10 )
| ( r @ SV2 @ ( succ @ SY8 ) @ SY10 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(16,plain,
! [SV3: $i] :
( ( ! [SY11: $i] :
( ~ ( r @ zero @ zero @ SV3 )
| ~ ( r @ zero @ SV3 @ SY11 )
| ! [Z0: $i] :
~ ( r @ zero @ SY11 @ Z0 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(17,plain,
! [SV4: $i,SV2: $i] :
( ( ! [SY13: $i] :
( ~ ( r @ SV2 @ SV4 @ SY13 )
| ! [SY14: $i] :
( ~ ( r @ SY13 @ SV4 @ SY14 )
| ( r @ SV2 @ ( succ @ SV4 ) @ SY14 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(18,plain,
! [SV5: $i,SV3: $i] :
( ( ~ ( r @ zero @ zero @ SV3 )
| ~ ( r @ zero @ SV3 @ SV5 )
| ! [SY15: $i] :
~ ( r @ zero @ SV5 @ SY15 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(19,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ~ ( r @ SV2 @ SV4 @ SV6 )
| ! [SY16: $i] :
( ~ ( r @ SV6 @ SV4 @ SY16 )
| ( r @ SV2 @ ( succ @ SV4 ) @ SY16 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(20,plain,
! [SV5: $i,SV3: $i] :
( ( ( ~ ( r @ zero @ zero @ SV3 )
| ~ ( r @ zero @ SV3 @ SV5 ) )
= $true )
| ( ( ! [SY15: $i] :
~ ( r @ zero @ SV5 @ SY15 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[18]) ).
thf(21,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ( ~ ( r @ SV2 @ SV4 @ SV6 ) )
= $true )
| ( ( ! [SY16: $i] :
( ~ ( r @ SV6 @ SV4 @ SY16 )
| ( r @ SV2 @ ( succ @ SV4 ) @ SY16 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(22,plain,
! [SV5: $i,SV3: $i] :
( ( ( ~ ( r @ zero @ zero @ SV3 ) )
= $true )
| ( ( ~ ( r @ zero @ SV3 @ SV5 ) )
= $true )
| ( ( ! [SY15: $i] :
~ ( r @ zero @ SV5 @ SY15 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ( r @ SV2 @ SV4 @ SV6 )
= $false )
| ( ( ! [SY16: $i] :
( ~ ( r @ SV6 @ SV4 @ SY16 )
| ( r @ SV2 @ ( succ @ SV4 ) @ SY16 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(24,plain,
! [SV5: $i,SV3: $i] :
( ( ( r @ zero @ zero @ SV3 )
= $false )
| ( ( ~ ( r @ zero @ SV3 @ SV5 ) )
= $true )
| ( ( ! [SY15: $i] :
~ ( r @ zero @ SV5 @ SY15 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(25,plain,
! [SV2: $i,SV7: $i,SV4: $i,SV6: $i] :
( ( ( ~ ( r @ SV6 @ SV4 @ SV7 )
| ( r @ SV2 @ ( succ @ SV4 ) @ SV7 ) )
= $true )
| ( ( r @ SV2 @ SV4 @ SV6 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(26,plain,
! [SV5: $i,SV3: $i] :
( ( ( r @ zero @ SV3 @ SV5 )
= $false )
| ( ( r @ zero @ zero @ SV3 )
= $false )
| ( ( ! [SY15: $i] :
~ ( r @ zero @ SV5 @ SY15 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(27,plain,
! [SV2: $i,SV7: $i,SV4: $i,SV6: $i] :
( ( ( ~ ( r @ SV6 @ SV4 @ SV7 ) )
= $true )
| ( ( r @ SV2 @ ( succ @ SV4 ) @ SV7 )
= $true )
| ( ( r @ SV2 @ SV4 @ SV6 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[25]) ).
thf(28,plain,
! [SV3: $i,SV8: $i,SV5: $i] :
( ( ( ~ ( r @ zero @ SV5 @ SV8 ) )
= $true )
| ( ( r @ zero @ zero @ SV3 )
= $false )
| ( ( r @ zero @ SV3 @ SV5 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(29,plain,
! [SV2: $i,SV7: $i,SV4: $i,SV6: $i] :
( ( ( r @ SV6 @ SV4 @ SV7 )
= $false )
| ( ( r @ SV2 @ ( succ @ SV4 ) @ SV7 )
= $true )
| ( ( r @ SV2 @ SV4 @ SV6 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(30,plain,
! [SV3: $i,SV8: $i,SV5: $i] :
( ( ( r @ zero @ SV5 @ SV8 )
= $false )
| ( ( r @ zero @ zero @ SV3 )
= $false )
| ( ( r @ zero @ SV3 @ SV5 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(31,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[14,30,29]) ).
thf(32,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN986+1.002 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 05:23:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 2
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (rf:0,axioms:2,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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:4,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.12/0.37
% 0.12/0.37 ********************************
% 0.12/0.37 * All subproblems solved! *
% 0.12/0.37 ********************************
% 0.12/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.37
% 0.12/0.37 %**** Beginning of derivation protocol ****
% 0.12/0.37 % SZS output start CNFRefutation
% See solution above
% 0.12/0.37
% 0.12/0.37 %**** End of derivation protocol ****
% 0.12/0.37 %**** no. of clauses in derivation: 32 ****
% 0.12/0.37 %**** clause counter: 31 ****
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------