TSTP Solution File: SET986+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET986+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:21:27 EDT 2023
% Result : Theorem 313.98s 40.70s
% Output : CNFRefutation 313.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 72 ( 12 unt; 0 def)
% Number of atoms : 227 ( 68 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 239 ( 84 ~; 117 |; 24 &)
% ( 11 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 183 ( 10 sgn; 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',d1_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',d3_tarski) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',d4_xboole_0) ).
fof(t140_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> set_union2(set_difference(X2,singleton(X1)),singleton(X1)) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',t140_zfmisc_1) ).
fof(t64_zfmisc_1,axiom,
! [X1,X2,X3] :
( in(X1,set_difference(X2,singleton(X3)))
<=> ( in(X1,X2)
& X1 != X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',t64_zfmisc_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',d2_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',commutativity_k2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p',d10_xboole_0) ).
fof(c_0_8,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ in(X13,X12)
| X13 = X11
| X12 != singleton(X11) )
& ( X14 != X11
| in(X14,X12)
| X12 != singleton(X11) )
& ( ~ in(esk1_2(X15,X16),X16)
| esk1_2(X15,X16) != X15
| X16 = singleton(X15) )
& ( in(esk1_2(X15,X16),X16)
| esk1_2(X15,X16) = X15
| X16 = singleton(X15) ) ),
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)],[d1_tarski])])])])])]) ).
cnf(c_0_9,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X27,X28,X29,X30,X31] :
( ( ~ subset(X27,X28)
| ~ in(X29,X27)
| in(X29,X28) )
& ( in(esk3_2(X30,X31),X30)
| subset(X30,X31) )
& ( ~ in(esk3_2(X30,X31),X31)
| subset(X30,X31) ) ),
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)],[d3_tarski])])])])])]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( esk3_2(singleton(X1),X2) = X1
| subset(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X33,X34,X35,X36,X37,X38,X39,X40] :
( ( in(X36,X33)
| ~ in(X36,X35)
| X35 != set_difference(X33,X34) )
& ( ~ in(X36,X34)
| ~ in(X36,X35)
| X35 != set_difference(X33,X34) )
& ( ~ in(X37,X33)
| in(X37,X34)
| in(X37,X35)
| X35 != set_difference(X33,X34) )
& ( ~ in(esk4_3(X38,X39,X40),X40)
| ~ in(esk4_3(X38,X39,X40),X38)
| in(esk4_3(X38,X39,X40),X39)
| X40 = set_difference(X38,X39) )
& ( in(esk4_3(X38,X39,X40),X38)
| in(esk4_3(X38,X39,X40),X40)
| X40 = set_difference(X38,X39) )
& ( ~ in(esk4_3(X38,X39,X40),X39)
| in(esk4_3(X38,X39,X40),X40)
| X40 = set_difference(X38,X39) ) ),
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)],[c_0_13])])])])])]) ).
cnf(c_0_17,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( in(esk4_3(X1,X2,X3),X1)
| in(esk4_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> set_union2(set_difference(X2,singleton(X1)),singleton(X1)) = X2 ),
inference(assume_negation,[status(cth)],[t140_zfmisc_1]) ).
cnf(c_0_21,plain,
( in(X1,X2)
| ~ in(X1,singleton(X3))
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( set_difference(X1,X2) = X1
| in(esk4_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_19]) ).
fof(c_0_23,negated_conjecture,
( in(esk7_0,esk8_0)
& set_union2(set_difference(esk8_0,singleton(esk7_0)),singleton(esk7_0)) != esk8_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_24,plain,
( in(esk4_3(X1,X2,X3),X2)
| X3 = set_difference(X1,X2)
| ~ in(esk4_3(X1,X2,X3),X3)
| ~ in(esk4_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X52,X53,X54] :
( ( in(X52,X53)
| ~ in(X52,set_difference(X53,singleton(X54))) )
& ( X52 != X54
| ~ in(X52,set_difference(X53,singleton(X54))) )
& ( ~ in(X52,X53)
| X52 = X54
| in(X52,set_difference(X53,singleton(X54))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t64_zfmisc_1])])]) ).
cnf(c_0_26,plain,
( set_difference(singleton(X1),X2) = singleton(X1)
| in(esk4_3(singleton(X1),X2,singleton(X1)),X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
in(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( set_difference(X1,X2) = X1
| in(esk4_3(X1,X2,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_22]) ).
fof(c_0_29,plain,
! [X18,X19,X20,X21,X22,X23,X24,X25] :
( ( ~ in(X21,X20)
| in(X21,X18)
| in(X21,X19)
| X20 != set_union2(X18,X19) )
& ( ~ in(X22,X18)
| in(X22,X20)
| X20 != set_union2(X18,X19) )
& ( ~ in(X22,X19)
| in(X22,X20)
| X20 != set_union2(X18,X19) )
& ( ~ in(esk2_3(X23,X24,X25),X23)
| ~ in(esk2_3(X23,X24,X25),X25)
| X25 = set_union2(X23,X24) )
& ( ~ in(esk2_3(X23,X24,X25),X24)
| ~ in(esk2_3(X23,X24,X25),X25)
| X25 = set_union2(X23,X24) )
& ( in(esk2_3(X23,X24,X25),X25)
| in(esk2_3(X23,X24,X25),X23)
| in(esk2_3(X23,X24,X25),X24)
| X25 = set_union2(X23,X24) ) ),
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)],[d2_xboole_0])])])])])]) ).
cnf(c_0_30,plain,
( X1 != X2
| ~ in(X1,set_difference(X3,singleton(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( set_difference(singleton(esk7_0),X1) = singleton(esk7_0)
| in(esk4_3(singleton(esk7_0),X1,singleton(esk7_0)),esk8_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( esk4_3(X1,singleton(X2),X1) = X2
| set_difference(X1,singleton(X2)) = X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_28]) ).
cnf(c_0_33,plain,
( in(esk2_3(X1,X2,X3),X3)
| in(esk2_3(X1,X2,X3),X1)
| in(esk2_3(X1,X2,X3),X2)
| X3 = set_union2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
~ in(X1,set_difference(X2,singleton(X1))),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( set_difference(singleton(esk7_0),singleton(X1)) = singleton(esk7_0)
| in(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( X3 = set_union2(X1,X2)
| ~ in(esk2_3(X1,X2,X3),X2)
| ~ in(esk2_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
( set_union2(X1,X2) = X2
| in(esk2_3(X1,X2,X2),X1)
| in(esk2_3(X1,X2,X2),X2) ),
inference(ef,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,singleton(esk7_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( set_union2(X1,X2) = X2
| in(esk2_3(X1,X2,X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
fof(c_0_40,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_41,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,negated_conjecture,
( set_union2(singleton(esk7_0),X1) = X1
| in(esk2_3(singleton(esk7_0),X1,X1),esk8_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_46,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( set_union2(esk8_0,singleton(esk7_0)) = esk8_0
| ~ in(esk2_3(singleton(esk7_0),esk8_0,esk8_0),esk8_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_43]),c_0_44]) ).
cnf(c_0_49,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( subset(set_union2(X1,X2),X3)
| in(esk3_2(set_union2(X1,X2),X3),X2)
| in(esk3_2(set_union2(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_12]) ).
cnf(c_0_51,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
set_union2(esk8_0,singleton(esk7_0)) = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_43]),c_0_44])]) ).
cnf(c_0_53,plain,
( subset(set_union2(set_difference(X1,X2),X3),X4)
| in(esk3_2(set_union2(set_difference(X1,X2),X3),X4),X3)
| in(esk3_2(set_union2(set_difference(X1,X2),X3),X4),X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_55,negated_conjecture,
( subset(X1,esk8_0)
| ~ in(esk3_2(X1,esk8_0),singleton(esk7_0)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( subset(set_union2(set_difference(X1,X2),X3),X1)
| in(esk3_2(set_union2(set_difference(X1,X2),X3),X1),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_53]) ).
cnf(c_0_57,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_58,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_54]) ).
fof(c_0_59,plain,
! [X9,X10] :
( ( subset(X9,X10)
| X9 != X10 )
& ( subset(X10,X9)
| X9 != X10 )
& ( ~ subset(X9,X10)
| ~ subset(X10,X9)
| X9 = X10 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_60,negated_conjecture,
subset(set_union2(set_difference(esk8_0,X1),singleton(esk7_0)),esk8_0),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_62,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),set_difference(X1,X3))
| in(esk3_2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_58,c_0_12]) ).
cnf(c_0_63,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_64,negated_conjecture,
subset(set_union2(singleton(esk7_0),set_difference(esk8_0,X1)),esk8_0),
inference(spm,[status(thm)],[c_0_60,c_0_44]) ).
cnf(c_0_65,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_61]) ).
cnf(c_0_66,plain,
( subset(X1,set_union2(X2,set_difference(X1,X3)))
| in(esk3_2(X1,set_union2(X2,set_difference(X1,X3))),X3) ),
inference(spm,[status(thm)],[c_0_51,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
set_union2(set_difference(esk8_0,singleton(esk7_0)),singleton(esk7_0)) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_68,negated_conjecture,
( set_union2(singleton(esk7_0),set_difference(esk8_0,X1)) = esk8_0
| ~ subset(esk8_0,set_union2(singleton(esk7_0),set_difference(esk8_0,X1))) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,plain,
subset(X1,set_union2(X2,set_difference(X1,X2))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
set_union2(singleton(esk7_0),set_difference(esk8_0,singleton(esk7_0))) != esk8_0,
inference(rw,[status(thm)],[c_0_67,c_0_44]) ).
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.06/0.11 % Problem : SET986+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 16:33:49 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.uRxG9YPxG1/E---3.1_16184.p
% 313.98/40.70 # Version: 3.1pre001
% 313.98/40.70 # Preprocessing class: FSMSSMSSSSSNFFN.
% 313.98/40.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 313.98/40.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 313.98/40.70 # Starting new_bool_3 with 300s (1) cores
% 313.98/40.70 # Starting new_bool_1 with 300s (1) cores
% 313.98/40.70 # Starting sh5l with 300s (1) cores
% 313.98/40.70 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16290 completed with status 0
% 313.98/40.70 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 313.98/40.70 # Preprocessing class: FSMSSMSSSSSNFFN.
% 313.98/40.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 313.98/40.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 313.98/40.70 # No SInE strategy applied
% 313.98/40.70 # Search class: FGHSS-FFMF32-MFFFFFNN
% 313.98/40.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 313.98/40.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 313.98/40.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 313.98/40.70 # Starting new_bool_3 with 136s (1) cores
% 313.98/40.70 # Starting new_bool_1 with 136s (1) cores
% 313.98/40.70 # Starting sh5l with 136s (1) cores
% 313.98/40.70 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 16296 completed with status 0
% 313.98/40.70 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 313.98/40.70 # Preprocessing class: FSMSSMSSSSSNFFN.
% 313.98/40.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 313.98/40.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 313.98/40.70 # No SInE strategy applied
% 313.98/40.70 # Search class: FGHSS-FFMF32-MFFFFFNN
% 313.98/40.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 313.98/40.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 313.98/40.70 # Preprocessing time : 0.001 s
% 313.98/40.70 # Presaturation interreduction done
% 313.98/40.70
% 313.98/40.70 # Proof found!
% 313.98/40.70 # SZS status Theorem
% 313.98/40.70 # SZS output start CNFRefutation
% See solution above
% 313.98/40.70 # Parsed axioms : 15
% 313.98/40.70 # Removed by relevancy pruning/SinE : 0
% 313.98/40.70 # Initial clauses : 35
% 313.98/40.70 # Removed in clause preprocessing : 0
% 313.98/40.70 # Initial clauses in saturation : 35
% 313.98/40.70 # Processed clauses : 38524
% 313.98/40.70 # ...of these trivial : 655
% 313.98/40.70 # ...subsumed : 33833
% 313.98/40.70 # ...remaining for further processing : 4036
% 313.98/40.70 # Other redundant clauses eliminated : 422
% 313.98/40.70 # Clauses deleted for lack of memory : 0
% 313.98/40.70 # Backward-subsumed : 208
% 313.98/40.70 # Backward-rewritten : 33
% 313.98/40.70 # Generated clauses : 1539645
% 313.98/40.70 # ...of the previous two non-redundant : 1500944
% 313.98/40.70 # ...aggressively subsumed : 0
% 313.98/40.70 # Contextual simplify-reflections : 13
% 313.98/40.70 # Paramodulations : 1534137
% 313.98/40.70 # Factorizations : 5087
% 313.98/40.70 # NegExts : 0
% 313.98/40.70 # Equation resolutions : 422
% 313.98/40.70 # Total rewrite steps : 155088
% 313.98/40.70 # Propositional unsat checks : 0
% 313.98/40.70 # Propositional check models : 0
% 313.98/40.70 # Propositional check unsatisfiable : 0
% 313.98/40.70 # Propositional clauses : 0
% 313.98/40.70 # Propositional clauses after purity: 0
% 313.98/40.70 # Propositional unsat core size : 0
% 313.98/40.70 # Propositional preprocessing time : 0.000
% 313.98/40.70 # Propositional encoding time : 0.000
% 313.98/40.70 # Propositional solver time : 0.000
% 313.98/40.70 # Success case prop preproc time : 0.000
% 313.98/40.70 # Success case prop encoding time : 0.000
% 313.98/40.70 # Success case prop solver time : 0.000
% 313.98/40.70 # Current number of processed clauses : 3752
% 313.98/40.70 # Positive orientable unit clauses : 217
% 313.98/40.70 # Positive unorientable unit clauses: 9
% 313.98/40.70 # Negative unit clauses : 435
% 313.98/40.70 # Non-unit-clauses : 3091
% 313.98/40.70 # Current number of unprocessed clauses: 1459516
% 313.98/40.70 # ...number of literals in the above : 8384075
% 313.98/40.70 # Current number of archived formulas : 0
% 313.98/40.70 # Current number of archived clauses : 273
% 313.98/40.70 # Clause-clause subsumption calls (NU) : 3415402
% 313.98/40.70 # Rec. Clause-clause subsumption calls : 749263
% 313.98/40.70 # Non-unit clause-clause subsumptions : 14439
% 313.98/40.70 # Unit Clause-clause subsumption calls : 137075
% 313.98/40.70 # Rewrite failures with RHS unbound : 0
% 313.98/40.70 # BW rewrite match attempts : 3026
% 313.98/40.70 # BW rewrite match successes : 79
% 313.98/40.70 # Condensation attempts : 0
% 313.98/40.70 # Condensation successes : 0
% 313.98/40.70 # Termbank termtop insertions : 40521575
% 313.98/40.70
% 313.98/40.70 # -------------------------------------------------
% 313.98/40.70 # User time : 38.456 s
% 313.98/40.70 # System time : 0.989 s
% 313.98/40.70 # Total time : 39.445 s
% 313.98/40.70 # Maximum resident set size: 1776 pages
% 313.98/40.70
% 313.98/40.70 # -------------------------------------------------
% 313.98/40.70 # User time : 195.514 s
% 313.98/40.70 # System time : 2.046 s
% 313.98/40.70 # Total time : 197.560 s
% 313.98/40.70 # Maximum resident set size: 1688 pages
% 313.98/40.70 % E---3.1 exiting
% 313.98/40.70 % E---3.1 exiting
%------------------------------------------------------------------------------