%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO003+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:53 EDT 2022
% Result : Theorem 0.21s 1.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 14 unt; 0 def)
% Number of atoms : 251 ( 22 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 310 ( 133 ~; 130 |; 36 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 155 ( 7 sgn 62 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
~ ? [X168] : occurrence_of(X168,tptp0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_02) ).
fof(sos_33,axiom,
! [X100,X101] :
( root_occ(X100,X101)
<=> ? [X102] :
( occurrence_of(X101,X102)
& subactivity_occurrence(X100,X101)
& root(X100,X102) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_33) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( min_precedes(X61,X62,X63)
& ~ ? [X64] :
( min_precedes(X61,X64,X63)
& min_precedes(X64,X62,X63) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_22) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164] :
( occurrence_of(X163,tptp4)
& root_occ(X163,X162)
& occurrence_of(X164,tptp3)
& leaf_occ(X164,X162)
& next_subocc(X163,X164,tptp0) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_49) ).
fof(sos_43,axiom,
! [X139,X140,X141,X142] :
( ( occurrence_of(X140,X139)
& subactivity_occurrence(X141,X140)
& leaf_occ(X142,X140)
& arboreal(X141)
& ~ min_precedes(X141,X142,X139) )
=> X142 = X141 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_43) ).
fof(sos_42,axiom,
! [X135,X136,X137,X138] :
( ( occurrence_of(X136,X135)
& subactivity_occurrence(X137,X136)
& root_occ(X138,X136)
& arboreal(X137)
& ~ min_precedes(X138,X137,X135) )
=> X138 = X137 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_42) ).
fof(sos_62,axiom,
! [X165,X166] :
( ( occurrence_of(X166,tptp0)
& root_occ(X165,X166) )
=> ? [X167] :
( occurrence_of(X167,tptp1)
& next_subocc(X165,X167,tptp0) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_62) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( occurrence_of(X73,X70)
& subactivity_occurrence(X71,X73)
& subactivity_occurrence(X72,X73) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_25) ).
fof(sos_38,axiom,
! [X118,X119,X120] :
( ( occurrence_of(X118,X120)
& root_occ(X119,X118) )
=> ~ ? [X121] : min_precedes(X121,X119,X120) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_38) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_07) ).
fof(sos_55,axiom,
atomic(tptp1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_55) ).
fof(sos_59,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_59) ).
fof(c_0_13,negated_conjecture,
~ ~ ? [X168] : occurrence_of(X168,tptp0),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X8,X9,X10] :
( ~ occurrence_of(X8,X9)
| ~ occurrence_of(X8,X10)
| X9 = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
fof(c_0_15,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X103,X104,X103,X104,X106] :
( ( occurrence_of(X104,esk6_2(X103,X104))
| ~ root_occ(X103,X104) )
& ( subactivity_occurrence(X103,X104)
| ~ root_occ(X103,X104) )
& ( root(X103,esk6_2(X103,X104))
| ~ root_occ(X103,X104) )
& ( ~ occurrence_of(X104,X106)
| ~ subactivity_occurrence(X103,X104)
| ~ root(X103,X106)
| root_occ(X103,X104) ) ),
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_33])])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk1_0,X1) ),
inference(pm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( occurrence_of(X2,esk6_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
( root(X1,esk6_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( esk6_2(X1,esk1_0) = tptp0
| ~ root_occ(X1,esk1_0) ),
inference(pm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X65,X66,X67,X68,X65,X66,X67] :
( ( min_precedes(X65,X66,X67)
| ~ next_subocc(X65,X66,X67) )
& ( ~ min_precedes(X65,X68,X67)
| ~ min_precedes(X68,X66,X67)
| ~ next_subocc(X65,X66,X67) )
& ( min_precedes(X65,esk5_3(X65,X66,X67),X67)
| ~ min_precedes(X65,X66,X67)
| next_subocc(X65,X66,X67) )
& ( min_precedes(esk5_3(X65,X66,X67),X66,X67)
| ~ min_precedes(X65,X66,X67)
| next_subocc(X65,X66,X67) ) ),
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_22])])])])])])]) ).
fof(c_0_24,plain,
! [X165] :
( ( occurrence_of(esk2_1(X165),tptp4)
| ~ occurrence_of(X165,tptp0) )
& ( root_occ(esk2_1(X165),X165)
| ~ occurrence_of(X165,tptp0) )
& ( occurrence_of(esk3_1(X165),tptp3)
| ~ occurrence_of(X165,tptp0) )
& ( leaf_occ(esk3_1(X165),X165)
| ~ occurrence_of(X165,tptp0) )
& ( next_subocc(esk2_1(X165),esk3_1(X165),tptp0)
| ~ occurrence_of(X165,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_49])])])])])]) ).
fof(c_0_25,plain,
! [X143,X144,X145,X146] :
( ~ occurrence_of(X144,X143)
| ~ subactivity_occurrence(X145,X144)
| ~ leaf_occ(X146,X144)
| ~ arboreal(X145)
| min_precedes(X145,X146,X143)
| X146 = X145 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_43])])]) ).
cnf(c_0_26,plain,
( root_occ(X1,X2)
| ~ root(X1,X3)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( root(X1,tptp0)
| ~ root_occ(X1,esk1_0) ),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ next_subocc(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( next_subocc(esk2_1(X1),esk3_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| ~ arboreal(X2)
| ~ leaf_occ(X1,X4)
| ~ subactivity_occurrence(X2,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( leaf_occ(esk3_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X139,X140,X141,X142] :
( ~ occurrence_of(X140,X139)
| ~ subactivity_occurrence(X141,X140)
| ~ root_occ(X142,X140)
| ~ arboreal(X141)
| min_precedes(X142,X141,X139)
| X142 = X141 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_42])])]) ).
fof(c_0_33,plain,
! [X168,X169] :
( ( occurrence_of(esk4_1(X168),tptp1)
| ~ occurrence_of(X169,tptp0)
| ~ root_occ(X168,X169) )
& ( next_subocc(X168,esk4_1(X168),tptp0)
| ~ occurrence_of(X169,tptp0)
| ~ root_occ(X168,X169) ) ),
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_62])])])])])])]) ).
cnf(c_0_34,negated_conjecture,
( root_occ(X1,X2)
| ~ root_occ(X1,esk1_0)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(pm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( root_occ(esk2_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( ~ min_precedes(X1,esk3_1(X2),tptp0)
| ~ min_precedes(esk2_1(X2),X1,tptp0)
| ~ occurrence_of(X2,tptp0) ),
inference(pm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( esk3_1(X1) = X2
| min_precedes(X2,esk3_1(X1),X3)
| ~ subactivity_occurrence(X2,X1)
| ~ arboreal(X2)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X1,X3) ),
inference(pm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( X1 = X2
| min_precedes(X1,X2,X3)
| ~ arboreal(X2)
| ~ root_occ(X1,X4)
| ~ subactivity_occurrence(X2,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( next_subocc(X1,esk4_1(X1),tptp0)
| ~ root_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( root_occ(esk2_1(esk1_0),X1)
| ~ subactivity_occurrence(esk2_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_35]),c_0_17])]) ).
cnf(c_0_41,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_42,plain,
( esk3_1(X1) = X2
| ~ subactivity_occurrence(X2,X1)
| ~ min_precedes(esk2_1(X1),X2,tptp0)
| ~ arboreal(X2)
| ~ occurrence_of(X1,tptp0) ),
inference(pm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( esk2_1(X1) = X2
| min_precedes(esk2_1(X1),X2,X3)
| ~ subactivity_occurrence(X2,X1)
| ~ arboreal(X2)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X1,X3) ),
inference(pm,[status(thm)],[c_0_38,c_0_35]) ).
fof(c_0_44,plain,
! [X74,X75,X76] :
( ( occurrence_of(esk7_3(X74,X75,X76),X74)
| ~ min_precedes(X75,X76,X74) )
& ( subactivity_occurrence(X75,esk7_3(X74,X75,X76))
| ~ min_precedes(X75,X76,X74) )
& ( subactivity_occurrence(X76,esk7_3(X74,X75,X76))
| ~ min_precedes(X75,X76,X74) ) ),
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_25])])])])])]) ).
cnf(c_0_45,negated_conjecture,
( next_subocc(esk2_1(esk1_0),esk4_1(esk2_1(esk1_0)),tptp0)
| ~ subactivity_occurrence(esk2_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(pm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( subactivity_occurrence(esk2_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(pm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_47,plain,
( esk2_1(X1) = X2
| esk3_1(X1) = X2
| ~ subactivity_occurrence(X2,X1)
| ~ arboreal(X2)
| ~ occurrence_of(X1,tptp0) ),
inference(pm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( subactivity_occurrence(X2,esk7_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
( occurrence_of(esk4_1(X1),tptp1)
| ~ root_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_50,plain,
! [X122,X123,X124,X125] :
( ~ occurrence_of(X122,X124)
| ~ root_occ(X123,X122)
| ~ min_precedes(X125,X123,X124) ),
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_38])])])])]) ).
cnf(c_0_51,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_52,negated_conjecture,
next_subocc(esk2_1(esk1_0),esk4_1(esk2_1(esk1_0)),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_46]),c_0_17])]) ).
cnf(c_0_53,plain,
( occurrence_of(esk3_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_54,plain,
( esk3_1(esk7_3(X1,X2,X3)) = X3
| esk2_1(esk7_3(X1,X2,X3)) = X3
| ~ min_precedes(X2,X3,X1)
| ~ arboreal(X3)
| ~ occurrence_of(esk7_3(X1,X2,X3),tptp0) ),
inference(pm,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_55,plain,
! [X19,X20] :
( ( ~ arboreal(X19)
| atomic(X20)
| ~ occurrence_of(X19,X20) )
& ( ~ atomic(X20)
| arboreal(X19)
| ~ occurrence_of(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_56,negated_conjecture,
( occurrence_of(esk4_1(esk2_1(esk1_0)),tptp1)
| ~ subactivity_occurrence(esk2_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(pm,[status(thm)],[c_0_49,c_0_40]) ).
cnf(c_0_57,plain,
( ~ min_precedes(X1,X2,X3)
| ~ root_occ(X2,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,negated_conjecture,
min_precedes(esk2_1(esk1_0),esk4_1(esk2_1(esk1_0)),tptp0),
inference(pm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,plain,
( esk2_1(esk7_3(X1,X2,X3)) = X3
| occurrence_of(X3,tptp3)
| ~ min_precedes(X2,X3,X1)
| ~ arboreal(X3)
| ~ occurrence_of(esk7_3(X1,X2,X3),tptp0) ),
inference(pm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
( arboreal(X1)
| ~ occurrence_of(X1,X2)
| ~ atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_61,negated_conjecture,
occurrence_of(esk4_1(esk2_1(esk1_0)),tptp1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_56,c_0_46]),c_0_17])]) ).
cnf(c_0_62,plain,
atomic(tptp1),
inference(split_conjunct,[status(thm)],[sos_55]) ).
cnf(c_0_63,negated_conjecture,
( ~ root_occ(esk4_1(esk2_1(esk1_0)),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(pm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
( root_occ(X1,esk7_3(X2,X3,X1))
| occurrence_of(X1,tptp3)
| ~ min_precedes(X3,X1,X2)
| ~ arboreal(X1)
| ~ occurrence_of(esk7_3(X2,X3,X1),tptp0) ),
inference(pm,[status(thm)],[c_0_35,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
arboreal(esk4_1(esk2_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_66,negated_conjecture,
( occurrence_of(esk4_1(esk2_1(esk1_0)),tptp3)
| ~ min_precedes(X1,esk4_1(esk2_1(esk1_0)),X2)
| ~ occurrence_of(esk7_3(X2,X1,esk4_1(esk2_1(esk1_0))),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_67,plain,
( occurrence_of(esk7_3(X3,X1,X2),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_68,plain,
( occurrence_of(esk4_1(esk2_1(X1)),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(pm,[status(thm)],[c_0_49,c_0_35]) ).
cnf(c_0_69,negated_conjecture,
( occurrence_of(esk4_1(esk2_1(esk1_0)),tptp3)
| ~ min_precedes(X1,esk4_1(esk2_1(esk1_0)),tptp0) ),
inference(pm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,plain,
( X1 = tptp1
| ~ occurrence_of(esk4_1(esk2_1(X2)),X1)
| ~ occurrence_of(X2,tptp0) ),
inference(pm,[status(thm)],[c_0_16,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
occurrence_of(esk4_1(esk2_1(esk1_0)),tptp3),
inference(pm,[status(thm)],[c_0_69,c_0_58]) ).
cnf(c_0_72,plain,
tptp1 != tptp3,
inference(split_conjunct,[status(thm)],[sos_59]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_70,c_0_71]),c_0_17])]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PRO003+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 02:30:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.41 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.21/1.41 # Preprocessing time : 0.017 s
% 0.21/1.41
% 0.21/1.41 # Failure: Out of unprocessed clauses!
% 0.21/1.41 # OLD status GaveUp
% 0.21/1.41 # Parsed axioms : 64
% 0.21/1.41 # Removed by relevancy pruning/SinE : 40
% 0.21/1.41 # Initial clauses : 36
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 36
% 0.21/1.41 # Processed clauses : 83
% 0.21/1.41 # ...of these trivial : 0
% 0.21/1.41 # ...subsumed : 4
% 0.21/1.41 # ...remaining for further processing : 79
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 0
% 0.21/1.41 # Backward-rewritten : 1
% 0.21/1.41 # Generated clauses : 55
% 0.21/1.41 # ...of the previous two non-trivial : 48
% 0.21/1.41 # Contextual simplify-reflections : 0
% 0.21/1.41 # Paramodulations : 55
% 0.21/1.41 # Factorizations : 0
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 78
% 0.21/1.41 # Positive orientable unit clauses : 19
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 5
% 0.21/1.41 # Non-unit-clauses : 54
% 0.21/1.41 # Current number of unprocessed clauses: 0
% 0.21/1.41 # ...number of literals in the above : 0
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 1
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 723
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 252
% 0.21/1.41 # Non-unit clause-clause subsumptions : 1
% 0.21/1.41 # Unit Clause-clause subsumption calls : 8
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 1
% 0.21/1.41 # BW rewrite match successes : 1
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 4013
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.019 s
% 0.21/1.41 # System time : 0.002 s
% 0.21/1.41 # Total time : 0.021 s
% 0.21/1.41 # Maximum resident set size: 3176 pages
% 0.21/1.41 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.21/1.41 # Preprocessing time : 0.014 s
% 0.21/1.41
% 0.21/1.41 # Failure: Out of unprocessed clauses!
% 0.21/1.41 # OLD status GaveUp
% 0.21/1.41 # Parsed axioms : 64
% 0.21/1.41 # Removed by relevancy pruning/SinE : 59
% 0.21/1.41 # Initial clauses : 10
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 10
% 0.21/1.41 # Processed clauses : 16
% 0.21/1.41 # ...of these trivial : 0
% 0.21/1.41 # ...subsumed : 0
% 0.21/1.41 # ...remaining for further processing : 16
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 0
% 0.21/1.41 # Backward-rewritten : 0
% 0.21/1.41 # Generated clauses : 6
% 0.21/1.41 # ...of the previous two non-trivial : 6
% 0.21/1.41 # Contextual simplify-reflections : 0
% 0.21/1.41 # Paramodulations : 6
% 0.21/1.41 # Factorizations : 0
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 16
% 0.21/1.41 # Positive orientable unit clauses : 1
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 1
% 0.21/1.41 # Non-unit-clauses : 14
% 0.21/1.41 # Current number of unprocessed clauses: 0
% 0.21/1.41 # ...number of literals in the above : 0
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 0
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 21
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 21
% 0.21/1.41 # Non-unit clause-clause subsumptions : 0
% 0.21/1.41 # Unit Clause-clause subsumption calls : 0
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 0
% 0.21/1.41 # BW rewrite match successes : 0
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 1362
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.012 s
% 0.21/1.41 # System time : 0.002 s
% 0.21/1.41 # Total time : 0.014 s
% 0.21/1.41 # Maximum resident set size: 2852 pages
% 0.21/1.41 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.21/1.41 # Preprocessing time : 0.017 s
% 0.21/1.41
% 0.21/1.41 # Proof found!
% 0.21/1.41 # SZS status Theorem
% 0.21/1.41 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 74
% 0.21/1.41 # Proof object clause steps : 49
% 0.21/1.41 # Proof object formula steps : 25
% 0.21/1.41 # Proof object conjectures : 20
% 0.21/1.41 # Proof object clause conjectures : 17
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 22
% 0.21/1.41 # Proof object initial formulas used : 13
% 0.21/1.41 # Proof object generating inferences : 27
% 0.21/1.41 # Proof object simplifying inferences : 13
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 64
% 0.21/1.41 # Removed by relevancy pruning/SinE : 28
% 0.21/1.41 # Initial clauses : 54
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 54
% 0.21/1.41 # Processed clauses : 767
% 0.21/1.41 # ...of these trivial : 0
% 0.21/1.41 # ...subsumed : 375
% 0.21/1.41 # ...remaining for further processing : 392
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 32
% 0.21/1.41 # Backward-rewritten : 7
% 0.21/1.41 # Generated clauses : 3477
% 0.21/1.41 # ...of the previous two non-trivial : 3388
% 0.21/1.41 # Contextual simplify-reflections : 301
% 0.21/1.41 # Paramodulations : 3472
% 0.21/1.41 # Factorizations : 5
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 353
% 0.21/1.41 # Positive orientable unit clauses : 10
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 13
% 0.21/1.41 # Non-unit-clauses : 330
% 0.21/1.41 # Current number of unprocessed clauses: 2447
% 0.21/1.41 # ...number of literals in the above : 16775
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 39
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 46037
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 13023
% 0.21/1.41 # Non-unit clause-clause subsumptions : 557
% 0.21/1.41 # Unit Clause-clause subsumption calls : 242
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 5
% 0.21/1.41 # BW rewrite match successes : 3
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 59343
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.126 s
% 0.21/1.41 # System time : 0.004 s
% 0.21/1.41 # Total time : 0.130 s
% 0.21/1.41 # Maximum resident set size: 6492 pages
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.41 eprover: CPU time limit exceeded, terminating
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------