%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET943+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 : n007.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:49 PM UTC 2026
% Result : Theorem 50.26s 6.88s
% Output : CNFRefutation 50.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 180 ( 32 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 216 ( 97 ~; 93 |; 17 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 2 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 : 121 ( 6 sgn 57 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t96_zfmisc_1,conjecture,
! [X1,X2] : union(set_union2(X1,X2)) = set_union2(union(X1),union(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t96_zfmisc_1) ).
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(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(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(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& in(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(t8_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X3,X2)
& subset(X1,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
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(t95_zfmisc_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> subset(union(X1),union(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t95_zfmisc_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] : union(set_union2(X1,X2)) = set_union2(union(X1),union(X2)),
inference(assume_negation,[status(cth)],[t96_zfmisc_1]) ).
fof(c_0_10,negated_conjecture,
union(set_union2(esk8_0,esk9_0)) != set_union2(union(esk8_0),union(esk9_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_11,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_12,negated_conjecture,
union(set_union2(esk8_0,esk9_0)) != set_union2(union(esk8_0),union(esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X20,X21,X22,X23,X24] :
( ( subset(X23,X24)
| ~ in(esk2_2(X23,X24),X24) )
& ( subset(X23,X24)
| in(esk2_2(X23,X24),X23) )
& ( in(X22,X21)
| ~ in(X22,X20)
| ~ subset(X20,X21) ) ),
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])])])])])])]) ).
fof(c_0_15,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ( X18 = set_union2(X16,X17)
| in(esk1_3(X16,X17,X18),X17)
| in(esk1_3(X16,X17,X18),X16)
| in(esk1_3(X16,X17,X18),X18) )
& ( X18 = set_union2(X16,X17)
| ~ in(esk1_3(X16,X17,X18),X18)
| ~ in(esk1_3(X16,X17,X18),X17) )
& ( X18 = set_union2(X16,X17)
| ~ in(esk1_3(X16,X17,X18),X18)
| ~ in(esk1_3(X16,X17,X18),X16) )
& ( X13 != set_union2(X11,X12)
| in(X15,X13)
| ~ in(X15,X12) )
& ( X13 != set_union2(X11,X12)
| in(X15,X13)
| ~ in(X15,X11) )
& ( X13 != set_union2(X11,X12)
| in(X14,X12)
| in(X14,X11)
| ~ in(X14,X13) ) ),
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_16,negated_conjecture,
( ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0)))
| ~ subset(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_17,plain,
( ~ in(esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( X3 != set_union2(X2,X4)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X26,X27,X28,X30,X31,X32,X33,X35] :
( ( X33 = union(X32)
| in(esk4_2(X32,X33),X33)
| in(esk5_2(X32,X33),X32) )
& ( X33 = union(X32)
| in(esk4_2(X32,X33),X33)
| in(esk4_2(X32,X33),esk5_2(X32,X33)) )
& ( X33 = union(X32)
| ~ in(X35,X32)
| ~ in(esk4_2(X32,X33),X35)
| ~ in(esk4_2(X32,X33),X33) )
& ( X27 != union(X26)
| in(X30,X27)
| ~ in(X31,X26)
| ~ in(X30,X31) )
& ( X27 != union(X26)
| ~ in(X28,X27)
| in(esk3_3(X26,X27,X28),X26) )
& ( X27 != union(X26)
| ~ in(X28,X27)
| in(X28,esk3_3(X26,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)],[d4_tarski])])])])])])]) ).
cnf(c_0_20,plain,
( X3 != set_union2(X4,X2)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),set_union2(union(esk8_0),union(esk9_0)))
| ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ in(X1,X2)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( X4 != union(X3)
| ~ in(X2,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_25,plain,
! [X47,X48,X49] :
( subset(set_union2(X47,X49),X48)
| ~ subset(X49,X48)
| ~ subset(X47,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).
fof(c_0_26,plain,
! [X45,X46] : subset(X45,set_union2(X45,X46)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_27,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_28,plain,
( ~ in(X1,X3)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(esk8_0))
| ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( ~ in(X1,X3)
| ~ in(X3,X2)
| in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0)))
| in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_32,plain,
( ~ subset(X3,X2)
| ~ subset(X1,X2)
| subset(set_union2(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X50,X51] :
( subset(union(X50),union(X51))
| ~ subset(X50,X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t95_zfmisc_1])])]) ).
cnf(c_0_34,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(esk9_0))
| ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
( ~ in(X1,esk8_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
| ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
| ~ subset(union(esk9_0),union(set_union2(esk8_0,esk9_0)))
| in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
( ~ subset(X1,X2)
| subset(union(X1),union(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( ~ in(X1,esk9_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
| ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
( ~ in(X1,esk8_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
| ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
| ~ subset(union(esk9_0),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_43,plain,
( X3 != union(X2)
| ~ in(X1,X3)
| in(X1,esk3_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_44,negated_conjecture,
( ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
| in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(X1,esk9_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
| ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
| ~ subset(union(esk9_0),union(set_union2(esk8_0,esk9_0))) ),
inference(spm,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_46,plain,
( X2 != union(X1)
| ~ in(X3,X2)
| in(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_47,negated_conjecture,
( ~ in(X1,esk8_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
| ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_39]),c_0_40])]) ).
cnf(c_0_48,plain,
( ~ in(X1,union(X2))
| in(X1,esk3_3(X2,union(X2),X1)) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_34])]) ).
cnf(c_0_50,negated_conjecture,
( ~ in(X1,esk9_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
| ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_40])]) ).
cnf(c_0_51,plain,
( X2 != set_union2(X3,X4)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_52,plain,
( ~ in(X2,union(X1))
| in(esk3_3(X1,union(X1),X2),X1) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ in(X1,esk8_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_34])]) ).
cnf(c_0_54,negated_conjecture,
in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( ~ in(X1,esk9_0)
| ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_34])]) ).
cnf(c_0_56,plain,
( ~ in(X1,set_union2(X3,X2))
| in(X1,X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_57,negated_conjecture,
in(esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0)))),set_union2(esk8_0,esk9_0)),
inference(spm,[status(thm)],[c_0_52,c_0_49]) ).
cnf(c_0_58,negated_conjecture,
~ in(esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0)))),esk8_0),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
~ in(esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0)))),esk9_0),
inference(spm,[status(thm)],[c_0_55,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET943+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 05:42:20 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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
% 50.26/6.88 % Version: 3.5.1
% 50.26/6.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 50.26/6.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.26/6.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 50.26/6.88 % Starting new_bool_3 with 300s (1) cores
% 50.26/6.88 % Starting new_bool_1 with 300s (1) cores
% 50.26/6.88 % Starting sh5l with 300s (1) cores
% 50.26/6.88 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 297282 completed with status 0
% 50.26/6.88 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 50.26/6.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 50.26/6.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.26/6.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 50.26/6.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 50.26/6.88 % No SInE strategy applied
% 50.26/6.88 % Search class: FGHSM-FFMF32-SFFFFFNN
% 50.26/6.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 50.26/6.88 % Starting SubtermCWHack with 136s (1) cores
% 50.26/6.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 50.26/6.88 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 50.26/6.88 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 50.26/6.88 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 50.26/6.88 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with pid 297293 completed with status 0
% 50.26/6.88 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A
% 50.26/6.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 50.26/6.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.26/6.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 50.26/6.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 50.26/6.88 % No SInE strategy applied
% 50.26/6.88 % Search class: FGHSM-FFMF32-SFFFFFNN
% 50.26/6.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 50.26/6.88 % Starting SubtermCWHack with 136s (1) cores
% 50.26/6.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 50.26/6.88 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 50.26/6.88 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 50.26/6.88 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 50.26/6.88 % Preprocessing time : 0.002 s
% 50.26/6.88 % Presaturation interreduction done
% 50.26/6.88
% 50.26/6.88 % Proof found!
% 50.26/6.88 % SZS status Theorem
% 50.26/6.88 % SZS output start CNFRefutation
% See solution above
% 50.26/6.88 % Parsed axioms : 16
% 50.26/6.88 % Removed by relevancy pruning/SinE : 0
% 50.26/6.88 % Initial clauses : 30
% 50.26/6.88 % Removed in clause preprocessing : 0
% 50.26/6.88 % Initial clauses in saturation : 30
% 50.26/6.88 % Processed clauses : 7794
% 50.26/6.88 % ...of these trivial : 46
% 50.26/6.88 % ...subsumed : 5261
% 50.26/6.88 % ...remaining for further processing : 2486
% 50.26/6.88 % Other redundant clauses eliminated : 432
% 50.26/6.88 % Clauses deleted for lack of memory : 0
% 50.26/6.88 % Backward-subsumed : 133
% 50.26/6.88 % Backward-rewritten : 27
% 50.26/6.88 % Generated clauses : 163152
% 50.26/6.88 % ...of the previous two non-redundant : 162063
% 50.26/6.88 % ...aggressively subsumed : 0
% 50.26/6.88 % Contextual simplify-reflections : 2
% 50.26/6.88 % Paramodulations : 162713
% 50.26/6.88 % Factorizations : 6
% 50.26/6.88 % NegExts : 0
% 50.26/6.88 % Equation resolutions : 433
% 50.26/6.88 % Disequality decompositions : 0
% 50.26/6.88 % Total rewrite steps : 9784
% 50.26/6.88 % ...of those cached : 9513
% 50.26/6.88 % Propositional unsat checks : 0
% 50.26/6.88 % Propositional check models : 0
% 50.26/6.88 % Propositional check unsatisfiable : 0
% 50.26/6.88 % Propositional clauses : 0
% 50.26/6.88 % Propositional clauses after purity: 0
% 50.26/6.88 % Propositional unsat core size : 0
% 50.26/6.88 % Propositional preprocessing time : 0.000
% 50.26/6.88 % Propositional encoding time : 0.000
% 50.26/6.88 % Propositional solver time : 0.000
% 50.26/6.88 % Success case prop preproc time : 0.000
% 50.26/6.88 % Success case prop encoding time : 0.000
% 50.26/6.88 % Success case prop solver time : 0.000
% 50.26/6.88 % Current number of processed clauses : 2290
% 50.26/6.88 % Positive orientable unit clauses : 43
% 50.26/6.88 % Positive unorientable unit clauses: 1
% 50.26/6.88 % Negative unit clauses : 117
% 50.26/6.88 % Non-unit-clauses : 2129
% 50.26/6.88 % Current number of unprocessed clauses: 153919
% 50.26/6.88 % ...number of literals in the above : 743245
% 50.26/6.88 % Current number of archived formulas : 0
% 50.26/6.88 % Current number of archived clauses : 188
% 50.26/6.88 % Clause-clause subsumption calls (NU) : 826577
% 50.26/6.88 % Rec. Clause-clause subsumption calls : 442075
% 50.26/6.88 % Non-unit clause-clause subsumptions : 3936
% 50.26/6.88 % Unit Clause-clause subsumption calls : 13981
% 50.26/6.88 % Rewrite failures with RHS unbound : 0
% 50.26/6.88 % BW rewrite match attempts : 110
% 50.26/6.88 % BW rewrite match successes : 34
% 50.26/6.88 % Condensation attempts : 0
% 50.26/6.88 % Condensation successes : 0
% 50.26/6.88 % Termbank termtop insertions : 3439482
% 50.26/6.88 % Search garbage collected termcells : 530
% 50.26/6.88
% 50.26/6.88 % -------------------------------------------------
% 50.26/6.88 % User time : 6.077 s
% 50.26/6.88 % System time : 0.181 s
% 50.26/6.88 % Total time : 6.258 s
% 50.26/6.88 % Maximum resident set size: 3644 pages
% 50.26/6.88
% 50.26/6.88 % -------------------------------------------------
% 50.26/6.88 % User time : 30.036 s
% 50.26/6.88 % System time : 0.971 s
% 50.26/6.88 % Total time : 31.007 s
% 50.26/6.88 % Maximum resident set size: 4608 pages
% 50.26/6.88 % E exiting
%------------------------------------------------------------------------------