%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO018+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:07 EDT 2022
% Result : Theorem 0.17s 1.36s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 73 ( 25 unt; 0 def)
% Number of atoms : 391 ( 24 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 521 ( 203 ~; 228 |; 74 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 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 : 120 ( 7 sgn 51 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X108,X109] :
( ( occurrence_of(X109,tptp0)
& subactivity_occurrence(X108,X109)
& arboreal(X108)
& ~ leaf_occ(X108,X109) )
=> ? [X110,X111] :
( occurrence_of(X110,tptp3)
& next_subocc(X108,X110,tptp0)
& ( occurrence_of(X111,tptp1)
| occurrence_of(X111,tptp2) )
& min_precedes(X110,X111,tptp0)
& leaf_occ(X111,X109)
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( occurrence_of(X112,tptp2)
& min_precedes(X110,X112,tptp0) ) )
& ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( occurrence_of(X113,tptp1)
& min_precedes(X110,X113,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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)
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X106,tptp1)
| occurrence_of(X106,tptp2) )
& min_precedes(X105,X106,tptp0)
& ! [X107] :
( min_precedes(X104,X107,tptp0)
=> ( X107 = X105
| X107 = X106 ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_32) ).
fof(sos_09,axiom,
! [X32,X33,X34] :
( ( occurrence_of(X32,X34)
& leaf_occ(X33,X32) )
=> ~ ? [X35] : min_precedes(X33,X35,X34) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_09) ).
fof(sos_06,axiom,
! [X22,X23,X24] :
( min_precedes(X23,X24,X22)
=> ? [X25] :
( occurrence_of(X25,X22)
& subactivity_occurrence(X23,X25)
& subactivity_occurrence(X24,X25) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_06) ).
fof(sos_16,axiom,
! [X52,X53] :
( occurrence_of(X52,X53)
=> ( arboreal(X52)
<=> atomic(X53) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_16) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_38) ).
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.mepo_128.in',sos_26) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X30)
& occurrence_of(X29,X31) )
=> X30 = X31 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_08) ).
fof(sos_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( activity(X43)
& occurrence_of(X42,X43) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_12) ).
fof(sos_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity(X13)
& activity_occurrence(X14) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_03) ).
fof(sos_43,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_43) ).
fof(sos_39,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_39) ).
fof(sos_42,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_42) ).
fof(c_0_13,negated_conjecture,
~ ! [X108,X109] :
( ( occurrence_of(X109,tptp0)
& subactivity_occurrence(X108,X109)
& arboreal(X108)
& ~ leaf_occ(X108,X109) )
=> ? [X110,X111] :
( occurrence_of(X110,tptp3)
& next_subocc(X108,X110,tptp0)
& ( occurrence_of(X111,tptp1)
| occurrence_of(X111,tptp2) )
& min_precedes(X110,X111,tptp0)
& leaf_occ(X111,X109)
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( occurrence_of(X112,tptp2)
& min_precedes(X110,X112,tptp0) ) )
& ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( occurrence_of(X113,tptp1)
& min_precedes(X110,X113,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X108,X109,X113] :
( ( occurrence_of(esk6_1(X108),tptp3)
| ~ occurrence_of(X109,tptp0)
| ~ subactivity_occurrence(X108,X109)
| ~ arboreal(X108)
| leaf_occ(X108,X109) )
& ( next_subocc(X108,esk6_1(X108),tptp0)
| ~ occurrence_of(X109,tptp0)
| ~ subactivity_occurrence(X108,X109)
| ~ arboreal(X108)
| leaf_occ(X108,X109) )
& ( occurrence_of(esk7_1(X108),tptp4)
| ~ occurrence_of(X109,tptp0)
| ~ subactivity_occurrence(X108,X109)
| ~ arboreal(X108)
| leaf_occ(X108,X109) )
& ( min_precedes(esk6_1(X108),esk7_1(X108),tptp0)
| ~ occurrence_of(X109,tptp0)
| ~ subactivity_occurrence(X108,X109)
| ~ arboreal(X108)
| leaf_occ(X108,X109) )
& ( occurrence_of(esk8_1(X108),tptp1)
| occurrence_of(esk8_1(X108),tptp2)
| ~ occurrence_of(X109,tptp0)
| ~ subactivity_occurrence(X108,X109)
| ~ arboreal(X108)
| leaf_occ(X108,X109) )
& ( min_precedes(esk7_1(X108),esk8_1(X108),tptp0)
| ~ occurrence_of(X109,tptp0)
| ~ subactivity_occurrence(X108,X109)
| ~ arboreal(X108)
| leaf_occ(X108,X109) )
& ( ~ min_precedes(esk6_1(X108),X113,tptp0)
| X113 = esk7_1(X108)
| X113 = esk8_1(X108)
| ~ occurrence_of(X109,tptp0)
| ~ subactivity_occurrence(X108,X109)
| ~ arboreal(X108)
| leaf_occ(X108,X109) ) ),
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_15,negated_conjecture,
! [X116,X117] :
( occurrence_of(esk2_0,tptp0)
& subactivity_occurrence(esk1_0,esk2_0)
& arboreal(esk1_0)
& ~ leaf_occ(esk1_0,esk2_0)
& ( occurrence_of(X117,tptp2)
| occurrence_of(X117,tptp1)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(esk4_2(X116,X117),tptp1)
| occurrence_of(X117,tptp1)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( min_precedes(X116,esk4_2(X116,X117),tptp0)
| occurrence_of(X117,tptp1)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(X117,tptp2)
| occurrence_of(esk3_2(X116,X117),tptp2)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(esk4_2(X116,X117),tptp1)
| occurrence_of(esk3_2(X116,X117),tptp2)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( min_precedes(X116,esk4_2(X116,X117),tptp0)
| occurrence_of(esk3_2(X116,X117),tptp2)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(X117,tptp2)
| min_precedes(X116,esk3_2(X116,X117),tptp0)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(esk4_2(X116,X117),tptp1)
| min_precedes(X116,esk3_2(X116,X117),tptp0)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( min_precedes(X116,esk4_2(X116,X117),tptp0)
| min_precedes(X116,esk3_2(X116,X117),tptp0)
| ~ occurrence_of(X117,tptp1)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(X117,tptp2)
| occurrence_of(X117,tptp1)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(esk4_2(X116,X117),tptp1)
| occurrence_of(X117,tptp1)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( min_precedes(X116,esk4_2(X116,X117),tptp0)
| occurrence_of(X117,tptp1)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(X117,tptp2)
| occurrence_of(esk3_2(X116,X117),tptp2)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(esk4_2(X116,X117),tptp1)
| occurrence_of(esk3_2(X116,X117),tptp2)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( min_precedes(X116,esk4_2(X116,X117),tptp0)
| occurrence_of(esk3_2(X116,X117),tptp2)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(X117,tptp2)
| min_precedes(X116,esk3_2(X116,X117),tptp0)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( occurrence_of(esk4_2(X116,X117),tptp1)
| min_precedes(X116,esk3_2(X116,X117),tptp0)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) )
& ( min_precedes(X116,esk4_2(X116,X117),tptp0)
| min_precedes(X116,esk3_2(X116,X117),tptp0)
| ~ occurrence_of(X117,tptp2)
| ~ occurrence_of(X116,tptp3)
| ~ next_subocc(esk1_0,X116,tptp0)
| ~ min_precedes(X116,X117,tptp0)
| ~ leaf_occ(X117,esk2_0) ) ),
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_13])])])])])])])]) ).
fof(c_0_16,plain,
! [X36,X37,X38,X39] :
( ~ occurrence_of(X36,X38)
| ~ leaf_occ(X37,X36)
| ~ min_precedes(X37,X39,X38) ),
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_09])])])])]) ).
cnf(c_0_17,plain,
( leaf_occ(X1,X2)
| min_precedes(esk6_1(X1),esk7_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X26,X27,X28] :
( ( occurrence_of(esk5_3(X26,X27,X28),X26)
| ~ min_precedes(X27,X28,X26) )
& ( subactivity_occurrence(X27,esk5_3(X26,X27,X28))
| ~ min_precedes(X27,X28,X26) )
& ( subactivity_occurrence(X28,esk5_3(X26,X27,X28))
| ~ min_precedes(X27,X28,X26) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])])])])]) ).
fof(c_0_23,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_24,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk6_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf_occ(X1,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
min_precedes(esk6_1(esk1_0),esk7_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_27,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk6_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,plain,
( subactivity_occurrence(X1,esk5_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( arboreal(X1)
| ~ occurrence_of(X1,X2)
| ~ atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
occurrence_of(esk6_1(esk1_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_31,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_32,negated_conjecture,
( ~ leaf_occ(esk6_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( next_subocc(X1,esk6_1(X1),tptp0)
| leaf_occ(X1,esk5_3(X2,X1,X3))
| ~ arboreal(X1)
| ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(esk5_3(X2,X1,X3),tptp0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
arboreal(esk6_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
( next_subocc(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0)
| ~ min_precedes(esk6_1(esk1_0),X1,X2)
| ~ occurrence_of(esk5_3(X2,esk6_1(esk1_0),X1),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,plain,
( occurrence_of(esk5_3(X3,X1,X2),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_37,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,esk9_3(X83,X84,X85),X85)
| ~ min_precedes(X83,X84,X85)
| next_subocc(X83,X84,X85) )
& ( min_precedes(esk9_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_38,plain,
( subactivity_occurrence(X2,esk5_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_39,negated_conjecture,
( next_subocc(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0)
| ~ min_precedes(esk6_1(esk1_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
next_subocc(esk1_0,esk6_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_42,plain,
( leaf_occ(X1,esk5_3(X2,X3,X1))
| occurrence_of(esk6_1(X1),tptp3)
| ~ arboreal(X1)
| ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(esk5_3(X2,X3,X1),tptp0) ),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
fof(c_0_43,plain,
! [X32,X33,X34] :
( ~ occurrence_of(X32,X33)
| ~ occurrence_of(X32,X34)
| X33 = X34 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])]) ).
fof(c_0_44,plain,
! [X44] :
( ( activity(esk10_1(X44))
| ~ activity_occurrence(X44) )
& ( occurrence_of(X44,esk10_1(X44))
| ~ activity_occurrence(X44) ) ),
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_12])])])])])]) ).
fof(c_0_45,plain,
! [X15,X16] :
( ( activity(X15)
| ~ occurrence_of(X16,X15) )
& ( activity_occurrence(X16)
| ~ occurrence_of(X16,X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])]) ).
cnf(c_0_46,negated_conjecture,
next_subocc(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_39,c_0_26]) ).
cnf(c_0_47,negated_conjecture,
min_precedes(esk1_0,esk6_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3)
| ~ min_precedes(X1,esk6_1(esk1_0),X2)
| ~ occurrence_of(esk5_3(X2,X1,esk6_1(esk1_0)),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_42]),c_0_34])]) ).
cnf(c_0_49,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,plain,
( occurrence_of(X1,esk10_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk8_1(X1),tptp2)
| occurrence_of(esk8_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_53,plain,
( leaf_occ(X1,X2)
| X3 = esk8_1(X1)
| X3 = esk7_1(X1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(esk6_1(X1),X3,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,negated_conjecture,
min_precedes(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_40,c_0_46]) ).
cnf(c_0_55,negated_conjecture,
( ~ leaf_occ(esk1_0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_25,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3)
| ~ min_precedes(X1,esk6_1(esk1_0),tptp0) ),
inference(spm,[status(thm)],[c_0_48,c_0_36]) ).
cnf(c_0_57,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk7_1(X1),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_58,plain,
( X1 = esk10_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( occurrence_of(esk8_1(esk1_0),tptp1)
| occurrence_of(esk8_1(esk1_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_60,negated_conjecture,
( esk7_1(esk1_0) = esk6_1(esk6_1(esk1_0))
| esk8_1(esk1_0) = esk6_1(esk6_1(esk1_0))
| ~ subactivity_occurrence(esk1_0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_19])]),c_0_55]) ).
cnf(c_0_61,negated_conjecture,
occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_62,negated_conjecture,
occurrence_of(esk7_1(esk1_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_63,negated_conjecture,
( esk10_1(esk8_1(esk1_0)) = tptp2
| occurrence_of(esk8_1(esk1_0),tptp1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( esk8_1(esk1_0) = esk6_1(esk6_1(esk1_0))
| esk7_1(esk1_0) = esk6_1(esk6_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_18]),c_0_20])]) ).
cnf(c_0_65,negated_conjecture,
esk10_1(esk6_1(esk6_1(esk1_0))) = tptp3,
inference(spm,[status(thm)],[c_0_58,c_0_61]) ).
cnf(c_0_66,plain,
tptp3 != tptp2,
inference(split_conjunct,[status(thm)],[sos_43]) ).
cnf(c_0_67,negated_conjecture,
esk10_1(esk7_1(esk1_0)) = tptp4,
inference(spm,[status(thm)],[c_0_58,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
( esk7_1(esk1_0) = esk6_1(esk6_1(esk1_0))
| occurrence_of(esk6_1(esk6_1(esk1_0)),tptp1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66]) ).
cnf(c_0_69,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[sos_39]) ).
cnf(c_0_70,negated_conjecture,
occurrence_of(esk6_1(esk6_1(esk1_0)),tptp1),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_65]),c_0_69]) ).
cnf(c_0_71,plain,
tptp3 != tptp1,
inference(split_conjunct,[status(thm)],[sos_42]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_70]),c_0_65]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : PRO018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.11 % Command : run_ET %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Mon Jun 13 00:54:26 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.17/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.36 # Preprocessing time : 0.015 s
% 0.17/1.36
% 0.17/1.36 # Proof found!
% 0.17/1.36 # SZS status Theorem
% 0.17/1.36 # SZS output start CNFRefutation
% See solution above
% 0.17/1.36 # Proof object total steps : 73
% 0.17/1.36 # Proof object clause steps : 50
% 0.17/1.36 # Proof object formula steps : 23
% 0.17/1.36 # Proof object conjectures : 31
% 0.17/1.36 # Proof object clause conjectures : 28
% 0.17/1.36 # Proof object formula conjectures : 3
% 0.17/1.36 # Proof object initial clauses used : 23
% 0.17/1.36 # Proof object initial formulas used : 13
% 0.17/1.36 # Proof object generating inferences : 27
% 0.17/1.36 # Proof object simplifying inferences : 38
% 0.17/1.36 # Training examples: 0 positive, 0 negative
% 0.17/1.36 # Parsed axioms : 46
% 0.17/1.36 # Removed by relevancy pruning/SinE : 19
% 0.17/1.36 # Initial clauses : 64
% 0.17/1.36 # Removed in clause preprocessing : 6
% 0.17/1.36 # Initial clauses in saturation : 58
% 0.17/1.36 # Processed clauses : 260
% 0.17/1.36 # ...of these trivial : 6
% 0.17/1.36 # ...subsumed : 48
% 0.17/1.36 # ...remaining for further processing : 206
% 0.17/1.36 # Other redundant clauses eliminated : 0
% 0.17/1.36 # Clauses deleted for lack of memory : 0
% 0.17/1.36 # Backward-subsumed : 1
% 0.17/1.36 # Backward-rewritten : 14
% 0.17/1.36 # Generated clauses : 490
% 0.17/1.36 # ...of the previous two non-trivial : 381
% 0.17/1.36 # Contextual simplify-reflections : 107
% 0.17/1.36 # Paramodulations : 490
% 0.17/1.36 # Factorizations : 0
% 0.17/1.36 # Equation resolutions : 0
% 0.17/1.36 # Current number of processed clauses : 191
% 0.17/1.36 # Positive orientable unit clauses : 47
% 0.17/1.36 # Positive unorientable unit clauses: 0
% 0.17/1.36 # Negative unit clauses : 12
% 0.17/1.36 # Non-unit-clauses : 132
% 0.17/1.36 # Current number of unprocessed clauses: 125
% 0.17/1.36 # ...number of literals in the above : 846
% 0.17/1.36 # Current number of archived formulas : 0
% 0.17/1.36 # Current number of archived clauses : 15
% 0.17/1.36 # Clause-clause subsumption calls (NU) : 14843
% 0.17/1.36 # Rec. Clause-clause subsumption calls : 2600
% 0.17/1.36 # Non-unit clause-clause subsumptions : 153
% 0.17/1.36 # Unit Clause-clause subsumption calls : 1767
% 0.17/1.36 # Rewrite failures with RHS unbound : 0
% 0.17/1.36 # BW rewrite match attempts : 7
% 0.17/1.36 # BW rewrite match successes : 7
% 0.17/1.36 # Condensation attempts : 0
% 0.17/1.36 # Condensation successes : 0
% 0.17/1.36 # Termbank termtop insertions : 13811
% 0.17/1.36
% 0.17/1.36 # -------------------------------------------------
% 0.17/1.36 # User time : 0.059 s
% 0.17/1.36 # System time : 0.002 s
% 0.17/1.36 # Total time : 0.061 s
% 0.17/1.36 # Maximum resident set size: 3940 pages
%------------------------------------------------------------------------------