TSTP Solution File: PRO014+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO014+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 25 unt; 0 def)
% Number of atoms : 309 ( 9 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 379 ( 146 ~; 164 |; 58 &)
% ( 4 <=>; 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 : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 122 ( 8 sgn 59 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X107,X108] :
( ( occurrence_of(X108,tptp0)
& subactivity_occurrence(X107,X108)
& arboreal(X107)
& ~ leaf_occ(X107,X108) )
=> ? [X109,X110] :
( occurrence_of(X109,tptp3)
& next_subocc(X107,X109,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& min_precedes(X109,X110,tptp0)
& leaf(X110,tptp0) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X102,X103] :
( ( occurrence_of(X103,tptp0)
& subactivity_occurrence(X102,X103)
& arboreal(X102)
& ~ leaf_occ(X102,X103) )
=> ? [X104,X105,X106] :
( occurrence_of(X104,tptp3)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X104,X105,tptp0)
& ( occurrence_of(X106,tptp2)
| occurrence_of(X106,tptp1) )
& next_subocc(X105,X106,tptp0)
& leaf(X106,tptp0) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_32) ).
fof(sos_26,axiom,
! [X79,X80,X81] :
( next_subocc(X79,X80,X81)
<=> ( min_precedes(X79,X80,X81)
& ~ ? [X82] :
( min_precedes(X79,X82,X81)
& min_precedes(X82,X80,X81) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_26) ).
fof(sos_07,axiom,
! [X26,X27] :
( ( leaf(X26,X27)
& ~ atomic(X27) )
=> ? [X28] :
( occurrence_of(X28,X27)
& leaf_occ(X26,X28) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_07) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_34) ).
fof(sos_27,axiom,
! [X83,X84,X85,X86] :
( ( min_precedes(X83,X84,X85)
& occurrence_of(X86,X85)
& subactivity_occurrence(X84,X86) )
=> subactivity_occurrence(X83,X86) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_27) ).
fof(sos_18,axiom,
! [X56,X57] :
( leaf_occ(X56,X57)
<=> ? [X58] :
( occurrence_of(X57,X58)
& subactivity_occurrence(X56,X57)
& leaf(X56,X58) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_18) ).
fof(sos_02,axiom,
! [X9,X10,X11,X12] :
( ( occurrence_of(X10,X9)
& subactivity_occurrence(X11,X10)
& leaf_occ(X12,X10)
& arboreal(X11)
& ~ min_precedes(X11,X12,X9) )
=> X12 = X11 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_02) ).
fof(sos_16,axiom,
! [X52,X53] :
( occurrence_of(X52,X53)
=> ( arboreal(X52)
<=> atomic(X53) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_16) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_38) ).
fof(sos_15,axiom,
! [X48,X49] :
( leaf(X48,X49)
<=> ( ( root(X48,X49)
| ? [X50] : min_precedes(X50,X48,X49) )
& ~ ? [X51] : min_precedes(X48,X51,X49) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_15) ).
fof(c_0_11,negated_conjecture,
~ ! [X107,X108] :
( ( occurrence_of(X108,tptp0)
& subactivity_occurrence(X107,X108)
& arboreal(X107)
& ~ leaf_occ(X107,X108) )
=> ? [X109,X110] :
( occurrence_of(X109,tptp3)
& next_subocc(X107,X109,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& min_precedes(X109,X110,tptp0)
& leaf(X110,tptp0) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
! [X107,X108] :
( ( occurrence_of(esk7_1(X107),tptp3)
| ~ occurrence_of(X108,tptp0)
| ~ subactivity_occurrence(X107,X108)
| ~ arboreal(X107)
| leaf_occ(X107,X108) )
& ( next_subocc(X107,esk7_1(X107),tptp0)
| ~ occurrence_of(X108,tptp0)
| ~ subactivity_occurrence(X107,X108)
| ~ arboreal(X107)
| leaf_occ(X107,X108) )
& ( occurrence_of(esk8_1(X107),tptp4)
| ~ occurrence_of(X108,tptp0)
| ~ subactivity_occurrence(X107,X108)
| ~ arboreal(X107)
| leaf_occ(X107,X108) )
& ( next_subocc(esk7_1(X107),esk8_1(X107),tptp0)
| ~ occurrence_of(X108,tptp0)
| ~ subactivity_occurrence(X107,X108)
| ~ arboreal(X107)
| leaf_occ(X107,X108) )
& ( occurrence_of(esk9_1(X107),tptp2)
| occurrence_of(esk9_1(X107),tptp1)
| ~ occurrence_of(X108,tptp0)
| ~ subactivity_occurrence(X107,X108)
| ~ arboreal(X107)
| leaf_occ(X107,X108) )
& ( next_subocc(esk8_1(X107),esk9_1(X107),tptp0)
| ~ occurrence_of(X108,tptp0)
| ~ subactivity_occurrence(X107,X108)
| ~ arboreal(X107)
| leaf_occ(X107,X108) )
& ( leaf(esk9_1(X107),tptp0)
| ~ occurrence_of(X108,tptp0)
| ~ subactivity_occurrence(X107,X108)
| ~ arboreal(X107)
| leaf_occ(X107,X108) ) ),
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_32])])])])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X113,X114] :
( occurrence_of(esk2_0,tptp0)
& subactivity_occurrence(esk1_0,esk2_0)
& arboreal(esk1_0)
& ~ leaf_occ(esk1_0,esk2_0)
& ( ~ occurrence_of(X114,tptp2)
| ~ occurrence_of(X113,tptp3)
| ~ next_subocc(esk1_0,X113,tptp0)
| ~ min_precedes(X113,X114,tptp0)
| ~ leaf(X114,tptp0) )
& ( ~ occurrence_of(X114,tptp1)
| ~ occurrence_of(X113,tptp3)
| ~ next_subocc(esk1_0,X113,tptp0)
| ~ min_precedes(X113,X114,tptp0)
| ~ leaf(X114,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(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]) ).
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)
| 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_17,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]) ).
fof(c_0_18,plain,
! [X83,X84,X85,X86,X83,X84,X85] :
( ( min_precedes(X83,X84,X85)
| ~ next_subocc(X83,X84,X85) )
& ( ~ min_precedes(X83,X86,X85)
| ~ min_precedes(X86,X84,X85)
| ~ next_subocc(X83,X84,X85) )
& ( min_precedes(X83,esk10_3(X83,X84,X85),X85)
| ~ min_precedes(X83,X84,X85)
| next_subocc(X83,X84,X85) )
& ( min_precedes(esk10_3(X83,X84,X85),X84,X85)
| ~ min_precedes(X83,X84,X85)
| next_subocc(X83,X84,X85) ) ),
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_26])])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( next_subocc(esk8_1(X1),esk9_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X29,X30] :
( ( occurrence_of(esk3_2(X29,X30),X30)
| ~ leaf(X29,X30)
| atomic(X30) )
& ( leaf_occ(X29,esk3_2(X29,X30))
| ~ leaf(X29,X30)
| atomic(X30) ) ),
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_07])])])])])])]) ).
cnf(c_0_24,negated_conjecture,
( leaf(esk9_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_25,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_26,negated_conjecture,
( next_subocc(esk7_1(X1),esk8_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
fof(c_0_27,plain,
! [X87,X88,X89,X90] :
( ~ min_precedes(X87,X88,X89)
| ~ occurrence_of(X90,X89)
| ~ subactivity_occurrence(X88,X90)
| subactivity_occurrence(X87,X90) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_27])]) ).
cnf(c_0_28,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,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_19,c_0_20]),c_0_21])]),c_0_22]) ).
fof(c_0_30,plain,
! [X59,X60,X59,X60,X62] :
( ( occurrence_of(X60,esk6_2(X59,X60))
| ~ leaf_occ(X59,X60) )
& ( subactivity_occurrence(X59,X60)
| ~ leaf_occ(X59,X60) )
& ( leaf(X59,esk6_2(X59,X60))
| ~ leaf_occ(X59,X60) )
& ( ~ occurrence_of(X60,X62)
| ~ subactivity_occurrence(X59,X60)
| ~ leaf(X59,X62)
| leaf_occ(X59,X60) ) ),
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_18])])])])])])]) ).
cnf(c_0_31,plain,
( atomic(X1)
| leaf_occ(X2,esk3_2(X2,X1))
| ~ leaf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,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_24,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_33,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,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_26,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_35,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_27]) ).
cnf(c_0_36,negated_conjecture,
min_precedes(esk8_1(esk1_0),esk9_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
leaf_occ(esk9_1(esk1_0),esk3_2(esk9_1(esk1_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,plain,
( atomic(X1)
| occurrence_of(esk3_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_40,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]) ).
fof(c_0_41,plain,
! [X13,X14,X15,X16] :
( ~ occurrence_of(X14,X13)
| ~ subactivity_occurrence(X15,X14)
| ~ leaf_occ(X16,X14)
| ~ arboreal(X15)
| min_precedes(X15,X16,X13)
| X16 = X15 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_02])])]) ).
cnf(c_0_42,negated_conjecture,
min_precedes(esk7_1(esk1_0),esk8_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( subactivity_occurrence(esk8_1(esk1_0),X1)
| ~ subactivity_occurrence(esk9_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
subactivity_occurrence(esk9_1(esk1_0),esk3_2(esk9_1(esk1_0),tptp0)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
occurrence_of(esk3_2(esk9_1(esk1_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_33]) ).
fof(c_0_46,plain,
! [X54,X55] :
( ( ~ arboreal(X54)
| atomic(X55)
| ~ occurrence_of(X54,X55) )
& ( ~ atomic(X55)
| arboreal(X54)
| ~ occurrence_of(X54,X55) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])]) ).
cnf(c_0_47,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk7_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_15]) ).
cnf(c_0_48,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_49,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_41]) ).
cnf(c_0_50,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_35,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
subactivity_occurrence(esk8_1(esk1_0),esk3_2(esk9_1(esk1_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_52,plain,
( arboreal(X1)
| ~ occurrence_of(X1,X2)
| ~ atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,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_47,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_54,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_55,negated_conjecture,
( next_subocc(X1,esk7_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_15]) ).
cnf(c_0_56,negated_conjecture,
( esk9_1(esk1_0) = X1
| min_precedes(X1,esk9_1(esk1_0),X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk3_2(esk9_1(esk1_0),tptp0))
| ~ occurrence_of(esk3_2(esk9_1(esk1_0),tptp0),X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_57,negated_conjecture,
subactivity_occurrence(esk7_1(esk1_0),esk3_2(esk9_1(esk1_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_45])]) ).
cnf(c_0_58,negated_conjecture,
arboreal(esk7_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_59,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_60,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_55,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_61,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk7_1(esk1_0),esk9_1(esk1_0),X1)
| ~ occurrence_of(esk3_2(esk9_1(esk1_0),tptp0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_62,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_63,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]) ).
fof(c_0_64,plain,
! [X52,X53,X55,X52,X53,X56] :
( ( root(X52,X53)
| min_precedes(esk4_2(X52,X53),X52,X53)
| ~ leaf(X52,X53) )
& ( ~ min_precedes(X52,X55,X53)
| ~ leaf(X52,X53) )
& ( ~ root(X52,X53)
| min_precedes(X52,esk5_2(X52,X53),X53)
| leaf(X52,X53) )
& ( ~ min_precedes(X56,X52,X53)
| min_precedes(X52,esk5_2(X52,X53),X53)
| leaf(X52,X53) ) ),
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_15])])])])])])]) ).
cnf(c_0_65,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_59,c_0_60]),c_0_53])]) ).
cnf(c_0_66,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| min_precedes(esk7_1(esk1_0),esk9_1(esk1_0),tptp0) ),
inference(spm,[status(thm)],[c_0_61,c_0_45]) ).
cnf(c_0_67,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk9_1(X1),tptp2)
| occurrence_of(esk9_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_15]) ).
cnf(c_0_68,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_63,c_0_60]),c_0_53])]) ).
cnf(c_0_69,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( esk7_1(esk1_0) = esk9_1(esk1_0)
| ~ occurrence_of(esk9_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_32])]) ).
cnf(c_0_71,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_67,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_72,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_68,c_0_66]),c_0_32])]) ).
cnf(c_0_73,negated_conjecture,
~ leaf(esk7_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_69,c_0_42]) ).
cnf(c_0_74,negated_conjecture,
esk7_1(esk1_0) = esk9_1(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PRO014+4 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 02:24:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.25/1.42 # Preprocessing time : 0.017 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 76
% 0.25/1.42 # Proof object clause steps : 54
% 0.25/1.42 # Proof object formula steps : 22
% 0.25/1.42 # Proof object conjectures : 41
% 0.25/1.42 # Proof object clause conjectures : 38
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 22
% 0.25/1.42 # Proof object initial formulas used : 11
% 0.25/1.42 # Proof object generating inferences : 31
% 0.25/1.42 # Proof object simplifying inferences : 40
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 46
% 0.25/1.42 # Removed by relevancy pruning/SinE : 17
% 0.25/1.42 # Initial clauses : 56
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 56
% 0.25/1.42 # Processed clauses : 627
% 0.25/1.42 # ...of these trivial : 9
% 0.25/1.42 # ...subsumed : 77
% 0.25/1.42 # ...remaining for further processing : 541
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 4
% 0.25/1.42 # Backward-rewritten : 194
% 0.25/1.42 # Generated clauses : 1654
% 0.25/1.42 # ...of the previous two non-trivial : 1607
% 0.25/1.42 # Contextual simplify-reflections : 37
% 0.25/1.42 # Paramodulations : 1653
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 342
% 0.25/1.42 # Positive orientable unit clauses : 77
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 40
% 0.25/1.42 # Non-unit-clauses : 225
% 0.25/1.42 # Current number of unprocessed clauses: 657
% 0.25/1.42 # ...number of literals in the above : 2121
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 199
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 12807
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 7320
% 0.25/1.42 # Non-unit clause-clause subsumptions : 70
% 0.25/1.42 # Unit Clause-clause subsumption calls : 1464
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 44
% 0.25/1.42 # BW rewrite match successes : 16
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 45723
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.084 s
% 0.25/1.42 # System time : 0.005 s
% 0.25/1.42 # Total time : 0.089 s
% 0.25/1.42 # Maximum resident set size: 5516 pages
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: CPU time limit exceeded, terminating
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------