%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET986+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:15:54 PM UTC 2026
% Result : Theorem 211.52s 36.28s
% Output : CNFRefutation 211.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 73 ( 12 unt; 0 def)
% Number of atoms : 230 ( 69 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 242 ( 85 ~; 117 |; 25 &)
% ( 12 <=>; 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 : 186 ( 10 sgn 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',t140_zfmisc_1) ).
fof(t64_zfmisc_1,axiom,
! [X1,X2,X3] :
( in(X1,set_difference(X2,singleton(X3)))
<=> ( X1 != X3
& in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t64_zfmisc_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
| in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(c_0_8,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( X16 = singleton(X15)
| esk1_2(X15,X16) = X15
| in(esk1_2(X15,X16),X16) )
& ( X16 = singleton(X15)
| esk1_2(X15,X16) != X15
| ~ in(esk1_2(X15,X16),X16) )
& ( X12 != singleton(X11)
| in(X14,X12)
| X14 != X11 )
& ( X12 != singleton(X11)
| X13 = X11
| ~ in(X13,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X27,X28,X29,X30,X31] :
( ( subset(X30,X31)
| ~ in(esk3_2(X30,X31),X31) )
& ( subset(X30,X31)
| in(esk3_2(X30,X31),X30) )
& ( in(X29,X28)
| ~ in(X29,X27)
| ~ subset(X27,X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
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,X2)
& in(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
cnf(c_0_14,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( subset(singleton(X1),X2)
| esk3_2(singleton(X1),X2) = X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X33,X34,X35,X36,X37,X38,X39,X40] :
( ( X40 = set_difference(X38,X39)
| in(esk4_3(X38,X39,X40),X40)
| ~ in(esk4_3(X38,X39,X40),X39) )
& ( X40 = set_difference(X38,X39)
| in(esk4_3(X38,X39,X40),X40)
| in(esk4_3(X38,X39,X40),X38) )
& ( X40 = set_difference(X38,X39)
| in(esk4_3(X38,X39,X40),X39)
| ~ in(esk4_3(X38,X39,X40),X38)
| ~ in(esk4_3(X38,X39,X40),X40) )
& ( X35 != set_difference(X33,X34)
| in(X37,X35)
| in(X37,X34)
| ~ in(X37,X33) )
& ( X35 != set_difference(X33,X34)
| ~ in(X36,X35)
| ~ in(X36,X34) )
& ( X35 != set_difference(X33,X34)
| ~ in(X36,X35)
| in(X36,X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ in(X1,X2)
| subset(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( 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_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]) ).
fof(c_0_21,plain,
! [X1,X2,X3] :
( in(X1,set_difference(X2,singleton(X3)))
<=> ( X1 != X3
& in(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t64_zfmisc_1]) ).
cnf(c_0_22,plain,
( ~ in(X3,X2)
| ~ in(X1,singleton(X3))
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( in(esk4_3(X1,X2,X1),X1)
| set_difference(X1,X2) = X1 ),
inference(ef,[status(thm)],[c_0_19]) ).
fof(c_0_24,negated_conjecture,
( set_union2(set_difference(esk8_0,singleton(esk7_0)),singleton(esk7_0)) != esk8_0
& in(esk7_0,esk8_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_25,plain,
( ~ in(esk4_3(X1,X2,X3),X1)
| ~ in(esk4_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2)
| in(esk4_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_26,plain,
! [X52,X53,X54] :
( ( in(X52,set_difference(X53,singleton(X54)))
| X52 = X54
| ~ in(X52,X53) )
& ( ~ in(X52,set_difference(X53,singleton(X54)))
| X52 != X54 )
& ( ~ in(X52,set_difference(X53,singleton(X54)))
| in(X52,X53) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
cnf(c_0_27,plain,
( ~ in(X1,X3)
| in(esk4_3(singleton(X1),X2,singleton(X1)),X3)
| set_difference(singleton(X1),X2) = singleton(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
in(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( in(esk4_3(X1,X2,X1),X2)
| set_difference(X1,X2) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_23]) ).
fof(c_0_30,plain,
! [X18,X19,X20,X21,X22,X23,X24,X25] :
( ( X25 = set_union2(X23,X24)
| in(esk2_3(X23,X24,X25),X24)
| 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),X25)
| ~ in(esk2_3(X23,X24,X25),X24) )
& ( X25 = set_union2(X23,X24)
| ~ in(esk2_3(X23,X24,X25),X25)
| ~ in(esk2_3(X23,X24,X25),X23) )
& ( X20 != set_union2(X18,X19)
| in(X22,X20)
| ~ in(X22,X19) )
& ( X20 != set_union2(X18,X19)
| in(X22,X20)
| ~ in(X22,X18) )
& ( X20 != set_union2(X18,X19)
| in(X21,X19)
| in(X21,X18)
| ~ in(X21,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_31,plain,
( ~ in(X1,set_difference(X3,singleton(X2)))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( in(esk4_3(singleton(esk7_0),X1,singleton(esk7_0)),esk8_0)
| set_difference(singleton(esk7_0),X1) = singleton(esk7_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( set_difference(X1,singleton(X2)) = X1
| esk4_3(X1,singleton(X2),X1) = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_34,plain,
( X3 = set_union2(X1,X2)
| in(esk2_3(X1,X2,X3),X2)
| in(esk2_3(X1,X2,X3),X1)
| in(esk2_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
~ in(X1,set_difference(X2,singleton(X1))),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( in(X1,esk8_0)
| set_difference(singleton(esk7_0),singleton(X1)) = singleton(esk7_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( ~ in(esk2_3(X1,X2,X3),X3)
| ~ in(esk2_3(X1,X2,X3),X2)
| X3 = set_union2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( in(esk2_3(X1,X2,X2),X2)
| in(esk2_3(X1,X2,X2),X1)
| set_union2(X1,X2) = X2 ),
inference(ef,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ~ in(X1,singleton(esk7_0))
| in(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( in(esk2_3(X1,X2,X2),X1)
| set_union2(X1,X2) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
fof(c_0_41,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_42,plain,
( X2 != set_union2(X3,X4)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
( X3 != set_union2(X4,X2)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_44,negated_conjecture,
( in(esk2_3(singleton(esk7_0),X1,X1),esk8_0)
| set_union2(singleton(esk7_0),X1) = X1 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
( X3 != set_difference(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_47,plain,
( ~ in(X1,set_union2(X3,X2))
| in(X1,X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
( ~ in(X1,X3)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( ~ in(esk2_3(singleton(esk7_0),esk8_0,esk8_0),esk8_0)
| set_union2(esk8_0,singleton(esk7_0)) = esk8_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_44]),c_0_45]) ).
cnf(c_0_50,plain,
( ~ in(X1,set_difference(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_51,plain,
( in(esk3_2(set_union2(X1,X2),X3),X1)
| in(esk3_2(set_union2(X1,X2),X3),X2)
| subset(set_union2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_12]) ).
cnf(c_0_52,plain,
( ~ in(esk3_2(X1,set_union2(X2,X3)),X3)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_48]) ).
cnf(c_0_53,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_49,c_0_44]),c_0_45])]) ).
cnf(c_0_54,plain,
( in(esk3_2(set_union2(set_difference(X1,X2),X3),X4),X1)
| in(esk3_2(set_union2(set_difference(X1,X2),X3),X4),X3)
| subset(set_union2(set_difference(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( X4 != set_difference(X2,X3)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_56,negated_conjecture,
( ~ in(esk3_2(X1,esk8_0),singleton(esk7_0))
| subset(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( in(esk3_2(set_union2(set_difference(X1,X2),X3),X1),X3)
| subset(set_union2(set_difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_54]) ).
cnf(c_0_58,plain,
( X3 != set_union2(X2,X4)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_59,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_55]) ).
fof(c_0_60,plain,
! [X9,X10] :
( ( X9 = X10
| ~ subset(X10,X9)
| ~ subset(X9,X10) )
& ( X9 != X10
| subset(X10,X9) )
& ( X9 != X10
| subset(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_61,negated_conjecture,
subset(set_union2(set_difference(esk8_0,X1),singleton(esk7_0)),esk8_0),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( ~ in(X1,X2)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
( in(esk3_2(X1,X2),X3)
| in(esk3_2(X1,X2),set_difference(X1,X3))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_12]) ).
cnf(c_0_64,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,negated_conjecture,
subset(set_union2(singleton(esk7_0),set_difference(esk8_0,X1)),esk8_0),
inference(spm,[status(thm)],[c_0_61,c_0_45]) ).
cnf(c_0_66,plain,
( ~ in(esk3_2(X1,set_union2(X2,X3)),X2)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_62]) ).
cnf(c_0_67,plain,
( in(esk3_2(X1,set_union2(X2,set_difference(X1,X3))),X3)
| subset(X1,set_union2(X2,set_difference(X1,X3))) ),
inference(spm,[status(thm)],[c_0_52,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
set_union2(set_difference(esk8_0,singleton(esk7_0)),singleton(esk7_0)) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_69,negated_conjecture,
( ~ subset(esk8_0,set_union2(singleton(esk7_0),set_difference(esk8_0,X1)))
| set_union2(singleton(esk7_0),set_difference(esk8_0,X1)) = esk8_0 ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
subset(X1,set_union2(X2,set_difference(X1,X2))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
set_union2(singleton(esk7_0),set_difference(esk8_0,singleton(esk7_0))) != esk8_0,
inference(rw,[status(thm)],[c_0_68,c_0_45]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET986+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 % Computer : n003.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Mon Sep 21 05:48:23 UTC 2026
% 0.16/5.45 % CPUTime :
% 0.16/5.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/5.50 Running first-order theorem proving
% 0.21/5.50 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/benchmark/theBenchmark.p
% 211.52/36.28 % Version: 3.5.1
% 211.52/36.28 % Preprocessing class: FSMSSMSSSSSNFFN.
% 211.52/36.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 211.52/36.28 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 211.52/36.28 % Starting new_bool_3 with 300s (1) cores
% 211.52/36.28 % Starting new_bool_1 with 300s (1) cores
% 211.52/36.28 % Starting sh5l with 300s (1) cores
% 211.52/36.28 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3539204 completed with status 0
% 211.52/36.28 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 211.52/36.28 % Preprocessing class: FSMSSMSSSSSNFFN.
% 211.52/36.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 211.52/36.28 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 211.52/36.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 211.52/36.28 % No SInE strategy applied
% 211.52/36.28 % Search class: FGHSS-FFMF32-MFFFFFNN
% 211.52/36.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 211.52/36.28 % Starting SubtermCWHack with 136s (1) cores
% 211.52/36.28 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 211.52/36.28 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 211.52/36.28 % Starting new_bool_3 with 136s (1) cores
% 211.52/36.28 % Starting new_bool_1 with 136s (1) cores
% 211.52/36.28 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 3539212 completed with status 0
% 211.52/36.28 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 211.52/36.28 % Preprocessing class: FSMSSMSSSSSNFFN.
% 211.52/36.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 211.52/36.28 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 211.52/36.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 211.52/36.28 % No SInE strategy applied
% 211.52/36.28 % Search class: FGHSS-FFMF32-MFFFFFNN
% 211.52/36.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 211.52/36.28 % Starting SubtermCWHack with 136s (1) cores
% 211.52/36.28 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 211.52/36.28 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 211.52/36.28 % Preprocessing time : 0.002 s
% 211.52/36.28 % Presaturation interreduction done
% 211.52/36.28
% 211.52/36.28 % Proof found!
% 211.52/36.28 % SZS status Theorem
% 211.52/36.28 % SZS output start CNFRefutation
% See solution above
% 211.52/36.28 % Parsed axioms : 15
% 211.52/36.28 % Removed by relevancy pruning/SinE : 0
% 211.52/36.28 % Initial clauses : 35
% 211.52/36.28 % Removed in clause preprocessing : 0
% 211.52/36.28 % Initial clauses in saturation : 35
% 211.52/36.28 % Processed clauses : 38568
% 211.52/36.28 % ...of these trivial : 664
% 211.52/36.28 % ...subsumed : 33962
% 211.52/36.28 % ...remaining for further processing : 3942
% 211.52/36.28 % Other redundant clauses eliminated : 428
% 211.52/36.28 % Clauses deleted for lack of memory : 0
% 211.52/36.28 % Backward-subsumed : 167
% 211.52/36.28 % Backward-rewritten : 41
% 211.52/36.28 % Generated clauses : 1567479
% 211.52/36.28 % ...of the previous two non-redundant : 1528476
% 211.52/36.28 % ...aggressively subsumed : 0
% 211.52/36.28 % Contextual simplify-reflections : 8
% 211.52/36.28 % Paramodulations : 1561961
% 211.52/36.28 % Factorizations : 5091
% 211.52/36.28 % NegExts : 0
% 211.52/36.28 % Equation resolutions : 428
% 211.52/36.28 % Disequality decompositions : 0
% 211.52/36.28 % Total rewrite steps : 148836
% 211.52/36.28 % ...of those cached : 144636
% 211.52/36.28 % Propositional unsat checks : 0
% 211.52/36.28 % Propositional check models : 0
% 211.52/36.28 % Propositional check unsatisfiable : 0
% 211.52/36.28 % Propositional clauses : 0
% 211.52/36.28 % Propositional clauses after purity: 0
% 211.52/36.28 % Propositional unsat core size : 0
% 211.52/36.28 % Propositional preprocessing time : 0.000
% 211.52/36.28 % Propositional encoding time : 0.000
% 211.52/36.28 % Propositional solver time : 0.000
% 211.52/36.28 % Success case prop preproc time : 0.000
% 211.52/36.28 % Success case prop encoding time : 0.000
% 211.52/36.28 % Success case prop solver time : 0.000
% 211.52/36.28 % Current number of processed clauses : 3691
% 211.52/36.28 % Positive orientable unit clauses : 228
% 211.52/36.28 % Positive unorientable unit clauses: 9
% 211.52/36.28 % Negative unit clauses : 406
% 211.52/36.28 % Non-unit-clauses : 3048
% 211.52/36.28 % Current number of unprocessed clauses: 1486935
% 211.52/36.28 % ...number of literals in the above : 8522424
% 211.52/36.28 % Current number of archived formulas : 0
% 211.52/36.28 % Current number of archived clauses : 240
% 211.52/36.28 % Clause-clause subsumption calls (NU) : 2989269
% 211.52/36.28 % Rec. Clause-clause subsumption calls : 670159
% 211.52/36.28 % Non-unit clause-clause subsumptions : 14857
% 211.52/36.28 % Unit Clause-clause subsumption calls : 138183
% 211.52/36.28 % Rewrite failures with RHS unbound : 0
% 211.52/36.28 % BW rewrite match attempts : 3493
% 211.52/36.28 % BW rewrite match successes : 88
% 211.52/36.28 % Condensation attempts : 0
% 211.52/36.28 % Condensation successes : 0
% 211.52/36.28 % Termbank termtop insertions : 41105395
% 211.52/36.28 % Search garbage collected termcells : 648
% 211.52/36.28
% 211.52/36.28 % -------------------------------------------------
% 211.52/36.28 % User time : 29.003 s
% 211.52/36.28 % System time : 1.013 s
% 211.52/36.28 % Total time : 30.016 s
% 211.52/36.28 % Maximum resident set size: 3644 pages
% 211.52/36.28
% 211.52/36.28 % -------------------------------------------------
% 211.52/36.28 % User time : 145.698 s
% 211.52/36.28 % System time : 4.782 s
% 211.52/36.28 % Total time : 150.481 s
% 211.52/36.28 % Maximum resident set size: 4608 pages
% 211.52/36.28 % E exiting
%------------------------------------------------------------------------------