TSTP Solution File: SET582+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET582+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:08 EDT 2022
% Result : Theorem 0.17s 1.36s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 8
% Syntax : Number of formulae : 83 ( 27 unt; 0 def)
% Number of atoms : 208 ( 29 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 199 ( 74 ~; 95 |; 17 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 158 ( 25 sgn 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th25,conjecture,
! [X1,X2,X3] :
( ! [X4] :
( ~ member(X4,X1)
<=> ( member(X4,X2)
<=> member(X4,X3) ) )
=> X1 = symmetric_difference(X2,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th25) ).
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',difference_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',union_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_of_union) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_defn) ).
fof(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_member_defn) ).
fof(symmetric_difference_defn,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetric_difference_defn) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ! [X4] :
( ~ member(X4,X1)
<=> ( member(X4,X2)
<=> member(X4,X3) ) )
=> X1 = symmetric_difference(X2,X3) ),
inference(assume_negation,[status(cth)],[prove_th25]) ).
fof(c_0_9,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(distribute,[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)],[difference_defn])])])])])]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk3_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[subset_defn])])])])])])]) ).
fof(c_0_11,negated_conjecture,
! [X8,X8] :
( ( ~ member(X8,esk5_0)
| member(X8,esk6_0)
| member(X8,esk4_0) )
& ( ~ member(X8,esk6_0)
| member(X8,esk5_0)
| member(X8,esk4_0) )
& ( ~ member(X8,esk5_0)
| ~ member(X8,esk6_0)
| ~ member(X8,esk4_0) )
& ( member(X8,esk5_0)
| member(X8,esk6_0)
| ~ member(X8,esk4_0) )
& esk4_0 != symmetric_difference(esk5_0,esk6_0) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])])])]) ).
cnf(c_0_12,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( member(X1,esk4_0)
| member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk3_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( subset(X1,esk4_0)
| member(esk3_2(X1,esk4_0),esk6_0)
| ~ member(esk3_2(X1,esk4_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( member(X1,esk4_0)
| member(X1,esk5_0)
| ~ member(X1,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( subset(difference(X1,esk6_0),esk4_0)
| ~ member(esk3_2(difference(X1,esk6_0),esk4_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( subset(difference(X1,X2),X3)
| member(esk3_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( subset(X1,esk4_0)
| member(esk3_2(X1,esk4_0),esk5_0)
| ~ member(esk3_2(X1,esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
fof(c_0_23,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])])]) ).
cnf(c_0_24,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
subset(difference(esk5_0,esk6_0),esk4_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( subset(difference(esk6_0,X1),esk4_0)
| member(esk3_2(difference(esk6_0,X1),esk4_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,difference(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
subset(difference(esk6_0,esk5_0),esk4_0),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_30,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( subset(difference(esk5_0,esk6_0),X1)
| member(esk3_2(difference(esk5_0,esk6_0),X1),esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_32,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,difference(esk6_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
subset(difference(esk5_0,esk6_0),union(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( subset(union(X1,X2),X3)
| member(esk3_2(union(X1,X2),X3),X1)
| member(esk3_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_13]) ).
cnf(c_0_37,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
fof(c_0_38,plain,
! [X3,X4] : union(X3,X4) = union(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_39,negated_conjecture,
( subset(difference(esk6_0,esk5_0),X1)
| member(esk3_2(difference(esk6_0,esk5_0),X1),esk4_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_40,negated_conjecture,
( member(X1,union(esk4_0,X2))
| ~ member(X1,difference(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
fof(c_0_41,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])])]) ).
cnf(c_0_42,plain,
( subset(union(X1,X1),X2)
| member(esk3_2(union(X1,X1),X2),X1) ),
inference(ef,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_13]) ).
cnf(c_0_44,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
subset(difference(esk6_0,esk5_0),union(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( subset(X1,union(esk4_0,X2))
| ~ member(esk3_2(X1,union(esk4_0,X2)),difference(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_40]) ).
cnf(c_0_47,plain,
( subset(union(X1,X2),union(X2,X3))
| member(esk3_2(union(X1,X2),union(X2,X3)),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_48,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
subset(union(X1,X1),X1),
inference(spm,[status(thm)],[c_0_14,c_0_42]) ).
cnf(c_0_50,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( member(X1,union(esk4_0,X2))
| ~ member(X1,difference(esk6_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
subset(union(esk4_0,difference(esk5_0,esk6_0)),union(esk4_0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44]) ).
cnf(c_0_53,plain,
union(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
( subset(X1,union(esk4_0,X2))
| ~ member(esk3_2(X1,union(esk4_0,X2)),difference(esk6_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_51]) ).
cnf(c_0_55,plain,
( subset(union(X1,X2),union(X3,X2))
| member(esk3_2(union(X1,X2),union(X3,X2)),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_56,negated_conjecture,
subset(union(esk4_0,difference(esk5_0,esk6_0)),esk4_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
subset(union(difference(esk6_0,esk5_0),X1),union(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
union(esk4_0,difference(esk5_0,esk6_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_56]),c_0_50])]) ).
fof(c_0_59,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ member(X6,X4)
| member(X6,X5)
| X4 != X5 )
& ( ~ member(X6,X5)
| member(X6,X4)
| X4 != X5 )
& ( ~ member(esk2_2(X4,X5),X4)
| ~ member(esk2_2(X4,X5),X5)
| X4 = X5 )
& ( member(esk2_2(X4,X5),X4)
| member(esk2_2(X4,X5),X5)
| X4 = X5 ) ),
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)],[equal_member_defn])])])])])])]) ).
fof(c_0_60,plain,
! [X3,X4] : symmetric_difference(X3,X4) = union(difference(X3,X4),difference(X4,X3)),
inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).
cnf(c_0_61,negated_conjecture,
subset(union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0)),esk4_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_44]) ).
cnf(c_0_62,negated_conjecture,
( member(X1,esk6_0)
| member(X1,esk5_0)
| ~ member(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_63,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_64,negated_conjecture,
esk4_0 != symmetric_difference(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_65,plain,
symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_66,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_67,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_24,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( esk4_0 = X1
| member(esk2_2(esk4_0,X1),esk5_0)
| member(esk2_2(esk4_0,X1),esk6_0)
| member(esk2_2(esk4_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
esk4_0 != union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0)),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
( X1 = union(X2,X3)
| ~ member(esk2_2(X1,union(X2,X3)),X1)
| ~ member(esk2_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_66,c_0_33]) ).
cnf(c_0_71,negated_conjecture,
( member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),esk5_0)
| member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),esk4_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_19]) ).
cnf(c_0_72,negated_conjecture,
~ member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),difference(esk6_0,esk5_0)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_69]),c_0_12]) ).
cnf(c_0_73,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_74,plain,
( X1 = union(X2,X3)
| member(esk2_2(X1,union(X2,X3)),X1)
| member(esk2_2(X1,union(X2,X3)),X2)
| member(esk2_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_63]) ).
cnf(c_0_75,negated_conjecture,
( member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),esk5_0)
| ~ member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),esk6_0) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,plain,
( X1 = union(X2,X3)
| ~ member(esk2_2(X1,union(X2,X3)),X1)
| ~ member(esk2_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_27]) ).
cnf(c_0_77,negated_conjecture,
member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),esk4_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_74]),c_0_69]),c_0_28]) ).
cnf(c_0_78,negated_conjecture,
( ~ member(X1,esk4_0)
| ~ member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_79,negated_conjecture,
member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_71]),c_0_75]) ).
cnf(c_0_80,negated_conjecture,
~ member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),difference(esk5_0,esk6_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_69]) ).
cnf(c_0_81,negated_conjecture,
~ member(esk2_2(esk4_0,union(difference(esk5_0,esk6_0),difference(esk6_0,esk5_0))),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_77]),c_0_79])]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_73]),c_0_79])]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SET582+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.09 % Command : run_ET %s %d
% 0.09/0.29 % Computer : n012.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jul 11 08:22:58 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.17/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.36 # Preprocessing time : 0.014 s
% 0.17/1.36
% 0.17/1.36 # Failure: Out of unprocessed clauses!
% 0.17/1.36 # OLD status GaveUp
% 0.17/1.36 # Parsed axioms : 11
% 0.17/1.36 # Removed by relevancy pruning/SinE : 7
% 0.17/1.36 # Initial clauses : 12
% 0.17/1.36 # Removed in clause preprocessing : 2
% 0.17/1.36 # Initial clauses in saturation : 10
% 0.17/1.36 # Processed clauses : 40
% 0.17/1.36 # ...of these trivial : 0
% 0.17/1.36 # ...subsumed : 8
% 0.17/1.36 # ...remaining for further processing : 32
% 0.17/1.36 # Other redundant clauses eliminated : 0
% 0.17/1.36 # Clauses deleted for lack of memory : 0
% 0.17/1.36 # Backward-subsumed : 6
% 0.17/1.36 # Backward-rewritten : 0
% 0.17/1.36 # Generated clauses : 57
% 0.17/1.36 # ...of the previous two non-trivial : 32
% 0.17/1.36 # Contextual simplify-reflections : 8
% 0.17/1.36 # Paramodulations : 45
% 0.17/1.36 # Factorizations : 12
% 0.17/1.36 # Equation resolutions : 0
% 0.17/1.36 # Current number of processed clauses : 26
% 0.17/1.36 # Positive orientable unit clauses : 0
% 0.17/1.36 # Positive unorientable unit clauses: 1
% 0.17/1.36 # Negative unit clauses : 1
% 0.17/1.36 # Non-unit-clauses : 24
% 0.17/1.36 # Current number of unprocessed clauses: 0
% 0.17/1.36 # ...number of literals in the above : 0
% 0.17/1.36 # Current number of archived formulas : 0
% 0.17/1.36 # Current number of archived clauses : 6
% 0.17/1.36 # Clause-clause subsumption calls (NU) : 189
% 0.17/1.36 # Rec. Clause-clause subsumption calls : 64
% 0.17/1.36 # Non-unit clause-clause subsumptions : 22
% 0.17/1.36 # Unit Clause-clause subsumption calls : 0
% 0.17/1.36 # Rewrite failures with RHS unbound : 0
% 0.17/1.36 # BW rewrite match attempts : 2
% 0.17/1.36 # BW rewrite match successes : 2
% 0.17/1.36 # Condensation attempts : 0
% 0.17/1.36 # Condensation successes : 0
% 0.17/1.36 # Termbank termtop insertions : 2133
% 0.17/1.36
% 0.17/1.36 # -------------------------------------------------
% 0.17/1.36 # User time : 0.017 s
% 0.17/1.36 # System time : 0.000 s
% 0.17/1.36 # Total time : 0.017 s
% 0.17/1.36 # Maximum resident set size: 2776 pages
% 0.17/1.36 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.17/1.36 # Preprocessing time : 0.015 s
% 0.17/1.36
% 0.17/1.36 # Proof found!
% 0.17/1.36 # SZS status Theorem
% 0.17/1.36 # SZS output start CNFRefutation
% See solution above
% 0.17/1.36 # Proof object total steps : 83
% 0.17/1.36 # Proof object clause steps : 66
% 0.17/1.36 # Proof object formula steps : 17
% 0.17/1.36 # Proof object conjectures : 40
% 0.17/1.36 # Proof object clause conjectures : 37
% 0.17/1.36 # Proof object formula conjectures : 3
% 0.17/1.36 # Proof object initial clauses used : 19
% 0.17/1.36 # Proof object initial formulas used : 8
% 0.17/1.36 # Proof object generating inferences : 46
% 0.17/1.36 # Proof object simplifying inferences : 20
% 0.17/1.36 # Training examples: 0 positive, 0 negative
% 0.17/1.36 # Parsed axioms : 11
% 0.17/1.36 # Removed by relevancy pruning/SinE : 0
% 0.17/1.36 # Initial clauses : 27
% 0.17/1.36 # Removed in clause preprocessing : 3
% 0.17/1.36 # Initial clauses in saturation : 24
% 0.17/1.36 # Processed clauses : 4781
% 0.17/1.36 # ...of these trivial : 252
% 0.17/1.36 # ...subsumed : 3241
% 0.17/1.36 # ...remaining for further processing : 1288
% 0.17/1.36 # Other redundant clauses eliminated : 2
% 0.17/1.36 # Clauses deleted for lack of memory : 0
% 0.17/1.36 # Backward-subsumed : 115
% 0.17/1.36 # Backward-rewritten : 257
% 0.17/1.36 # Generated clauses : 42972
% 0.17/1.36 # ...of the previous two non-trivial : 37497
% 0.17/1.36 # Contextual simplify-reflections : 982
% 0.17/1.36 # Paramodulations : 42614
% 0.17/1.36 # Factorizations : 356
% 0.17/1.36 # Equation resolutions : 2
% 0.17/1.36 # Current number of processed clauses : 914
% 0.17/1.36 # Positive orientable unit clauses : 172
% 0.17/1.36 # Positive unorientable unit clauses: 6
% 0.17/1.36 # Negative unit clauses : 12
% 0.17/1.36 # Non-unit-clauses : 724
% 0.17/1.36 # Current number of unprocessed clauses: 26140
% 0.17/1.36 # ...number of literals in the above : 87306
% 0.17/1.36 # Current number of archived formulas : 0
% 0.17/1.36 # Current number of archived clauses : 373
% 0.17/1.36 # Clause-clause subsumption calls (NU) : 157034
% 0.17/1.36 # Rec. Clause-clause subsumption calls : 106685
% 0.17/1.36 # Non-unit clause-clause subsumptions : 3232
% 0.17/1.36 # Unit Clause-clause subsumption calls : 10781
% 0.17/1.36 # Rewrite failures with RHS unbound : 102
% 0.17/1.36 # BW rewrite match attempts : 1111
% 0.17/1.36 # BW rewrite match successes : 117
% 0.17/1.36 # Condensation attempts : 0
% 0.17/1.36 # Condensation successes : 0
% 0.17/1.36 # Termbank termtop insertions : 783947
% 0.17/1.36
% 0.17/1.36 # -------------------------------------------------
% 0.17/1.36 # User time : 0.546 s
% 0.17/1.36 # System time : 0.013 s
% 0.17/1.36 # Total time : 0.559 s
% 0.17/1.36 # Maximum resident set size: 31288 pages
% 0.17/23.39 eprover: CPU time limit exceeded, terminating
% 0.17/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.41 eprover: No such file or directory
% 0.17/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.41 eprover: No such file or directory
% 0.17/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.42 eprover: No such file or directory
% 0.17/23.42 eprover: CPU time limit exceeded, terminating
% 0.17/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.43 eprover: No such file or directory
% 0.17/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.43 eprover: No such file or directory
% 0.17/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.43 eprover: No such file or directory
% 0.17/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.44 eprover: No such file or directory
% 0.17/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.44 eprover: No such file or directory
% 0.17/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.44 eprover: No such file or directory
% 0.17/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.44 eprover: No such file or directory
% 0.17/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.44 eprover: No such file or directory
% 0.17/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.45 eprover: No such file or directory
% 0.17/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.45 eprover: No such file or directory
% 0.17/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.45 eprover: No such file or directory
% 0.17/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.45 eprover: No such file or directory
% 0.17/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.46 eprover: No such file or directory
% 0.17/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.17/23.46 eprover: No such file or directory
% 0.17/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.46 eprover: No such file or directory
% 0.17/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.17/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------