TSTP Solution File: PRO018+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PRO018+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Tue May 21 02:22:09 EDT 2024
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 88 ( 30 unt; 0 def)
% Number of atoms : 445 ( 35 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 582 ( 225 ~; 256 |; 83 &)
% ( 2 <=>; 16 =>; 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 : 129 ( 2 sgn 54 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
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/benchmark/theBenchmark.p',sos_32) ).
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/benchmark/theBenchmark.p',goals) ).
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/benchmark/theBenchmark.p',sos_06) ).
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/benchmark/theBenchmark.p',sos_26) ).
fof(sos_16,axiom,
! [X52,X53] :
( occurrence_of(X52,X53)
=> ( arboreal(X52)
<=> atomic(X53) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
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/benchmark/theBenchmark.p',sos_09) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X30)
& occurrence_of(X29,X31) )
=> X30 = X31 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( activity(X43)
& occurrence_of(X42,X43) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(sos_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity(X13)
& activity_occurrence(X14) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(sos_39,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(sos_43,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_43) ).
fof(sos_42,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_42) ).
fof(c_0_13,plain,
! [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 ) ) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_14,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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_15,plain,
! [X128,X129,X133] :
( ( occurrence_of(esk6_1(X128),tptp3)
| ~ occurrence_of(X129,tptp0)
| ~ subactivity_occurrence(X128,X129)
| ~ arboreal(X128)
| leaf_occ(X128,X129) )
& ( next_subocc(X128,esk6_1(X128),tptp0)
| ~ occurrence_of(X129,tptp0)
| ~ subactivity_occurrence(X128,X129)
| ~ arboreal(X128)
| leaf_occ(X128,X129) )
& ( occurrence_of(esk7_1(X128),tptp4)
| ~ occurrence_of(X129,tptp0)
| ~ subactivity_occurrence(X128,X129)
| ~ arboreal(X128)
| leaf_occ(X128,X129) )
& ( min_precedes(esk6_1(X128),esk7_1(X128),tptp0)
| ~ occurrence_of(X129,tptp0)
| ~ subactivity_occurrence(X128,X129)
| ~ arboreal(X128)
| leaf_occ(X128,X129) )
& ( occurrence_of(esk8_1(X128),tptp1)
| occurrence_of(esk8_1(X128),tptp2)
| ~ occurrence_of(X129,tptp0)
| ~ subactivity_occurrence(X128,X129)
| ~ arboreal(X128)
| leaf_occ(X128,X129) )
& ( min_precedes(esk7_1(X128),esk8_1(X128),tptp0)
| ~ occurrence_of(X129,tptp0)
| ~ subactivity_occurrence(X128,X129)
| ~ arboreal(X128)
| leaf_occ(X128,X129) )
& ( ~ min_precedes(esk6_1(X128),X133,tptp0)
| X133 = esk7_1(X128)
| X133 = esk8_1(X128)
| ~ occurrence_of(X129,tptp0)
| ~ subactivity_occurrence(X128,X129)
| ~ arboreal(X128)
| leaf_occ(X128,X129) ) ),
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_13])])])])])])]) ).
fof(c_0_16,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(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_14])])])])])]) ).
fof(c_0_17,plain,
! [X120,X121,X122] :
( ( occurrence_of(esk5_3(X120,X121,X122),X120)
| ~ min_precedes(X121,X122,X120) )
& ( subactivity_occurrence(X121,esk5_3(X120,X121,X122))
| ~ min_precedes(X121,X122,X120) )
& ( subactivity_occurrence(X122,esk5_3(X120,X121,X122))
| ~ min_precedes(X121,X122,X120) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])])])]) ).
cnf(c_0_18,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_15]) ).
cnf(c_0_19,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,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_15]) ).
cnf(c_0_21,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_15]) ).
cnf(c_0_22,plain,
( occurrence_of(esk5_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X152,X153,X154,X155,X156,X157,X158] :
( ( min_precedes(X152,X153,X154)
| ~ next_subocc(X152,X153,X154) )
& ( ~ min_precedes(X152,X155,X154)
| ~ min_precedes(X155,X153,X154)
| ~ next_subocc(X152,X153,X154) )
& ( min_precedes(X156,esk9_3(X156,X157,X158),X158)
| ~ min_precedes(X156,X157,X158)
| next_subocc(X156,X157,X158) )
& ( min_precedes(esk9_3(X156,X157,X158),X157,X158)
| ~ min_precedes(X156,X157,X158)
| next_subocc(X156,X157,X158) ) ),
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_26])])])])])])]) ).
cnf(c_0_24,negated_conjecture,
( next_subocc(X1,esk6_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_28,plain,
! [X164,X165] :
( ( ~ arboreal(X164)
| atomic(X165)
| ~ occurrence_of(X164,X165) )
& ( ~ atomic(X165)
| arboreal(X164)
| ~ occurrence_of(X164,X165) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])])]) ).
cnf(c_0_29,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk6_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
fof(c_0_30,plain,
! [X141,X142,X143,X144] :
( ~ occurrence_of(X141,X143)
| ~ leaf_occ(X142,X141)
| ~ min_precedes(X142,X144,X143) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])])]) ).
cnf(c_0_31,negated_conjecture,
( min_precedes(esk6_1(X1),esk7_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_32,plain,
( next_subocc(X1,esk6_1(X1),tptp0)
| leaf_occ(X1,esk5_3(tptp0,X2,X3))
| ~ arboreal(X1)
| ~ min_precedes(X2,X3,tptp0)
| ~ subactivity_occurrence(X1,esk5_3(tptp0,X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_33,plain,
( subactivity_occurrence(X1,esk5_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,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_24,c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_36,plain,
( arboreal(X2)
| ~ atomic(X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,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_29,c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_38,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_39,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,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_31,c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_41,plain,
( next_subocc(X1,esk6_1(X1),tptp0)
| leaf_occ(X1,esk5_3(tptp0,X2,X1))
| ~ arboreal(X1)
| ~ min_precedes(X2,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
min_precedes(esk1_0,esk6_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
arboreal(esk6_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_44,negated_conjecture,
( ~ leaf_occ(esk6_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( next_subocc(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0)
| leaf_occ(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_46,plain,
( leaf_occ(X1,esk5_3(tptp0,X2,X3))
| occurrence_of(esk6_1(X1),tptp3)
| ~ arboreal(X1)
| ~ min_precedes(X2,X3,tptp0)
| ~ subactivity_occurrence(X1,esk5_3(tptp0,X2,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_47,negated_conjecture,
( next_subocc(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0)
| ~ occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( leaf_occ(X1,esk5_3(tptp0,X2,X1))
| occurrence_of(esk6_1(X1),tptp3)
| ~ arboreal(X1)
| ~ min_precedes(X2,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_46,c_0_33]) ).
cnf(c_0_49,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_15]) ).
cnf(c_0_50,negated_conjecture,
( min_precedes(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0)
| ~ occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_34,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( ~ leaf_occ(esk1_0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_39,c_0_42]) ).
fof(c_0_52,plain,
! [X134,X135,X136] :
( ~ occurrence_of(X134,X135)
| ~ occurrence_of(X134,X136)
| X135 = X136 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
fof(c_0_53,plain,
! [X168] :
( ( activity(esk10_1(X168))
| ~ activity_occurrence(X168) )
& ( occurrence_of(X168,esk10_1(X168))
| ~ activity_occurrence(X168) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])]) ).
fof(c_0_54,plain,
! [X166,X167] :
( ( activity(X166)
| ~ occurrence_of(X167,X166) )
& ( activity_occurrence(X167)
| ~ occurrence_of(X167,X166) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).
cnf(c_0_55,negated_conjecture,
( leaf_occ(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_42]),c_0_43])]) ).
cnf(c_0_56,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk8_1(esk1_0)
| esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0)
| ~ subactivity_occurrence(esk1_0,X1)
| ~ occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_26])]),c_0_51]) ).
cnf(c_0_57,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_15]) ).
cnf(c_0_58,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
( occurrence_of(X1,esk10_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3)
| ~ occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_44,c_0_55]) ).
cnf(c_0_62,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0)
| esk6_1(esk6_1(esk1_0)) = esk8_1(esk1_0)
| ~ subactivity_occurrence(esk1_0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_22]),c_0_42])]) ).
cnf(c_0_63,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk7_1(X1),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_19]) ).
fof(c_0_64,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_39]) ).
cnf(c_0_65,plain,
( occurrence_of(esk8_1(X1),tptp1)
| occurrence_of(esk8_1(X1),tptp2)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_66,plain,
( X1 = esk10_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_67,negated_conjecture,
occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_22]),c_0_42])]) ).
cnf(c_0_68,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk8_1(esk1_0)
| esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_25]),c_0_19])]) ).
cnf(c_0_69,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_63,c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_70,plain,
tptp4 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_64]) ).
cnf(c_0_71,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk8_1(X1),tptp2)
| occurrence_of(esk8_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_19]) ).
fof(c_0_72,plain,
tptp3 != tptp2,
inference(fof_simplification,[status(thm)],[sos_43]) ).
cnf(c_0_73,negated_conjecture,
esk10_1(esk6_1(esk6_1(esk1_0))) = tptp3,
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_74,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0)
| occurrence_of(esk8_1(esk1_0),tptp3) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
esk10_1(esk7_1(esk1_0)) = tptp4,
inference(spm,[status(thm)],[c_0_66,c_0_69]) ).
cnf(c_0_76,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_77,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(spm,[status(thm)],[c_0_71,c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_78,plain,
tptp3 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_72]) ).
fof(c_0_79,plain,
tptp3 != tptp1,
inference(fof_simplification,[status(thm)],[sos_42]) ).
cnf(c_0_80,negated_conjecture,
occurrence_of(esk8_1(esk1_0),tptp3),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76]) ).
cnf(c_0_81,negated_conjecture,
( X1 = tptp2
| occurrence_of(esk8_1(esk1_0),tptp1)
| ~ occurrence_of(esk8_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_77]) ).
cnf(c_0_82,plain,
tptp3 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_78]) ).
fof(c_0_83,plain,
tptp3 != tptp1,
inference(fof_nnf,[status(thm)],[c_0_79]) ).
cnf(c_0_84,negated_conjecture,
( X1 = tptp3
| ~ occurrence_of(esk8_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
occurrence_of(esk8_1(esk1_0),tptp1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_80]),c_0_82]) ).
cnf(c_0_86,plain,
tptp3 != tptp1,
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PRO018+4 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 03:57:52 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.46 # Version: 3.1.0
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # new_bool_3 with pid 20515 completed with status 0
% 0.16/0.46 # Result found by new_bool_3
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 20518 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 46
% 0.16/0.46 # Removed by relevancy pruning/SinE : 16
% 0.16/0.46 # Initial clauses : 69
% 0.16/0.46 # Removed in clause preprocessing : 6
% 0.16/0.46 # Initial clauses in saturation : 63
% 0.16/0.46 # Processed clauses : 437
% 0.16/0.46 # ...of these trivial : 13
% 0.16/0.46 # ...subsumed : 54
% 0.16/0.46 # ...remaining for further processing : 370
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 15
% 0.16/0.46 # Backward-rewritten : 23
% 0.16/0.46 # Generated clauses : 979
% 0.16/0.46 # ...of the previous two non-redundant : 738
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 4
% 0.16/0.46 # Paramodulations : 971
% 0.16/0.46 # Factorizations : 8
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 629
% 0.16/0.46 # ...of those cached : 579
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 269
% 0.16/0.46 # Positive orientable unit clauses : 62
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 16
% 0.16/0.46 # Non-unit-clauses : 191
% 0.16/0.46 # Current number of unprocessed clauses: 414
% 0.16/0.46 # ...number of literals in the above : 1778
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 101
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 15808
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 4858
% 0.16/0.46 # Non-unit clause-clause subsumptions : 58
% 0.16/0.46 # Unit Clause-clause subsumption calls : 2565
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 15
% 0.16/0.46 # BW rewrite match successes : 9
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 27375
% 0.16/0.46 # Search garbage collected termcells : 1094
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.026 s
% 0.16/0.46 # System time : 0.005 s
% 0.16/0.46 # Total time : 0.031 s
% 0.16/0.46 # Maximum resident set size: 2052 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.028 s
% 0.16/0.46 # System time : 0.007 s
% 0.16/0.46 # Total time : 0.034 s
% 0.16/0.46 # Maximum resident set size: 1812 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------