%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO004+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:44:54 EDT 2022
% Result : Theorem 0.53s 47.70s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 24
% Syntax : Number of formulae : 131 ( 49 unt; 0 def)
% Number of atoms : 359 ( 24 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 380 ( 152 ~; 155 |; 53 &)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 196 ( 15 sgn 101 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
~ ? [X106] : occurrence_of(X106,tptp0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96] :
( occurrence_of(X96,tptp0)
=> ? [X97,X98] :
( occurrence_of(X97,tptp4)
& root_occ(X97,X96)
& occurrence_of(X98,tptp3)
& leaf_occ(X98,X96)
& next_subocc(X97,X98,tptp0) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_32) ).
fof(sos_22,axiom,
! [X65,X66,X67] :
( ( occurrence_of(X65,X66)
& occurrence_of(X65,X67) )
=> X66 = X67 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_22) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( min_precedes(X16,X17,X18)
& ~ ? [X19] :
( min_precedes(X16,X19,X18)
& min_precedes(X19,X17,X18) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_04) ).
fof(sos_30,axiom,
! [X92,X93] :
( ( occurrence_of(X93,X92)
& ~ atomic(X92) )
=> ? [X94] :
( root(X94,X92)
& subactivity_occurrence(X94,X93) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_30) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_34) ).
fof(sos_18,axiom,
! [X53] :
( activity_occurrence(X53)
=> ? [X54] :
( activity(X54)
& occurrence_of(X53,X54) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_18) ).
fof(sos_29,axiom,
! [X90,X91] :
( occurrence_of(X91,X90)
=> ( activity(X90)
& activity_occurrence(X91) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_29) ).
fof(sos_21,axiom,
! [X61,X62,X63] :
( ( occurrence_of(X61,X63)
& leaf_occ(X62,X61) )
=> ~ ? [X64] : min_precedes(X62,X64,X63) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_21) ).
fof(sos_10,axiom,
! [X33,X34] :
( root_occ(X33,X34)
<=> ? [X35] :
( occurrence_of(X34,X35)
& subactivity_occurrence(X33,X34)
& root(X33,X35) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_10) ).
fof(sos_47,axiom,
! [X103,X104] :
( ( occurrence_of(X104,tptp0)
& subactivity_occurrence(X103,X104)
& arboreal(X103)
& ~ leaf_occ(X103,X104) )
=> ? [X105] :
( occurrence_of(X105,tptp1)
& next_subocc(X103,X105,tptp0) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_47) ).
fof(sos_13,axiom,
! [X41,X42] :
( occurrence_of(X41,X42)
=> ( arboreal(X41)
<=> atomic(X42) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_13) ).
fof(sos_02,axiom,
! [X8,X9,X10,X11] :
( ( occurrence_of(X10,X11)
& root_occ(X8,X10)
& root_occ(X9,X10) )
=> X8 = X9 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_02) ).
fof(sos_35,axiom,
atomic(tptp4),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_35) ).
fof(sos_12,axiom,
! [X39,X40] :
( root(X39,X40)
=> legal(X39) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_12) ).
fof(sos_17,axiom,
! [X52] :
( legal(X52)
=> arboreal(X52) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_17) ).
fof(sos_24,axiom,
! [X71,X72,X73] :
( min_precedes(X72,X73,X71)
=> ? [X74] :
( occurrence_of(X74,X71)
& subactivity_occurrence(X72,X74)
& subactivity_occurrence(X73,X74) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_24) ).
fof(sos_20,axiom,
! [X57,X58,X59] :
( ( occurrence_of(X57,X59)
& root_occ(X58,X57) )
=> ~ ? [X60] : min_precedes(X60,X58,X59) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_20) ).
fof(sos_14,axiom,
! [X43,X44] :
( leaf(X43,X44)
<=> ( ( root(X43,X44)
| ? [X45] : min_precedes(X45,X43,X44) )
& ~ ? [X46] : min_precedes(X43,X46,X44) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_14) ).
fof(sos_45,axiom,
! [X99,X100] :
( ( occurrence_of(X100,tptp0)
& subactivity_occurrence(X99,X100)
& arboreal(X99)
& ~ leaf_occ(X99,X100) )
=> root_occ(X99,X100) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_45) ).
fof(sos_38,axiom,
atomic(tptp1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_38) ).
fof(sos_23,axiom,
! [X68,X69] :
( ( leaf(X68,X69)
& ~ atomic(X69) )
=> ? [X70] :
( occurrence_of(X70,X69)
& leaf_occ(X68,X70) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_23) ).
fof(sos_03,axiom,
! [X12,X13,X14,X15] :
( ( occurrence_of(X14,X15)
& ~ atomic(X15)
& leaf_occ(X12,X14)
& leaf_occ(X13,X14) )
=> X12 = X13 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_03) ).
fof(sos_42,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_42) ).
fof(c_0_24,negated_conjecture,
~ ~ ? [X106] : occurrence_of(X106,tptp0),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_25,plain,
! [X99] :
( ( occurrence_of(esk15_1(X99),tptp4)
| ~ occurrence_of(X99,tptp0) )
& ( root_occ(esk15_1(X99),X99)
| ~ occurrence_of(X99,tptp0) )
& ( occurrence_of(esk16_1(X99),tptp3)
| ~ occurrence_of(X99,tptp0) )
& ( leaf_occ(esk16_1(X99),X99)
| ~ occurrence_of(X99,tptp0) )
& ( next_subocc(esk15_1(X99),esk16_1(X99),tptp0)
| ~ occurrence_of(X99,tptp0) ) ),
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_32])])])])])]) ).
fof(c_0_26,negated_conjecture,
occurrence_of(esk18_0,tptp0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_27,plain,
! [X68,X69,X70] :
( ~ occurrence_of(X68,X69)
| ~ occurrence_of(X68,X70)
| X69 = X70 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])]) ).
fof(c_0_28,plain,
! [X20,X21,X22,X23,X20,X21,X22] :
( ( min_precedes(X20,X21,X22)
| ~ next_subocc(X20,X21,X22) )
& ( ~ min_precedes(X20,X23,X22)
| ~ min_precedes(X23,X21,X22)
| ~ next_subocc(X20,X21,X22) )
& ( min_precedes(X20,esk1_3(X20,X21,X22),X22)
| ~ min_precedes(X20,X21,X22)
| next_subocc(X20,X21,X22) )
& ( min_precedes(esk1_3(X20,X21,X22),X21,X22)
| ~ min_precedes(X20,X21,X22)
| next_subocc(X20,X21,X22) ) ),
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_04])])])])])])]) ).
cnf(c_0_29,plain,
( next_subocc(esk15_1(X1),esk16_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
occurrence_of(esk18_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X95,X96] :
( ( root(esk14_2(X95,X96),X95)
| ~ occurrence_of(X96,X95)
| atomic(X95) )
& ( subactivity_occurrence(esk14_2(X95,X96),X96)
| ~ occurrence_of(X96,X95)
| atomic(X95) ) ),
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)],[inference(fof_simplification,[status(thm)],[sos_30])])])])])])]) ).
fof(c_0_32,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_34,plain,
! [X55] :
( ( activity(esk7_1(X55))
| ~ activity_occurrence(X55) )
& ( occurrence_of(X55,esk7_1(X55))
| ~ activity_occurrence(X55) ) ),
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_18])])])])])]) ).
fof(c_0_35,plain,
! [X92,X93] :
( ( activity(X92)
| ~ occurrence_of(X93,X92) )
& ( activity_occurrence(X93)
| ~ occurrence_of(X93,X92) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
fof(c_0_36,plain,
! [X65,X66,X67,X68] :
( ~ occurrence_of(X65,X67)
| ~ leaf_occ(X66,X65)
| ~ min_precedes(X66,X68,X67) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])])]) ).
cnf(c_0_37,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
next_subocc(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_39,plain,
! [X36,X37,X36,X37,X39] :
( ( occurrence_of(X37,esk2_2(X36,X37))
| ~ root_occ(X36,X37) )
& ( subactivity_occurrence(X36,X37)
| ~ root_occ(X36,X37) )
& ( root(X36,esk2_2(X36,X37))
| ~ root_occ(X36,X37) )
& ( ~ occurrence_of(X37,X39)
| ~ subactivity_occurrence(X36,X37)
| ~ root(X36,X39)
| root_occ(X36,X37) ) ),
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_10])])])])])])]) ).
cnf(c_0_40,plain,
( atomic(X1)
| subactivity_occurrence(esk14_2(X1,X2),X2)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk18_0,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_43,plain,
( occurrence_of(X1,esk7_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_45,plain,
! [X106,X107] :
( ( occurrence_of(esk17_1(X106),tptp1)
| ~ occurrence_of(X107,tptp0)
| ~ subactivity_occurrence(X106,X107)
| ~ arboreal(X106)
| leaf_occ(X106,X107) )
& ( next_subocc(X106,esk17_1(X106),tptp0)
| ~ occurrence_of(X107,tptp0)
| ~ subactivity_occurrence(X106,X107)
| ~ arboreal(X106)
| leaf_occ(X106,X107) ) ),
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)],[inference(fof_simplification,[status(thm)],[sos_47])])])])])])])]) ).
cnf(c_0_46,plain,
( root_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_47,plain,
! [X43,X44] :
( ( ~ arboreal(X43)
| atomic(X44)
| ~ occurrence_of(X43,X44) )
& ( ~ atomic(X44)
| arboreal(X43)
| ~ occurrence_of(X43,X44) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_13])])]) ).
cnf(c_0_48,plain,
( occurrence_of(esk15_1(X1),tptp4)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_49,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf_occ(X1,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_50,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_51,plain,
! [X12,X13,X14,X15] :
( ~ occurrence_of(X14,X15)
| ~ root_occ(X12,X14)
| ~ root_occ(X13,X14)
| X12 = X13 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])])]) ).
cnf(c_0_52,plain,
( root_occ(X1,X2)
| ~ root(X1,X3)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_53,negated_conjecture,
subactivity_occurrence(esk14_2(tptp0,esk18_0),esk18_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_30]),c_0_41]) ).
cnf(c_0_54,negated_conjecture,
( esk7_1(esk18_0) = tptp0
| ~ activity_occurrence(esk18_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_55,negated_conjecture,
activity_occurrence(esk18_0),
inference(spm,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_56,plain,
( atomic(X1)
| root(esk14_2(X1,X2),X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_57,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_58,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_59,negated_conjecture,
root_occ(esk15_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_46,c_0_30]) ).
cnf(c_0_60,plain,
( arboreal(X1)
| ~ occurrence_of(X1,X2)
| ~ atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_61,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp4),
inference(spm,[status(thm)],[c_0_48,c_0_30]) ).
cnf(c_0_62,plain,
atomic(tptp4),
inference(split_conjunct,[status(thm)],[sos_35]) ).
cnf(c_0_63,negated_conjecture,
( ~ leaf_occ(esk15_1(esk18_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
fof(c_0_64,plain,
! [X41,X42] :
( ~ root(X41,X42)
| legal(X41) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])]) ).
cnf(c_0_65,plain,
( X1 = X2
| ~ root_occ(X2,X3)
| ~ root_occ(X1,X3)
| ~ occurrence_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_66,negated_conjecture,
( root_occ(esk14_2(tptp0,esk18_0),esk18_0)
| ~ root(esk14_2(tptp0,esk18_0),X1)
| ~ occurrence_of(esk18_0,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_67,negated_conjecture,
esk7_1(esk18_0) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_68,negated_conjecture,
root(esk14_2(tptp0,esk18_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_30]),c_0_41]) ).
cnf(c_0_69,negated_conjecture,
( next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,esk18_0)
| ~ subactivity_occurrence(X1,esk18_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_30]) ).
cnf(c_0_70,negated_conjecture,
subactivity_occurrence(esk15_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_71,negated_conjecture,
arboreal(esk15_1(esk18_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_72,negated_conjecture,
~ leaf_occ(esk15_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_63,c_0_30]) ).
fof(c_0_73,plain,
! [X53] :
( ~ legal(X53)
| arboreal(X53) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_17])]) ).
cnf(c_0_74,plain,
( legal(X1)
| ~ root(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_75,negated_conjecture,
( X1 = esk15_1(esk18_0)
| ~ root_occ(X1,esk18_0)
| ~ occurrence_of(esk18_0,X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_59]) ).
cnf(c_0_76,negated_conjecture,
root_occ(esk14_2(tptp0,esk18_0),esk18_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_43]),c_0_67]),c_0_68]),c_0_55])]) ).
fof(c_0_77,plain,
! [X75,X76,X77] :
( ( occurrence_of(esk9_3(X75,X76,X77),X75)
| ~ min_precedes(X76,X77,X75) )
& ( subactivity_occurrence(X76,esk9_3(X75,X76,X77))
| ~ min_precedes(X76,X77,X75) )
& ( subactivity_occurrence(X77,esk9_3(X75,X76,X77))
| ~ min_precedes(X76,X77,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_24])])])])])]) ).
cnf(c_0_78,negated_conjecture,
next_subocc(esk15_1(esk18_0),esk17_1(esk15_1(esk18_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]),c_0_72]) ).
cnf(c_0_79,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_80,plain,
( arboreal(X1)
| ~ legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_81,negated_conjecture,
legal(esk14_2(tptp0,esk18_0)),
inference(spm,[status(thm)],[c_0_74,c_0_68]) ).
cnf(c_0_82,negated_conjecture,
( esk14_2(tptp0,esk18_0) = esk15_1(esk18_0)
| ~ occurrence_of(esk18_0,X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
fof(c_0_83,plain,
! [X61,X62,X63,X64] :
( ~ occurrence_of(X61,X63)
| ~ root_occ(X62,X61)
| ~ min_precedes(X64,X62,X63) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_20])])])])]) ).
fof(c_0_84,plain,
! [X47,X48,X50,X47,X48,X51] :
( ( root(X47,X48)
| min_precedes(esk4_2(X47,X48),X47,X48)
| ~ leaf(X47,X48) )
& ( ~ min_precedes(X47,X50,X48)
| ~ leaf(X47,X48) )
& ( ~ root(X47,X48)
| min_precedes(X47,esk5_2(X47,X48),X48)
| leaf(X47,X48) )
& ( ~ min_precedes(X51,X47,X48)
| min_precedes(X47,esk5_2(X47,X48),X48)
| leaf(X47,X48) ) ),
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_14])])])])])])]) ).
fof(c_0_85,plain,
! [X101,X102] :
( ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102)
| root_occ(X101,X102) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_45])])]) ).
cnf(c_0_86,plain,
( occurrence_of(esk9_3(X3,X1,X2),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_87,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk17_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_37,c_0_78]) ).
cnf(c_0_88,negated_conjecture,
( leaf_occ(X1,esk18_0)
| occurrence_of(esk17_1(X1),tptp1)
| ~ subactivity_occurrence(X1,esk18_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_30]) ).
cnf(c_0_89,plain,
( subactivity_occurrence(esk14_2(esk7_1(X1),X1),X1)
| atomic(esk7_1(X1))
| ~ activity_occurrence(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_43]) ).
cnf(c_0_90,negated_conjecture,
arboreal(esk14_2(tptp0,esk18_0)),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_91,negated_conjecture,
esk14_2(tptp0,esk18_0) = esk15_1(esk18_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_43]),c_0_55])]) ).
cnf(c_0_92,plain,
( ~ min_precedes(X1,X2,X3)
| ~ root_occ(X2,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_93,plain,
( leaf(X1,X2)
| min_precedes(X1,esk5_2(X1,X2),X2)
| ~ min_precedes(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_94,plain,
( root_occ(X1,X2)
| leaf_occ(X1,X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_95,negated_conjecture,
occurrence_of(esk9_3(tptp0,esk15_1(esk18_0),esk17_1(esk15_1(esk18_0))),tptp0),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_96,plain,
( subactivity_occurrence(X2,esk9_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_97,negated_conjecture,
occurrence_of(esk17_1(esk15_1(esk18_0)),tptp1),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_90]),c_0_55])]),c_0_41]),c_0_91]),c_0_91]),c_0_72]) ).
cnf(c_0_98,plain,
atomic(tptp1),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_99,negated_conjecture,
( ~ root_occ(esk17_1(esk15_1(esk18_0)),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_92,c_0_87]) ).
cnf(c_0_100,negated_conjecture,
( leaf(esk17_1(esk15_1(esk18_0)),tptp0)
| min_precedes(esk17_1(esk15_1(esk18_0)),esk5_2(esk17_1(esk15_1(esk18_0)),tptp0),tptp0) ),
inference(spm,[status(thm)],[c_0_93,c_0_87]) ).
cnf(c_0_101,negated_conjecture,
( leaf_occ(X1,esk9_3(tptp0,esk15_1(esk18_0),esk17_1(esk15_1(esk18_0))))
| root_occ(X1,esk9_3(tptp0,esk15_1(esk18_0),esk17_1(esk15_1(esk18_0))))
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk15_1(esk18_0),esk17_1(esk15_1(esk18_0))))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_102,negated_conjecture,
subactivity_occurrence(esk17_1(esk15_1(esk18_0)),esk9_3(tptp0,esk15_1(esk18_0),esk17_1(esk15_1(esk18_0)))),
inference(spm,[status(thm)],[c_0_96,c_0_87]) ).
cnf(c_0_103,negated_conjecture,
arboreal(esk17_1(esk15_1(esk18_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_97]),c_0_98])]) ).
cnf(c_0_104,negated_conjecture,
~ root_occ(esk17_1(esk15_1(esk18_0)),esk9_3(tptp0,esk15_1(esk18_0),esk17_1(esk15_1(esk18_0)))),
inference(spm,[status(thm)],[c_0_99,c_0_95]) ).
fof(c_0_105,plain,
! [X71,X72] :
( ( occurrence_of(esk8_2(X71,X72),X72)
| ~ leaf(X71,X72)
| atomic(X72) )
& ( leaf_occ(X71,esk8_2(X71,X72))
| ~ leaf(X71,X72)
| atomic(X72) ) ),
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)],[inference(fof_simplification,[status(thm)],[sos_23])])])])])])]) ).
cnf(c_0_106,negated_conjecture,
( leaf(esk17_1(esk15_1(esk18_0)),tptp0)
| ~ leaf_occ(esk17_1(esk15_1(esk18_0)),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_49,c_0_100]) ).
cnf(c_0_107,negated_conjecture,
leaf_occ(esk17_1(esk15_1(esk18_0)),esk9_3(tptp0,esk15_1(esk18_0),esk17_1(esk15_1(esk18_0)))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103])]),c_0_104]) ).
cnf(c_0_108,plain,
( atomic(X1)
| occurrence_of(esk8_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_109,negated_conjecture,
leaf(esk17_1(esk15_1(esk18_0)),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_95]),c_0_107])]) ).
fof(c_0_110,plain,
! [X16,X17,X18,X19] :
( ~ occurrence_of(X18,X19)
| atomic(X19)
| ~ leaf_occ(X16,X18)
| ~ leaf_occ(X17,X18)
| X16 = X17 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_03])])])])]) ).
cnf(c_0_111,plain,
( atomic(X1)
| leaf_occ(X2,esk8_2(X2,X1))
| ~ leaf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_112,plain,
( occurrence_of(esk16_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_113,negated_conjecture,
occurrence_of(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_41]) ).
cnf(c_0_114,plain,
( X1 = X2
| atomic(X4)
| ~ leaf_occ(X2,X3)
| ~ leaf_occ(X1,X3)
| ~ occurrence_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_115,negated_conjecture,
leaf_occ(esk17_1(esk15_1(esk18_0)),esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_109]),c_0_41]) ).
cnf(c_0_116,plain,
( leaf_occ(esk16_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_117,negated_conjecture,
occurrence_of(esk16_1(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)),tptp3),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_118,negated_conjecture,
( X1 = esk17_1(esk15_1(esk18_0))
| atomic(X2)
| ~ leaf_occ(X1,esk8_2(esk17_1(esk15_1(esk18_0)),tptp0))
| ~ occurrence_of(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0),X2) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_119,negated_conjecture,
leaf_occ(esk16_1(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)),esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)),
inference(spm,[status(thm)],[c_0_116,c_0_113]) ).
cnf(c_0_120,plain,
( X1 = esk7_1(X2)
| ~ activity_occurrence(X2)
| ~ occurrence_of(X2,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_43]) ).
cnf(c_0_121,negated_conjecture,
activity_occurrence(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)),
inference(spm,[status(thm)],[c_0_44,c_0_113]) ).
cnf(c_0_122,negated_conjecture,
activity_occurrence(esk16_1(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0))),
inference(spm,[status(thm)],[c_0_44,c_0_117]) ).
cnf(c_0_123,negated_conjecture,
( esk16_1(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)) = esk17_1(esk15_1(esk18_0))
| atomic(X1)
| ~ occurrence_of(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0),X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_124,negated_conjecture,
esk7_1(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_113]),c_0_121])]) ).
cnf(c_0_125,negated_conjecture,
activity_occurrence(esk17_1(esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_44,c_0_97]) ).
cnf(c_0_126,negated_conjecture,
esk7_1(esk16_1(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0))) = tptp3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_117]),c_0_122])]) ).
cnf(c_0_127,negated_conjecture,
esk16_1(esk8_2(esk17_1(esk15_1(esk18_0)),tptp0)) = esk17_1(esk15_1(esk18_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_43]),c_0_124]),c_0_121])]),c_0_41]) ).
cnf(c_0_128,negated_conjecture,
esk7_1(esk17_1(esk15_1(esk18_0))) = tptp1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_97]),c_0_125])]) ).
cnf(c_0_129,plain,
tptp1 != tptp3,
inference(split_conjunct,[status(thm)],[sos_42]) ).
cnf(c_0_130,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127]),c_0_128]),c_0_129]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PRO004+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 02:17:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.38/23.40 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.46 eprover: CPU time limit exceeded, terminating
% 0.51/46.41 eprover: CPU time limit exceeded, terminating
% 0.51/46.41 eprover: CPU time limit exceeded, terminating
% 0.51/46.46 eprover: CPU time limit exceeded, terminating
% 0.51/46.48 eprover: CPU time limit exceeded, terminating
% 0.53/47.70 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.53/47.70 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.53/47.70 # Preprocessing time : 0.014 s
% 0.53/47.70
% 0.53/47.70 # Failure: Out of unprocessed clauses!
% 0.53/47.70 # OLD status GaveUp
% 0.53/47.70 # Parsed axioms : 49
% 0.53/47.70 # Removed by relevancy pruning/SinE : 46
% 0.53/47.70 # Initial clauses : 3
% 0.53/47.70 # Removed in clause preprocessing : 0
% 0.53/47.70 # Initial clauses in saturation : 3
% 0.53/47.70 # Processed clauses : 4
% 0.53/47.70 # ...of these trivial : 0
% 0.53/47.70 # ...subsumed : 0
% 0.53/47.70 # ...remaining for further processing : 4
% 0.53/47.70 # Other redundant clauses eliminated : 0
% 0.53/47.70 # Clauses deleted for lack of memory : 0
% 0.53/47.70 # Backward-subsumed : 0
% 0.53/47.70 # Backward-rewritten : 0
% 0.53/47.70 # Generated clauses : 1
% 0.53/47.70 # ...of the previous two non-trivial : 1
% 0.53/47.70 # Contextual simplify-reflections : 0
% 0.53/47.70 # Paramodulations : 1
% 0.53/47.70 # Factorizations : 0
% 0.53/47.70 # Equation resolutions : 0
% 0.53/47.70 # Current number of processed clauses : 4
% 0.53/47.70 # Positive orientable unit clauses : 1
% 0.53/47.70 # Positive unorientable unit clauses: 0
% 0.53/47.70 # Negative unit clauses : 1
% 0.53/47.70 # Non-unit-clauses : 2
% 0.53/47.70 # Current number of unprocessed clauses: 0
% 0.53/47.70 # ...number of literals in the above : 0
% 0.53/47.70 # Current number of archived formulas : 0
% 0.53/47.70 # Current number of archived clauses : 0
% 0.53/47.70 # Clause-clause subsumption calls (NU) : 0
% 0.53/47.70 # Rec. Clause-clause subsumption calls : 0
% 0.53/47.70 # Non-unit clause-clause subsumptions : 0
% 0.53/47.70 # Unit Clause-clause subsumption calls : 0
% 0.53/47.70 # Rewrite failures with RHS unbound : 0
% 0.53/47.70 # BW rewrite match attempts : 0
% 0.53/47.70 # BW rewrite match successes : 0
% 0.53/47.70 # Condensation attempts : 0
% 0.53/47.70 # Condensation successes : 0
% 0.53/47.70 # Termbank termtop insertions : 638
% 0.53/47.70
% 0.53/47.70 # -------------------------------------------------
% 0.53/47.70 # User time : 0.011 s
% 0.53/47.70 # System time : 0.003 s
% 0.53/47.70 # Total time : 0.015 s
% 0.53/47.70 # Maximum resident set size: 2768 pages
% 0.53/47.70 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.53/47.70 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.53/47.70 # Preprocessing time : 0.014 s
% 0.53/47.70
% 0.53/47.70 # Failure: Out of unprocessed clauses!
% 0.53/47.70 # OLD status GaveUp
% 0.53/47.70 # Parsed axioms : 49
% 0.53/47.70 # Removed by relevancy pruning/SinE : 46
% 0.53/47.70 # Initial clauses : 3
% 0.53/47.70 # Removed in clause preprocessing : 0
% 0.53/47.70 # Initial clauses in saturation : 3
% 0.53/47.70 # Processed clauses : 4
% 0.53/47.70 # ...of these trivial : 0
% 0.53/47.70 # ...subsumed : 0
% 0.53/47.70 # ...remaining for further processing : 4
% 0.53/47.70 # Other redundant clauses eliminated : 0
% 0.53/47.70 # Clauses deleted for lack of memory : 0
% 0.53/47.70 # Backward-subsumed : 0
% 0.53/47.70 # Backward-rewritten : 0
% 0.53/47.70 # Generated clauses : 1
% 0.53/47.70 # ...of the previous two non-trivial : 1
% 0.53/47.70 # Contextual simplify-reflections : 0
% 0.53/47.70 # Paramodulations : 1
% 0.53/47.70 # Factorizations : 0
% 0.53/47.70 # Equation resolutions : 0
% 0.53/47.70 # Current number of processed clauses : 4
% 0.53/47.70 # Positive orientable unit clauses : 1
% 0.53/47.70 # Positive unorientable unit clauses: 0
% 0.53/47.70 # Negative unit clauses : 1
% 0.53/47.70 # Non-unit-clauses : 2
% 0.53/47.70 # Current number of unprocessed clauses: 0
% 0.53/47.70 # ...number of literals in the above : 0
% 0.53/47.70 # Current number of archived formulas : 0
% 0.53/47.70 # Current number of archived clauses : 0
% 0.53/47.70 # Clause-clause subsumption calls (NU) : 0
% 0.53/47.70 # Rec. Clause-clause subsumption calls : 0
% 0.53/47.70 # Non-unit clause-clause subsumptions : 0
% 0.53/47.70 # Unit Clause-clause subsumption calls : 0
% 0.53/47.70 # Rewrite failures with RHS unbound : 0
% 0.53/47.70 # BW rewrite match attempts : 0
% 0.53/47.70 # BW rewrite match successes : 0
% 0.53/47.70 # Condensation attempts : 0
% 0.53/47.70 # Condensation successes : 0
% 0.53/47.70 # Termbank termtop insertions : 638
% 0.53/47.70
% 0.53/47.70 # -------------------------------------------------
% 0.53/47.70 # User time : 0.012 s
% 0.53/47.70 # System time : 0.002 s
% 0.53/47.70 # Total time : 0.014 s
% 0.53/47.70 # Maximum resident set size: 2772 pages
% 0.53/47.70 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.53/47.70 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.53/47.70 # Preprocessing time : 0.014 s
% 0.53/47.70
% 0.53/47.70 # Failure: Out of unprocessed clauses!
% 0.53/47.70 # OLD status GaveUp
% 0.53/47.70 # Parsed axioms : 49
% 0.53/47.70 # Removed by relevancy pruning/SinE : 46
% 0.53/47.70 # Initial clauses : 3
% 0.53/47.70 # Removed in clause preprocessing : 0
% 0.53/47.70 # Initial clauses in saturation : 3
% 0.53/47.70 # Processed clauses : 4
% 0.53/47.70 # ...of these trivial : 0
% 0.53/47.70 # ...subsumed : 0
% 0.53/47.70 # ...remaining for further processing : 4
% 0.53/47.70 # Other redundant clauses eliminated : 0
% 0.53/47.70 # Clauses deleted for lack of memory : 0
% 0.53/47.70 # Backward-subsumed : 0
% 0.53/47.70 # Backward-rewritten : 0
% 0.53/47.70 # Generated clauses : 1
% 0.53/47.70 # ...of the previous two non-trivial : 1
% 0.53/47.70 # Contextual simplify-reflections : 0
% 0.53/47.70 # Paramodulations : 1
% 0.53/47.70 # Factorizations : 0
% 0.53/47.70 # Equation resolutions : 0
% 0.53/47.70 # Current number of processed clauses : 4
% 0.53/47.70 # Positive orientable unit clauses : 1
% 0.53/47.70 # Positive unorientable unit clauses: 0
% 0.53/47.70 # Negative unit clauses : 1
% 0.53/47.70 # Non-unit-clauses : 2
% 0.53/47.70 # Current number of unprocessed clauses: 0
% 0.53/47.70 # ...number of literals in the above : 0
% 0.53/47.70 # Current number of archived formulas : 0
% 0.53/47.70 # Current number of archived clauses : 0
% 0.53/47.70 # Clause-clause subsumption calls (NU) : 0
% 0.53/47.70 # Rec. Clause-clause subsumption calls : 0
% 0.53/47.70 # Non-unit clause-clause subsumptions : 0
% 0.53/47.70 # Unit Clause-clause subsumption calls : 0
% 0.53/47.70 # Rewrite failures with RHS unbound : 0
% 0.53/47.70 # BW rewrite match attempts : 0
% 0.53/47.70 # BW rewrite match successes : 0
% 0.53/47.70 # Condensation attempts : 0
% 0.53/47.70 # Condensation successes : 0
% 0.53/47.70 # Termbank termtop insertions : 631
% 0.53/47.70
% 0.53/47.70 # -------------------------------------------------
% 0.53/47.70 # User time : 0.012 s
% 0.53/47.70 # System time : 0.002 s
% 0.53/47.70 # Total time : 0.014 s
% 0.53/47.70 # Maximum resident set size: 2848 pages
% 0.53/47.70 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.53/47.70
% 0.53/47.70 # Failure: Resource limit exceeded (time)
% 0.53/47.70 # OLD status Res
% 0.53/47.70 # Preprocessing time : 0.018 s
% 0.53/47.70 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.53/47.70
% 0.53/47.70 # Failure: Resource limit exceeded (time)
% 0.53/47.70 # OLD status Res
% 0.53/47.70 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.53/47.70 # Preprocessing time : 0.010 s
% 0.53/47.70 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.53/47.70 # Preprocessing time : 0.010 s
% 0.53/47.70
% 0.53/47.70 # Proof found!
% 0.53/47.70 # SZS status Theorem
% 0.53/47.70 # SZS output start CNFRefutation
% See solution above
% 0.53/47.70 # Proof object total steps : 131
% 0.53/47.70 # Proof object clause steps : 85
% 0.53/47.70 # Proof object formula steps : 46
% 0.53/47.70 # Proof object conjectures : 54
% 0.53/47.70 # Proof object clause conjectures : 51
% 0.53/47.70 # Proof object formula conjectures : 3
% 0.53/47.70 # Proof object initial clauses used : 33
% 0.53/47.70 # Proof object initial formulas used : 24
% 0.53/47.70 # Proof object generating inferences : 50
% 0.53/47.70 # Proof object simplifying inferences : 48
% 0.53/47.70 # Training examples: 0 positive, 0 negative
% 0.53/47.70 # Parsed axioms : 49
% 0.53/47.70 # Removed by relevancy pruning/SinE : 0
% 0.53/47.70 # Initial clauses : 85
% 0.53/47.70 # Removed in clause preprocessing : 0
% 0.53/47.70 # Initial clauses in saturation : 85
% 0.53/47.70 # Processed clauses : 5131
% 0.53/47.70 # ...of these trivial : 612
% 0.53/47.70 # ...subsumed : 1430
% 0.53/47.70 # ...remaining for further processing : 3089
% 0.53/47.70 # Other redundant clauses eliminated : 0
% 0.53/47.70 # Clauses deleted for lack of memory : 0
% 0.53/47.70 # Backward-subsumed : 23
% 0.53/47.70 # Backward-rewritten : 721
% 0.53/47.70 # Generated clauses : 28521
% 0.53/47.70 # ...of the previous two non-trivial : 16483
% 0.53/47.70 # Contextual simplify-reflections : 0
% 0.53/47.70 # Paramodulations : 28520
% 0.53/47.70 # Factorizations : 0
% 0.53/47.70 # Equation resolutions : 0
% 0.53/47.70 # Current number of processed clauses : 2344
% 0.53/47.70 # Positive orientable unit clauses : 808
% 0.53/47.70 # Positive unorientable unit clauses: 0
% 0.53/47.70 # Negative unit clauses : 650
% 0.53/47.70 # Non-unit-clauses : 886
% 0.53/47.70 # Current number of unprocessed clauses: 8780
% 0.53/47.70 # ...number of literals in the above : 23981
% 0.53/47.70 # Current number of archived formulas : 0
% 0.53/47.70 # Current number of archived clauses : 745
% 0.53/47.70 # Clause-clause subsumption calls (NU) : 42006
% 0.53/47.70 # Rec. Clause-clause subsumption calls : 34183
% 0.53/47.70 # Non-unit clause-clause subsumptions : 685
% 0.53/47.70 # Unit Clause-clause subsumption calls : 46085
% 0.53/47.70 # Rewrite failures with RHS unbound : 0
% 0.53/47.70 # BW rewrite match attempts : 1534
% 0.53/47.70 # BW rewrite match successes : 123
% 0.53/47.70 # Condensation attempts : 0
% 0.53/47.70 # Condensation successes : 0
% 0.53/47.70 # Termbank termtop insertions : 1385628
% 0.53/47.70
% 0.53/47.70 # -------------------------------------------------
% 0.53/47.70 # User time : 0.369 s
% 0.53/47.70 # System time : 0.015 s
% 0.53/47.70 # Total time : 0.384 s
% 0.53/47.70 # Maximum resident set size: 20804 pages
% 0.53/69.43 eprover: CPU time limit exceeded, terminating
% 0.53/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.45 eprover: No such file or directory
% 0.53/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.45 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
%------------------------------------------------------------------------------