TSTP Solution File: SET703+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET703+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:18 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 66 ( 12 unt; 0 def)
% Number of atoms : 165 ( 48 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 164 ( 65 ~; 81 |; 11 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 6 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI41,conjecture,
! [X1,X2] : equal_set(union(singleton(X1),singleton(X2)),unordered_pair(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.6oQYPq0z9r/E---3.1_3321.p',thI41) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6oQYPq0z9r/E---3.1_3321.p',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6oQYPq0z9r/E---3.1_3321.p',subset) ).
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6oQYPq0z9r/E---3.1_3321.p',power_set) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6oQYPq0z9r/E---3.1_3321.p',union) ).
fof(singleton,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.6oQYPq0z9r/E---3.1_3321.p',singleton) ).
fof(unordered_pair,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.6oQYPq0z9r/E---3.1_3321.p',unordered_pair) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] : equal_set(union(singleton(X1),singleton(X2)),unordered_pair(X1,X2)),
inference(assume_negation,[status(cth)],[thI41]) ).
fof(c_0_8,negated_conjecture,
~ equal_set(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X12,X13] :
( ( subset(X12,X13)
| ~ equal_set(X12,X13) )
& ( subset(X13,X12)
| ~ equal_set(X12,X13) )
& ( ~ subset(X12,X13)
| ~ subset(X13,X12)
| equal_set(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_10,negated_conjecture,
~ equal_set(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ member(X8,X6)
| member(X8,X7) )
& ( member(esk1_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ member(esk1_2(X9,X10),X10)
| subset(X9,X10) ) ),
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])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0)))
| ~ subset(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X14,X15] :
( ( ~ member(X14,power_set(X15))
| subset(X14,X15) )
& ( ~ subset(X14,X15)
| member(X14,power_set(X15)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])]) ).
fof(c_0_16,plain,
! [X19,X20,X21] :
( ( ~ member(X19,union(X20,X21))
| member(X19,X20)
| member(X19,X21) )
& ( ~ member(X19,X20)
| member(X19,union(X20,X21)) )
& ( ~ member(X19,X21)
| member(X19,union(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).
cnf(c_0_17,negated_conjecture,
( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),union(singleton(esk4_0),singleton(esk5_0)))
| ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X26,X27] :
( ( ~ member(X26,singleton(X27))
| X26 = X27 )
& ( X26 != X27
| member(X26,singleton(X27)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])]) ).
cnf(c_0_20,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),union(singleton(esk4_0),singleton(esk5_0)))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk4_0))
| member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk5_0))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X28,X29,X30] :
( ( ~ member(X28,unordered_pair(X29,X30))
| X28 = X29
| X28 = X30 )
& ( X28 != X29
| member(X28,unordered_pair(X29,X30)) )
& ( X28 != X30
| member(X28,unordered_pair(X29,X30)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair])])]) ).
cnf(c_0_25,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk4_0))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( member(esk1_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
| ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_32,plain,
( esk1_2(unordered_pair(X1,X2),X3) = X1
| esk1_2(unordered_pair(X1,X2),X3) = X2
| member(unordered_pair(X1,X2),power_set(X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( member(X1,unordered_pair(X3,X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
| ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
inference(spm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_35,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
member(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_32]) ).
cnf(c_0_39,plain,
member(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_40,plain,
( member(X1,power_set(X2))
| ~ member(esk1_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_41,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_38]),c_0_39])]),c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0))))
| ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),union(singleton(esk4_0),singleton(esk5_0)))
| ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_45,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_31,c_0_42]) ).
cnf(c_0_46,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_47,plain,
member(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
| ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_44,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_50,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36])]) ).
cnf(c_0_51,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_46]),c_0_47])]) ).
cnf(c_0_52,negated_conjecture,
( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
| ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_51]),c_0_39])]) ).
cnf(c_0_53,negated_conjecture,
esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_46]),c_0_47])]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0)))
| ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_55,negated_conjecture,
( member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0))))
| ~ member(esk4_0,union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_40,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),union(singleton(esk4_0),singleton(esk5_0)))
| ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_54,c_0_26]) ).
cnf(c_0_57,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_58,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| ~ member(esk4_0,union(singleton(esk4_0),singleton(esk5_0))) ),
inference(spm,[status(thm)],[c_0_31,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),singleton(esk4_0))
| ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
| ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),singleton(esk4_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_47])]) ).
cnf(c_0_62,negated_conjecture,
~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_53]),c_0_47])]) ).
cnf(c_0_63,negated_conjecture,
~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_53]),c_0_47])]) ).
cnf(c_0_64,negated_conjecture,
esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_61]),c_0_36])]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET703+4 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:22:51 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.6oQYPq0z9r/E---3.1_3321.p
% 0.20/0.60 # Version: 3.1pre001
% 0.20/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.60 # Starting sh5l with 300s (1) cores
% 0.20/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3439 completed with status 0
% 0.20/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.60 # No SInE strategy applied
% 0.20/0.60 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.20/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.60 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 0.20/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.60 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.60 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 0.20/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S05BI with 136s (1) cores
% 0.20/0.60 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 3450 completed with status 0
% 0.20/0.60 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.20/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.60 # No SInE strategy applied
% 0.20/0.60 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.20/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.60 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 811s (1) cores
% 0.20/0.60 # Preprocessing time : 0.001 s
% 0.20/0.60 # Presaturation interreduction done
% 0.20/0.60
% 0.20/0.60 # Proof found!
% 0.20/0.60 # SZS status Theorem
% 0.20/0.60 # SZS output start CNFRefutation
% See solution above
% 0.20/0.60 # Parsed axioms : 12
% 0.20/0.60 # Removed by relevancy pruning/SinE : 0
% 0.20/0.60 # Initial clauses : 30
% 0.20/0.60 # Removed in clause preprocessing : 0
% 0.20/0.60 # Initial clauses in saturation : 30
% 0.20/0.60 # Processed clauses : 370
% 0.20/0.60 # ...of these trivial : 14
% 0.20/0.60 # ...subsumed : 41
% 0.20/0.60 # ...remaining for further processing : 315
% 0.20/0.60 # Other redundant clauses eliminated : 3
% 0.20/0.60 # Clauses deleted for lack of memory : 0
% 0.20/0.60 # Backward-subsumed : 24
% 0.20/0.60 # Backward-rewritten : 26
% 0.20/0.60 # Generated clauses : 4624
% 0.20/0.60 # ...of the previous two non-redundant : 4517
% 0.20/0.60 # ...aggressively subsumed : 0
% 0.20/0.60 # Contextual simplify-reflections : 4
% 0.20/0.60 # Paramodulations : 4611
% 0.20/0.60 # Factorizations : 10
% 0.20/0.60 # NegExts : 0
% 0.20/0.60 # Equation resolutions : 3
% 0.20/0.60 # Total rewrite steps : 195
% 0.20/0.60 # Propositional unsat checks : 0
% 0.20/0.60 # Propositional check models : 0
% 0.20/0.60 # Propositional check unsatisfiable : 0
% 0.20/0.60 # Propositional clauses : 0
% 0.20/0.60 # Propositional clauses after purity: 0
% 0.20/0.60 # Propositional unsat core size : 0
% 0.20/0.60 # Propositional preprocessing time : 0.000
% 0.20/0.60 # Propositional encoding time : 0.000
% 0.20/0.60 # Propositional solver time : 0.000
% 0.20/0.60 # Success case prop preproc time : 0.000
% 0.20/0.60 # Success case prop encoding time : 0.000
% 0.20/0.60 # Success case prop solver time : 0.000
% 0.20/0.60 # Current number of processed clauses : 232
% 0.20/0.60 # Positive orientable unit clauses : 60
% 0.20/0.60 # Positive unorientable unit clauses: 0
% 0.20/0.60 # Negative unit clauses : 4
% 0.20/0.60 # Non-unit-clauses : 168
% 0.20/0.60 # Current number of unprocessed clauses: 4108
% 0.20/0.60 # ...number of literals in the above : 7915
% 0.20/0.60 # Current number of archived formulas : 0
% 0.20/0.60 # Current number of archived clauses : 80
% 0.20/0.60 # Clause-clause subsumption calls (NU) : 14316
% 0.20/0.60 # Rec. Clause-clause subsumption calls : 11637
% 0.20/0.60 # Non-unit clause-clause subsumptions : 46
% 0.20/0.60 # Unit Clause-clause subsumption calls : 1590
% 0.20/0.60 # Rewrite failures with RHS unbound : 0
% 0.20/0.60 # BW rewrite match attempts : 142
% 0.20/0.60 # BW rewrite match successes : 5
% 0.20/0.60 # Condensation attempts : 0
% 0.20/0.60 # Condensation successes : 0
% 0.20/0.60 # Termbank termtop insertions : 65455
% 0.20/0.60
% 0.20/0.60 # -------------------------------------------------
% 0.20/0.60 # User time : 0.091 s
% 0.20/0.60 # System time : 0.011 s
% 0.20/0.60 # Total time : 0.102 s
% 0.20/0.60 # Maximum resident set size: 1764 pages
% 0.20/0.60
% 0.20/0.60 # -------------------------------------------------
% 0.20/0.60 # User time : 0.410 s
% 0.20/0.60 # System time : 0.027 s
% 0.20/0.60 # Total time : 0.437 s
% 0.20/0.60 # Maximum resident set size: 1688 pages
% 0.20/0.60 % E---3.1 exiting
% 0.20/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------