%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET951+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:50 PM UTC 2026
% Result : Theorem 0.68s 0.55s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 24 unt; 0 def)
% Number of atoms : 170 ( 77 equ)
% Maximal formula atoms : 28 ( 2 avg)
% Number of connectives : 187 ( 79 ~; 79 |; 24 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-4 aty)
% Number of variables : 163 ( 15 sgn 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( X4 = ordered_pair(X5,X6)
& in(X6,X2)
& in(X5,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(t104_zfmisc_1,conjecture,
! [X1,X2,X3,X4,X5] :
~ ( ! [X6,X7] :
~ ( in(X7,set_intersection2(X3,X5))
& in(X6,set_intersection2(X2,X4))
& X1 = ordered_pair(X6,X7) )
& in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t104_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_7,plain,
! [X54,X55,X56,X57] :
( ( ordered_pair(X54,X55) != ordered_pair(X56,X57)
| X55 = X57 )
& ( ordered_pair(X54,X55) != ordered_pair(X56,X57)
| X54 = X56 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])])]) ).
fof(c_0_8,plain,
! [X40,X41] : ordered_pair(X40,X41) = unordered_pair(unordered_pair(X40,X41),singleton(X40)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_9,plain,
! [X14,X15,X16,X17,X20,X21,X22,X23,X24,X25,X27,X28] :
( ( X25 = cartesian_product2(X23,X24)
| in(esk3_3(X23,X24,X25),X25)
| esk3_3(X23,X24,X25) = ordered_pair(esk4_3(X23,X24,X25),esk5_3(X23,X24,X25)) )
& ( X25 = cartesian_product2(X23,X24)
| in(esk3_3(X23,X24,X25),X25)
| in(esk5_3(X23,X24,X25),X24) )
& ( X25 = cartesian_product2(X23,X24)
| in(esk3_3(X23,X24,X25),X25)
| in(esk4_3(X23,X24,X25),X23) )
& ( X25 = cartesian_product2(X23,X24)
| esk3_3(X23,X24,X25) != ordered_pair(X27,X28)
| ~ in(X28,X24)
| ~ in(X27,X23)
| ~ in(esk3_3(X23,X24,X25),X25) )
& ( X16 != cartesian_product2(X14,X15)
| in(X20,X16)
| X20 != ordered_pair(X21,X22)
| ~ in(X22,X15)
| ~ in(X21,X14) )
& ( X16 != cartesian_product2(X14,X15)
| ~ in(X17,X16)
| X17 = ordered_pair(esk1_4(X14,X15,X16,X17),esk2_4(X14,X15,X16,X17)) )
& ( X16 != cartesian_product2(X14,X15)
| ~ in(X17,X16)
| in(esk2_4(X14,X15,X16,X17),X15) )
& ( X16 != cartesian_product2(X14,X15)
| ~ in(X17,X16)
| in(esk1_4(X14,X15,X16,X17),X14) ) ),
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_zfmisc_1])])])])])])]) ).
fof(c_0_10,plain,
! [X31,X32,X33,X34,X35,X36,X37,X38] :
( ( X38 = set_intersection2(X36,X37)
| in(esk6_3(X36,X37,X38),X38)
| in(esk6_3(X36,X37,X38),X37) )
& ( X38 = set_intersection2(X36,X37)
| in(esk6_3(X36,X37,X38),X38)
| in(esk6_3(X36,X37,X38),X36) )
& ( X38 = set_intersection2(X36,X37)
| ~ in(esk6_3(X36,X37,X38),X37)
| ~ in(esk6_3(X36,X37,X38),X36)
| ~ in(esk6_3(X36,X37,X38),X38) )
& ( X33 != set_intersection2(X31,X32)
| in(X35,X33)
| ~ in(X35,X32)
| ~ in(X35,X31) )
& ( X33 != set_intersection2(X31,X32)
| ~ in(X34,X33)
| in(X34,X32) )
& ( X33 != set_intersection2(X31,X32)
| ~ in(X34,X33)
| in(X34,X31) ) ),
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_xboole_0])])])])])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2,X3,X4,X5] :
~ ( ! [X6,X7] :
~ ( in(X7,set_intersection2(X3,X5))
& in(X6,set_intersection2(X2,X4))
& X1 = ordered_pair(X6,X7) )
& in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
inference(assume_negation,[status(cth)],[t104_zfmisc_1]) ).
cnf(c_0_12,plain,
( ordered_pair(X3,X1) != ordered_pair(X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X10,X11] : unordered_pair(X10,X11) = unordered_pair(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_15,plain,
( X4 != cartesian_product2(X2,X3)
| ~ in(X1,X4)
| X1 = ordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
! [X52,X53] :
( ( ~ in(X53,set_intersection2(esk11_0,esk13_0))
| ~ in(X52,set_intersection2(esk10_0,esk12_0))
| esk9_0 != ordered_pair(X52,X53) )
& in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
cnf(c_0_18,plain,
( unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(unordered_pair(X4,X2),singleton(X4))
| X1 = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_19,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ in(X1,X4)
| X4 != cartesian_product2(X2,X3)
| X1 = unordered_pair(unordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)),singleton(esk1_4(X2,X3,X4,X1))) ),
inference(rw,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_21,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( ordered_pair(X1,X3) != ordered_pair(X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,plain,
( unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(singleton(X4),unordered_pair(X4,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ in(X3,cartesian_product2(X1,X2))
| unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3 ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
in(esk9_0,cartesian_product2(esk12_0,esk13_0)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(unordered_pair(X2,X4),singleton(X2))
| X1 = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_13]),c_0_13]) ).
cnf(c_0_30,plain,
( X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3)
| in(esk2_4(X1,X2,X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,plain,
( unordered_pair(singleton(X3),unordered_pair(X3,X1)) != unordered_pair(singleton(X4),unordered_pair(X4,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
unordered_pair(singleton(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0)),unordered_pair(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0))) = esk9_0,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
in(esk9_0,cartesian_product2(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_34,plain,
( X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3)
| in(esk1_4(X1,X2,X3,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
( unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(singleton(X2),unordered_pair(X2,X4))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_36,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,plain,
( ~ in(X3,cartesian_product2(X1,X2))
| in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( unordered_pair(singleton(X2),unordered_pair(X2,X1)) != esk9_0
| X1 = esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
unordered_pair(singleton(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0)),unordered_pair(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0))) = esk9_0,
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_40,plain,
( ~ in(X3,cartesian_product2(X1,X2))
| in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( unordered_pair(singleton(X1),unordered_pair(X1,X3)) != unordered_pair(singleton(X2),unordered_pair(X2,X4))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_42,negated_conjecture,
( ~ in(X2,set_intersection2(esk11_0,esk13_0))
| ~ in(X1,set_intersection2(esk10_0,esk12_0))
| esk9_0 != ordered_pair(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_43,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk11_0),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_45,negated_conjecture,
in(esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),esk13_0),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_46,negated_conjecture,
esk2_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0) = esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_47,plain,
! [X12,X13] : set_intersection2(X12,X13) = set_intersection2(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_48,negated_conjecture,
in(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),esk12_0),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_49,negated_conjecture,
( unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk9_0
| X1 = esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_50,negated_conjecture,
( ~ in(X1,set_intersection2(esk10_0,esk12_0))
| ~ in(X2,set_intersection2(esk11_0,esk13_0))
| esk9_0 != unordered_pair(unordered_pair(X1,X2),singleton(X1)) ),
inference(rw,[status(thm)],[c_0_42,c_0_13]) ).
cnf(c_0_51,negated_conjecture,
( ~ in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),X1)
| in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(X1,esk11_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk13_0),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( ~ in(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),X1)
| in(esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0),set_intersection2(X1,esk12_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
esk1_4(esk12_0,esk13_0,cartesian_product2(esk12_0,esk13_0),esk9_0) = esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),
inference(spm,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_56,negated_conjecture,
( ~ in(X1,set_intersection2(esk10_0,esk12_0))
| ~ in(X2,set_intersection2(esk11_0,esk13_0))
| unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk9_0 ),
inference(spm,[status(thm)],[c_0_50,c_0_19]) ).
cnf(c_0_57,negated_conjecture,
in(esk2_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(esk11_0,esk13_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( ~ in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),X1)
| in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(X1,esk12_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_55]) ).
cnf(c_0_59,negated_conjecture,
in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),esk10_0),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_60,negated_conjecture,
~ in(esk1_4(esk10_0,esk11_0,cartesian_product2(esk10_0,esk11_0),esk9_0),set_intersection2(esk10_0,esk12_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_39]),c_0_57])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET951+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n002.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 05:47:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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/benchmark/theBenchmark.p
% 0.68/0.55 % Version: 3.5.1
% 0.68/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.68/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.68/0.55 % Starting sh5l with 300s (1) cores
% 0.68/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2557454 completed with status 0
% 0.68/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.68/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.68/0.55 % No SInE strategy applied
% 0.68/0.55 % Search class: FGHSS-FFMF32-MFFFFFNN
% 0.68/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.68/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.68/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.68/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.68/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.68/0.55 % new_bool_3 with pid 2557463 completed with status 0
% 0.68/0.55 % Result found by new_bool_3
% 0.68/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.68/0.55 % No SInE strategy applied
% 0.68/0.55 % Search class: FGHSS-FFMF32-MFFFFFNN
% 0.68/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.68/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.68/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.68/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.68/0.55 % Preprocessing time : 0.001 s
% 0.68/0.55 % Presaturation interreduction done
% 0.68/0.55
% 0.68/0.55 % Proof found!
% 0.68/0.55 % SZS status Theorem
% 0.68/0.55 % SZS output start CNFRefutation
% See solution above
% 0.68/0.55 % Parsed axioms : 12
% 0.68/0.55 % Removed by relevancy pruning/SinE : 0
% 0.68/0.55 % Initial clauses : 26
% 0.68/0.55 % Removed in clause preprocessing : 1
% 0.68/0.55 % Initial clauses in saturation : 25
% 0.68/0.55 % Processed clauses : 1315
% 0.68/0.55 % ...of these trivial : 26
% 0.68/0.55 % ...subsumed : 680
% 0.68/0.55 % ...remaining for further processing : 609
% 0.68/0.55 % Other redundant clauses eliminated : 8
% 0.68/0.55 % Clauses deleted for lack of memory : 0
% 0.68/0.55 % Backward-subsumed : 0
% 0.68/0.55 % Backward-rewritten : 53
% 0.68/0.55 % Generated clauses : 11054
% 0.68/0.55 % ...of the previous two non-redundant : 10562
% 0.68/0.55 % ...aggressively subsumed : 0
% 0.68/0.55 % Contextual simplify-reflections : 2
% 0.68/0.55 % Paramodulations : 11015
% 0.68/0.55 % Factorizations : 20
% 0.68/0.55 % NegExts : 0
% 0.68/0.55 % Equation resolutions : 20
% 0.68/0.55 % Disequality decompositions : 0
% 0.68/0.55 % Total rewrite steps : 2267
% 0.68/0.55 % ...of those cached : 1991
% 0.68/0.55 % Propositional unsat checks : 0
% 0.68/0.55 % Propositional check models : 0
% 0.68/0.55 % Propositional check unsatisfiable : 0
% 0.68/0.55 % Propositional clauses : 0
% 0.68/0.55 % Propositional clauses after purity: 0
% 0.68/0.55 % Propositional unsat core size : 0
% 0.68/0.55 % Propositional preprocessing time : 0.000
% 0.68/0.55 % Propositional encoding time : 0.000
% 0.68/0.55 % Propositional solver time : 0.000
% 0.68/0.55 % Success case prop preproc time : 0.000
% 0.68/0.55 % Success case prop encoding time : 0.000
% 0.68/0.55 % Success case prop solver time : 0.000
% 0.68/0.55 % Current number of processed clauses : 524
% 0.68/0.55 % Positive orientable unit clauses : 126
% 0.68/0.55 % Positive unorientable unit clauses: 2
% 0.68/0.55 % Negative unit clauses : 131
% 0.68/0.55 % Non-unit-clauses : 265
% 0.68/0.55 % Current number of unprocessed clauses: 9275
% 0.68/0.55 % ...number of literals in the above : 21749
% 0.68/0.55 % Current number of archived formulas : 0
% 0.68/0.55 % Current number of archived clauses : 79
% 0.68/0.55 % Clause-clause subsumption calls (NU) : 9328
% 0.68/0.55 % Rec. Clause-clause subsumption calls : 7901
% 0.68/0.55 % Non-unit clause-clause subsumptions : 397
% 0.68/0.55 % Unit Clause-clause subsumption calls : 1924
% 0.68/0.55 % Rewrite failures with RHS unbound : 0
% 0.68/0.55 % BW rewrite match attempts : 1306
% 0.68/0.55 % BW rewrite match successes : 30
% 0.68/0.55 % Condensation attempts : 0
% 0.68/0.55 % Condensation successes : 0
% 0.68/0.55 % Termbank termtop insertions : 371699
% 0.68/0.55 % Search garbage collected termcells : 505
% 0.68/0.55
% 0.68/0.55 % -------------------------------------------------
% 0.68/0.55 % User time : 0.118 s
% 0.68/0.55 % System time : 0.012 s
% 0.68/0.55 % Total time : 0.130 s
% 0.68/0.55 % Maximum resident set size: 3388 pages
% 0.68/0.55
% 0.68/0.55 % -------------------------------------------------
% 0.68/0.55 % User time : 0.561 s
% 0.68/0.55 % System time : 0.046 s
% 0.68/0.55 % Total time : 0.607 s
% 0.68/0.55 % Maximum resident set size: 4608 pages
% 0.68/0.55 % E exiting
%------------------------------------------------------------------------------