TSTP Solution File: SYO160^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO160^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 : n029.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:28 EDT 2022
% Result : Theorem 0.19s 0.40s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 67 ( 39 unt; 6 typ; 0 def)
% Number of atoms : 288 ( 80 equ; 0 cnn)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 217 ( 26 ~; 42 |; 14 &; 124 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 0 ^ 66 !; 0 ?; 66 :)
% 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(tp_cQ,type,
cQ: $i > $o ).
thf(tp_cR,type,
cR: $i > $o ).
thf(1,conjecture,
( ( ( ! [Xx: $i] : ( cP @ Xx )
| ! [Xx: $i] : ( cQ @ Xx ) )
& ! [Xx: $i] :
( ( cP @ Xx )
=> ( cR @ Xx ) )
& ! [Xx: $i] :
( ( cQ @ Xx )
=> ( cR @ Xx ) ) )
=> ( ( cR @ a )
& ( cR @ b )
& ( cR @ c ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDISJ_THIRD) ).
thf(2,negated_conjecture,
( ( ( ( ! [Xx: $i] : ( cP @ Xx )
| ! [Xx: $i] : ( cQ @ Xx ) )
& ! [Xx: $i] :
( ( cP @ Xx )
=> ( cR @ Xx ) )
& ! [Xx: $i] :
( ( cQ @ Xx )
=> ( cR @ Xx ) ) )
=> ( ( cR @ a )
& ( cR @ b )
& ( cR @ c ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ( ! [Xx: $i] : ( cP @ Xx )
| ! [Xx: $i] : ( cQ @ Xx ) )
& ! [Xx: $i] :
( ( cP @ Xx )
=> ( cR @ Xx ) )
& ! [Xx: $i] :
( ( cQ @ Xx )
=> ( cR @ Xx ) ) )
=> ( ( cR @ a )
& ( cR @ b )
& ( cR @ c ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Xx: $i] : ( cP @ Xx )
| ! [Xx: $i] : ( cQ @ Xx ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: $i] :
( ( cP @ Xx )
=> ( cR @ Xx ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [Xx: $i] :
( ( cQ @ Xx )
=> ( cR @ Xx ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ( cR @ a )
& ( cR @ b )
& ( cR @ c ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( cR @ a )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[7]) ).
thf(9,plain,
( ( cR @ b )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[7]) ).
thf(10,plain,
( ( cR @ c )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[7]) ).
thf(11,plain,
( ( ~ ( cR @ a ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(12,plain,
( ( ~ ( cR @ b ) )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(13,plain,
( ( ~ ( cR @ c ) )
= $true ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(14,plain,
( ( ! [Xx: $i] :
( ~ ( cP @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(15,plain,
( ( ! [Xx: $i] :
( ~ ( cQ @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(16,plain,
( ( ! [Xx: $i] :
( ~ ( cQ @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(17,plain,
( ( ! [Xx: $i] :
( ~ ( cP @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(18,plain,
( ( ! [Xx: $i] : ( cP @ Xx )
| ! [Xx: $i] : ( cQ @ Xx ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(19,plain,
( ( ~ ( cR @ a ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(20,plain,
! [SV1: $i] :
( ( ~ ( cQ @ SV1 )
| ( cR @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(21,plain,
! [SV2: $i] :
( ( ~ ( cP @ SV2 )
| ( cR @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(22,plain,
( ( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[18]) ).
thf(23,plain,
( ( cR @ a )
= $false ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(24,plain,
! [SV1: $i] :
( ( ( ~ ( cQ @ SV1 ) )
= $true )
| ( ( cR @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[20]) ).
thf(25,plain,
! [SV2: $i] :
( ( ( ~ ( cP @ SV2 ) )
= $true )
| ( ( cR @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[21]) ).
thf(26,plain,
! [SV3: $i] :
( ( ( cP @ SV3 )
= $true )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(27,plain,
! [SV1: $i] :
( ( ( cQ @ SV1 )
= $false )
| ( ( cR @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(28,plain,
! [SV2: $i] :
( ( ( cP @ SV2 )
= $false )
| ( ( cR @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(29,plain,
! [SV3: $i,SV4: $i] :
( ( ( cQ @ SV4 )
= $true )
| ( ( cP @ SV3 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(30,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[23,29,28,27]) ).
thf(31,plain,
( ( ! [Xx: $i] :
( ~ ( cQ @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(32,plain,
( ( ! [Xx: $i] :
( ~ ( cP @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(33,plain,
( ( ! [Xx: $i] : ( cP @ Xx )
| ! [Xx: $i] : ( cQ @ Xx ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(34,plain,
( ( ~ ( cR @ b ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(35,plain,
! [SV5: $i] :
( ( ~ ( cQ @ SV5 )
| ( cR @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(36,plain,
! [SV6: $i] :
( ( ~ ( cP @ SV6 )
| ( cR @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(37,plain,
( ( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(38,plain,
( ( cR @ b )
= $false ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(39,plain,
! [SV5: $i] :
( ( ( ~ ( cQ @ SV5 ) )
= $true )
| ( ( cR @ SV5 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(40,plain,
! [SV6: $i] :
( ( ( ~ ( cP @ SV6 ) )
= $true )
| ( ( cR @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[36]) ).
thf(41,plain,
! [SV7: $i] :
( ( ( cP @ SV7 )
= $true )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(42,plain,
! [SV5: $i] :
( ( ( cQ @ SV5 )
= $false )
| ( ( cR @ SV5 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(43,plain,
! [SV6: $i] :
( ( ( cP @ SV6 )
= $false )
| ( ( cR @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(44,plain,
! [SV7: $i,SV8: $i] :
( ( ( cQ @ SV8 )
= $true )
| ( ( cP @ SV7 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(45,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[38,44,43,42]) ).
thf(46,plain,
( ( ! [Xx: $i] :
( ~ ( cQ @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(47,plain,
( ( ! [Xx: $i] :
( ~ ( cP @ Xx )
| ( cR @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(48,plain,
( ( ! [Xx: $i] : ( cP @ Xx )
| ! [Xx: $i] : ( cQ @ Xx ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(49,plain,
( ( ~ ( cR @ c ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(50,plain,
! [SV9: $i] :
( ( ~ ( cQ @ SV9 )
| ( cR @ SV9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(51,plain,
! [SV10: $i] :
( ( ~ ( cP @ SV10 )
| ( cR @ SV10 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(52,plain,
( ( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[48]) ).
thf(53,plain,
( ( cR @ c )
= $false ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(54,plain,
! [SV9: $i] :
( ( ( ~ ( cQ @ SV9 ) )
= $true )
| ( ( cR @ SV9 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(55,plain,
! [SV10: $i] :
( ( ( ~ ( cP @ SV10 ) )
= $true )
| ( ( cR @ SV10 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[51]) ).
thf(56,plain,
! [SV11: $i] :
( ( ( cP @ SV11 )
= $true )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[52]) ).
thf(57,plain,
! [SV9: $i] :
( ( ( cQ @ SV9 )
= $false )
| ( ( cR @ SV9 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[54]) ).
thf(58,plain,
! [SV10: $i] :
( ( ( cP @ SV10 )
= $false )
| ( ( cR @ SV10 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[55]) ).
thf(59,plain,
! [SV11: $i,SV12: $i] :
( ( ( cQ @ SV12 )
= $true )
| ( ( cP @ SV11 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[56]) ).
thf(60,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[53,59,58,57]) ).
thf(61,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[60,30,45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYO160^5 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 8 22:52:45 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.33
% 0.13/0.33 No.of.Axioms: 0
% 0.13/0.33
% 0.13/0.33 Length.of.Defs: 0
% 0.13/0.33
% 0.13/0.33 Contains.Choice.Funs: false
% 0.13/0.33 (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.19/0.40
% 0.19/0.40 ********************************
% 0.19/0.40 * All subproblems solved! *
% 0.19/0.40 ********************************
% 0.19/0.40 % 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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:60,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.40
% 0.19/0.40 %**** Beginning of derivation protocol ****
% 0.19/0.40 % SZS output start CNFRefutation
% See solution above
% 0.19/0.40
% 0.19/0.40 %**** End of derivation protocol ****
% 0.19/0.40 %**** no. of clauses in derivation: 61 ****
% 0.19/0.40 %**** clause counter: 60 ****
% 0.19/0.40
% 0.19/0.40 % 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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:60,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------