TSTP Solution File: PRO018+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PRO018+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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 : 300s
% DateTime : Thu Aug 31 13:06:12 EDT 2023
% Result : Theorem 0.19s 0.65s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 52
% Syntax : Number of formulae : 110 ( 25 unt; 43 typ; 0 def)
% Number of atoms : 394 ( 21 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 529 ( 202 ~; 232 |; 79 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 69 ( 36 >; 33 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 7 con; 0-3 aty)
% Number of variables : 113 ( 1 sgn; 48 !; 17 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
min_precedes: ( $i * $i * $i ) > $o ).
tff(decl_23,type,
earlier: ( $i * $i ) > $o ).
tff(decl_24,type,
occurrence_of: ( $i * $i ) > $o ).
tff(decl_25,type,
root_occ: ( $i * $i ) > $o ).
tff(decl_26,type,
atomic: $i > $o ).
tff(decl_27,type,
leaf_occ: ( $i * $i ) > $o ).
tff(decl_28,type,
next_subocc: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
arboreal: $i > $o ).
tff(decl_30,type,
precedes: ( $i * $i ) > $o ).
tff(decl_31,type,
root: ( $i * $i ) > $o ).
tff(decl_32,type,
legal: $i > $o ).
tff(decl_33,type,
subactivity_occurrence: ( $i * $i ) > $o ).
tff(decl_34,type,
leaf: ( $i * $i ) > $o ).
tff(decl_35,type,
atocc: ( $i * $i ) > $o ).
tff(decl_36,type,
subactivity: ( $i * $i ) > $o ).
tff(decl_37,type,
activity_occurrence: $i > $o ).
tff(decl_38,type,
activity: $i > $o ).
tff(decl_39,type,
tptp0: $i ).
tff(decl_40,type,
tptp3: $i ).
tff(decl_41,type,
tptp4: $i ).
tff(decl_42,type,
tptp1: $i ).
tff(decl_43,type,
tptp2: $i ).
tff(decl_44,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_45,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_46,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_47,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_48,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk7_1: $i > $i ).
tff(decl_51,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk9_3: ( $i * $i * $i ) > $i ).
tff(decl_53,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk13_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk15_1: $i > $i ).
tff(decl_59,type,
esk16_1: $i > $i ).
tff(decl_60,type,
esk17_1: $i > $i ).
tff(decl_61,type,
esk18_0: $i ).
tff(decl_62,type,
esk19_0: $i ).
tff(decl_63,type,
esk20_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk21_2: ( $i * $i ) > $i ).
fof(sos_32,axiom,
! [X96,X97] :
( ( occurrence_of(X97,tptp0)
& subactivity_occurrence(X96,X97)
& arboreal(X96)
& ~ leaf_occ(X96,X97) )
=> ? [X98,X99,X100] :
( occurrence_of(X98,tptp3)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X99,tptp4)
& min_precedes(X98,X99,tptp0)
& ( occurrence_of(X100,tptp1)
| occurrence_of(X100,tptp2) )
& min_precedes(X99,X100,tptp0)
& ! [X101] :
( min_precedes(X98,X101,tptp0)
=> ( X101 = X99
| X101 = X100 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(goals,conjecture,
! [X102,X103] :
( ( occurrence_of(X103,tptp0)
& subactivity_occurrence(X102,X103)
& arboreal(X102)
& ~ leaf_occ(X102,X103) )
=> ? [X104,X105] :
( occurrence_of(X104,tptp3)
& next_subocc(X102,X104,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& min_precedes(X104,X105,tptp0)
& leaf_occ(X105,X103)
& ( occurrence_of(X105,tptp1)
=> ~ ? [X106] :
( occurrence_of(X106,tptp2)
& min_precedes(X104,X106,tptp0) ) )
& ( occurrence_of(X105,tptp2)
=> ~ ? [X107] :
( occurrence_of(X107,tptp1)
& min_precedes(X104,X107,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( min_precedes(X16,X17,X18)
& ~ ? [X19] :
( min_precedes(X16,X19,X18)
& min_precedes(X19,X17,X18) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(sos_24,axiom,
! [X71,X72,X73] :
( min_precedes(X72,X73,X71)
=> ? [X74] :
( occurrence_of(X74,X71)
& subactivity_occurrence(X72,X74)
& subactivity_occurrence(X73,X74) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_24) ).
fof(sos_21,axiom,
! [X61,X62,X63] :
( ( occurrence_of(X61,X63)
& leaf_occ(X62,X61) )
=> ~ ? [X64] : min_precedes(X62,X64,X63) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos_13,axiom,
! [X41,X42] :
( occurrence_of(X41,X42)
=> ( arboreal(X41)
<=> atomic(X42) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
fof(sos_22,axiom,
! [X65,X66,X67] :
( ( occurrence_of(X65,X66)
& occurrence_of(X65,X67) )
=> X66 = X67 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(sos_39,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(c_0_9,plain,
! [X96,X97] :
( ( occurrence_of(X97,tptp0)
& subactivity_occurrence(X96,X97)
& arboreal(X96)
& ~ leaf_occ(X96,X97) )
=> ? [X98,X99,X100] :
( occurrence_of(X98,tptp3)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X99,tptp4)
& min_precedes(X98,X99,tptp0)
& ( occurrence_of(X100,tptp1)
| occurrence_of(X100,tptp2) )
& min_precedes(X99,X100,tptp0)
& ! [X101] :
( min_precedes(X98,X101,tptp0)
=> ( X101 = X99
| X101 = X100 ) ) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_10,negated_conjecture,
~ ! [X102,X103] :
( ( occurrence_of(X103,tptp0)
& subactivity_occurrence(X102,X103)
& arboreal(X102)
& ~ leaf_occ(X102,X103) )
=> ? [X104,X105] :
( occurrence_of(X104,tptp3)
& next_subocc(X102,X104,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& min_precedes(X104,X105,tptp0)
& leaf_occ(X105,X103)
& ( occurrence_of(X105,tptp1)
=> ~ ? [X106] :
( occurrence_of(X106,tptp2)
& min_precedes(X104,X106,tptp0) ) )
& ( occurrence_of(X105,tptp2)
=> ~ ? [X107] :
( occurrence_of(X107,tptp1)
& min_precedes(X104,X107,tptp0) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_11,plain,
! [X220,X221,X225] :
( ( occurrence_of(esk15_1(X220),tptp3)
| ~ occurrence_of(X221,tptp0)
| ~ subactivity_occurrence(X220,X221)
| ~ arboreal(X220)
| leaf_occ(X220,X221) )
& ( next_subocc(X220,esk15_1(X220),tptp0)
| ~ occurrence_of(X221,tptp0)
| ~ subactivity_occurrence(X220,X221)
| ~ arboreal(X220)
| leaf_occ(X220,X221) )
& ( occurrence_of(esk16_1(X220),tptp4)
| ~ occurrence_of(X221,tptp0)
| ~ subactivity_occurrence(X220,X221)
| ~ arboreal(X220)
| leaf_occ(X220,X221) )
& ( min_precedes(esk15_1(X220),esk16_1(X220),tptp0)
| ~ occurrence_of(X221,tptp0)
| ~ subactivity_occurrence(X220,X221)
| ~ arboreal(X220)
| leaf_occ(X220,X221) )
& ( occurrence_of(esk17_1(X220),tptp1)
| occurrence_of(esk17_1(X220),tptp2)
| ~ occurrence_of(X221,tptp0)
| ~ subactivity_occurrence(X220,X221)
| ~ arboreal(X220)
| leaf_occ(X220,X221) )
& ( min_precedes(esk16_1(X220),esk17_1(X220),tptp0)
| ~ occurrence_of(X221,tptp0)
| ~ subactivity_occurrence(X220,X221)
| ~ arboreal(X220)
| leaf_occ(X220,X221) )
& ( ~ min_precedes(esk15_1(X220),X225,tptp0)
| X225 = esk16_1(X220)
| X225 = esk17_1(X220)
| ~ occurrence_of(X221,tptp0)
| ~ subactivity_occurrence(X220,X221)
| ~ arboreal(X220)
| leaf_occ(X220,X221) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
fof(c_0_12,negated_conjecture,
! [X228,X229] :
( occurrence_of(esk19_0,tptp0)
& subactivity_occurrence(esk18_0,esk19_0)
& arboreal(esk18_0)
& ~ leaf_occ(esk18_0,esk19_0)
& ( occurrence_of(X229,tptp2)
| occurrence_of(X229,tptp1)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(esk21_2(X228,X229),tptp1)
| occurrence_of(X229,tptp1)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( min_precedes(X228,esk21_2(X228,X229),tptp0)
| occurrence_of(X229,tptp1)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(X229,tptp2)
| occurrence_of(esk20_2(X228,X229),tptp2)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(esk21_2(X228,X229),tptp1)
| occurrence_of(esk20_2(X228,X229),tptp2)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( min_precedes(X228,esk21_2(X228,X229),tptp0)
| occurrence_of(esk20_2(X228,X229),tptp2)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(X229,tptp2)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(esk21_2(X228,X229),tptp1)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( min_precedes(X228,esk21_2(X228,X229),tptp0)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| ~ occurrence_of(X229,tptp1)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(X229,tptp2)
| occurrence_of(X229,tptp1)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(esk21_2(X228,X229),tptp1)
| occurrence_of(X229,tptp1)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( min_precedes(X228,esk21_2(X228,X229),tptp0)
| occurrence_of(X229,tptp1)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(X229,tptp2)
| occurrence_of(esk20_2(X228,X229),tptp2)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(esk21_2(X228,X229),tptp1)
| occurrence_of(esk20_2(X228,X229),tptp2)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( min_precedes(X228,esk21_2(X228,X229),tptp0)
| occurrence_of(esk20_2(X228,X229),tptp2)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(X229,tptp2)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( occurrence_of(esk21_2(X228,X229),tptp1)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) )
& ( min_precedes(X228,esk21_2(X228,X229),tptp0)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| ~ occurrence_of(X229,tptp2)
| ~ occurrence_of(X228,tptp3)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ min_precedes(X228,X229,tptp0)
| ~ leaf_occ(X229,esk19_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
cnf(c_0_13,plain,
( next_subocc(X1,esk15_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X123,X124,X125,X126,X127,X128,X129] :
( ( min_precedes(X123,X124,X125)
| ~ next_subocc(X123,X124,X125) )
& ( ~ min_precedes(X123,X126,X125)
| ~ min_precedes(X126,X124,X125)
| ~ next_subocc(X123,X124,X125) )
& ( min_precedes(X127,esk1_3(X127,X128,X129),X129)
| ~ min_precedes(X127,X128,X129)
| next_subocc(X127,X128,X129) )
& ( min_precedes(esk1_3(X127,X128,X129),X128,X129)
| ~ min_precedes(X127,X128,X129)
| next_subocc(X127,X128,X129) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_04])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( next_subocc(X1,esk15_1(X1),tptp0)
| leaf_occ(X1,esk19_0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
arboreal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
~ leaf_occ(esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X195,X196,X197] :
( ( occurrence_of(esk9_3(X195,X196,X197),X195)
| ~ min_precedes(X196,X197,X195) )
& ( subactivity_occurrence(X196,esk9_3(X195,X196,X197))
| ~ min_precedes(X196,X197,X195) )
& ( subactivity_occurrence(X197,esk9_3(X195,X196,X197))
| ~ min_precedes(X196,X197,X195) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])])]) ).
cnf(c_0_22,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
next_subocc(esk18_0,esk15_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_24,plain,
( occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X185,X186,X187,X188] :
( ~ occurrence_of(X185,X187)
| ~ leaf_occ(X186,X185)
| ~ min_precedes(X186,X188,X187) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])]) ).
cnf(c_0_26,negated_conjecture,
( leaf_occ(X1,esk19_0)
| min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_27,plain,
( occurrence_of(esk9_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
min_precedes(esk18_0,esk15_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,plain,
! [X158,X159] :
( ( ~ arboreal(X158)
| atomic(X159)
| ~ occurrence_of(X158,X159) )
& ( ~ atomic(X159)
| arboreal(X158)
| ~ occurrence_of(X158,X159) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_13])])]) ).
cnf(c_0_30,negated_conjecture,
( leaf_occ(X1,esk19_0)
| occurrence_of(esk15_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_31,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_33,negated_conjecture,
occurrence_of(esk9_3(tptp0,esk18_0,esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( subactivity_occurrence(X1,esk9_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,plain,
( arboreal(X2)
| ~ atomic(X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_37,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_38,negated_conjecture,
( ~ leaf_occ(esk15_1(esk18_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( next_subocc(X1,esk15_1(X1),tptp0)
| leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
subactivity_occurrence(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_41,negated_conjecture,
arboreal(esk15_1(esk18_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
~ leaf_occ(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_43,plain,
( X2 = esk16_1(X1)
| X2 = esk17_1(X1)
| leaf_occ(X1,X3)
| ~ min_precedes(esk15_1(X1),X2,tptp0)
| ~ occurrence_of(X3,tptp0)
| ~ subactivity_occurrence(X1,X3)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X2,X4,X3)
| ~ next_subocc(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_45,negated_conjecture,
next_subocc(esk15_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk17_1(X2)
| X1 = esk16_1(X2)
| leaf_occ(X2,esk19_0)
| ~ subactivity_occurrence(X2,esk19_0)
| ~ arboreal(X2)
| ~ min_precedes(esk15_1(X2),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_43,c_0_14]) ).
cnf(c_0_47,plain,
( min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_48,plain,
( occurrence_of(esk16_1(X1),tptp4)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk15_1(esk18_0)),tptp0)
| ~ min_precedes(esk15_1(esk18_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( X1 = esk16_1(esk18_0)
| X1 = esk17_1(esk18_0)
| ~ min_precedes(esk15_1(esk18_0),X1,tptp0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_51,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( leaf_occ(X1,esk19_0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_14]) ).
fof(c_0_53,plain,
! [X189,X190,X191] :
( ~ occurrence_of(X189,X190)
| ~ occurrence_of(X189,X191)
| X190 = X191 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])]) ).
cnf(c_0_54,negated_conjecture,
( leaf_occ(X1,esk19_0)
| occurrence_of(esk16_1(X1),tptp4)
| ~ subactivity_occurrence(X1,esk19_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_14]) ).
cnf(c_0_55,negated_conjecture,
( leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| occurrence_of(esk15_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_56,negated_conjecture,
~ min_precedes(esk16_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_57,negated_conjecture,
( esk15_1(esk15_1(esk18_0)) = esk17_1(esk18_0)
| esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_59,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,negated_conjecture,
occurrence_of(esk16_1(esk18_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_61,negated_conjecture,
occurrence_of(esk15_1(esk15_1(esk18_0)),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_62,negated_conjecture,
esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_63,negated_conjecture,
( X1 = tptp4
| ~ occurrence_of(esk16_1(esk18_0),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
occurrence_of(esk16_1(esk18_0),tptp3),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[sos_39]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PRO018+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 19:48:04 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.65 % Version : CSE_E---1.5
% 0.19/0.65 % Problem : theBenchmark.p
% 0.19/0.65 % Proof found
% 0.19/0.65 % SZS status Theorem for theBenchmark.p
% 0.19/0.65 % SZS output start Proof
% See solution above
% 0.19/0.66 % Total time : 0.084000 s
% 0.19/0.66 % SZS output end Proof
% 0.19/0.66 % Total time : 0.088000 s
%------------------------------------------------------------------------------