%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO016+4 : 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 : n016.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:35 PM UTC 2026
% Result : Theorem 0.33s 0.79s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 93 ( 35 unt; 0 def)
% Number of atoms : 469 ( 7 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 609 ( 233 ~; 249 |; 104 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 169 ( 3 sgn 86 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( ( occurrence_of(X110,tptp2)
=> ~ ? [X112] :
( min_precedes(X109,X112,tptp0)
& occurrence_of(X112,tptp1) ) )
& ( occurrence_of(X110,tptp1)
=> ~ ? [X111] :
( min_precedes(X109,X111,tptp0)
& occurrence_of(X111,tptp2) ) )
& leaf_occ(X110,X108)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105,X106] :
( leaf_occ(X106,X103)
& next_subocc(X105,X106,tptp0)
& ( occurrence_of(X106,tptp2)
| occurrence_of(X106,tptp1) )
& next_subocc(X104,X105,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(sos_26,axiom,
! [X79,X80,X81] :
( next_subocc(X79,X80,X81)
<=> ( ~ ? [X82] :
( min_precedes(X82,X80,X81)
& min_precedes(X79,X82,X81) )
& min_precedes(X79,X80,X81) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26) ).
fof(sos_27,axiom,
! [X83,X84,X85,X86] :
( ( subactivity_occurrence(X84,X86)
& occurrence_of(X86,X85)
& min_precedes(X83,X84,X85) )
=> subactivity_occurrence(X83,X86) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_27) ).
fof(sos_18,axiom,
! [X56,X57] :
( leaf_occ(X56,X57)
<=> ? [X58] :
( leaf(X56,X58)
& subactivity_occurrence(X56,X57)
& occurrence_of(X57,X58) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(sos_09,axiom,
! [X32,X33,X34] :
( ( leaf_occ(X33,X32)
& occurrence_of(X32,X34) )
=> ~ ? [X35] : min_precedes(X33,X35,X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(sos_28,axiom,
! [X87,X88,X89,X90] :
( ( leaf_occ(X88,X89)
& leaf_occ(X87,X89)
& ~ atomic(X90)
& occurrence_of(X89,X90) )
=> X87 = X88 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_28) ).
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_35,axiom,
atomic(tptp4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_24,axiom,
! [X73,X74,X75] :
( min_precedes(X73,X74,X75)
=> precedes(X73,X74) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_24) ).
fof(sos_21,axiom,
! [X64,X65] :
( precedes(X64,X65)
<=> ( legal(X65)
& earlier(X64,X65) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos_30,axiom,
! [X95,X96,X97] :
( ( earlier(X96,X97)
& earlier(X95,X96) )
=> earlier(X95,X97) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_30) ).
fof(sos_31,axiom,
! [X98,X99,X100,X101] :
( ( precedes(X99,X100)
& min_precedes(X98,X100,X101)
& min_precedes(X98,X99,X101) )
=> min_precedes(X99,X100,X101) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_31) ).
fof(c_0_14,negated_conjecture,
~ ! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( ( occurrence_of(X110,tptp2)
=> ~ ? [X112] :
( min_precedes(X109,X112,tptp0)
& occurrence_of(X112,tptp1) ) )
& ( occurrence_of(X110,tptp1)
=> ~ ? [X111] :
( min_precedes(X109,X111,tptp0)
& occurrence_of(X111,tptp2) ) )
& leaf_occ(X110,X108)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105,X106] :
( leaf_occ(X106,X103)
& next_subocc(X105,X106,tptp0)
& ( occurrence_of(X106,tptp2)
| occurrence_of(X106,tptp1) )
& next_subocc(X104,X105,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_16,negated_conjecture,
~ ! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( ( occurrence_of(X110,tptp2)
=> ~ ? [X112] :
( min_precedes(X109,X112,tptp0)
& occurrence_of(X112,tptp1) ) )
& ( occurrence_of(X110,tptp1)
=> ~ ? [X111] :
( min_precedes(X109,X111,tptp0)
& occurrence_of(X111,tptp2) ) )
& leaf_occ(X110,X108)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X231,X232] :
( ( leaf_occ(X231,X232)
| ~ arboreal(X231)
| ~ subactivity_occurrence(X231,X232)
| ~ occurrence_of(X232,tptp0)
| leaf_occ(esk15_2(X231,X232),X232) )
& ( leaf_occ(X231,X232)
| ~ arboreal(X231)
| ~ subactivity_occurrence(X231,X232)
| ~ occurrence_of(X232,tptp0)
| next_subocc(esk14_2(X231,X232),esk15_2(X231,X232),tptp0) )
& ( leaf_occ(X231,X232)
| ~ arboreal(X231)
| ~ subactivity_occurrence(X231,X232)
| ~ occurrence_of(X232,tptp0)
| occurrence_of(esk15_2(X231,X232),tptp2)
| occurrence_of(esk15_2(X231,X232),tptp1) )
& ( leaf_occ(X231,X232)
| ~ arboreal(X231)
| ~ subactivity_occurrence(X231,X232)
| ~ occurrence_of(X232,tptp0)
| next_subocc(esk13_2(X231,X232),esk14_2(X231,X232),tptp0) )
& ( leaf_occ(X231,X232)
| ~ arboreal(X231)
| ~ subactivity_occurrence(X231,X232)
| ~ occurrence_of(X232,tptp0)
| occurrence_of(esk14_2(X231,X232),tptp4) )
& ( leaf_occ(X231,X232)
| ~ arboreal(X231)
| ~ subactivity_occurrence(X231,X232)
| ~ occurrence_of(X232,tptp0)
| next_subocc(X231,esk13_2(X231,X232),tptp0) )
& ( leaf_occ(X231,X232)
| ~ arboreal(X231)
| ~ subactivity_occurrence(X231,X232)
| ~ occurrence_of(X232,tptp0)
| occurrence_of(esk13_2(X231,X232),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,
! [X238,X239] :
( ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| min_precedes(X238,esk19_2(X238,X239),tptp0) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| occurrence_of(esk19_2(X238,X239),tptp1) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| occurrence_of(X239,tptp2) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| occurrence_of(esk18_2(X238,X239),tptp2)
| min_precedes(X238,esk19_2(X238,X239),tptp0) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| occurrence_of(esk18_2(X238,X239),tptp2)
| occurrence_of(esk19_2(X238,X239),tptp1) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| occurrence_of(esk18_2(X238,X239),tptp2)
| occurrence_of(X239,tptp2) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| occurrence_of(X239,tptp1)
| min_precedes(X238,esk19_2(X238,X239),tptp0) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| occurrence_of(X239,tptp1)
| occurrence_of(esk19_2(X238,X239),tptp1) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2)
| occurrence_of(X239,tptp1)
| occurrence_of(X239,tptp2) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| min_precedes(X238,esk19_2(X238,X239),tptp0) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| occurrence_of(esk19_2(X238,X239),tptp1) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| occurrence_of(X239,tptp2) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| occurrence_of(esk18_2(X238,X239),tptp2)
| min_precedes(X238,esk19_2(X238,X239),tptp0) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| occurrence_of(esk18_2(X238,X239),tptp2)
| occurrence_of(esk19_2(X238,X239),tptp1) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| occurrence_of(esk18_2(X238,X239),tptp2)
| occurrence_of(X239,tptp2) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| occurrence_of(X239,tptp1)
| min_precedes(X238,esk19_2(X238,X239),tptp0) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| occurrence_of(X239,tptp1)
| occurrence_of(esk19_2(X238,X239),tptp1) )
& ( ~ leaf_occ(X239,esk17_0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1)
| occurrence_of(X239,tptp1)
| occurrence_of(X239,tptp2) )
& ~ leaf_occ(esk16_0,esk17_0)
& arboreal(esk16_0)
& subactivity_occurrence(esk16_0,esk17_0)
& occurrence_of(esk17_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])])])])])]) ).
cnf(c_0_19,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk14_2(X1,X2),esk15_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
occurrence_of(esk17_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X204,X205,X206,X207,X208,X209,X210] :
( ( next_subocc(X208,X209,X210)
| ~ min_precedes(X208,X209,X210)
| min_precedes(esk12_3(X208,X209,X210),X209,X210) )
& ( next_subocc(X208,X209,X210)
| ~ min_precedes(X208,X209,X210)
| min_precedes(X208,esk12_3(X208,X209,X210),X210) )
& ( ~ next_subocc(X204,X205,X206)
| ~ min_precedes(X207,X205,X206)
| ~ min_precedes(X204,X207,X206) )
& ( ~ next_subocc(X204,X205,X206)
| min_precedes(X204,X205,X206) ) ),
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_22,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk17_0)
| next_subocc(esk14_2(X1,esk17_0),esk15_2(X1,esk17_0),tptp0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
arboreal(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf_occ(esk15_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_27,plain,
! [X212,X213,X214,X215] :
( subactivity_occurrence(X212,X215)
| ~ subactivity_occurrence(X213,X215)
| ~ occurrence_of(X215,X214)
| ~ min_precedes(X212,X213,X214) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_27])])]) ).
cnf(c_0_28,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
next_subocc(esk14_2(esk16_0,esk17_0),esk15_2(esk16_0,esk17_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
fof(c_0_30,plain,
! [X175,X176,X178,X179,X180] :
( ( leaf_occ(X178,X179)
| ~ leaf(X178,X180)
| ~ subactivity_occurrence(X178,X179)
| ~ occurrence_of(X179,X180) )
& ( ~ leaf_occ(X175,X176)
| leaf(X175,esk9_2(X175,X176)) )
& ( ~ leaf_occ(X175,X176)
| subactivity_occurrence(X175,X176) )
& ( ~ leaf_occ(X175,X176)
| occurrence_of(X176,esk9_2(X175,X176)) ) ),
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_18])])])])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk17_0)
| leaf_occ(esk15_2(X1,esk17_0),esk17_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_32,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk14_2(X1,X2),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_33,plain,
! [X144,X145,X146,X147] :
( ~ min_precedes(X145,X147,X146)
| ~ leaf_occ(X145,X144)
| ~ occurrence_of(X144,X146) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])])]) ).
fof(c_0_34,plain,
! [X87,X88,X89,X90] :
( ( leaf_occ(X88,X89)
& leaf_occ(X87,X89)
& ~ atomic(X90)
& occurrence_of(X89,X90) )
=> X87 = X88 ),
inference(fof_simplification,[status(thm)],[sos_28]) ).
cnf(c_0_35,plain,
( ~ subactivity_occurrence(X2,X4)
| ~ occurrence_of(X4,X3)
| ~ min_precedes(X1,X2,X3)
| subactivity_occurrence(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
min_precedes(esk14_2(esk16_0,esk17_0),esk15_2(esk16_0,esk17_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ leaf_occ(X1,X2)
| subactivity_occurrence(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
leaf_occ(esk15_2(esk16_0,esk17_0),esk17_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_24])]),c_0_25]) ).
fof(c_0_39,plain,
! [X171,X172] :
( ( ~ occurrence_of(X171,X172)
| arboreal(X171)
| ~ atomic(X172) )
& ( ~ occurrence_of(X171,X172)
| atomic(X172)
| ~ arboreal(X171) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| occurrence_of(esk14_2(X1,esk17_0),tptp4)
| leaf_occ(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_41,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_42,plain,
! [X216,X217,X218,X219] :
( X216 = X217
| ~ leaf_occ(X217,X218)
| ~ leaf_occ(X216,X218)
| atomic(X219)
| ~ occurrence_of(X218,X219) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
cnf(c_0_43,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk15_2(esk16_0,esk17_0),X1)
| subactivity_occurrence(esk14_2(esk16_0,esk17_0),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
subactivity_occurrence(esk15_2(esk16_0,esk17_0),esk17_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
occurrence_of(esk14_2(esk16_0,esk17_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_47,plain,
atomic(tptp4),
inference(split_conjunct,[status(thm)],[sos_35]) ).
cnf(c_0_48,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk14_2(esk16_0,esk17_0),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_49,plain,
( ~ leaf_occ(X4,X1)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2)
| X3 = X4
| atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
subactivity_occurrence(esk14_2(esk16_0,esk17_0),esk17_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_20]),c_0_44])]) ).
cnf(c_0_51,negated_conjecture,
arboreal(esk14_2(esk16_0,esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_52,negated_conjecture,
~ leaf_occ(esk14_2(esk16_0,esk17_0),esk17_0),
inference(spm,[status(thm)],[c_0_48,c_0_20]) ).
fof(c_0_53,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_54,negated_conjecture,
( ~ occurrence_of(esk17_0,X2)
| ~ leaf_occ(X1,esk17_0)
| atomic(X2)
| X1 = esk15_2(esk16_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_55,negated_conjecture,
leaf_occ(esk15_2(esk14_2(esk16_0,esk17_0),esk17_0),esk17_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_50]),c_0_51])]),c_0_52]) ).
fof(c_0_56,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( ~ occurrence_of(esk17_0,X1)
| atomic(X1)
| esk15_2(esk14_2(esk16_0,esk17_0),esk17_0) = esk15_2(esk16_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_59,negated_conjecture,
esk15_2(esk14_2(esk16_0,esk17_0),esk17_0) = esk15_2(esk16_0,esk17_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_20]),c_0_58]) ).
cnf(c_0_60,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk13_2(X1,X2),esk14_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_61,plain,
! [X198,X199,X200] :
( precedes(X198,X199)
| ~ min_precedes(X198,X199,X200) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])]) ).
cnf(c_0_62,negated_conjecture,
next_subocc(esk14_2(esk14_2(esk16_0,esk17_0),esk17_0),esk15_2(esk16_0,esk17_0),tptp0),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_50]),c_0_51])]),c_0_52]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk17_0)
| next_subocc(esk13_2(X1,esk17_0),esk14_2(X1,esk17_0),tptp0) ),
inference(spm,[status(thm)],[c_0_60,c_0_20]) ).
fof(c_0_64,plain,
! [X189,X190] :
( ( precedes(X189,X190)
| ~ legal(X190)
| ~ earlier(X189,X190) )
& ( ~ precedes(X189,X190)
| legal(X190) )
& ( ~ precedes(X189,X190)
| earlier(X189,X190) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])]) ).
cnf(c_0_65,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_66,negated_conjecture,
min_precedes(esk14_2(esk14_2(esk16_0,esk17_0),esk17_0),esk15_2(esk16_0,esk17_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
next_subocc(esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),esk14_2(esk14_2(esk16_0,esk17_0),esk17_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_50]),c_0_51])]),c_0_52]) ).
fof(c_0_68,plain,
! [X224,X225,X226] :
( earlier(X224,X226)
| ~ earlier(X225,X226)
| ~ earlier(X224,X225) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_30])])]) ).
cnf(c_0_69,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_70,negated_conjecture,
precedes(esk14_2(esk14_2(esk16_0,esk17_0),esk17_0),esk15_2(esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
min_precedes(esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),esk14_2(esk14_2(esk16_0,esk17_0),esk17_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_67]) ).
cnf(c_0_72,plain,
( ~ earlier(X2,X3)
| ~ earlier(X1,X2)
| earlier(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_73,negated_conjecture,
earlier(esk14_2(esk14_2(esk16_0,esk17_0),esk17_0),esk15_2(esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
precedes(esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),esk14_2(esk14_2(esk16_0,esk17_0),esk17_0)),
inference(spm,[status(thm)],[c_0_65,c_0_71]) ).
cnf(c_0_75,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk13_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_76,plain,
! [X227,X228,X229,X230] :
( min_precedes(X228,X229,X230)
| ~ precedes(X228,X229)
| ~ min_precedes(X227,X229,X230)
| ~ min_precedes(X227,X228,X230) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_31])])]) ).
cnf(c_0_77,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_78,negated_conjecture,
( ~ earlier(X1,esk14_2(esk14_2(esk16_0,esk17_0),esk17_0))
| earlier(X1,esk15_2(esk16_0,esk17_0)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
earlier(esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),esk14_2(esk14_2(esk16_0,esk17_0),esk17_0)),
inference(spm,[status(thm)],[c_0_69,c_0_74]) ).
cnf(c_0_80,plain,
( ~ precedes(X2,X1)
| legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_81,negated_conjecture,
precedes(esk14_2(esk16_0,esk17_0),esk15_2(esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_65,c_0_36]) ).
cnf(c_0_82,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk17_0)
| next_subocc(X1,esk13_2(X1,esk17_0),tptp0) ),
inference(spm,[status(thm)],[c_0_75,c_0_20]) ).
cnf(c_0_83,plain,
( ~ precedes(X2,X4)
| ~ min_precedes(X1,X4,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_84,negated_conjecture,
( ~ min_precedes(esk14_2(esk16_0,esk17_0),X1,tptp0)
| ~ min_precedes(X1,esk15_2(esk16_0,esk17_0),tptp0) ),
inference(spm,[status(thm)],[c_0_77,c_0_29]) ).
cnf(c_0_85,plain,
( ~ legal(X2)
| ~ earlier(X1,X2)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_86,negated_conjecture,
earlier(esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),esk15_2(esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_87,negated_conjecture,
legal(esk15_2(esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_88,negated_conjecture,
next_subocc(esk14_2(esk16_0,esk17_0),esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_50]),c_0_51])]),c_0_52]) ).
cnf(c_0_89,negated_conjecture,
( ~ min_precedes(esk14_2(esk16_0,esk17_0),X1,tptp0)
| ~ precedes(X1,esk15_2(esk16_0,esk17_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_36]),c_0_84]) ).
cnf(c_0_90,negated_conjecture,
precedes(esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),esk15_2(esk16_0,esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87])]) ).
cnf(c_0_91,negated_conjecture,
min_precedes(esk14_2(esk16_0,esk17_0),esk13_2(esk14_2(esk16_0,esk17_0),esk17_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_88]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PRO016+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n016.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 03:48:24 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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.33/0.79 % Version: 3.5.1
% 0.33/0.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.79 % Starting sh5l with 300s (1) cores
% 0.33/0.79 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1476981 completed with status 0
% 0.33/0.79 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.33/0.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.79 % No SInE strategy applied
% 0.33/0.79 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.33/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.79 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.33/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.33/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.33/0.79 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.33/0.79 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 1476988 completed with status 0
% 0.33/0.79 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.33/0.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.79 % No SInE strategy applied
% 0.33/0.79 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.33/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.79 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.33/0.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.33/0.79 % Preprocessing time : 0.002 s
% 0.33/0.79 % Presaturation interreduction done
% 0.33/0.79
% 0.33/0.79 % Proof found!
% 0.33/0.79 % SZS status Theorem
% 0.33/0.79 % SZS output start CNFRefutation
% See solution above
% 0.33/0.79 % Parsed axioms : 46
% 0.33/0.79 % Removed by relevancy pruning/SinE : 0
% 0.33/0.79 % Initial clauses : 101
% 0.33/0.79 % Removed in clause preprocessing : 6
% 0.33/0.79 % Initial clauses in saturation : 95
% 0.33/0.79 % Processed clauses : 1842
% 0.33/0.79 % ...of these trivial : 32
% 0.33/0.79 % ...subsumed : 184
% 0.33/0.79 % ...remaining for further processing : 1626
% 0.33/0.79 % Other redundant clauses eliminated : 0
% 0.33/0.79 % Clauses deleted for lack of memory : 0
% 0.33/0.79 % Backward-subsumed : 34
% 0.33/0.79 % Backward-rewritten : 129
% 0.33/0.79 % Generated clauses : 4576
% 0.33/0.79 % ...of the previous two non-redundant : 4010
% 0.33/0.79 % ...aggressively subsumed : 0
% 0.33/0.79 % Contextual simplify-reflections : 13
% 0.33/0.79 % Paramodulations : 4568
% 0.33/0.79 % Factorizations : 1
% 0.33/0.79 % NegExts : 0
% 0.33/0.79 % Equation resolutions : 0
% 0.33/0.79 % Disequality decompositions : 0
% 0.33/0.79 % Total rewrite steps : 1391
% 0.33/0.79 % ...of those cached : 1181
% 0.33/0.79 % Propositional unsat checks : 0
% 0.33/0.79 % Propositional check models : 0
% 0.33/0.79 % Propositional check unsatisfiable : 0
% 0.33/0.79 % Propositional clauses : 0
% 0.33/0.79 % Propositional clauses after purity: 0
% 0.33/0.79 % Propositional unsat core size : 0
% 0.33/0.79 % Propositional preprocessing time : 0.000
% 0.33/0.79 % Propositional encoding time : 0.000
% 0.33/0.79 % Propositional solver time : 0.000
% 0.33/0.79 % Success case prop preproc time : 0.000
% 0.33/0.79 % Success case prop encoding time : 0.000
% 0.33/0.79 % Success case prop solver time : 0.000
% 0.33/0.79 % Current number of processed clauses : 1361
% 0.33/0.79 % Positive orientable unit clauses : 355
% 0.33/0.79 % Positive unorientable unit clauses: 0
% 0.33/0.79 % Negative unit clauses : 431
% 0.33/0.79 % Non-unit-clauses : 575
% 0.33/0.79 % Current number of unprocessed clauses: 2153
% 0.33/0.79 % ...number of literals in the above : 6426
% 0.33/0.79 % Current number of archived formulas : 0
% 0.33/0.79 % Current number of archived clauses : 265
% 0.33/0.79 % Clause-clause subsumption calls (NU) : 60178
% 0.33/0.79 % Rec. Clause-clause subsumption calls : 23531
% 0.33/0.79 % Non-unit clause-clause subsumptions : 101
% 0.33/0.79 % Unit Clause-clause subsumption calls : 12387
% 0.33/0.79 % Rewrite failures with RHS unbound : 0
% 0.33/0.79 % BW rewrite match attempts : 199
% 0.33/0.79 % BW rewrite match successes : 42
% 0.33/0.79 % Condensation attempts : 0
% 0.33/0.79 % Condensation successes : 0
% 0.33/0.79 % Termbank termtop insertions : 124144
% 0.33/0.79 % Search garbage collected termcells : 1523
% 0.33/0.79
% 0.33/0.79 % -------------------------------------------------
% 0.33/0.79 % User time : 0.206 s
% 0.33/0.79 % System time : 0.014 s
% 0.33/0.79 % Total time : 0.220 s
% 0.33/0.79 % Maximum resident set size: 4000 pages
% 0.33/0.79
% 0.33/0.79 % -------------------------------------------------
% 0.33/0.79 % User time : 0.804 s
% 0.33/0.79 % System time : 0.046 s
% 0.33/0.79 % Total time : 0.850 s
% 0.33/0.79 % Maximum resident set size: 4864 pages
% 0.33/0.79 % E exiting
%------------------------------------------------------------------------------