TSTP Solution File: SYO129^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO129^5 : 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 17:32:19 EDT 2022
% Result : Theorem 0.20s 0.42s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 26 unt; 4 typ; 0 def)
% Number of atoms : 88 ( 25 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 51 ( 6 ~; 0 |; 8 &; 34 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_c,type,
c: $i ).
thf(tp_cP,type,
cP: $i > $o ).
thf(1,conjecture,
( ! [Xx: $i] : ( cP @ Xx )
=> ( ( cP @ a )
& ( cP @ b )
& ( cP @ c ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cALLCONJ3) ).
thf(2,negated_conjecture,
( ( ! [Xx: $i] : ( cP @ Xx )
=> ( ( cP @ a )
& ( cP @ b )
& ( cP @ c ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: $i] : ( cP @ Xx )
=> ( ( cP @ a )
& ( cP @ b )
& ( cP @ c ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ( cP @ a )
& ( cP @ b )
& ( cP @ c ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( cP @ a )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(7,plain,
( ( cP @ b )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(8,plain,
( ( cP @ c )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(9,plain,
( ( ~ ( cP @ a ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(10,plain,
( ( ~ ( cP @ b ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( cP @ c ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(12,plain,
( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(13,plain,
( ( ~ ( cP @ a ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(14,plain,
! [SV1: $i] :
( ( cP @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( cP @ a )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(16,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[14,15]) ).
thf(17,plain,
( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(18,plain,
( ( ~ ( cP @ b ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(19,plain,
! [SV2: $i] :
( ( cP @ SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(20,plain,
( ( cP @ b )
= $false ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(21,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[19,20]) ).
thf(22,plain,
( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(23,plain,
( ( ~ ( cP @ c ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(24,plain,
! [SV3: $i] :
( ( cP @ SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(25,plain,
( ( cP @ c )
= $false ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[24,25]) ).
thf(27,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[26,16,21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO129^5 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 8 22:06:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36
% 0.13/0.36 No.of.Axioms: 0
% 0.13/0.36
% 0.13/0.36 Length.of.Defs: 0
% 0.13/0.36
% 0.13/0.36 Contains.Choice.Funs: false
% 0.13/0.36 (rf:0,axioms:0,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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.20/0.42 ********************************
% 0.20/0.42 * All subproblems solved! *
% 0.20/0.42 ********************************
% 0.20/0.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.42
% 0.20/0.42 %**** Beginning of derivation protocol ****
% 0.20/0.42 % SZS output start CNFRefutation
% See solution above
% 0.20/0.42
% 0.20/0.42 %**** End of derivation protocol ****
% 0.20/0.42 %**** no. of clauses in derivation: 27 ****
% 0.20/0.42 %**** clause counter: 26 ****
% 0.20/0.42
% 0.20/0.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------