TSTP Solution File: PRO017+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PRO017+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n026.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:11 EDT 2023
% Result : Theorem 0.21s 0.67s
% Output : CNFRefutation 0.21s
% 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 : 266 ( 21 equ)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 317 ( 118 ~; 132 |; 55 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 72 ( 36 >; 36 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 7 con; 0-4 aty)
% Number of variables : 109 ( 1 sgn; 48 !; 13 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
occurrence_of: ( $i * $i ) > $o ).
tff(decl_23,type,
activity: $i > $o ).
tff(decl_24,type,
activity_occurrence: $i > $o ).
tff(decl_25,type,
subactivity: ( $i * $i ) > $o ).
tff(decl_26,type,
earlier: ( $i * $i ) > $o ).
tff(decl_27,type,
arboreal: $i > $o ).
tff(decl_28,type,
atomic: $i > $o ).
tff(decl_29,type,
legal: $i > $o ).
tff(decl_30,type,
precedes: ( $i * $i ) > $o ).
tff(decl_31,type,
min_precedes: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
atocc: ( $i * $i ) > $o ).
tff(decl_33,type,
root: ( $i * $i ) > $o ).
tff(decl_34,type,
leaf: ( $i * $i ) > $o ).
tff(decl_35,type,
next_subocc: ( $i * $i * $i ) > $o ).
tff(decl_36,type,
subactivity_occurrence: ( $i * $i ) > $o ).
tff(decl_37,type,
root_occ: ( $i * $i ) > $o ).
tff(decl_38,type,
leaf_occ: ( $i * $i ) > $o ).
tff(decl_39,type,
tptp0: $i ).
tff(decl_40,type,
tptp3: $i ).
tff(decl_41,type,
tptp4: $i ).
tff(decl_42,type,
tptp2: $i ).
tff(decl_43,type,
tptp1: $i ).
tff(decl_44,type,
esk1_1: $i > $i ).
tff(decl_45,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_46,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_47,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_48,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_49,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_51,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk10_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk13_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_57,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk16_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk17_1: $i > $i ).
tff(decl_61,type,
esk18_1: $i > $i ).
tff(decl_62,type,
esk19_1: $i > $i ).
tff(decl_63,type,
esk20_0: $i ).
tff(decl_64,type,
esk21_0: $i ).
fof(sos_49,axiom,
! [X162,X163] :
( ( occurrence_of(X163,tptp0)
& subactivity_occurrence(X162,X163)
& arboreal(X162)
& ~ leaf_occ(X162,X163) )
=> ? [X164,X165,X166] :
( occurrence_of(X164,tptp3)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X165,tptp4)
& min_precedes(X164,X165,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& min_precedes(X165,X166,tptp0)
& ! [X167] :
( min_precedes(X164,X167,tptp0)
=> ( X167 = X165
| X167 = X166 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
fof(goals,conjecture,
! [X168,X169] :
( ( occurrence_of(X169,tptp0)
& subactivity_occurrence(X168,X169)
& arboreal(X168)
& ~ leaf_occ(X168,X169) )
=> ? [X170,X171] :
( occurrence_of(X170,tptp3)
& next_subocc(X168,X170,tptp0)
& ( occurrence_of(X171,tptp2)
| occurrence_of(X171,tptp1) )
& min_precedes(X170,X171,tptp0)
& leaf(X171,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( min_precedes(X61,X62,X63)
& ~ ? [X64] :
( min_precedes(X61,X64,X63)
& min_precedes(X64,X62,X63) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( occurrence_of(X73,X70)
& subactivity_occurrence(X71,X73)
& subactivity_occurrence(X72,X73) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_25) ).
fof(sos_37,axiom,
! [X114,X115,X116] :
( ( occurrence_of(X114,X116)
& leaf_occ(X115,X114) )
=> ~ ? [X117] : min_precedes(X115,X117,X116) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_37) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(sos_55,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_55) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(sos_56,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_56) ).
fof(c_0_9,plain,
! [X162,X163] :
( ( occurrence_of(X163,tptp0)
& subactivity_occurrence(X162,X163)
& arboreal(X162)
& ~ leaf_occ(X162,X163) )
=> ? [X164,X165,X166] :
( occurrence_of(X164,tptp3)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X165,tptp4)
& min_precedes(X164,X165,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& min_precedes(X165,X166,tptp0)
& ! [X167] :
( min_precedes(X164,X167,tptp0)
=> ( X167 = X165
| X167 = X166 ) ) ) ),
inference(fof_simplification,[status(thm)],[sos_49]) ).
fof(c_0_10,negated_conjecture,
~ ! [X168,X169] :
( ( occurrence_of(X169,tptp0)
& subactivity_occurrence(X168,X169)
& arboreal(X168)
& ~ leaf_occ(X168,X169) )
=> ? [X170,X171] :
( occurrence_of(X170,tptp3)
& next_subocc(X168,X170,tptp0)
& ( occurrence_of(X171,tptp2)
| occurrence_of(X171,tptp1) )
& min_precedes(X170,X171,tptp0)
& leaf(X171,tptp0) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_11,plain,
! [X350,X351,X355] :
( ( occurrence_of(esk17_1(X350),tptp3)
| ~ occurrence_of(X351,tptp0)
| ~ subactivity_occurrence(X350,X351)
| ~ arboreal(X350)
| leaf_occ(X350,X351) )
& ( next_subocc(X350,esk17_1(X350),tptp0)
| ~ occurrence_of(X351,tptp0)
| ~ subactivity_occurrence(X350,X351)
| ~ arboreal(X350)
| leaf_occ(X350,X351) )
& ( occurrence_of(esk18_1(X350),tptp4)
| ~ occurrence_of(X351,tptp0)
| ~ subactivity_occurrence(X350,X351)
| ~ arboreal(X350)
| leaf_occ(X350,X351) )
& ( min_precedes(esk17_1(X350),esk18_1(X350),tptp0)
| ~ occurrence_of(X351,tptp0)
| ~ subactivity_occurrence(X350,X351)
| ~ arboreal(X350)
| leaf_occ(X350,X351) )
& ( occurrence_of(esk19_1(X350),tptp2)
| occurrence_of(esk19_1(X350),tptp1)
| ~ occurrence_of(X351,tptp0)
| ~ subactivity_occurrence(X350,X351)
| ~ arboreal(X350)
| leaf_occ(X350,X351) )
& ( min_precedes(esk18_1(X350),esk19_1(X350),tptp0)
| ~ occurrence_of(X351,tptp0)
| ~ subactivity_occurrence(X350,X351)
| ~ arboreal(X350)
| leaf_occ(X350,X351) )
& ( ~ min_precedes(esk17_1(X350),X355,tptp0)
| X355 = esk18_1(X350)
| X355 = esk19_1(X350)
| ~ occurrence_of(X351,tptp0)
| ~ subactivity_occurrence(X350,X351)
| ~ arboreal(X350)
| leaf_occ(X350,X351) ) ),
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,
! [X358,X359] :
( occurrence_of(esk21_0,tptp0)
& subactivity_occurrence(esk20_0,esk21_0)
& arboreal(esk20_0)
& ~ leaf_occ(esk20_0,esk21_0)
& ( ~ occurrence_of(X359,tptp2)
| ~ occurrence_of(X358,tptp3)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ min_precedes(X358,X359,tptp0)
| ~ leaf(X359,tptp0) )
& ( ~ occurrence_of(X359,tptp1)
| ~ occurrence_of(X358,tptp3)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ min_precedes(X358,X359,tptp0)
| ~ leaf(X359,tptp0) ) ),
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,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_14,negated_conjecture,
occurrence_of(esk21_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X236,X237,X238,X239,X240,X241,X242] :
( ( min_precedes(X236,X237,X238)
| ~ next_subocc(X236,X237,X238) )
& ( ~ min_precedes(X236,X239,X238)
| ~ min_precedes(X239,X237,X238)
| ~ next_subocc(X236,X237,X238) )
& ( min_precedes(X240,esk8_3(X240,X241,X242),X242)
| ~ min_precedes(X240,X241,X242)
| next_subocc(X240,X241,X242) )
& ( min_precedes(esk8_3(X240,X241,X242),X241,X242)
| ~ min_precedes(X240,X241,X242)
| next_subocc(X240,X241,X242) ) ),
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_22])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( leaf_occ(X1,esk21_0)
| next_subocc(X1,esk17_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk21_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
arboreal(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
~ leaf_occ(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( min_precedes(esk17_1(X1),esk18_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,
! [X252,X253,X254] :
( ( occurrence_of(esk10_3(X252,X253,X254),X252)
| ~ min_precedes(X253,X254,X252) )
& ( subactivity_occurrence(X253,esk10_3(X252,X253,X254))
| ~ min_precedes(X253,X254,X252) )
& ( subactivity_occurrence(X254,esk10_3(X252,X253,X254))
| ~ min_precedes(X253,X254,X252) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])]) ).
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(esk20_0,esk17_1(esk20_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(esk17_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,
! [X302,X303,X304,X305] :
( ~ occurrence_of(X302,X304)
| ~ leaf_occ(X303,X302)
| ~ min_precedes(X303,X305,X304) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])]) ).
cnf(c_0_26,negated_conjecture,
( leaf_occ(X1,esk21_0)
| min_precedes(esk17_1(X1),esk18_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk21_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_27,plain,
( occurrence_of(esk10_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(esk20_0,esk17_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,plain,
! [X188,X189] :
( ( ~ arboreal(X188)
| atomic(X189)
| ~ occurrence_of(X188,X189) )
& ( ~ atomic(X189)
| arboreal(X188)
| ~ occurrence_of(X188,X189) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_30,negated_conjecture,
( leaf_occ(X1,esk21_0)
| occurrence_of(esk17_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk21_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(esk17_1(esk20_0),esk18_1(esk20_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(esk10_3(tptp0,esk20_0,esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( subactivity_occurrence(X1,esk10_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(esk17_1(esk20_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_55]) ).
cnf(c_0_38,negated_conjecture,
( ~ leaf_occ(esk17_1(esk20_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( leaf_occ(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| next_subocc(X1,esk17_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
subactivity_occurrence(esk17_1(esk20_0),esk10_3(tptp0,esk20_0,esk17_1(esk20_0))),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_41,negated_conjecture,
arboreal(esk17_1(esk20_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(esk17_1(esk20_0),esk10_3(tptp0,esk20_0,esk17_1(esk20_0))),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_43,plain,
( X2 = esk18_1(X1)
| X2 = esk19_1(X1)
| leaf_occ(X1,X3)
| ~ min_precedes(esk17_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(esk17_1(esk20_0),esk17_1(esk17_1(esk20_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 = esk19_1(X2)
| X1 = esk18_1(X2)
| leaf_occ(X2,esk21_0)
| ~ subactivity_occurrence(X2,esk21_0)
| ~ min_precedes(esk17_1(X2),X1,tptp0)
| ~ arboreal(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_14]) ).
cnf(c_0_47,plain,
( min_precedes(esk18_1(X1),esk19_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(esk18_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,esk17_1(esk17_1(esk20_0)),tptp0)
| ~ min_precedes(esk17_1(esk20_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( X1 = esk18_1(esk20_0)
| X1 = esk19_1(esk20_0)
| ~ min_precedes(esk17_1(esk20_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(esk17_1(esk20_0),esk17_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( leaf_occ(X1,esk21_0)
| min_precedes(esk18_1(X1),esk19_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk21_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_14]) ).
fof(c_0_53,plain,
! [X176,X177,X178] :
( ~ occurrence_of(X176,X177)
| ~ occurrence_of(X176,X178)
| X177 = X178 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
cnf(c_0_54,negated_conjecture,
( leaf_occ(X1,esk21_0)
| occurrence_of(esk18_1(X1),tptp4)
| ~ subactivity_occurrence(X1,esk21_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_14]) ).
cnf(c_0_55,negated_conjecture,
( leaf_occ(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| occurrence_of(esk17_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_56,negated_conjecture,
~ min_precedes(esk18_1(esk20_0),esk17_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_57,negated_conjecture,
( esk17_1(esk17_1(esk20_0)) = esk19_1(esk20_0)
| esk17_1(esk17_1(esk20_0)) = esk18_1(esk20_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_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(esk18_1(esk20_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(esk17_1(esk17_1(esk20_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,
esk17_1(esk17_1(esk20_0)) = esk18_1(esk20_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(esk18_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
occurrence_of(esk18_1(esk20_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_56]) ).
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.00/0.13 % Problem : PRO017+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 19:40:35 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.67 % Version : CSE_E---1.5
% 0.21/0.67 % Problem : theBenchmark.p
% 0.21/0.67 % Proof found
% 0.21/0.67 % SZS status Theorem for theBenchmark.p
% 0.21/0.67 % SZS output start Proof
% See solution above
% 0.21/0.68 % Total time : 0.097000 s
% 0.21/0.68 % SZS output end Proof
% 0.21/0.68 % Total time : 0.102000 s
%------------------------------------------------------------------------------