TSTP Solution File: PRO014+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO014+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:03 EDT 2022
% Result : Theorem 0.28s 6.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 80 ( 27 unt; 0 def)
% Number of atoms : 320 ( 13 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 377 ( 137 ~; 176 |; 54 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 120 ( 6 sgn 54 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X111,X112] :
( ( occurrence_of(X112,tptp0)
& subactivity_occurrence(X111,X112)
& arboreal(X111)
& ~ leaf_occ(X111,X112) )
=> ? [X113,X114] :
( occurrence_of(X113,tptp3)
& next_subocc(X111,X113,tptp0)
& ( occurrence_of(X114,tptp2)
| occurrence_of(X114,tptp1) )
& min_precedes(X113,X114,tptp0)
& leaf(X114,tptp0) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106,X107] :
( ( occurrence_of(X107,tptp0)
& subactivity_occurrence(X106,X107)
& arboreal(X106)
& ~ leaf_occ(X106,X107) )
=> ? [X108,X109,X110] :
( occurrence_of(X108,tptp3)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X109,tptp4)
& next_subocc(X108,X109,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& next_subocc(X109,X110,tptp0)
& leaf(X110,tptp0) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_35) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_22) ).
fof(sos_29,axiom,
! [X84,X85,X86,X87] :
( ( min_precedes(X84,X85,X86)
& occurrence_of(X87,X86)
& subactivity_occurrence(X85,X87) )
=> subactivity_occurrence(X84,X87) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_29) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_25) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_07) ).
fof(sos_28,axiom,
! [X80,X81,X82,X83] :
( ( occurrence_of(X81,X80)
& arboreal(X82)
& arboreal(X83)
& subactivity_occurrence(X82,X81)
& subactivity_occurrence(X83,X81) )
=> ( min_precedes(X82,X83,X80)
| min_precedes(X83,X82,X80)
| X82 = X83 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_28) ).
fof(sos_41,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_41) ).
fof(sos_40,axiom,
atomic(tptp1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_40) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_21) ).
fof(sos_39,axiom,
atomic(tptp2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_39) ).
fof(c_0_11,negated_conjecture,
~ ! [X111,X112] :
( ( occurrence_of(X112,tptp0)
& subactivity_occurrence(X111,X112)
& arboreal(X111)
& ~ leaf_occ(X111,X112) )
=> ? [X113,X114] :
( occurrence_of(X113,tptp3)
& next_subocc(X111,X113,tptp0)
& ( occurrence_of(X114,tptp2)
| occurrence_of(X114,tptp1) )
& min_precedes(X113,X114,tptp0)
& leaf(X114,tptp0) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
! [X111,X112] :
( ( occurrence_of(esk7_1(X111),tptp3)
| ~ occurrence_of(X112,tptp0)
| ~ subactivity_occurrence(X111,X112)
| ~ arboreal(X111)
| leaf_occ(X111,X112) )
& ( next_subocc(X111,esk7_1(X111),tptp0)
| ~ occurrence_of(X112,tptp0)
| ~ subactivity_occurrence(X111,X112)
| ~ arboreal(X111)
| leaf_occ(X111,X112) )
& ( occurrence_of(esk8_1(X111),tptp4)
| ~ occurrence_of(X112,tptp0)
| ~ subactivity_occurrence(X111,X112)
| ~ arboreal(X111)
| leaf_occ(X111,X112) )
& ( next_subocc(esk7_1(X111),esk8_1(X111),tptp0)
| ~ occurrence_of(X112,tptp0)
| ~ subactivity_occurrence(X111,X112)
| ~ arboreal(X111)
| leaf_occ(X111,X112) )
& ( occurrence_of(esk9_1(X111),tptp2)
| occurrence_of(esk9_1(X111),tptp1)
| ~ occurrence_of(X112,tptp0)
| ~ subactivity_occurrence(X111,X112)
| ~ arboreal(X111)
| leaf_occ(X111,X112) )
& ( next_subocc(esk8_1(X111),esk9_1(X111),tptp0)
| ~ occurrence_of(X112,tptp0)
| ~ subactivity_occurrence(X111,X112)
| ~ arboreal(X111)
| leaf_occ(X111,X112) )
& ( leaf(esk9_1(X111),tptp0)
| ~ occurrence_of(X112,tptp0)
| ~ subactivity_occurrence(X111,X112)
| ~ arboreal(X111)
| leaf_occ(X111,X112) ) ),
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_35])])])])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X117,X118] :
( occurrence_of(esk2_0,tptp0)
& subactivity_occurrence(esk1_0,esk2_0)
& arboreal(esk1_0)
& ~ leaf_occ(esk1_0,esk2_0)
& ( ~ occurrence_of(X118,tptp2)
| ~ occurrence_of(X117,tptp3)
| ~ next_subocc(esk1_0,X117,tptp0)
| ~ min_precedes(X117,X118,tptp0)
| ~ leaf(X118,tptp0) )
& ( ~ occurrence_of(X118,tptp1)
| ~ occurrence_of(X117,tptp3)
| ~ next_subocc(esk1_0,X117,tptp0)
| ~ min_precedes(X117,X118,tptp0)
| ~ leaf(X118,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)],[inference(fof_simplification,[status(thm)],[c_0_11])])])])])])])]) ).
cnf(c_0_14,plain,
( leaf_occ(X1,X2)
| next_subocc(esk7_1(X1),esk8_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( leaf_occ(X1,X2)
| next_subocc(esk8_1(X1),esk9_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,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,esk6_3(X65,X66,X67),X67)
| ~ min_precedes(X65,X66,X67)
| next_subocc(X65,X66,X67) )
& ( min_precedes(esk6_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])])])])])])]) ).
cnf(c_0_18,negated_conjecture,
( leaf_occ(X1,esk2_0)
| next_subocc(esk7_1(X1),esk8_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( leaf_occ(X1,esk2_0)
| next_subocc(esk8_1(X1),esk9_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_23,plain,
! [X88,X89,X90,X91] :
( ~ min_precedes(X88,X89,X90)
| ~ occurrence_of(X91,X90)
| ~ subactivity_occurrence(X89,X91)
| subactivity_occurrence(X88,X91) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])]) ).
cnf(c_0_24,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
next_subocc(esk7_1(esk1_0),esk8_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
fof(c_0_26,plain,
! [X74,X75,X76] :
( ( occurrence_of(esk5_3(X74,X75,X76),X74)
| ~ min_precedes(X75,X76,X74) )
& ( subactivity_occurrence(X75,esk5_3(X74,X75,X76))
| ~ min_precedes(X75,X76,X74) )
& ( subactivity_occurrence(X76,esk5_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_27,negated_conjecture,
next_subocc(esk8_1(esk1_0),esk9_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_28,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk7_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,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_23]) ).
cnf(c_0_30,negated_conjecture,
min_precedes(esk7_1(esk1_0),esk8_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( subactivity_occurrence(X1,esk5_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
min_precedes(esk8_1(esk1_0),esk9_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_33,plain,
( occurrence_of(esk5_3(X3,X1,X2),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_34,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_35,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk7_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
fof(c_0_36,plain,
! [X84,X85,X86,X87] :
( ~ occurrence_of(X85,X84)
| ~ arboreal(X86)
| ~ arboreal(X87)
| ~ subactivity_occurrence(X86,X85)
| ~ subactivity_occurrence(X87,X85)
| min_precedes(X86,X87,X84)
| min_precedes(X87,X86,X84)
| X86 = X87 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_28])]) ).
cnf(c_0_37,negated_conjecture,
( subactivity_occurrence(esk7_1(esk1_0),X1)
| ~ subactivity_occurrence(esk8_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
subactivity_occurrence(esk8_1(esk1_0),esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
occurrence_of(esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_40,plain,
( arboreal(X1)
| ~ occurrence_of(X1,X2)
| ~ atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
occurrence_of(esk7_1(esk1_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_42,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_41]) ).
cnf(c_0_43,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk9_1(X1),tptp1)
| occurrence_of(esk9_1(X1),tptp2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| min_precedes(X1,X2,X3)
| ~ subactivity_occurrence(X2,X4)
| ~ subactivity_occurrence(X1,X4)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,negated_conjecture,
subactivity_occurrence(esk7_1(esk1_0),esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_46,negated_conjecture,
arboreal(esk7_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_47,plain,
( subactivity_occurrence(X2,esk5_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_48,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk9_1(X1),tptp2)
| occurrence_of(esk9_1(X1),tptp1)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_15]) ).
cnf(c_0_49,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk7_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_50,negated_conjecture,
( X1 = esk7_1(esk1_0)
| min_precedes(esk7_1(esk1_0),X1,X2)
| min_precedes(X1,esk7_1(esk1_0),X2)
| ~ subactivity_occurrence(X1,esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0)))
| ~ arboreal(X1)
| ~ occurrence_of(esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0)),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_51,negated_conjecture,
subactivity_occurrence(esk9_1(esk1_0),esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0))),
inference(spm,[status(thm)],[c_0_47,c_0_32]) ).
cnf(c_0_52,negated_conjecture,
( occurrence_of(esk9_1(esk1_0),tptp1)
| occurrence_of(esk9_1(esk1_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_53,plain,
atomic(tptp1),
inference(split_conjunct,[status(thm)],[sos_40]) ).
cnf(c_0_54,negated_conjecture,
( leaf_occ(X1,esk2_0)
| next_subocc(X1,esk7_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_15]) ).
cnf(c_0_55,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk9_1(esk1_0),esk7_1(esk1_0),X1)
| min_precedes(esk7_1(esk1_0),esk9_1(esk1_0),X1)
| ~ arboreal(esk9_1(esk1_0))
| ~ occurrence_of(esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( arboreal(esk9_1(esk1_0))
| occurrence_of(esk9_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_52]),c_0_53])]) ).
cnf(c_0_57,plain,
( leaf_occ(X1,X2)
| leaf(esk9_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_58,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk1_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_59,negated_conjecture,
next_subocc(esk1_0,esk7_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_60,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk7_1(esk1_0),esk9_1(esk1_0),X1)
| min_precedes(esk9_1(esk1_0),esk7_1(esk1_0),X1)
| occurrence_of(esk9_1(esk1_0),tptp2)
| ~ occurrence_of(esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( leaf_occ(X1,esk2_0)
| leaf(esk9_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_15]) ).
fof(c_0_62,plain,
! [X61,X62,X64,X61,X62,X65] :
( ( root(X61,X62)
| min_precedes(esk3_2(X61,X62),X61,X62)
| ~ leaf(X61,X62) )
& ( ~ min_precedes(X61,X64,X62)
| ~ leaf(X61,X62) )
& ( ~ root(X61,X62)
| min_precedes(X61,esk4_2(X61,X62),X62)
| leaf(X61,X62) )
& ( ~ min_precedes(X65,X61,X62)
| min_precedes(X61,esk4_2(X61,X62),X62)
| leaf(X61,X62) ) ),
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_21])])])])])])]) ).
cnf(c_0_63,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(esk7_1(esk1_0),X1,tptp0)
| ~ occurrence_of(X1,tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_41])]) ).
cnf(c_0_64,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk9_1(esk1_0),esk7_1(esk1_0),tptp0)
| min_precedes(esk7_1(esk1_0),esk9_1(esk1_0),tptp0)
| occurrence_of(esk9_1(esk1_0),tptp2) ),
inference(spm,[status(thm)],[c_0_60,c_0_39]) ).
cnf(c_0_65,negated_conjecture,
leaf(esk9_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_66,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk9_1(esk1_0),esk7_1(esk1_0),tptp0)
| occurrence_of(esk9_1(esk1_0),tptp2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),c_0_52]) ).
cnf(c_0_68,negated_conjecture,
~ leaf(esk7_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_66,c_0_30]) ).
cnf(c_0_69,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| occurrence_of(esk9_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_65])]) ).
cnf(c_0_70,negated_conjecture,
occurrence_of(esk9_1(esk1_0),tptp2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_65])]) ).
cnf(c_0_71,plain,
atomic(tptp2),
inference(split_conjunct,[status(thm)],[sos_39]) ).
cnf(c_0_72,negated_conjecture,
arboreal(esk9_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_70]),c_0_71])]) ).
cnf(c_0_73,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk1_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_74,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk7_1(esk1_0),esk9_1(esk1_0),X1)
| min_precedes(esk9_1(esk1_0),esk7_1(esk1_0),X1)
| ~ occurrence_of(esk5_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_72])]) ).
cnf(c_0_75,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(esk7_1(esk1_0),X1,tptp0)
| ~ occurrence_of(X1,tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_59]),c_0_41])]) ).
cnf(c_0_76,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk9_1(esk1_0),esk7_1(esk1_0),tptp0)
| min_precedes(esk7_1(esk1_0),esk9_1(esk1_0),tptp0) ),
inference(spm,[status(thm)],[c_0_74,c_0_39]) ).
cnf(c_0_77,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk9_1(esk1_0),esk7_1(esk1_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_65]),c_0_70])]) ).
cnf(c_0_78,negated_conjecture,
esk7_1(esk1_0) = esk9_1(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_77]),c_0_65])]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_78]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : PRO014+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 02:34:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.28/6.46 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.28/6.46 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.28/6.46 # Preprocessing time : 0.018 s
% 0.28/6.46
% 0.28/6.46 # Proof found!
% 0.28/6.46 # SZS status Theorem
% 0.28/6.46 # SZS output start CNFRefutation
% See solution above
% 0.28/6.47 # Proof object total steps : 80
% 0.28/6.47 # Proof object clause steps : 60
% 0.28/6.47 # Proof object formula steps : 20
% 0.28/6.47 # Proof object conjectures : 46
% 0.28/6.47 # Proof object clause conjectures : 43
% 0.28/6.47 # Proof object formula conjectures : 3
% 0.28/6.47 # Proof object initial clauses used : 23
% 0.28/6.47 # Proof object initial formulas used : 11
% 0.28/6.47 # Proof object generating inferences : 35
% 0.28/6.47 # Proof object simplifying inferences : 49
% 0.28/6.47 # Training examples: 0 positive, 0 negative
% 0.28/6.47 # Parsed axioms : 49
% 0.28/6.47 # Removed by relevancy pruning/SinE : 17
% 0.28/6.47 # Initial clauses : 58
% 0.28/6.47 # Removed in clause preprocessing : 0
% 0.28/6.47 # Initial clauses in saturation : 58
% 0.28/6.47 # Processed clauses : 11668
% 0.28/6.47 # ...of these trivial : 73
% 0.28/6.47 # ...subsumed : 2442
% 0.28/6.47 # ...remaining for further processing : 9153
% 0.28/6.47 # Other redundant clauses eliminated : 0
% 0.28/6.47 # Clauses deleted for lack of memory : 0
% 0.28/6.47 # Backward-subsumed : 295
% 0.28/6.47 # Backward-rewritten : 4034
% 0.28/6.47 # Generated clauses : 46275
% 0.28/6.47 # ...of the previous two non-trivial : 47209
% 0.28/6.47 # Contextual simplify-reflections : 4603
% 0.28/6.47 # Paramodulations : 46256
% 0.28/6.47 # Factorizations : 0
% 0.28/6.47 # Equation resolutions : 0
% 0.28/6.47 # Current number of processed clauses : 4805
% 0.28/6.47 # Positive orientable unit clauses : 356
% 0.28/6.47 # Positive unorientable unit clauses: 0
% 0.28/6.47 # Negative unit clauses : 121
% 0.28/6.47 # Non-unit-clauses : 4328
% 0.28/6.47 # Current number of unprocessed clauses: 18003
% 0.28/6.47 # ...number of literals in the above : 87887
% 0.28/6.47 # Current number of archived formulas : 0
% 0.28/6.47 # Current number of archived clauses : 4348
% 0.28/6.47 # Clause-clause subsumption calls (NU) : 3933849
% 0.28/6.47 # Rec. Clause-clause subsumption calls : 421854
% 0.28/6.47 # Non-unit clause-clause subsumptions : 6258
% 0.28/6.47 # Unit Clause-clause subsumption calls : 155055
% 0.28/6.47 # Rewrite failures with RHS unbound : 0
% 0.28/6.47 # BW rewrite match attempts : 5609
% 0.28/6.47 # BW rewrite match successes : 80
% 0.28/6.47 # Condensation attempts : 0
% 0.28/6.47 # Condensation successes : 0
% 0.28/6.47 # Termbank termtop insertions : 2038632
% 0.28/6.47
% 0.28/6.47 # -------------------------------------------------
% 0.28/6.47 # User time : 5.281 s
% 0.28/6.47 # System time : 0.041 s
% 0.28/6.47 # Total time : 5.322 s
% 0.28/6.47 # Maximum resident set size: 56216 pages
% 0.28/23.43 eprover: CPU time limit exceeded, terminating
% 0.28/23.43 eprover: CPU time limit exceeded, terminating
% 0.28/23.44 eprover: CPU time limit exceeded, terminating
% 0.28/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.44 eprover: No such file or directory
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------