%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO012+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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 : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 17:45:02 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 66 ( 20 unt; 0 def)
% Number of atoms : 199 ( 15 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 220 ( 87 ~; 87 |; 36 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 109 ( 5 sgn 49 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X107] :
( occurrence_of(X107,tptp0)
=> ? [X108,X109] :
( occurrence_of(X108,tptp3)
& root_occ(X108,X107)
& ( occurrence_of(X109,tptp2)
| occurrence_of(X109,tptp1) )
& min_precedes(X108,X109,tptp0) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X102] :
( occurrence_of(X102,tptp0)
=> ? [X103,X104,X105] :
( occurrence_of(X103,tptp3)
& root_occ(X103,X102)
& occurrence_of(X104,tptp4)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X105,tptp2)
| occurrence_of(X105,tptp1) )
& min_precedes(X104,X105,tptp0)
& ! [X106] :
( min_precedes(X103,X106,tptp0)
=> ( X106 = X104
| X106 = X105 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_32) ).
fof(sos_27,axiom,
! [X83,X84,X85,X86] :
( ( min_precedes(X83,X84,X85)
& occurrence_of(X86,X85)
& subactivity_occurrence(X84,X86) )
=> subactivity_occurrence(X83,X86) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_27) ).
fof(sos_06,axiom,
! [X22,X23,X24] :
( min_precedes(X23,X24,X22)
=> ? [X25] :
( occurrence_of(X25,X22)
& subactivity_occurrence(X23,X25)
& subactivity_occurrence(X24,X25) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_06) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X30)
& occurrence_of(X29,X31) )
=> X30 = X31 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_08) ).
fof(sos_19,axiom,
! [X59,X60] :
( root_occ(X59,X60)
<=> ? [X61] :
( occurrence_of(X60,X61)
& subactivity_occurrence(X59,X60)
& root(X59,X61) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_19) ).
fof(sos_23,axiom,
! [X69,X70,X71] :
( min_precedes(X69,X70,X71)
=> ? [X72] :
( root(X72,X71)
& min_precedes(X72,X70,X71) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_23) ).
fof(sos_29,axiom,
! [X91,X92,X93,X94] :
( ( occurrence_of(X93,X94)
& root_occ(X91,X93)
& root_occ(X92,X93) )
=> X91 = X92 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_29) ).
fof(c_0_8,negated_conjecture,
~ ! [X107] :
( occurrence_of(X107,tptp0)
=> ? [X108,X109] :
( occurrence_of(X108,tptp3)
& root_occ(X108,X107)
& ( occurrence_of(X109,tptp2)
| occurrence_of(X109,tptp1) )
& min_precedes(X108,X109,tptp0) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,plain,
! [X107,X111] :
( ( occurrence_of(esk2_1(X107),tptp3)
| ~ occurrence_of(X107,tptp0) )
& ( root_occ(esk2_1(X107),X107)
| ~ occurrence_of(X107,tptp0) )
& ( occurrence_of(esk3_1(X107),tptp4)
| ~ occurrence_of(X107,tptp0) )
& ( min_precedes(esk2_1(X107),esk3_1(X107),tptp0)
| ~ occurrence_of(X107,tptp0) )
& ( occurrence_of(esk4_1(X107),tptp2)
| occurrence_of(esk4_1(X107),tptp1)
| ~ occurrence_of(X107,tptp0) )
& ( min_precedes(esk3_1(X107),esk4_1(X107),tptp0)
| ~ occurrence_of(X107,tptp0) )
& ( ~ min_precedes(esk2_1(X107),X111,tptp0)
| X111 = esk3_1(X107)
| X111 = esk4_1(X107)
| ~ occurrence_of(X107,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X111,X112] :
( occurrence_of(esk1_0,tptp0)
& ( ~ occurrence_of(X112,tptp2)
| ~ occurrence_of(X111,tptp3)
| ~ root_occ(X111,esk1_0)
| ~ min_precedes(X111,X112,tptp0) )
& ( ~ occurrence_of(X112,tptp1)
| ~ occurrence_of(X111,tptp3)
| ~ root_occ(X111,esk1_0)
| ~ min_precedes(X111,X112,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
fof(c_0_11,plain,
! [X87,X88,X89,X90] :
( ~ min_precedes(X87,X88,X89)
| ~ occurrence_of(X90,X89)
| ~ subactivity_occurrence(X88,X90)
| subactivity_occurrence(X87,X90) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_27])]) ).
cnf(c_0_12,plain,
( min_precedes(esk2_1(X1),esk3_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X26,X27,X28] :
( ( occurrence_of(esk6_3(X26,X27,X28),X26)
| ~ min_precedes(X27,X28,X26) )
& ( subactivity_occurrence(X27,esk6_3(X26,X27,X28))
| ~ min_precedes(X27,X28,X26) )
& ( subactivity_occurrence(X28,esk6_3(X26,X27,X28))
| ~ min_precedes(X27,X28,X26) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])])])])]) ).
cnf(c_0_15,plain,
( min_precedes(esk3_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X32,X33,X34] :
( ~ occurrence_of(X32,X33)
| ~ occurrence_of(X32,X34)
| X33 = X34 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])]) ).
fof(c_0_17,plain,
! [X62,X63,X62,X63,X65] :
( ( occurrence_of(X63,esk5_2(X62,X63))
| ~ root_occ(X62,X63) )
& ( subactivity_occurrence(X62,X63)
| ~ root_occ(X62,X63) )
& ( root(X62,esk5_2(X62,X63))
| ~ root_occ(X62,X63) )
& ( ~ occurrence_of(X63,X65)
| ~ subactivity_occurrence(X62,X63)
| ~ root(X62,X65)
| root_occ(X62,X63) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_19])])])])])])]) ).
cnf(c_0_18,plain,
( root_occ(esk2_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X73,X74,X75] :
( ( root(esk8_3(X73,X74,X75),X75)
| ~ min_precedes(X73,X74,X75) )
& ( min_precedes(esk8_3(X73,X74,X75),X74,X75)
| ~ min_precedes(X73,X74,X75) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_23])])])])])]) ).
cnf(c_0_20,plain,
( subactivity_occurrence(X1,X2)
| ~ subactivity_occurrence(X3,X2)
| ~ occurrence_of(X2,X4)
| ~ min_precedes(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
min_precedes(esk2_1(esk1_0),esk3_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_22,plain,
( subactivity_occurrence(X1,esk6_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
min_precedes(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_24,plain,
( occurrence_of(esk6_3(X3,X1,X2),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( occurrence_of(X2,esk5_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
root_occ(esk2_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_28,plain,
( min_precedes(esk8_3(X1,X2,X3),X2,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( subactivity_occurrence(esk2_1(esk1_0),X1)
| ~ subactivity_occurrence(esk3_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
subactivity_occurrence(esk3_1(esk1_0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
occurrence_of(esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_32,plain,
( root(X1,esk5_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_34,negated_conjecture,
occurrence_of(esk1_0,esk5_2(esk2_1(esk1_0),esk1_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
min_precedes(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),esk4_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_36,plain,
( subactivity_occurrence(X2,esk6_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_37,plain,
( root_occ(X1,X2)
| ~ root(X1,X3)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_38,negated_conjecture,
subactivity_occurrence(esk2_1(esk1_0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
root(esk2_1(esk1_0),esk5_2(esk2_1(esk1_0),esk1_0)),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_40,negated_conjecture,
esk5_2(esk2_1(esk1_0),esk1_0) = tptp0,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( subactivity_occurrence(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),X1)
| ~ subactivity_occurrence(esk4_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
subactivity_occurrence(esk4_1(esk1_0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0))),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
fof(c_0_43,plain,
! [X95,X96,X97,X98] :
( ~ occurrence_of(X97,X98)
| ~ root_occ(X95,X97)
| ~ root_occ(X96,X97)
| X95 = X96 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])])]) ).
cnf(c_0_44,negated_conjecture,
( root_occ(esk2_1(esk1_0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)))
| ~ root(esk2_1(esk1_0),X1)
| ~ occurrence_of(esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
root(esk2_1(esk1_0),tptp0),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
subactivity_occurrence(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_31])]) ).
cnf(c_0_47,plain,
( root(esk8_3(X1,X2,X3),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_48,plain,
( X1 = X2
| ~ root_occ(X2,X3)
| ~ root_occ(X1,X3)
| ~ occurrence_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
root_occ(esk2_1(esk1_0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_31]),c_0_45])]) ).
cnf(c_0_50,negated_conjecture,
( root_occ(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)))
| ~ root(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),X1)
| ~ occurrence_of(esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
root(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),tptp0),
inference(spm,[status(thm)],[c_0_47,c_0_23]) ).
cnf(c_0_52,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk1_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_53,plain,
( occurrence_of(esk4_1(X1),tptp1)
| occurrence_of(esk4_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_54,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk1_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_55,negated_conjecture,
( X1 = esk2_1(esk1_0)
| ~ root_occ(X1,esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)))
| ~ occurrence_of(esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)),X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
root_occ(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_31])]) ).
cnf(c_0_57,negated_conjecture,
( ~ root_occ(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),esk1_0)
| ~ occurrence_of(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),tptp3)
| ~ occurrence_of(esk4_1(esk1_0),tptp1) ),
inference(spm,[status(thm)],[c_0_52,c_0_35]) ).
cnf(c_0_58,negated_conjecture,
( occurrence_of(esk4_1(esk1_0),tptp2)
| occurrence_of(esk4_1(esk1_0),tptp1) ),
inference(spm,[status(thm)],[c_0_53,c_0_13]) ).
cnf(c_0_59,negated_conjecture,
( ~ root_occ(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),esk1_0)
| ~ occurrence_of(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),tptp3)
| ~ occurrence_of(esk4_1(esk1_0),tptp2) ),
inference(spm,[status(thm)],[c_0_54,c_0_35]) ).
cnf(c_0_60,negated_conjecture,
( esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0) = esk2_1(esk1_0)
| ~ occurrence_of(esk6_3(tptp0,esk3_1(esk1_0),esk4_1(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
( occurrence_of(esk2_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_62,negated_conjecture,
( ~ root_occ(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),esk1_0)
| ~ occurrence_of(esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),tptp3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
esk8_3(esk3_1(esk1_0),esk4_1(esk1_0),tptp0) = esk2_1(esk1_0),
inference(spm,[status(thm)],[c_0_60,c_0_31]) ).
cnf(c_0_64,negated_conjecture,
occurrence_of(esk2_1(esk1_0),tptp3),
inference(spm,[status(thm)],[c_0_61,c_0_13]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_27]),c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO012+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.14/0.33 % Computer : n006.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Mon Jun 13 03:52:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.41 # Preprocessing time : 0.016 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 66
% 0.24/1.41 # Proof object clause steps : 49
% 0.24/1.41 # Proof object formula steps : 17
% 0.24/1.41 # Proof object conjectures : 36
% 0.24/1.41 # Proof object clause conjectures : 33
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 19
% 0.24/1.41 # Proof object initial formulas used : 8
% 0.24/1.41 # Proof object generating inferences : 28
% 0.24/1.41 # Proof object simplifying inferences : 15
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 46
% 0.24/1.41 # Removed by relevancy pruning/SinE : 21
% 0.24/1.41 # Initial clauses : 40
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 40
% 0.24/1.41 # Processed clauses : 739
% 0.24/1.41 # ...of these trivial : 20
% 0.24/1.41 # ...subsumed : 168
% 0.24/1.41 # ...remaining for further processing : 551
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 17
% 0.24/1.41 # Backward-rewritten : 371
% 0.24/1.41 # Generated clauses : 1236
% 0.24/1.41 # ...of the previous two non-trivial : 1367
% 0.24/1.41 # Contextual simplify-reflections : 25
% 0.24/1.41 # Paramodulations : 1235
% 0.24/1.41 # Factorizations : 1
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 163
% 0.24/1.41 # Positive orientable unit clauses : 60
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 15
% 0.24/1.41 # Non-unit-clauses : 88
% 0.24/1.41 # Current number of unprocessed clauses: 191
% 0.24/1.41 # ...number of literals in the above : 331
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 388
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 10668
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 8274
% 0.24/1.41 # Non-unit clause-clause subsumptions : 142
% 0.24/1.41 # Unit Clause-clause subsumption calls : 338
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 390
% 0.24/1.41 # BW rewrite match successes : 24
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 46655
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.080 s
% 0.24/1.41 # System time : 0.005 s
% 0.24/1.41 # Total time : 0.085 s
% 0.24/1.41 # Maximum resident set size: 5216 pages
%------------------------------------------------------------------------------