TSTP Solution File: SET655+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET655+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : Tue Jul 19 00:52:55 EDT 2022
% Result : Theorem 0.50s 47.68s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 72 ( 18 unt; 0 def)
% Number of atoms : 281 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 342 ( 133 ~; 143 |; 24 &)
% ( 4 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 140 ( 2 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p3,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> ilf_type(X3,relation_type(X1,X2)) )
& ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ilf_type(X4,subset_type(cross_product(X1,X2))) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p3) ).
fof(p19,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p19) ).
fof(prove_relset_1_17,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ! [X5] :
( ilf_type(X5,relation_type(X1,X3))
=> ( ( subset(X1,X2)
& subset(X3,X4) )
=> ilf_type(X5,relation_type(X2,X4)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',prove_relset_1_17) ).
fof(p7,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ilf_type(X2,subset_type(X1))
<=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p7) ).
fof(p2,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cross_product(X1,X3),cross_product(X2,X4)) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p2) ).
fof(p10,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X1,power_set(X2))
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p10) ).
fof(p5,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( subset(X1,X2)
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p5) ).
fof(p12,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ~ empty(X2)
& ilf_type(X2,set_type) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p12) ).
fof(p11,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( ~ empty(power_set(X1))
& ilf_type(power_set(X1),set_type) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p11) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',p1) ).
fof(c_0_10,plain,
! [X5,X6,X7,X8] :
( ( ~ ilf_type(X7,subset_type(cross_product(X5,X6)))
| ilf_type(X7,relation_type(X5,X6))
| ~ ilf_type(X6,set_type)
| ~ ilf_type(X5,set_type) )
& ( ~ ilf_type(X8,relation_type(X5,X6))
| ilf_type(X8,subset_type(cross_product(X5,X6)))
| ~ ilf_type(X6,set_type)
| ~ ilf_type(X5,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p3])])])])])]) ).
fof(c_0_11,plain,
! [X2] : ilf_type(X2,set_type),
inference(variable_rename,[status(thm)],[p19]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ! [X5] :
( ilf_type(X5,relation_type(X1,X3))
=> ( ( subset(X1,X2)
& subset(X3,X4) )
=> ilf_type(X5,relation_type(X2,X4)) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_17]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ( ~ ilf_type(X4,subset_type(X3))
| ilf_type(X4,member_type(power_set(X3)))
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X3,set_type) )
& ( ~ ilf_type(X4,member_type(power_set(X3)))
| ilf_type(X4,subset_type(X3))
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X3,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p7])])])])])]) ).
cnf(c_0_14,plain,
( ilf_type(X3,subset_type(cross_product(X1,X2)))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,relation_type(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,negated_conjecture,
( ilf_type(esk10_0,set_type)
& ilf_type(esk11_0,set_type)
& ilf_type(esk12_0,set_type)
& ilf_type(esk13_0,set_type)
& ilf_type(esk14_0,relation_type(esk10_0,esk12_0))
& subset(esk10_0,esk11_0)
& subset(esk12_0,esk13_0)
& ~ ilf_type(esk14_0,relation_type(esk11_0,esk13_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_17,plain,
! [X5,X6,X7,X8] :
( ~ ilf_type(X5,set_type)
| ~ ilf_type(X6,set_type)
| ~ ilf_type(X7,set_type)
| ~ ilf_type(X8,set_type)
| ~ subset(X5,X6)
| ~ subset(X7,X8)
| subset(cross_product(X5,X7),cross_product(X6,X8)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])])])])]) ).
fof(c_0_18,plain,
! [X4,X5,X6] :
( ( ~ member(X4,power_set(X5))
| ~ ilf_type(X6,set_type)
| ~ member(X6,X4)
| member(X6,X5)
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) )
& ( ilf_type(esk4_2(X4,X5),set_type)
| member(X4,power_set(X5))
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) )
& ( member(esk4_2(X4,X5),X4)
| member(X4,power_set(X5))
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) )
& ( ~ member(esk4_2(X4,X5),X5)
| member(X4,power_set(X5))
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p10])])])])])])]) ).
fof(c_0_19,plain,
! [X4,X5,X6] :
( ( ~ subset(X4,X5)
| ~ ilf_type(X6,set_type)
| ~ member(X6,X4)
| member(X6,X5)
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) )
& ( ilf_type(esk2_2(X4,X5),set_type)
| subset(X4,X5)
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) )
& ( member(esk2_2(X4,X5),X4)
| subset(X4,X5)
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) )
& ( ~ member(esk2_2(X4,X5),X5)
| subset(X4,X5)
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p5])])])])])])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ( ~ ilf_type(X3,member_type(X4))
| member(X3,X4)
| empty(X4)
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X3,set_type) )
& ( ~ member(X3,X4)
| ilf_type(X3,member_type(X4))
| empty(X4)
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X3,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[p12])])])])])])]) ).
cnf(c_0_21,plain,
( ilf_type(X2,member_type(power_set(X1)))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X2,subset_type(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( ilf_type(X1,subset_type(cross_product(X2,X3)))
| ~ ilf_type(X1,relation_type(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
cnf(c_0_23,negated_conjecture,
ilf_type(esk14_0,relation_type(esk10_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X2] :
( ( ~ empty(power_set(X2))
| ~ ilf_type(X2,set_type) )
& ( ilf_type(power_set(X2),set_type)
| ~ ilf_type(X2,set_type) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[p11])])])]) ).
cnf(c_0_25,plain,
( subset(cross_product(X1,X2),cross_product(X3,X4))
| ~ subset(X2,X4)
| ~ subset(X1,X3)
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( member(X3,X2)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X3,set_type)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( empty(X2)
| member(X1,X2)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,member_type(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( ilf_type(X1,member_type(power_set(X2)))
| ~ ilf_type(X1,subset_type(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_15]),c_0_15])]) ).
cnf(c_0_30,negated_conjecture,
ilf_type(esk14_0,subset_type(cross_product(esk10_0,esk12_0))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( ~ ilf_type(X1,set_type)
| ~ empty(power_set(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X4,X5,X6] :
( ~ ilf_type(X4,set_type)
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X6,set_type)
| ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])])])]) ).
cnf(c_0_33,plain,
( subset(cross_product(X1,X2),cross_product(X3,X4))
| ~ subset(X2,X4)
| ~ subset(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_15]),c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_34,negated_conjecture,
subset(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_35,plain,
( member(X1,X2)
| ~ member(X3,power_set(X2))
| ~ member(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_36,plain,
( member(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_15]),c_0_15])]) ).
cnf(c_0_37,plain,
( empty(X1)
| member(X2,X1)
| ~ ilf_type(X2,member_type(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_15]),c_0_15])]) ).
cnf(c_0_38,negated_conjecture,
ilf_type(esk14_0,member_type(power_set(cross_product(esk10_0,esk12_0)))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
~ empty(power_set(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_15])]) ).
cnf(c_0_40,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( subset(cross_product(X1,esk12_0),cross_product(X2,esk13_0))
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
subset(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_43,plain,
( subset(X1,X2)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_44,plain,
( member(esk2_2(X1,X2),X3)
| subset(X1,X2)
| ~ member(X1,power_set(X3)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
member(esk14_0,power_set(cross_product(esk10_0,esk12_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_46,plain,
( member(X3,X2)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X3,set_type)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_47,plain,
( member(X1,power_set(X2))
| member(esk4_2(X1,X2),X1)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_48,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_49,negated_conjecture,
subset(cross_product(esk10_0,esk12_0),cross_product(esk11_0,esk13_0)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_15]),c_0_15])]) ).
cnf(c_0_51,negated_conjecture,
( member(esk2_2(esk14_0,X1),cross_product(esk10_0,esk12_0))
| subset(esk14_0,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_53,plain,
( member(esk4_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_15]),c_0_15])]) ).
cnf(c_0_54,negated_conjecture,
( subset(X1,cross_product(esk11_0,esk13_0))
| ~ subset(X1,cross_product(esk10_0,esk12_0)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
subset(esk14_0,cross_product(esk10_0,esk12_0)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( member(X1,power_set(X2))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_57,plain,
( member(esk4_2(X1,X2),X3)
| member(X1,power_set(X2))
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
subset(esk14_0,cross_product(esk11_0,esk13_0)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( empty(X2)
| ilf_type(X1,member_type(X2))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_60,plain,
( member(X1,power_set(X2))
| ~ member(esk4_2(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_15]),c_0_15])]) ).
cnf(c_0_61,negated_conjecture,
( member(esk4_2(esk14_0,X1),cross_product(esk11_0,esk13_0))
| member(esk14_0,power_set(X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
( ilf_type(X2,subset_type(X1))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X2,member_type(power_set(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_63,plain,
( empty(X1)
| ilf_type(X2,member_type(X1))
| ~ member(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_15]),c_0_15])]) ).
cnf(c_0_64,negated_conjecture,
member(esk14_0,power_set(cross_product(esk11_0,esk13_0))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
( ilf_type(X3,relation_type(X1,X2))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,subset_type(cross_product(X1,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_66,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X1,member_type(power_set(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_15]),c_0_15])]) ).
cnf(c_0_67,negated_conjecture,
ilf_type(esk14_0,member_type(power_set(cross_product(esk11_0,esk13_0)))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_39]) ).
cnf(c_0_68,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_15]),c_0_15])]) ).
cnf(c_0_69,negated_conjecture,
ilf_type(esk14_0,subset_type(cross_product(esk11_0,esk13_0))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
~ ilf_type(esk14_0,relation_type(esk11_0,esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET655+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 06:44:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.44 eprover: CPU time limit exceeded, terminating
% 0.50/46.43 eprover: CPU time limit exceeded, terminating
% 0.50/46.44 eprover: CPU time limit exceeded, terminating
% 0.50/46.45 eprover: CPU time limit exceeded, terminating
% 0.50/46.46 eprover: CPU time limit exceeded, terminating
% 0.50/47.68 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.50/47.68
% 0.50/47.68 # Failure: Resource limit exceeded (time)
% 0.50/47.68 # OLD status Res
% 0.50/47.68 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.50/47.68 # Preprocessing time : 0.016 s
% 0.50/47.68 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.50/47.68 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.50/47.68 # Preprocessing time : 0.017 s
% 0.50/47.68
% 0.50/47.68 # Failure: Out of unprocessed clauses!
% 0.50/47.68 # OLD status GaveUp
% 0.50/47.68 # Parsed axioms : 20
% 0.50/47.68 # Removed by relevancy pruning/SinE : 13
% 0.50/47.68 # Initial clauses : 18
% 0.50/47.68 # Removed in clause preprocessing : 0
% 0.50/47.68 # Initial clauses in saturation : 18
% 0.50/47.68 # Processed clauses : 58
% 0.50/47.68 # ...of these trivial : 1
% 0.50/47.68 # ...subsumed : 17
% 0.50/47.68 # ...remaining for further processing : 40
% 0.50/47.68 # Other redundant clauses eliminated : 0
% 0.50/47.68 # Clauses deleted for lack of memory : 0
% 0.50/47.68 # Backward-subsumed : 0
% 0.50/47.68 # Backward-rewritten : 4
% 0.50/47.68 # Generated clauses : 47
% 0.50/47.68 # ...of the previous two non-trivial : 40
% 0.50/47.68 # Contextual simplify-reflections : 16
% 0.50/47.68 # Paramodulations : 47
% 0.50/47.68 # Factorizations : 0
% 0.50/47.68 # Equation resolutions : 0
% 0.50/47.68 # Current number of processed clauses : 36
% 0.50/47.68 # Positive orientable unit clauses : 6
% 0.50/47.68 # Positive unorientable unit clauses: 0
% 0.50/47.68 # Negative unit clauses : 1
% 0.50/47.68 # Non-unit-clauses : 29
% 0.50/47.68 # Current number of unprocessed clauses: 0
% 0.50/47.68 # ...number of literals in the above : 0
% 0.50/47.68 # Current number of archived formulas : 0
% 0.50/47.68 # Current number of archived clauses : 4
% 0.50/47.68 # Clause-clause subsumption calls (NU) : 349
% 0.50/47.68 # Rec. Clause-clause subsumption calls : 212
% 0.50/47.68 # Non-unit clause-clause subsumptions : 33
% 0.50/47.68 # Unit Clause-clause subsumption calls : 0
% 0.50/47.68 # Rewrite failures with RHS unbound : 0
% 0.50/47.68 # BW rewrite match attempts : 6
% 0.50/47.68 # BW rewrite match successes : 4
% 0.50/47.68 # Condensation attempts : 0
% 0.50/47.68 # Condensation successes : 0
% 0.50/47.68 # Termbank termtop insertions : 2184
% 0.50/47.68
% 0.50/47.68 # -------------------------------------------------
% 0.50/47.68 # User time : 0.016 s
% 0.50/47.68 # System time : 0.003 s
% 0.50/47.68 # Total time : 0.019 s
% 0.50/47.68 # Maximum resident set size: 2704 pages
% 0.50/47.68 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.50/47.68
% 0.50/47.68 # Failure: Resource limit exceeded (time)
% 0.50/47.68 # OLD status Res
% 0.50/47.68 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.50/47.68 # Preprocessing time : 0.009 s
% 0.50/47.68 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.50/47.68 # Preprocessing time : 0.009 s
% 0.50/47.68
% 0.50/47.68 # Proof found!
% 0.50/47.68 # SZS status Theorem
% 0.50/47.68 # SZS output start CNFRefutation
% See solution above
% 0.50/47.68 # Proof object total steps : 72
% 0.50/47.68 # Proof object clause steps : 51
% 0.50/47.68 # Proof object formula steps : 21
% 0.50/47.68 # Proof object conjectures : 21
% 0.50/47.68 # Proof object clause conjectures : 18
% 0.50/47.68 # Proof object formula conjectures : 3
% 0.50/47.68 # Proof object initial clauses used : 20
% 0.50/47.68 # Proof object initial formulas used : 10
% 0.50/47.68 # Proof object generating inferences : 16
% 0.50/47.68 # Proof object simplifying inferences : 52
% 0.50/47.68 # Training examples: 0 positive, 0 negative
% 0.50/47.68 # Parsed axioms : 20
% 0.50/47.68 # Removed by relevancy pruning/SinE : 0
% 0.50/47.68 # Initial clauses : 44
% 0.50/47.68 # Removed in clause preprocessing : 0
% 0.50/47.68 # Initial clauses in saturation : 44
% 0.50/47.68 # Processed clauses : 13931
% 0.50/47.68 # ...of these trivial : 280
% 0.50/47.68 # ...subsumed : 8247
% 0.50/47.68 # ...remaining for further processing : 5404
% 0.50/47.68 # Other redundant clauses eliminated : 0
% 0.50/47.68 # Clauses deleted for lack of memory : 0
% 0.50/47.68 # Backward-subsumed : 680
% 0.50/47.68 # Backward-rewritten : 4
% 0.50/47.68 # Generated clauses : 62818
% 0.50/47.68 # ...of the previous two non-trivial : 58791
% 0.50/47.68 # Contextual simplify-reflections : 0
% 0.50/47.68 # Paramodulations : 62816
% 0.50/47.68 # Factorizations : 0
% 0.50/47.68 # Equation resolutions : 0
% 0.50/47.68 # Current number of processed clauses : 4718
% 0.50/47.68 # Positive orientable unit clauses : 925
% 0.50/47.68 # Positive unorientable unit clauses: 0
% 0.50/47.68 # Negative unit clauses : 7
% 0.50/47.68 # Non-unit-clauses : 3786
% 0.50/47.68 # Current number of unprocessed clauses: 39732
% 0.50/47.68 # ...number of literals in the above : 80443
% 0.50/47.68 # Current number of archived formulas : 0
% 0.50/47.68 # Current number of archived clauses : 686
% 0.50/47.68 # Clause-clause subsumption calls (NU) : 1248601
% 0.50/47.68 # Rec. Clause-clause subsumption calls : 1157444
% 0.50/47.68 # Non-unit clause-clause subsumptions : 7946
% 0.50/47.68 # Unit Clause-clause subsumption calls : 52206
% 0.50/47.68 # Rewrite failures with RHS unbound : 0
% 0.50/47.68 # BW rewrite match attempts : 108183
% 0.50/47.68 # BW rewrite match successes : 4
% 0.50/47.68 # Condensation attempts : 0
% 0.50/47.68 # Condensation successes : 0
% 0.50/47.68 # Termbank termtop insertions : 1472212
% 0.50/47.68
% 0.50/47.68 # -------------------------------------------------
% 0.50/47.68 # User time : 1.078 s
% 0.50/47.68 # System time : 0.037 s
% 0.50/47.68 # Total time : 1.115 s
% 0.50/47.68 # Maximum resident set size: 48124 pages
% 0.50/69.44 eprover: CPU time limit exceeded, terminating
% 0.50/69.44 eprover: CPU time limit exceeded, terminating
% 0.50/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.46 eprover: No such file or directory
% 0.50/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.46 eprover: No such file or directory
% 0.50/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.46 eprover: No such file or directory
% 0.50/69.46 eprover: CPU time limit exceeded, terminating
% 0.50/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.47 eprover: No such file or directory
% 0.50/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.47 eprover: No such file or directory
% 0.50/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.47 eprover: No such file or directory
% 0.50/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.47 eprover: No such file or directory
% 0.50/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.48 eprover: No such file or directory
% 0.50/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.48 eprover: No such file or directory
% 0.50/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.48 eprover: No such file or directory
% 0.50/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.48 eprover: No such file or directory
% 0.50/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.49 eprover: No such file or directory
% 0.50/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.49 eprover: No such file or directory
% 0.50/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.49 eprover: No such file or directory
% 0.50/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.49 eprover: No such file or directory
% 0.50/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.49 eprover: No such file or directory
% 0.50/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.50 eprover: No such file or directory
% 0.50/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.50 eprover: No such file or directory
% 0.50/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.50 eprover: No such file or directory
% 0.50/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.50 eprover: No such file or directory
% 0.50/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.50 eprover: No such file or directory
% 0.50/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.50 eprover: No such file or directory
% 0.50/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.50/69.51 eprover: No such file or directory
% 0.50/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.51 eprover: No such file or directory
% 0.50/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.51 eprover: No such file or directory
% 0.50/69.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.52 eprover: No such file or directory
% 0.50/69.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.50/69.52 eprover: No such file or directory
%------------------------------------------------------------------------------