TSTP Solution File: PRO018+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PRO018+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : Sat May 4 09:10:17 EDT 2024
% Result : Theorem 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 69 ( 27 unt; 0 def)
% Number of atoms : 396 ( 23 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 531 ( 204 ~; 232 |; 79 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 113 ( 1 sgn 48 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.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/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.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/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.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/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.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/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.p',sos_21) ).
fof(sos_13,axiom,
! [X41,X42] :
( occurrence_of(X41,X42)
=> ( arboreal(X41)
<=> atomic(X42) ) ),
file('/export/starexec/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.p',sos_13) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.p',sos_38) ).
fof(sos_22,axiom,
! [X65,X66,X67] :
( ( occurrence_of(X65,X66)
& occurrence_of(X65,X67) )
=> X66 = X67 ),
file('/export/starexec/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.p',sos_22) ).
fof(sos_39,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.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,
! [X122,X123,X127] :
( ( occurrence_of(esk6_1(X122),tptp3)
| ~ occurrence_of(X123,tptp0)
| ~ subactivity_occurrence(X122,X123)
| ~ arboreal(X122)
| leaf_occ(X122,X123) )
& ( next_subocc(X122,esk6_1(X122),tptp0)
| ~ occurrence_of(X123,tptp0)
| ~ subactivity_occurrence(X122,X123)
| ~ arboreal(X122)
| leaf_occ(X122,X123) )
& ( occurrence_of(esk7_1(X122),tptp4)
| ~ occurrence_of(X123,tptp0)
| ~ subactivity_occurrence(X122,X123)
| ~ arboreal(X122)
| leaf_occ(X122,X123) )
& ( min_precedes(esk6_1(X122),esk7_1(X122),tptp0)
| ~ occurrence_of(X123,tptp0)
| ~ subactivity_occurrence(X122,X123)
| ~ arboreal(X122)
| leaf_occ(X122,X123) )
& ( occurrence_of(esk8_1(X122),tptp1)
| occurrence_of(esk8_1(X122),tptp2)
| ~ occurrence_of(X123,tptp0)
| ~ subactivity_occurrence(X122,X123)
| ~ arboreal(X122)
| leaf_occ(X122,X123) )
& ( min_precedes(esk7_1(X122),esk8_1(X122),tptp0)
| ~ occurrence_of(X123,tptp0)
| ~ subactivity_occurrence(X122,X123)
| ~ arboreal(X122)
| leaf_occ(X122,X123) )
& ( ~ min_precedes(esk6_1(X122),X127,tptp0)
| X127 = esk7_1(X122)
| X127 = esk8_1(X122)
| ~ occurrence_of(X123,tptp0)
| ~ subactivity_occurrence(X122,X123)
| ~ arboreal(X122)
| leaf_occ(X122,X123) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
! [X110,X111] :
( occurrence_of(esk2_0,tptp0)
& subactivity_occurrence(esk1_0,esk2_0)
& arboreal(esk1_0)
& ~ leaf_occ(esk1_0,esk2_0)
& ( occurrence_of(X111,tptp2)
| occurrence_of(X111,tptp1)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(esk4_2(X110,X111),tptp1)
| occurrence_of(X111,tptp1)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( min_precedes(X110,esk4_2(X110,X111),tptp0)
| occurrence_of(X111,tptp1)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(X111,tptp2)
| occurrence_of(esk3_2(X110,X111),tptp2)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(esk4_2(X110,X111),tptp1)
| occurrence_of(esk3_2(X110,X111),tptp2)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( min_precedes(X110,esk4_2(X110,X111),tptp0)
| occurrence_of(esk3_2(X110,X111),tptp2)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(X111,tptp2)
| min_precedes(X110,esk3_2(X110,X111),tptp0)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(esk4_2(X110,X111),tptp1)
| min_precedes(X110,esk3_2(X110,X111),tptp0)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( min_precedes(X110,esk4_2(X110,X111),tptp0)
| min_precedes(X110,esk3_2(X110,X111),tptp0)
| ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(X111,tptp2)
| occurrence_of(X111,tptp1)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(esk4_2(X110,X111),tptp1)
| occurrence_of(X111,tptp1)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( min_precedes(X110,esk4_2(X110,X111),tptp0)
| occurrence_of(X111,tptp1)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(X111,tptp2)
| occurrence_of(esk3_2(X110,X111),tptp2)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(esk4_2(X110,X111),tptp1)
| occurrence_of(esk3_2(X110,X111),tptp2)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( min_precedes(X110,esk4_2(X110,X111),tptp0)
| occurrence_of(esk3_2(X110,X111),tptp2)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(X111,tptp2)
| min_precedes(X110,esk3_2(X110,X111),tptp0)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( occurrence_of(esk4_2(X110,X111),tptp1)
| min_precedes(X110,esk3_2(X110,X111),tptp0)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) )
& ( min_precedes(X110,esk4_2(X110,X111),tptp0)
| min_precedes(X110,esk3_2(X110,X111),tptp0)
| ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ next_subocc(esk1_0,X110,tptp0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk2_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,esk6_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(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X139,X140,X141,X142,X143,X144,X145] :
( ( min_precedes(X139,X140,X141)
| ~ next_subocc(X139,X140,X141) )
& ( ~ min_precedes(X139,X142,X141)
| ~ min_precedes(X142,X140,X141)
| ~ next_subocc(X139,X140,X141) )
& ( min_precedes(X143,esk9_3(X143,X144,X145),X145)
| ~ min_precedes(X143,X144,X145)
| next_subocc(X143,X144,X145) )
& ( min_precedes(esk9_3(X143,X144,X145),X144,X145)
| ~ min_precedes(X143,X144,X145)
| next_subocc(X143,X144,X145) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,esk6_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( min_precedes(esk6_1(X1),esk7_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,
! [X118,X119,X120] :
( ( occurrence_of(esk5_3(X118,X119,X120),X118)
| ~ min_precedes(X119,X120,X118) )
& ( subactivity_occurrence(X119,esk5_3(X118,X119,X120))
| ~ min_precedes(X119,X120,X118) )
& ( subactivity_occurrence(X120,esk5_3(X118,X119,X120))
| ~ min_precedes(X119,X120,X118) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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(esk1_0,esk6_1(esk1_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(esk6_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,
! [X135,X136,X137,X138] :
( ~ occurrence_of(X135,X137)
| ~ leaf_occ(X136,X135)
| ~ min_precedes(X136,X138,X137) ),
inference(fof_nnf,[status(thm)],[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,esk2_0)
| min_precedes(esk6_1(X1),esk7_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_27,plain,
( occurrence_of(esk5_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(esk1_0,esk6_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,plain,
! [X150,X151] :
( ( ~ arboreal(X150)
| atomic(X151)
| ~ occurrence_of(X150,X151) )
& ( ~ atomic(X151)
| arboreal(X150)
| ~ occurrence_of(X150,X151) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_13])])])]) ).
cnf(c_0_30,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk6_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk2_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(esk6_1(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_26,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_33,negated_conjecture,
occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( subactivity_occurrence(X1,esk5_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(esk6_1(esk1_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(esk6_1(esk1_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,esk6_1(X1),tptp0)
| leaf_occ(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| ~ subactivity_occurrence(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
subactivity_occurrence(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_41,negated_conjecture,
arboreal(esk6_1(esk1_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(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_43,plain,
( X2 = esk7_1(X1)
| X2 = esk8_1(X1)
| leaf_occ(X1,X3)
| ~ min_precedes(esk6_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(esk6_1(esk1_0),esk6_1(esk6_1(esk1_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 = esk8_1(X2)
| X1 = esk7_1(X2)
| leaf_occ(X2,esk2_0)
| ~ subactivity_occurrence(X2,esk2_0)
| ~ arboreal(X2)
| ~ min_precedes(esk6_1(X2),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_43,c_0_14]) ).
cnf(c_0_47,plain,
( min_precedes(esk7_1(X1),esk8_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(esk7_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,esk6_1(esk6_1(esk1_0)),tptp0)
| ~ min_precedes(esk6_1(esk1_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( X1 = esk7_1(esk1_0)
| X1 = esk8_1(esk1_0)
| ~ min_precedes(esk6_1(esk1_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(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( leaf_occ(X1,esk2_0)
| min_precedes(esk7_1(X1),esk8_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_14]) ).
fof(c_0_53,plain,
! [X128,X129,X130] :
( ~ occurrence_of(X128,X129)
| ~ occurrence_of(X128,X130)
| X129 = X130 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])]) ).
cnf(c_0_54,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk7_1(X1),tptp4)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_14]) ).
cnf(c_0_55,negated_conjecture,
( leaf_occ(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| occurrence_of(esk6_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_56,negated_conjecture,
~ min_precedes(esk7_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_57,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk8_1(esk1_0)
| esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
min_precedes(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_52,c_0_17]),c_0_18])]),c_0_19]) ).
fof(c_0_59,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_39]) ).
cnf(c_0_60,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_61,negated_conjecture,
occurrence_of(esk7_1(esk1_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_62,negated_conjecture,
occurrence_of(esk6_1(esk6_1(esk1_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_63,negated_conjecture,
esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
fof(c_0_64,plain,
tptp4 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( X1 = tptp4
| ~ occurrence_of(esk7_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
occurrence_of(esk7_1(esk1_0),tptp3),
inference(rw,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PRO018+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n004.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 : 300
% 0.14/0.34 % DateTime : Fri May 3 15:48:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.nbGpnXZWih/E---3.1_3371.p
% 0.20/0.57 # Version: 3.1.0
% 0.20/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # new_bool_1 with pid 3455 completed with status 0
% 0.20/0.57 # Result found by new_bool_1
% 0.20/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.57 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.20/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.20/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 3461 completed with status 0
% 0.20/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.20/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.57 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.20/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.20/0.57 # Preprocessing time : 0.002 s
% 0.20/0.57 # Presaturation interreduction done
% 0.20/0.57
% 0.20/0.57 # Proof found!
% 0.20/0.57 # SZS status Theorem
% 0.20/0.57 # SZS output start CNFRefutation
% See solution above
% 0.20/0.57 # Parsed axioms : 46
% 0.20/0.57 # Removed by relevancy pruning/SinE : 11
% 0.20/0.57 # Initial clauses : 80
% 0.20/0.57 # Removed in clause preprocessing : 6
% 0.20/0.57 # Initial clauses in saturation : 74
% 0.20/0.57 # Processed clauses : 696
% 0.20/0.57 # ...of these trivial : 21
% 0.20/0.57 # ...subsumed : 94
% 0.20/0.57 # ...remaining for further processing : 581
% 0.20/0.57 # Other redundant clauses eliminated : 0
% 0.20/0.57 # Clauses deleted for lack of memory : 0
% 0.20/0.57 # Backward-subsumed : 0
% 0.20/0.57 # Backward-rewritten : 49
% 0.20/0.57 # Generated clauses : 1201
% 0.20/0.57 # ...of the previous two non-redundant : 1040
% 0.20/0.57 # ...aggressively subsumed : 0
% 0.20/0.57 # Contextual simplify-reflections : 3
% 0.20/0.57 # Paramodulations : 1200
% 0.20/0.57 # Factorizations : 1
% 0.20/0.57 # NegExts : 0
% 0.20/0.57 # Equation resolutions : 0
% 0.20/0.57 # Disequality decompositions : 0
% 0.20/0.57 # Total rewrite steps : 378
% 0.20/0.57 # ...of those cached : 304
% 0.20/0.57 # Propositional unsat checks : 0
% 0.20/0.57 # Propositional check models : 0
% 0.20/0.57 # Propositional check unsatisfiable : 0
% 0.20/0.57 # Propositional clauses : 0
% 0.20/0.57 # Propositional clauses after purity: 0
% 0.20/0.57 # Propositional unsat core size : 0
% 0.20/0.57 # Propositional preprocessing time : 0.000
% 0.20/0.57 # Propositional encoding time : 0.000
% 0.20/0.57 # Propositional solver time : 0.000
% 0.20/0.57 # Success case prop preproc time : 0.000
% 0.20/0.57 # Success case prop encoding time : 0.000
% 0.20/0.57 # Success case prop solver time : 0.000
% 0.20/0.57 # Current number of processed clauses : 458
% 0.20/0.57 # Positive orientable unit clauses : 169
% 0.20/0.57 # Positive unorientable unit clauses: 0
% 0.20/0.57 # Negative unit clauses : 78
% 0.20/0.57 # Non-unit-clauses : 211
% 0.20/0.57 # Current number of unprocessed clauses: 447
% 0.20/0.57 # ...number of literals in the above : 1402
% 0.20/0.57 # Current number of archived formulas : 0
% 0.20/0.57 # Current number of archived clauses : 123
% 0.20/0.57 # Clause-clause subsumption calls (NU) : 19046
% 0.20/0.57 # Rec. Clause-clause subsumption calls : 5501
% 0.20/0.57 # Non-unit clause-clause subsumptions : 58
% 0.20/0.57 # Unit Clause-clause subsumption calls : 5632
% 0.20/0.57 # Rewrite failures with RHS unbound : 0
% 0.20/0.57 # BW rewrite match attempts : 139
% 0.20/0.57 # BW rewrite match successes : 14
% 0.20/0.57 # Condensation attempts : 0
% 0.20/0.57 # Condensation successes : 0
% 0.20/0.57 # Termbank termtop insertions : 26930
% 0.20/0.57 # Search garbage collected termcells : 1148
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.068 s
% 0.20/0.57 # System time : 0.003 s
% 0.20/0.57 # Total time : 0.070 s
% 0.20/0.57 # Maximum resident set size: 2056 pages
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.069 s
% 0.20/0.57 # System time : 0.006 s
% 0.20/0.57 # Total time : 0.075 s
% 0.20/0.57 # Maximum resident set size: 1812 pages
% 0.20/0.57 % E---3.1 exiting
% 0.20/0.57 % E exiting
%------------------------------------------------------------------------------