%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET732+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:06 PM UTC 2026
% Result : Theorem 5.83s 11.66s
% Output : CNFRefutation 5.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 9 unt; 0 def)
% Number of atoms : 234 ( 14 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 287 ( 112 ~; 123 |; 37 &)
% ( 7 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 171 ( 0 sgn 67 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII23,conjecture,
! [X6,X10,X1,X2,X11] :
( ( injective(X6,X1,X2)
& ! [X3,X5] :
( ( member(X5,X11)
& member(X3,X1) )
=> ( apply(X10,X3,X5)
<=> apply(X6,X3,X5) ) )
& image2(X6,X1) = X11
& subset(X11,X2)
& maps(X6,X1,X2) )
=> one_to_one(X10,X1,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII23) ).
fof(image2,axiom,
! [X6,X1,X5] :
( member(X5,image2(X6,X1))
<=> ? [X3] :
( apply(X6,X3,X5)
& member(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',image2) ).
fof(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( apply(X6,X4,X5)
& member(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',surjective) ).
fof(injective,axiom,
! [X6,X1,X2] :
( injective(X6,X1,X2)
<=> ! [X13,X14,X5] :
( ( member(X5,X2)
& member(X14,X1)
& member(X13,X1) )
=> ( ( apply(X6,X14,X5)
& apply(X6,X13,X5) )
=> X13 = X14 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',injective) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(one_to_one,axiom,
! [X6,X1,X2] :
( one_to_one(X6,X1,X2)
<=> ( surjective(X6,X1,X2)
& injective(X6,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',one_to_one) ).
fof(c_0_6,negated_conjecture,
~ ! [X6,X10,X1,X2,X11] :
( ( injective(X6,X1,X2)
& ! [X3,X5] :
( ( member(X5,X11)
& member(X3,X1) )
=> ( apply(X10,X3,X5)
<=> apply(X6,X3,X5) ) )
& image2(X6,X1) = X11
& subset(X11,X2)
& maps(X6,X1,X2) )
=> one_to_one(X10,X1,X11) ),
inference(assume_negation,[status(cth)],[thII23]) ).
fof(c_0_7,plain,
! [X39,X40,X41,X43,X44,X45,X46] :
( ( member(X45,image2(X43,X44))
| ~ apply(X43,X46,X45)
| ~ member(X46,X44) )
& ( ~ member(X41,image2(X39,X40))
| apply(X39,esk9_3(X39,X40,X41),X41) )
& ( ~ member(X41,image2(X39,X40))
| member(esk9_3(X39,X40,X41),X40) ) ),
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)],[image2])])])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X22,X23] :
( ~ one_to_one(esk2_0,esk3_0,esk5_0)
& injective(esk1_0,esk3_0,esk4_0)
& ( ~ member(X23,esk5_0)
| ~ member(X22,esk3_0)
| apply(esk2_0,X22,X23)
| ~ apply(esk1_0,X22,X23) )
& ( ~ member(X23,esk5_0)
| ~ member(X22,esk3_0)
| apply(esk1_0,X22,X23)
| ~ apply(esk2_0,X22,X23) )
& image2(esk1_0,esk3_0) = esk5_0
& subset(esk5_0,esk4_0)
& maps(esk1_0,esk3_0,esk4_0) ),
inference(distribute,[status(thm)],[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_6])])])])])]) ).
cnf(c_0_9,plain,
( ~ apply(X3,X1,X4)
| ~ member(X1,X2)
| member(X4,image2(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ member(X2,esk5_0)
| ~ member(X1,esk3_0)
| ~ apply(esk1_0,X1,X2)
| apply(esk2_0,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X69,X70,X71,X72,X74,X75,X76,X78] :
( ( surjective(X74,X75,X76)
| ~ apply(X74,X78,esk17_3(X74,X75,X76))
| ~ member(X78,X75) )
& ( surjective(X74,X75,X76)
| member(esk17_3(X74,X75,X76),X76) )
& ( ~ surjective(X69,X70,X71)
| ~ member(X72,X71)
| apply(X69,esk16_4(X69,X70,X71,X72),X72) )
& ( ~ surjective(X69,X70,X71)
| ~ member(X72,X71)
| member(esk16_4(X69,X70,X71,X72),X70) ) ),
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)],[surjective])])])])])])]) ).
fof(c_0_12,plain,
! [X27,X28,X29,X30,X31,X32,X33,X34,X35] :
( ( injective(X33,X34,X35)
| esk6_3(X33,X34,X35) != esk7_3(X33,X34,X35) )
& ( injective(X33,X34,X35)
| apply(X33,esk7_3(X33,X34,X35),esk8_3(X33,X34,X35)) )
& ( injective(X33,X34,X35)
| apply(X33,esk6_3(X33,X34,X35),esk8_3(X33,X34,X35)) )
& ( injective(X33,X34,X35)
| member(esk8_3(X33,X34,X35),X35) )
& ( injective(X33,X34,X35)
| member(esk7_3(X33,X34,X35),X34) )
& ( injective(X33,X34,X35)
| member(esk6_3(X33,X34,X35),X34) )
& ( X30 = X31
| ~ apply(X27,X31,X32)
| ~ apply(X27,X30,X32)
| ~ member(X32,X29)
| ~ member(X31,X28)
| ~ member(X30,X28)
| ~ injective(X27,X28,X29) ) ),
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)],[injective])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ member(X3,X2)
| ~ member(X3,esk3_0)
| ~ member(X1,esk5_0)
| ~ apply(esk1_0,X3,X1)
| member(X1,image2(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ surjective(X1,X2,X3)
| ~ member(X4,X3)
| apply(X1,esk16_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ apply(X3,X1,esk17_3(X3,X2,X4))
| ~ member(X1,X2)
| surjective(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ member(X3,image2(X1,X2))
| apply(X1,esk9_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( ~ apply(X1,X5,X6)
| ~ apply(X1,X4,X6)
| ~ member(X6,X3)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ injective(X1,X2,X3)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
injective(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_19,plain,
! [X47,X48,X49,X50,X51] :
( ( subset(X50,X51)
| ~ member(esk10_2(X50,X51),X51) )
& ( subset(X50,X51)
| member(esk10_2(X50,X51),X50) )
& ( member(X49,X48)
| ~ member(X49,X47)
| ~ subset(X47,X48) ) ),
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)],[subset])])])])])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(X1,X4)
| ~ member(X1,esk5_0)
| ~ member(esk16_4(esk1_0,X3,X4,X1),X2)
| ~ member(esk16_4(esk1_0,X3,X4,X1),esk3_0)
| ~ surjective(esk1_0,X3,X4)
| member(X1,image2(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ surjective(X1,X2,X3)
| ~ member(X4,X3)
| member(esk16_4(X1,X2,X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ~ member(esk17_3(X1,X2,X3),image2(X1,X4))
| ~ member(esk9_3(X1,X4,esk17_3(X1,X2,X3)),X2)
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ member(X3,image2(X1,X2))
| member(esk9_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(X1,esk3_0)
| ~ member(X2,esk3_0)
| ~ member(X3,esk4_0)
| ~ apply(esk1_0,X1,X3)
| ~ apply(esk1_0,X2,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
subset(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(X1,X3)
| ~ member(X1,esk5_0)
| ~ member(esk16_4(esk1_0,esk3_0,X3,X1),X2)
| ~ surjective(esk1_0,esk3_0,X3)
| member(X1,image2(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ member(esk17_3(X1,X2,X3),image2(X1,X2))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( surjective(X1,X2,X3)
| member(esk17_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,esk3_0)
| ~ member(X3,esk4_0)
| ~ member(X3,image2(esk1_0,X2))
| ~ member(esk9_3(esk1_0,X2,X3),esk3_0)
| ~ apply(esk1_0,X1,X3)
| X1 = esk9_3(esk1_0,X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_31,negated_conjecture,
image2(esk1_0,esk3_0) = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(X1,esk5_0)
| member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(X2,esk5_0)
| ~ member(X1,esk3_0)
| ~ apply(esk2_0,X1,X2)
| apply(esk1_0,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,plain,
( injective(X1,X2,X3)
| apply(X1,esk7_3(X1,X2,X3),esk8_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,plain,
( injective(X1,X2,X3)
| apply(X1,esk6_3(X1,X2,X3),esk8_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(X1,X2)
| ~ member(X1,esk5_0)
| ~ surjective(esk1_0,esk3_0,X2)
| member(X1,image2(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_37,plain,
surjective(X1,X2,image2(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(X1,esk3_0)
| ~ member(X2,esk5_0)
| ~ apply(esk1_0,X1,X2)
| X1 = esk9_3(esk1_0,esk3_0,X2) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_31]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(esk7_3(esk2_0,X1,X2),esk3_0)
| ~ member(esk8_3(esk2_0,X1,X2),esk5_0)
| apply(esk1_0,esk7_3(esk2_0,X1,X2),esk8_3(esk2_0,X1,X2))
| injective(esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(esk6_3(esk2_0,X1,X2),esk3_0)
| ~ member(esk8_3(esk2_0,X1,X2),esk5_0)
| apply(esk1_0,esk6_3(esk2_0,X1,X2),esk8_3(esk2_0,X1,X2))
| injective(esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
fof(c_0_41,plain,
! [X24,X25,X26] :
( ( one_to_one(X24,X25,X26)
| ~ surjective(X24,X25,X26)
| ~ injective(X24,X25,X26) )
& ( ~ one_to_one(X24,X25,X26)
| surjective(X24,X25,X26) )
& ( ~ one_to_one(X24,X25,X26)
| injective(X24,X25,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_to_one])])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(X1,esk5_0)
| member(X1,image2(esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
( ~ member(esk7_3(esk2_0,X1,X2),esk3_0)
| ~ member(esk8_3(esk2_0,X1,X2),esk5_0)
| injective(esk2_0,X1,X2)
| esk9_3(esk1_0,esk3_0,esk8_3(esk2_0,X1,X2)) = esk7_3(esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(esk6_3(esk2_0,X1,X2),esk3_0)
| ~ member(esk8_3(esk2_0,X1,X2),esk5_0)
| injective(esk2_0,X1,X2)
| esk9_3(esk1_0,esk3_0,esk8_3(esk2_0,X1,X2)) = esk6_3(esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_45,plain,
( esk6_3(X1,X2,X3) != esk7_3(X1,X2,X3)
| injective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,negated_conjecture,
~ one_to_one(esk2_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_47,plain,
( ~ surjective(X1,X2,X3)
| ~ injective(X1,X2,X3)
| one_to_one(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( ~ member(esk17_3(esk2_0,esk3_0,X1),esk5_0)
| surjective(esk2_0,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( ~ member(esk6_3(esk2_0,X1,X2),esk3_0)
| ~ member(esk7_3(esk2_0,X1,X2),esk3_0)
| ~ member(esk8_3(esk2_0,X1,X2),esk5_0)
| injective(esk2_0,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_50,plain,
( injective(X1,X2,X3)
| member(esk8_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_51,negated_conjecture,
( ~ injective(esk2_0,esk3_0,esk5_0)
| ~ surjective(esk2_0,esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
surjective(esk2_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_48,c_0_29]) ).
cnf(c_0_53,negated_conjecture,
( ~ member(esk6_3(esk2_0,X1,esk5_0),esk3_0)
| ~ member(esk7_3(esk2_0,X1,esk5_0),esk3_0)
| injective(esk2_0,X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( injective(X1,X2,X3)
| member(esk7_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_55,negated_conjecture,
~ injective(esk2_0,esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_56,negated_conjecture,
~ member(esk6_3(esk2_0,esk3_0,esk5_0),esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_57,plain,
( injective(X1,X2,X3)
| member(esk6_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET732+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/10.65 % Computer : n002.cluster.edu
% 0.17/10.65 % Model : x86_64 x86_64
% 0.17/10.65 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.65 % Memory : 8046.5625MB
% 0.17/10.65 % OS : Linux 6.8.0-71-generic
% 0.17/10.65 % CPULimit : 300
% 0.17/10.65 % WCLimit : 300
% 0.17/10.65 % DateTime : Mon Sep 21 05:37:13 UTC 2026
% 0.17/10.66 % CPUTime :
% 0.17/10.66 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/10.73 Running first-order theorem proving
% 0.22/10.73 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
% 5.83/11.66 % Version: 3.5.1
% 5.83/11.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.83/11.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.83/11.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.83/11.66 % Starting new_bool_3 with 300s (1) cores
% 5.83/11.66 % Starting new_bool_1 with 300s (1) cores
% 5.83/11.66 % Starting sh5l with 300s (1) cores
% 5.83/11.66 % new_bool_3 with pid 2535761 completed with status 0
% 5.83/11.66 % Result found by new_bool_3
% 5.83/11.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.83/11.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.83/11.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.83/11.66 % Starting new_bool_3 with 300s (1) cores
% 5.83/11.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.83/11.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.83/11.66 % Search class: FGUSF-FFMS33-SFFFFFNN
% 5.83/11.66 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 5.83/11.66 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.83/11.66 % Starting SubtermCWHack with 31s (1) cores
% 5.83/11.66 % SubtermCWHack with pid 2535766 completed with status 0
% 5.83/11.66 % Result found by SubtermCWHack
% 5.83/11.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.83/11.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.83/11.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.83/11.66 % Starting new_bool_3 with 300s (1) cores
% 5.83/11.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.83/11.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.83/11.66 % Search class: FGUSF-FFMS33-SFFFFFNN
% 5.83/11.66 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 5.83/11.66 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.83/11.66 % Starting SubtermCWHack with 31s (1) cores
% 5.83/11.66 % Preprocessing time : 0.002 s
% 5.83/11.66
% 5.83/11.66 % Proof found!
% 5.83/11.66 % SZS status Theorem
% 5.83/11.66 % SZS output start CNFRefutation
% See solution above
% 5.83/11.66 % Parsed axioms : 29
% 5.83/11.66 % Removed by relevancy pruning/SinE : 22
% 5.83/11.66 % Initial clauses : 42
% 5.83/11.66 % Removed in clause preprocessing : 0
% 5.83/11.66 % Initial clauses in saturation : 42
% 5.83/11.66 % Processed clauses : 1533
% 5.83/11.66 % ...of these trivial : 0
% 5.83/11.66 % ...subsumed : 473
% 5.83/11.66 % ...remaining for further processing : 1060
% 5.83/11.66 % Other redundant clauses eliminated : 0
% 5.83/11.66 % Clauses deleted for lack of memory : 0
% 5.83/11.66 % Backward-subsumed : 21
% 5.83/11.66 % Backward-rewritten : 2
% 5.83/11.66 % Generated clauses : 11290
% 5.83/11.66 % ...of the previous two non-redundant : 11223
% 5.83/11.66 % ...aggressively subsumed : 0
% 5.83/11.66 % Contextual simplify-reflections : 35
% 5.83/11.66 % Paramodulations : 11290
% 5.83/11.66 % Factorizations : 0
% 5.83/11.66 % NegExts : 0
% 5.83/11.66 % Equation resolutions : 0
% 5.83/11.66 % Disequality decompositions : 0
% 5.83/11.66 % Total rewrite steps : 266
% 5.83/11.66 % ...of those cached : 256
% 5.83/11.66 % Propositional unsat checks : 0
% 5.83/11.66 % Propositional check models : 0
% 5.83/11.66 % Propositional check unsatisfiable : 0
% 5.83/11.66 % Propositional clauses : 0
% 5.83/11.66 % Propositional clauses after purity: 0
% 5.83/11.66 % Propositional unsat core size : 0
% 5.83/11.66 % Propositional preprocessing time : 0.000
% 5.83/11.66 % Propositional encoding time : 0.000
% 5.83/11.66 % Propositional solver time : 0.000
% 5.83/11.66 % Success case prop preproc time : 0.000
% 5.83/11.66 % Success case prop encoding time : 0.000
% 5.83/11.66 % Success case prop solver time : 0.000
% 5.83/11.66 % Current number of processed clauses : 1037
% 5.83/11.66 % Positive orientable unit clauses : 22
% 5.83/11.66 % Positive unorientable unit clauses: 0
% 5.83/11.66 % Negative unit clauses : 3
% 5.83/11.66 % Non-unit-clauses : 1012
% 5.83/11.66 % Current number of unprocessed clauses: 9650
% 5.83/11.66 % ...number of literals in the above : 59229
% 5.83/11.66 % Current number of archived formulas : 0
% 5.83/11.66 % Current number of archived clauses : 23
% 5.83/11.66 % Clause-clause subsumption calls (NU) : 232437
% 5.83/11.66 % Rec. Clause-clause subsumption calls : 86079
% 5.83/11.66 % Non-unit clause-clause subsumptions : 529
% 5.83/11.66 % Unit Clause-clause subsumption calls : 649
% 5.83/11.66 % Rewrite failures with RHS unbound : 0
% 5.83/11.66 % BW rewrite match attempts : 66
% 5.83/11.66 % BW rewrite match successes : 2
% 5.83/11.66 % Condensation attempts : 0
% 5.83/11.66 % Condensation successes : 0
% 5.83/11.66 % Termbank termtop insertions : 370955
% 5.83/11.66 % Search garbage collected termcells : 1203
% 5.83/11.66
% 5.83/11.66 % -------------------------------------------------
% 5.83/11.66 % User time : 0.716 s
% 5.83/11.66 % System time : 0.023 s
% 5.83/11.66 % Total time : 0.738 s
% 5.83/11.66 % Maximum resident set size: 3692 pages
% 5.83/11.66
% 5.83/11.66 % -------------------------------------------------
% 5.83/11.66 % User time : 0.720 s
% 5.83/11.66 % System time : 0.028 s
% 5.83/11.66 % Total time : 0.748 s
% 5.83/11.66 % Maximum resident set size: 4864 pages
% 5.83/11.66 % E exiting
%------------------------------------------------------------------------------