%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PRO016+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:59:45 PM UTC 2026
% Result : Theorem 254.31s 37.19s
% Output : CNFRefutation 254.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of formulae : 89 ( 24 unt; 0 def)
% Number of atoms : 452 ( 12 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 574 ( 211 ~; 237 |; 103 &)
% ( 2 <=>; 21 =>; 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 : 161 ( 6 sgn 79 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( ( occurrence_of(X104,tptp2)
=> ~ ? [X106] :
( min_precedes(X103,X106,tptp0)
& occurrence_of(X106,tptp1) ) )
& ( occurrence_of(X104,tptp1)
=> ~ ? [X105] :
( min_precedes(X103,X105,tptp0)
& occurrence_of(X105,tptp2) ) )
& leaf_occ(X104,X102)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( leaf_occ(X100,X97)
& next_subocc(X99,X100,tptp0)
& ( occurrence_of(X100,tptp2)
| occurrence_of(X100,tptp1) )
& next_subocc(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( ~ ? [X19] :
( min_precedes(X19,X17,X18)
& min_precedes(X16,X19,X18) )
& min_precedes(X16,X17,X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(sos_24,axiom,
! [X71,X72,X73] :
( min_precedes(X72,X73,X71)
=> ? [X74] :
( subactivity_occurrence(X73,X74)
& subactivity_occurrence(X72,X74)
& occurrence_of(X74,X71) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_24) ).
fof(sos_05,axiom,
! [X20,X21,X22] :
( next_subocc(X20,X21,X22)
=> ( arboreal(X21)
& arboreal(X20) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(sos_21,axiom,
! [X61,X62,X63] :
( ( leaf_occ(X62,X61)
& occurrence_of(X61,X63) )
=> ~ ? [X64] : min_precedes(X62,X64,X63) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos_03,axiom,
! [X12,X13,X14,X15] :
( ( leaf_occ(X13,X14)
& leaf_occ(X12,X14)
& ~ atomic(X15)
& occurrence_of(X14,X15) )
=> X12 = X13 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
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_35,axiom,
atomic(tptp4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(sos_22,axiom,
! [X65,X66,X67] :
( ( occurrence_of(X65,X67)
& occurrence_of(X65,X66) )
=> X66 = X67 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(sos_18,axiom,
! [X53] :
( activity_occurrence(X53)
=> ? [X54] :
( occurrence_of(X53,X54)
& activity(X54) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(sos_29,axiom,
! [X90,X91] :
( occurrence_of(X91,X90)
=> ( activity_occurrence(X91)
& activity(X90) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos,axiom,
! [X1,X2,X3,X4] :
( ( min_precedes(X2,X3,X4)
& min_precedes(X1,X2,X4) )
=> min_precedes(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(c_0_14,negated_conjecture,
~ ! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( ( occurrence_of(X104,tptp2)
=> ~ ? [X106] :
( min_precedes(X103,X106,tptp0)
& occurrence_of(X106,tptp1) ) )
& ( occurrence_of(X104,tptp1)
=> ~ ? [X105] :
( min_precedes(X103,X105,tptp0)
& occurrence_of(X105,tptp2) ) )
& leaf_occ(X104,X102)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( leaf_occ(X100,X97)
& next_subocc(X99,X100,tptp0)
& ( occurrence_of(X100,tptp2)
| occurrence_of(X100,tptp1) )
& next_subocc(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_16,negated_conjecture,
~ ! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( ( occurrence_of(X104,tptp2)
=> ~ ? [X106] :
( min_precedes(X103,X106,tptp0)
& occurrence_of(X106,tptp1) ) )
& ( occurrence_of(X104,tptp1)
=> ~ ? [X105] :
( min_precedes(X103,X105,tptp0)
& occurrence_of(X105,tptp2) ) )
& leaf_occ(X104,X102)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X121,X122] :
( ( leaf_occ(X121,X122)
| ~ arboreal(X121)
| ~ subactivity_occurrence(X121,X122)
| ~ occurrence_of(X122,tptp0)
| leaf_occ(esk8_2(X121,X122),X122) )
& ( leaf_occ(X121,X122)
| ~ arboreal(X121)
| ~ subactivity_occurrence(X121,X122)
| ~ occurrence_of(X122,tptp0)
| next_subocc(esk7_2(X121,X122),esk8_2(X121,X122),tptp0) )
& ( leaf_occ(X121,X122)
| ~ arboreal(X121)
| ~ subactivity_occurrence(X121,X122)
| ~ occurrence_of(X122,tptp0)
| occurrence_of(esk8_2(X121,X122),tptp2)
| occurrence_of(esk8_2(X121,X122),tptp1) )
& ( leaf_occ(X121,X122)
| ~ arboreal(X121)
| ~ subactivity_occurrence(X121,X122)
| ~ occurrence_of(X122,tptp0)
| next_subocc(esk6_2(X121,X122),esk7_2(X121,X122),tptp0) )
& ( leaf_occ(X121,X122)
| ~ arboreal(X121)
| ~ subactivity_occurrence(X121,X122)
| ~ occurrence_of(X122,tptp0)
| occurrence_of(esk7_2(X121,X122),tptp4) )
& ( leaf_occ(X121,X122)
| ~ arboreal(X121)
| ~ subactivity_occurrence(X121,X122)
| ~ occurrence_of(X122,tptp0)
| next_subocc(X121,esk6_2(X121,X122),tptp0) )
& ( leaf_occ(X121,X122)
| ~ arboreal(X121)
| ~ subactivity_occurrence(X121,X122)
| ~ occurrence_of(X122,tptp0)
| occurrence_of(esk6_2(X121,X122),tptp3) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
fof(c_0_18,negated_conjecture,
! [X109,X110] :
( ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| min_precedes(X109,esk3_2(X109,X110),tptp0)
| min_precedes(X109,esk4_2(X109,X110),tptp0) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| min_precedes(X109,esk3_2(X109,X110),tptp0)
| occurrence_of(esk4_2(X109,X110),tptp1) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| min_precedes(X109,esk3_2(X109,X110),tptp0)
| occurrence_of(X110,tptp2) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| occurrence_of(esk3_2(X109,X110),tptp2)
| min_precedes(X109,esk4_2(X109,X110),tptp0) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| occurrence_of(esk3_2(X109,X110),tptp2)
| occurrence_of(esk4_2(X109,X110),tptp1) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| occurrence_of(esk3_2(X109,X110),tptp2)
| occurrence_of(X110,tptp2) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1)
| min_precedes(X109,esk4_2(X109,X110),tptp0) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1)
| occurrence_of(esk4_2(X109,X110),tptp1) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| min_precedes(X109,esk3_2(X109,X110),tptp0)
| min_precedes(X109,esk4_2(X109,X110),tptp0) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| min_precedes(X109,esk3_2(X109,X110),tptp0)
| occurrence_of(esk4_2(X109,X110),tptp1) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| min_precedes(X109,esk3_2(X109,X110),tptp0)
| occurrence_of(X110,tptp2) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| occurrence_of(esk3_2(X109,X110),tptp2)
| min_precedes(X109,esk4_2(X109,X110),tptp0) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| occurrence_of(esk3_2(X109,X110),tptp2)
| occurrence_of(esk4_2(X109,X110),tptp1) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| occurrence_of(esk3_2(X109,X110),tptp2)
| occurrence_of(X110,tptp2) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp1)
| min_precedes(X109,esk4_2(X109,X110),tptp0) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp1)
| occurrence_of(esk4_2(X109,X110),tptp1) )
& ( ~ leaf_occ(X110,esk2_0)
| ~ min_precedes(X109,X110,tptp0)
| ~ next_subocc(esk1_0,X109,tptp0)
| ~ occurrence_of(X109,tptp3)
| ~ occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& ~ leaf_occ(esk1_0,esk2_0)
& arboreal(esk1_0)
& subactivity_occurrence(esk1_0,esk2_0)
& occurrence_of(esk2_0,tptp0) ),
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_16])])])])])]) ).
fof(c_0_19,plain,
! [X137,X138,X139,X140,X141,X142,X143] :
( ( next_subocc(X141,X142,X143)
| ~ min_precedes(X141,X142,X143)
| min_precedes(esk9_3(X141,X142,X143),X142,X143) )
& ( next_subocc(X141,X142,X143)
| ~ min_precedes(X141,X142,X143)
| min_precedes(X141,esk9_3(X141,X142,X143),X143) )
& ( ~ next_subocc(X137,X138,X139)
| ~ min_precedes(X140,X138,X139)
| ~ min_precedes(X137,X140,X139) )
& ( ~ next_subocc(X137,X138,X139)
| min_precedes(X137,X138,X139) ) ),
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_20,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk7_2(X1,X2),esk8_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X117,X118,X119] :
( ( ~ min_precedes(X118,X119,X117)
| subactivity_occurrence(X119,esk5_3(X117,X118,X119)) )
& ( ~ min_precedes(X118,X119,X117)
| subactivity_occurrence(X118,esk5_3(X117,X118,X119)) )
& ( ~ min_precedes(X118,X119,X117)
| occurrence_of(esk5_3(X117,X118,X119),X117) ) ),
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_26,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
next_subocc(esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
fof(c_0_28,plain,
! [X145,X146,X147] :
( ( ~ next_subocc(X145,X146,X147)
| arboreal(X146) )
& ( ~ next_subocc(X145,X146,X147)
| arboreal(X145) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])])]) ).
cnf(c_0_29,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk5_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
min_precedes(esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0),tptp0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ next_subocc(X2,X1,X3)
| arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk5_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X133,X134,X135,X136] :
( ~ min_precedes(X134,X136,X135)
| ~ leaf_occ(X134,X133)
| ~ occurrence_of(X133,X135) ),
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_34,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf_occ(esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_35,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk6_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_36,negated_conjecture,
subactivity_occurrence(esk8_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
arboreal(esk8_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_38,negated_conjecture,
occurrence_of(esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)),tptp0),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
fof(c_0_39,plain,
! [X12,X13,X14,X15] :
( ( leaf_occ(X13,X14)
& leaf_occ(X12,X14)
& ~ atomic(X15)
& occurrence_of(X14,X15) )
=> X12 = X13 ),
inference(fof_simplification,[status(thm)],[sos_03]) ).
cnf(c_0_40,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_42,negated_conjecture,
( leaf_occ(esk8_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| next_subocc(esk8_2(esk1_0,esk2_0),esk6_2(esk8_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
fof(c_0_43,plain,
! [X148,X149] :
( ( ~ occurrence_of(X148,X149)
| arboreal(X148)
| ~ atomic(X149) )
& ( ~ occurrence_of(X148,X149)
| atomic(X149)
| ~ arboreal(X148) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_13])])])]) ).
cnf(c_0_44,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk7_2(X1,X2),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_45,plain,
! [X129,X130,X131,X132] :
( X129 = X130
| ~ leaf_occ(X130,X131)
| ~ leaf_occ(X129,X131)
| atomic(X132)
| ~ occurrence_of(X131,X132) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ min_precedes(esk8_2(esk1_0,esk2_0),X2,X1)
| ~ occurrence_of(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( min_precedes(esk8_2(esk1_0,esk2_0),esk6_2(esk8_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_48,plain,
( ~ min_precedes(X1,X3,X2)
| subactivity_occurrence(X1,esk5_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_49,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,negated_conjecture,
occurrence_of(esk7_2(esk1_0,esk2_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_51,plain,
atomic(tptp4),
inference(split_conjunct,[status(thm)],[sos_35]) ).
fof(c_0_52,plain,
! [X126,X127,X128] :
( X127 = X128
| ~ occurrence_of(X126,X128)
| ~ occurrence_of(X126,X127) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])]) ).
fof(c_0_53,plain,
! [X158] :
( ( ~ activity_occurrence(X158)
| occurrence_of(X158,esk11_1(X158)) )
& ( ~ activity_occurrence(X158)
| activity(esk11_1(X158)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])])])])]) ).
fof(c_0_54,plain,
! [X160,X161] :
( ( ~ occurrence_of(X161,X160)
| activity_occurrence(X161) )
& ( ~ occurrence_of(X161,X160)
| activity(X160) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])])]) ).
cnf(c_0_55,plain,
( ~ leaf_occ(X4,X1)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2)
| X3 = X4
| atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
leaf_occ(esk8_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_23])]) ).
cnf(c_0_57,negated_conjecture,
subactivity_occurrence(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_48,c_0_30]) ).
cnf(c_0_58,negated_conjecture,
arboreal(esk7_2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_59,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_61,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
fof(c_0_62,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_63,negated_conjecture,
( ~ occurrence_of(esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)),X2)
| ~ leaf_occ(X1,esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| atomic(X2)
| X1 = esk8_2(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| leaf_occ(esk8_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_57]),c_0_58]),c_0_38])]) ).
cnf(c_0_65,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk11_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
fof(c_0_66,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| next_subocc(esk7_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),esk8_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_57]),c_0_58]),c_0_38])]) ).
cnf(c_0_68,negated_conjecture,
( ~ occurrence_of(esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)),X1)
| atomic(X1)
| leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| esk8_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) = esk8_2(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
esk11_1(esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) = tptp0,
inference(spm,[status(thm)],[c_0_65,c_0_38]) ).
cnf(c_0_70,negated_conjecture,
activity_occurrence(esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_61,c_0_38]) ).
cnf(c_0_71,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
fof(c_0_72,plain,
! [X113,X114,X115,X116] :
( min_precedes(X113,X115,X116)
| ~ min_precedes(X114,X115,X116)
| ~ min_precedes(X113,X114,X116) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
cnf(c_0_73,negated_conjecture,
( min_precedes(esk7_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),esk8_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0)
| leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_67]) ).
cnf(c_0_74,negated_conjecture,
( leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| esk8_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) = esk8_2(esk1_0,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_60]),c_0_69]),c_0_70])]),c_0_71]) ).
cnf(c_0_75,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk6_2(X1,X2),esk7_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_76,plain,
( ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_77,negated_conjecture,
( min_precedes(esk7_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),esk8_2(esk1_0,esk2_0),tptp0)
| leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| next_subocc(esk6_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),esk7_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_57]),c_0_58]),c_0_38])]) ).
cnf(c_0_79,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_80,negated_conjecture,
( ~ min_precedes(X1,esk7_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0)
| min_precedes(X1,esk8_2(esk1_0,esk2_0),tptp0)
| leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,negated_conjecture,
( min_precedes(esk6_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),esk7_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0)
| leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
( leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)))
| next_subocc(esk7_2(esk1_0,esk2_0),esk6_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_57]),c_0_58]),c_0_38])]) ).
cnf(c_0_83,negated_conjecture,
( ~ min_precedes(esk7_2(esk1_0,esk2_0),X1,tptp0)
| ~ min_precedes(X1,esk8_2(esk1_0,esk2_0),tptp0) ),
inference(spm,[status(thm)],[c_0_79,c_0_27]) ).
cnf(c_0_84,negated_conjecture,
( min_precedes(esk6_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),esk8_2(esk1_0,esk2_0),tptp0)
| leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,negated_conjecture,
( min_precedes(esk7_2(esk1_0,esk2_0),esk6_2(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),tptp0)
| leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_82]) ).
cnf(c_0_86,negated_conjecture,
leaf_occ(esk7_2(esk1_0,esk2_0),esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_87,negated_conjecture,
( ~ min_precedes(esk7_2(esk1_0,esk2_0),X2,X1)
| ~ occurrence_of(esk5_3(tptp0,esk7_2(esk1_0,esk2_0),esk8_2(esk1_0,esk2_0)),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_86]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_30]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO016+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:42:45 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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
% 254.31/37.19 % Version: 3.5.1
% 254.31/37.19 % Preprocessing class: FSLSSMSSSSSNFFN.
% 254.31/37.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 254.31/37.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 254.31/37.19 % Starting new_bool_3 with 300s (1) cores
% 254.31/37.19 % Starting new_bool_1 with 300s (1) cores
% 254.31/37.19 % Starting sh5l with 300s (1) cores
% 254.31/37.19 % new_bool_3 with pid 1934300 completed with status 0
% 254.31/37.19 % Result found by new_bool_3
% 254.31/37.19 % Preprocessing class: FSLSSMSSSSSNFFN.
% 254.31/37.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 254.31/37.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 254.31/37.19 % Starting new_bool_3 with 300s (1) cores
% 254.31/37.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 254.31/37.19 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 254.31/37.19 % Search class: FGHSF-FFMM32-SFFFFFNN
% 254.31/37.19 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 254.31/37.19 % Starting SubtermCWHack with 28s (1) cores
% 254.31/37.19 % SubtermCWHack with pid 1934303 completed with status 8
% 254.31/37.19 % Starting new_bool_3 with 31s (1) cores
% 254.31/37.19 % new_bool_3 with pid 1934503 completed with status 0
% 254.31/37.19 % Result found by new_bool_3
% 254.31/37.19 % Preprocessing class: FSLSSMSSSSSNFFN.
% 254.31/37.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 254.31/37.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 254.31/37.19 % Starting new_bool_3 with 300s (1) cores
% 254.31/37.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 254.31/37.19 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 254.31/37.19 % Search class: FGHSF-FFMM32-SFFFFFNN
% 254.31/37.19 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 254.31/37.19 % Starting SubtermCWHack with 28s (1) cores
% 254.31/37.19 % SubtermCWHack with pid 1934303 completed with status 8
% 254.31/37.19 % Starting new_bool_3 with 31s (1) cores
% 254.31/37.19 % Preprocessing time : 0.001 s
% 254.31/37.19 % Presaturation interreduction done
% 254.31/37.19
% 254.31/37.19 % Proof found!
% 254.31/37.19 % SZS status Theorem
% 254.31/37.19 % SZS output start CNFRefutation
% See solution above
% 254.31/37.19 % Parsed axioms : 46
% 254.31/37.19 % Removed by relevancy pruning/SinE : 11
% 254.31/37.19 % Initial clauses : 80
% 254.31/37.19 % Removed in clause preprocessing : 6
% 254.31/37.19 % Initial clauses in saturation : 74
% 254.31/37.19 % Processed clauses : 28538
% 254.31/37.19 % ...of these trivial : 69
% 254.31/37.19 % ...subsumed : 18326
% 254.31/37.19 % ...remaining for further processing : 10143
% 254.31/37.19 % Other redundant clauses eliminated : 0
% 254.31/37.19 % Clauses deleted for lack of memory : 0
% 254.31/37.19 % Backward-subsumed : 220
% 254.31/37.19 % Backward-rewritten : 264
% 254.31/37.19 % Generated clauses : 133882
% 254.31/37.19 % ...of the previous two non-redundant : 126699
% 254.31/37.19 % ...aggressively subsumed : 0
% 254.31/37.19 % Contextual simplify-reflections : 1749
% 254.31/37.19 % Paramodulations : 133882
% 254.31/37.19 % Factorizations : 0
% 254.31/37.19 % NegExts : 0
% 254.31/37.19 % Equation resolutions : 0
% 254.31/37.19 % Disequality decompositions : 0
% 254.31/37.19 % Total rewrite steps : 30729
% 254.31/37.19 % ...of those cached : 30520
% 254.31/37.19 % Propositional unsat checks : 2
% 254.31/37.19 % Propositional check models : 1
% 254.31/37.19 % Propositional check unsatisfiable : 0
% 254.31/37.19 % Propositional clauses : 0
% 254.31/37.19 % Propositional clauses after purity: 0
% 254.31/37.19 % Propositional unsat core size : 0
% 254.31/37.19 % Propositional preprocessing time : 0.000
% 254.31/37.19 % Propositional encoding time : 0.066
% 254.31/37.19 % Propositional solver time : 0.103
% 254.31/37.19 % Success case prop preproc time : 0.000
% 254.31/37.19 % Success case prop encoding time : 0.000
% 254.31/37.19 % Success case prop solver time : 0.000
% 254.31/37.19 % Current number of processed clauses : 9585
% 254.31/37.19 % Positive orientable unit clauses : 239
% 254.31/37.19 % Positive unorientable unit clauses: 0
% 254.31/37.19 % Negative unit clauses : 49
% 254.31/37.19 % Non-unit-clauses : 9297
% 254.31/37.19 % Current number of unprocessed clauses: 98011
% 254.31/37.19 % ...number of literals in the above : 420984
% 254.31/37.19 % Current number of archived formulas : 0
% 254.31/37.19 % Current number of archived clauses : 558
% 254.31/37.19 % Clause-clause subsumption calls (NU) : 16928403
% 254.31/37.19 % Rec. Clause-clause subsumption calls : 5439706
% 254.31/37.19 % Non-unit clause-clause subsumptions : 18102
% 254.31/37.19 % Unit Clause-clause subsumption calls : 25715
% 254.31/37.19 % Rewrite failures with RHS unbound : 0
% 254.31/37.19 % BW rewrite match attempts : 303
% 254.31/37.19 % BW rewrite match successes : 32
% 254.31/37.19 % Condensation attempts : 0
% 254.31/37.19 % Condensation successes : 0
% 254.31/37.19 % Termbank termtop insertions : 8139096
% 254.31/37.19 % Search garbage collected termcells : 1120
% 254.31/37.19
% 254.31/37.19 % -------------------------------------------------
% 254.31/37.19 % User time : 36.215 s
% 254.31/37.19 % System time : 0.332 s
% 254.31/37.19 % Total time : 36.548 s
% 254.31/37.19 % Maximum resident set size: 3996 pages
% 254.31/37.19
% 254.31/37.19 % -------------------------------------------------
% 254.31/37.19 % User time : 36.217 s
% 254.31/37.19 % System time : 0.340 s
% 254.31/37.19 % Total time : 36.557 s
% 254.31/37.19 % Maximum resident set size: 4864 pages
% 254.31/37.19 % E exiting
%------------------------------------------------------------------------------