TSTP Solution File: SET690+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET690+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:20:16 EDT 2023
% Result : Theorem 2.22s 0.76s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 4 unt; 0 def)
% Number of atoms : 170 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 206 ( 95 ~; 93 |; 11 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 5 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI12,conjecture,
! [X1,X2,X6] :
( equal_set(union(intersection(X1,X2),X6),intersection(X1,union(X2,X6)))
<=> subset(X6,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.wPV1ofL2TT/E---3.1_32114.p',thI12) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wPV1ofL2TT/E---3.1_32114.p',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wPV1ofL2TT/E---3.1_32114.p',subset) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wPV1ofL2TT/E---3.1_32114.p',union) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wPV1ofL2TT/E---3.1_32114.p',intersection) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X6] :
( equal_set(union(intersection(X1,X2),X6),intersection(X1,union(X2,X6)))
<=> subset(X6,X1) ),
inference(assume_negation,[status(cth)],[thI12]) ).
fof(c_0_6,negated_conjecture,
( ( ~ equal_set(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(esk6_0,esk4_0) )
& ( equal_set(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0)))
| subset(esk6_0,esk4_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X13,X14] :
( ( subset(X13,X14)
| ~ equal_set(X13,X14) )
& ( subset(X14,X13)
| ~ equal_set(X13,X14) )
& ( ~ subset(X13,X14)
| ~ subset(X14,X13)
| equal_set(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ equal_set(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(esk6_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ member(X9,X7)
| member(X9,X8) )
& ( member(esk1_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ member(esk1_2(X10,X11),X11)
| subset(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])]) ).
fof(c_0_11,plain,
! [X20,X21,X22] :
( ( ~ member(X20,union(X21,X22))
| member(X20,X21)
| member(X20,X22) )
& ( ~ member(X20,X21)
| member(X20,union(X21,X22)) )
& ( ~ member(X20,X22)
| member(X20,union(X21,X22)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ subset(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( equal_set(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0)))
| subset(esk6_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,plain,
! [X17,X18,X19] :
( ( member(X17,X18)
| ~ member(X17,intersection(X18,X19)) )
& ( member(X17,X19)
| ~ member(X17,intersection(X18,X19)) )
& ( ~ member(X17,X18)
| ~ member(X17,X19)
| member(X17,intersection(X18,X19)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])]) ).
cnf(c_0_20,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(union(X4,X3),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( subset(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0)))
| subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_24,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_26,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( member(X1,intersection(esk4_0,union(esk5_0,esk6_0)))
| subset(esk6_0,esk4_0)
| ~ member(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),union(esk5_0,esk6_0))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),union(esk5_0,esk6_0))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_14]) ).
cnf(c_0_32,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk6_0)
| ~ subset(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_14]) ).
cnf(c_0_35,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_36,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk6_0)
| ~ subset(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_31]) ).
cnf(c_0_37,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_39,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,esk5_0))
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,esk5_0))
| ~ subset(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| member(esk1_2(union(intersection(esk4_0,esk5_0),esk6_0),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),intersection(esk4_0,esk5_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_37]) ).
cnf(c_0_50,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),union(esk5_0,esk6_0))
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),esk6_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_15]) ).
cnf(c_0_52,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),esk5_0)
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),esk4_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_53,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),esk5_0)
| ~ subset(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_50]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),esk6_0)),esk4_0)
| ~ subset(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
~ subset(esk6_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ member(esk1_2(esk6_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_55,c_0_13]) ).
cnf(c_0_57,negated_conjecture,
member(esk1_2(esk6_0,esk4_0),esk6_0),
inference(spm,[status(thm)],[c_0_55,c_0_20]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_31]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET690+4 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 17:07:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.wPV1ofL2TT/E---3.1_32114.p
% 2.22/0.76 # Version: 3.1pre001
% 2.22/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.22/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.22/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.22/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.22/0.76 # Starting sh5l with 300s (1) cores
% 2.22/0.76 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32235 completed with status 0
% 2.22/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.22/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.22/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.22/0.76 # No SInE strategy applied
% 2.22/0.76 # Search class: FGHSF-FFMF21-SFFFFFNN
% 2.22/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.22/0.76 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 2.22/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.22/0.76 # Starting new_bool_3 with 136s (1) cores
% 2.22/0.76 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 2.22/0.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S05BI with 136s (1) cores
% 2.22/0.76 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with pid 32245 completed with status 0
% 2.22/0.76 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N
% 2.22/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.22/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.22/0.76 # No SInE strategy applied
% 2.22/0.76 # Search class: FGHSF-FFMF21-SFFFFFNN
% 2.22/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.22/0.76 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 2.22/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.22/0.76 # Starting new_bool_3 with 136s (1) cores
% 2.22/0.76 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 2.22/0.76 # Preprocessing time : 0.001 s
% 2.22/0.76 # Presaturation interreduction done
% 2.22/0.76
% 2.22/0.76 # Proof found!
% 2.22/0.76 # SZS status Theorem
% 2.22/0.76 # SZS output start CNFRefutation
% See solution above
% 2.22/0.76 # Parsed axioms : 12
% 2.22/0.76 # Removed by relevancy pruning/SinE : 0
% 2.22/0.76 # Initial clauses : 31
% 2.22/0.76 # Removed in clause preprocessing : 0
% 2.22/0.76 # Initial clauses in saturation : 31
% 2.22/0.76 # Processed clauses : 998
% 2.22/0.76 # ...of these trivial : 20
% 2.22/0.76 # ...subsumed : 345
% 2.22/0.76 # ...remaining for further processing : 633
% 2.22/0.76 # Other redundant clauses eliminated : 5
% 2.22/0.76 # Clauses deleted for lack of memory : 0
% 2.22/0.76 # Backward-subsumed : 40
% 2.22/0.76 # Backward-rewritten : 3
% 2.22/0.76 # Generated clauses : 14231
% 2.22/0.76 # ...of the previous two non-redundant : 7680
% 2.22/0.76 # ...aggressively subsumed : 0
% 2.22/0.76 # Contextual simplify-reflections : 22
% 2.22/0.76 # Paramodulations : 14199
% 2.22/0.76 # Factorizations : 18
% 2.22/0.76 # NegExts : 0
% 2.22/0.76 # Equation resolutions : 5
% 2.22/0.76 # Total rewrite steps : 6556
% 2.22/0.76 # Propositional unsat checks : 0
% 2.22/0.76 # Propositional check models : 0
% 2.22/0.76 # Propositional check unsatisfiable : 0
% 2.22/0.76 # Propositional clauses : 0
% 2.22/0.76 # Propositional clauses after purity: 0
% 2.22/0.76 # Propositional unsat core size : 0
% 2.22/0.76 # Propositional preprocessing time : 0.000
% 2.22/0.76 # Propositional encoding time : 0.000
% 2.22/0.76 # Propositional solver time : 0.000
% 2.22/0.76 # Success case prop preproc time : 0.000
% 2.22/0.76 # Success case prop encoding time : 0.000
% 2.22/0.76 # Success case prop solver time : 0.000
% 2.22/0.76 # Current number of processed clauses : 547
% 2.22/0.76 # Positive orientable unit clauses : 155
% 2.22/0.76 # Positive unorientable unit clauses: 0
% 2.22/0.76 # Negative unit clauses : 3
% 2.22/0.76 # Non-unit-clauses : 389
% 2.22/0.76 # Current number of unprocessed clauses: 6739
% 2.22/0.76 # ...number of literals in the above : 15130
% 2.22/0.76 # Current number of archived formulas : 0
% 2.22/0.76 # Current number of archived clauses : 83
% 2.22/0.76 # Clause-clause subsumption calls (NU) : 103650
% 2.22/0.76 # Rec. Clause-clause subsumption calls : 72767
% 2.22/0.76 # Non-unit clause-clause subsumptions : 373
% 2.22/0.76 # Unit Clause-clause subsumption calls : 14664
% 2.22/0.76 # Rewrite failures with RHS unbound : 0
% 2.22/0.76 # BW rewrite match attempts : 357
% 2.22/0.76 # BW rewrite match successes : 1
% 2.22/0.76 # Condensation attempts : 0
% 2.22/0.76 # Condensation successes : 0
% 2.22/0.76 # Termbank termtop insertions : 180460
% 2.22/0.76
% 2.22/0.76 # -------------------------------------------------
% 2.22/0.76 # User time : 0.223 s
% 2.22/0.76 # System time : 0.011 s
% 2.22/0.76 # Total time : 0.233 s
% 2.22/0.76 # Maximum resident set size: 1776 pages
% 2.22/0.76
% 2.22/0.76 # -------------------------------------------------
% 2.22/0.76 # User time : 1.100 s
% 2.22/0.76 # System time : 0.047 s
% 2.22/0.76 # Total time : 1.147 s
% 2.22/0.76 # Maximum resident set size: 1688 pages
% 2.22/0.76 % E---3.1 exiting
% 2.22/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------