%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO016+3 : 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 : n004.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.74s 0.96s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 103 ( 40 unt; 0 def)
% Number of atoms : 487 ( 14 equ)
% Maximal formula atoms : 130 ( 4 avg)
% Number of connectives : 624 ( 240 ~; 255 |; 105 &)
% ( 4 <=>; 20 =>; 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 : 183 ( 3 sgn 94 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X167,X168] :
( ( ~ leaf_occ(X167,X168)
& arboreal(X167)
& subactivity_occurrence(X167,X168)
& occurrence_of(X168,tptp0) )
=> ? [X169,X170] :
( ( occurrence_of(X170,tptp2)
=> ~ ? [X172] :
( min_precedes(X169,X172,tptp0)
& occurrence_of(X172,tptp1) ) )
& ( occurrence_of(X170,tptp1)
=> ~ ? [X171] :
( min_precedes(X169,X171,tptp0)
& occurrence_of(X171,tptp2) ) )
& leaf_occ(X170,X168)
& min_precedes(X169,X170,tptp0)
& ( occurrence_of(X170,tptp2)
| occurrence_of(X170,tptp1) )
& next_subocc(X167,X169,tptp0)
& occurrence_of(X169,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_49,axiom,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( leaf_occ(X166,X163)
& next_subocc(X165,X166,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& next_subocc(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( ~ ? [X64] :
( min_precedes(X64,X62,X63)
& min_precedes(X61,X64,X63) )
& min_precedes(X61,X62,X63) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(sos_29,axiom,
! [X84,X85,X86,X87] :
( ( subactivity_occurrence(X85,X87)
& occurrence_of(X87,X86)
& min_precedes(X84,X85,X86) )
=> subactivity_occurrence(X84,X87) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( leaf(X103,X105)
& subactivity_occurrence(X103,X104)
& occurrence_of(X104,X105) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_37,axiom,
! [X114,X115,X116] :
( ( leaf_occ(X115,X114)
& occurrence_of(X114,X116) )
=> ~ ? [X117] : min_precedes(X115,X117,X116) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_37) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(sos_36,axiom,
! [X110,X111,X112,X113] :
( ( leaf_occ(X111,X112)
& leaf_occ(X110,X112)
& ~ atomic(X113)
& occurrence_of(X112,X113) )
=> X110 = X111 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_36) ).
fof(sos_52,axiom,
atomic(tptp4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_52) ).
fof(sos_51,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_51) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(sos_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( legal(X23)
& earlier(X22,X23) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).
fof(sos_40,axiom,
! [X127,X128,X129,X130] :
( ( next_subocc(X129,X127,X130)
& next_subocc(X128,X127,X130) )
=> X128 = X129 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_40) ).
fof(sos_05,axiom,
! [X11,X12,X13] :
( ( earlier(X12,X13)
& earlier(X11,X12) )
=> earlier(X11,X13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(sos_18,axiom,
! [X46,X47,X48,X49] :
( ( precedes(X47,X48)
& min_precedes(X46,X48,X49)
& min_precedes(X46,X47,X49) )
=> min_precedes(X47,X48,X49) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(c_0_15,negated_conjecture,
~ ! [X167,X168] :
( ( ~ leaf_occ(X167,X168)
& arboreal(X167)
& subactivity_occurrence(X167,X168)
& occurrence_of(X168,tptp0) )
=> ? [X169,X170] :
( ( occurrence_of(X170,tptp2)
=> ~ ? [X172] :
( min_precedes(X169,X172,tptp0)
& occurrence_of(X172,tptp1) ) )
& ( occurrence_of(X170,tptp1)
=> ~ ? [X171] :
( min_precedes(X169,X171,tptp0)
& occurrence_of(X171,tptp2) ) )
& leaf_occ(X170,X168)
& min_precedes(X169,X170,tptp0)
& ( occurrence_of(X170,tptp2)
| occurrence_of(X170,tptp1) )
& next_subocc(X167,X169,tptp0)
& occurrence_of(X169,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_16,plain,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( leaf_occ(X166,X163)
& next_subocc(X165,X166,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& next_subocc(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_49]) ).
fof(c_0_17,negated_conjecture,
~ ! [X167,X168] :
( ( ~ leaf_occ(X167,X168)
& arboreal(X167)
& subactivity_occurrence(X167,X168)
& occurrence_of(X168,tptp0) )
=> ? [X169,X170] :
( ( occurrence_of(X170,tptp2)
=> ~ ? [X172] :
( min_precedes(X169,X172,tptp0)
& occurrence_of(X172,tptp1) ) )
& ( occurrence_of(X170,tptp1)
=> ~ ? [X171] :
( min_precedes(X169,X171,tptp0)
& occurrence_of(X171,tptp2) ) )
& leaf_occ(X170,X168)
& min_precedes(X169,X170,tptp0)
& ( occurrence_of(X170,tptp2)
| occurrence_of(X170,tptp1) )
& next_subocc(X167,X169,tptp0)
& occurrence_of(X169,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X351,X352] :
( ( leaf_occ(X351,X352)
| ~ arboreal(X351)
| ~ subactivity_occurrence(X351,X352)
| ~ occurrence_of(X352,tptp0)
| leaf_occ(esk19_2(X351,X352),X352) )
& ( leaf_occ(X351,X352)
| ~ arboreal(X351)
| ~ subactivity_occurrence(X351,X352)
| ~ occurrence_of(X352,tptp0)
| next_subocc(esk18_2(X351,X352),esk19_2(X351,X352),tptp0) )
& ( leaf_occ(X351,X352)
| ~ arboreal(X351)
| ~ subactivity_occurrence(X351,X352)
| ~ occurrence_of(X352,tptp0)
| occurrence_of(esk19_2(X351,X352),tptp2)
| occurrence_of(esk19_2(X351,X352),tptp1) )
& ( leaf_occ(X351,X352)
| ~ arboreal(X351)
| ~ subactivity_occurrence(X351,X352)
| ~ occurrence_of(X352,tptp0)
| next_subocc(esk17_2(X351,X352),esk18_2(X351,X352),tptp0) )
& ( leaf_occ(X351,X352)
| ~ arboreal(X351)
| ~ subactivity_occurrence(X351,X352)
| ~ occurrence_of(X352,tptp0)
| occurrence_of(esk18_2(X351,X352),tptp4) )
& ( leaf_occ(X351,X352)
| ~ arboreal(X351)
| ~ subactivity_occurrence(X351,X352)
| ~ occurrence_of(X352,tptp0)
| next_subocc(X351,esk17_2(X351,X352),tptp0) )
& ( leaf_occ(X351,X352)
| ~ arboreal(X351)
| ~ subactivity_occurrence(X351,X352)
| ~ occurrence_of(X352,tptp0)
| occurrence_of(esk17_2(X351,X352),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_16])])])])]) ).
fof(c_0_19,negated_conjecture,
! [X358,X359] :
( ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| min_precedes(X358,esk22_2(X358,X359),tptp0)
| min_precedes(X358,esk23_2(X358,X359),tptp0) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| min_precedes(X358,esk22_2(X358,X359),tptp0)
| occurrence_of(esk23_2(X358,X359),tptp1) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| min_precedes(X358,esk22_2(X358,X359),tptp0)
| occurrence_of(X359,tptp2) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| occurrence_of(esk22_2(X358,X359),tptp2)
| min_precedes(X358,esk23_2(X358,X359),tptp0) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| occurrence_of(esk22_2(X358,X359),tptp2)
| occurrence_of(esk23_2(X358,X359),tptp1) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| occurrence_of(esk22_2(X358,X359),tptp2)
| occurrence_of(X359,tptp2) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| occurrence_of(X359,tptp1)
| min_precedes(X358,esk23_2(X358,X359),tptp0) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| occurrence_of(X359,tptp1)
| occurrence_of(esk23_2(X358,X359),tptp1) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2)
| occurrence_of(X359,tptp1)
| occurrence_of(X359,tptp2) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| min_precedes(X358,esk22_2(X358,X359),tptp0)
| min_precedes(X358,esk23_2(X358,X359),tptp0) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| min_precedes(X358,esk22_2(X358,X359),tptp0)
| occurrence_of(esk23_2(X358,X359),tptp1) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| min_precedes(X358,esk22_2(X358,X359),tptp0)
| occurrence_of(X359,tptp2) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| occurrence_of(esk22_2(X358,X359),tptp2)
| min_precedes(X358,esk23_2(X358,X359),tptp0) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| occurrence_of(esk22_2(X358,X359),tptp2)
| occurrence_of(esk23_2(X358,X359),tptp1) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| occurrence_of(esk22_2(X358,X359),tptp2)
| occurrence_of(X359,tptp2) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| occurrence_of(X359,tptp1)
| min_precedes(X358,esk23_2(X358,X359),tptp0) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| occurrence_of(X359,tptp1)
| occurrence_of(esk23_2(X358,X359),tptp1) )
& ( ~ leaf_occ(X359,esk21_0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1)
| occurrence_of(X359,tptp1)
| occurrence_of(X359,tptp2) )
& ~ leaf_occ(esk20_0,esk21_0)
& arboreal(esk20_0)
& subactivity_occurrence(esk20_0,esk21_0)
& occurrence_of(esk21_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_17])])])])])]) ).
cnf(c_0_20,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk18_2(X1,X2),esk19_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
occurrence_of(esk21_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X237,X238,X239,X240,X241,X242,X243] :
( ( next_subocc(X241,X242,X243)
| ~ min_precedes(X241,X242,X243)
| min_precedes(esk8_3(X241,X242,X243),X242,X243) )
& ( next_subocc(X241,X242,X243)
| ~ min_precedes(X241,X242,X243)
| min_precedes(X241,esk8_3(X241,X242,X243),X243) )
& ( ~ next_subocc(X237,X238,X239)
| ~ min_precedes(X240,X238,X239)
| ~ min_precedes(X237,X240,X239) )
& ( ~ next_subocc(X237,X238,X239)
| min_precedes(X237,X238,X239) ) ),
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_22])])])])])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(esk18_2(X1,esk21_0),esk19_2(X1,esk21_0),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
arboreal(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
~ leaf_occ(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf_occ(esk19_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_28,plain,
! [X267,X268,X269,X270] :
( subactivity_occurrence(X267,X270)
| ~ subactivity_occurrence(X268,X270)
| ~ occurrence_of(X270,X269)
| ~ min_precedes(X267,X268,X269) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
cnf(c_0_29,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
next_subocc(esk18_2(esk20_0,esk21_0),esk19_2(esk20_0,esk21_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).
fof(c_0_31,plain,
! [X289,X290,X292,X293,X294] :
( ( leaf_occ(X292,X293)
| ~ leaf(X292,X294)
| ~ subactivity_occurrence(X292,X293)
| ~ occurrence_of(X293,X294) )
& ( ~ leaf_occ(X289,X290)
| leaf(X289,esk15_2(X289,X290)) )
& ( ~ leaf_occ(X289,X290)
| subactivity_occurrence(X289,X290) )
& ( ~ leaf_occ(X289,X290)
| occurrence_of(X290,esk15_2(X289,X290)) ) ),
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_34])])])])])])]) ).
cnf(c_0_32,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| leaf_occ(X1,esk21_0)
| leaf_occ(esk19_2(X1,esk21_0),esk21_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_33,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk18_2(X1,X2),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_34,plain,
! [X303,X304,X305,X306] :
( ~ min_precedes(X304,X306,X305)
| ~ leaf_occ(X304,X303)
| ~ occurrence_of(X303,X305) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])])]) ).
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_28]) ).
cnf(c_0_36,negated_conjecture,
min_precedes(esk18_2(esk20_0,esk21_0),esk19_2(esk20_0,esk21_0),tptp0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ leaf_occ(X1,X2)
| subactivity_occurrence(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
leaf_occ(esk19_2(esk20_0,esk21_0),esk21_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_25])]),c_0_26]) ).
fof(c_0_39,plain,
! [X189,X190] :
( ( ~ occurrence_of(X189,X190)
| arboreal(X189)
| ~ atomic(X190) )
& ( ~ occurrence_of(X189,X190)
| atomic(X190)
| ~ arboreal(X189) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| occurrence_of(esk18_2(X1,esk21_0),tptp4)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
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_34]) ).
fof(c_0_42,plain,
! [X110,X111,X112,X113] :
( ( leaf_occ(X111,X112)
& leaf_occ(X110,X112)
& ~ atomic(X113)
& occurrence_of(X112,X113) )
=> X110 = X111 ),
inference(fof_simplification,[status(thm)],[sos_36]) ).
cnf(c_0_43,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk17_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_44,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk19_2(esk20_0,esk21_0),X1)
| subactivity_occurrence(esk18_2(esk20_0,esk21_0),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
subactivity_occurrence(esk19_2(esk20_0,esk21_0),esk21_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,negated_conjecture,
occurrence_of(esk18_2(esk20_0,esk21_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_48,plain,
atomic(tptp4),
inference(split_conjunct,[status(thm)],[sos_52]) ).
cnf(c_0_49,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk18_2(esk20_0,esk21_0),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
fof(c_0_50,plain,
! [X299,X300,X301,X302] :
( X299 = X300
| ~ leaf_occ(X300,X301)
| ~ leaf_occ(X299,X301)
| atomic(X302)
| ~ occurrence_of(X301,X302) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
cnf(c_0_51,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(X1,esk17_2(X1,esk21_0),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_52,negated_conjecture,
subactivity_occurrence(esk18_2(esk20_0,esk21_0),esk21_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_21]),c_0_45])]) ).
cnf(c_0_53,negated_conjecture,
arboreal(esk18_2(esk20_0,esk21_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_54,negated_conjecture,
~ leaf_occ(esk18_2(esk20_0,esk21_0),esk21_0),
inference(spm,[status(thm)],[c_0_49,c_0_21]) ).
cnf(c_0_55,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk17_2(X1,X2),esk18_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_56,plain,
( ~ leaf_occ(X4,X1)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2)
| X3 = X4
| atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_57,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_51]) ).
fof(c_0_58,plain,
! [X211,X212,X213] :
( precedes(X211,X212)
| ~ min_precedes(X211,X212,X213) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])]) ).
cnf(c_0_59,negated_conjecture,
next_subocc(esk18_2(esk20_0,esk21_0),esk17_2(esk18_2(esk20_0,esk21_0),esk21_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(esk17_2(X1,esk21_0),esk18_2(X1,esk21_0),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_21]) ).
cnf(c_0_61,negated_conjecture,
( ~ occurrence_of(esk21_0,X2)
| ~ leaf_occ(X1,esk21_0)
| atomic(X2)
| X1 = esk19_2(esk20_0,esk21_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_38]) ).
cnf(c_0_62,negated_conjecture,
leaf_occ(esk19_2(esk18_2(esk20_0,esk21_0),esk21_0),esk21_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_52]),c_0_53])]),c_0_54]) ).
fof(c_0_63,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_57]) ).
fof(c_0_64,plain,
! [X194,X195] :
( ( precedes(X194,X195)
| ~ legal(X195)
| ~ earlier(X194,X195) )
& ( ~ precedes(X194,X195)
| legal(X195) )
& ( ~ precedes(X194,X195)
| earlier(X194,X195) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_65,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_66,negated_conjecture,
min_precedes(esk18_2(esk20_0,esk21_0),esk17_2(esk18_2(esk20_0,esk21_0),esk21_0),tptp0),
inference(spm,[status(thm)],[c_0_29,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
next_subocc(esk17_2(esk20_0,esk21_0),esk18_2(esk20_0,esk21_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_24]),c_0_25])]),c_0_26]) ).
fof(c_0_68,plain,
! [X316,X317,X318,X319] :
( X317 = X318
| ~ next_subocc(X318,X316,X319)
| ~ next_subocc(X317,X316,X319) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_40])])]) ).
cnf(c_0_69,negated_conjecture,
( ~ occurrence_of(esk21_0,X1)
| atomic(X1)
| esk19_2(esk18_2(esk20_0,esk21_0),esk21_0) = esk19_2(esk20_0,esk21_0) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_70,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
fof(c_0_71,plain,
! [X183,X184,X185] :
( earlier(X183,X185)
| ~ earlier(X184,X185)
| ~ earlier(X183,X184) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).
cnf(c_0_72,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_73,negated_conjecture,
precedes(esk18_2(esk20_0,esk21_0),esk17_2(esk18_2(esk20_0,esk21_0),esk21_0)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
min_precedes(esk17_2(esk20_0,esk21_0),esk18_2(esk20_0,esk21_0),tptp0),
inference(spm,[status(thm)],[c_0_29,c_0_67]) ).
cnf(c_0_75,plain,
( ~ next_subocc(X4,X2,X3)
| ~ next_subocc(X1,X2,X3)
| X1 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_76,negated_conjecture,
esk19_2(esk18_2(esk20_0,esk21_0),esk21_0) = esk19_2(esk20_0,esk21_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_21]),c_0_70]) ).
cnf(c_0_77,plain,
( ~ earlier(X2,X3)
| ~ earlier(X1,X2)
| earlier(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_78,negated_conjecture,
earlier(esk18_2(esk20_0,esk21_0),esk17_2(esk18_2(esk20_0,esk21_0),esk21_0)),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
precedes(esk17_2(esk20_0,esk21_0),esk18_2(esk20_0,esk21_0)),
inference(spm,[status(thm)],[c_0_65,c_0_74]) ).
cnf(c_0_80,negated_conjecture,
( ~ next_subocc(X1,esk19_2(esk20_0,esk21_0),tptp0)
| X1 = esk18_2(esk20_0,esk21_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_30]) ).
cnf(c_0_81,negated_conjecture,
next_subocc(esk18_2(esk18_2(esk20_0,esk21_0),esk21_0),esk19_2(esk20_0,esk21_0),tptp0),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_52]),c_0_53])]),c_0_54]),c_0_76]) ).
fof(c_0_82,plain,
! [X218,X219,X220,X221] :
( min_precedes(X219,X220,X221)
| ~ precedes(X219,X220)
| ~ min_precedes(X218,X220,X221)
| ~ min_precedes(X218,X219,X221) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])])]) ).
cnf(c_0_83,negated_conjecture,
next_subocc(esk20_0,esk17_2(esk20_0,esk21_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_84,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_85,negated_conjecture,
( ~ earlier(X1,esk18_2(esk20_0,esk21_0))
| earlier(X1,esk17_2(esk18_2(esk20_0,esk21_0),esk21_0)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_86,negated_conjecture,
earlier(esk17_2(esk20_0,esk21_0),esk18_2(esk20_0,esk21_0)),
inference(spm,[status(thm)],[c_0_72,c_0_79]) ).
cnf(c_0_87,plain,
( ~ precedes(X2,X1)
| legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_88,negated_conjecture,
next_subocc(esk17_2(esk18_2(esk20_0,esk21_0),esk21_0),esk18_2(esk18_2(esk20_0,esk21_0),esk21_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_52]),c_0_53])]),c_0_54]) ).
cnf(c_0_89,negated_conjecture,
esk18_2(esk18_2(esk20_0,esk21_0),esk21_0) = esk18_2(esk20_0,esk21_0),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_90,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_82]) ).
cnf(c_0_91,negated_conjecture,
min_precedes(esk20_0,esk17_2(esk20_0,esk21_0),tptp0),
inference(spm,[status(thm)],[c_0_29,c_0_83]) ).
cnf(c_0_92,negated_conjecture,
( ~ min_precedes(esk20_0,X1,tptp0)
| ~ min_precedes(X1,esk17_2(esk20_0,esk21_0),tptp0) ),
inference(spm,[status(thm)],[c_0_84,c_0_83]) ).
cnf(c_0_93,plain,
( ~ legal(X2)
| ~ earlier(X1,X2)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_94,negated_conjecture,
earlier(esk17_2(esk20_0,esk21_0),esk17_2(esk18_2(esk20_0,esk21_0),esk21_0)),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_95,negated_conjecture,
legal(esk17_2(esk18_2(esk20_0,esk21_0),esk21_0)),
inference(spm,[status(thm)],[c_0_87,c_0_73]) ).
cnf(c_0_96,negated_conjecture,
( ~ next_subocc(X1,esk18_2(esk20_0,esk21_0),tptp0)
| X1 = esk17_2(esk20_0,esk21_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_67]) ).
cnf(c_0_97,negated_conjecture,
next_subocc(esk17_2(esk18_2(esk20_0,esk21_0),esk21_0),esk18_2(esk20_0,esk21_0),tptp0),
inference(rw,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_98,negated_conjecture,
( ~ precedes(X1,esk17_2(esk20_0,esk21_0))
| ~ min_precedes(esk20_0,X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
cnf(c_0_99,negated_conjecture,
precedes(esk17_2(esk20_0,esk21_0),esk17_2(esk18_2(esk20_0,esk21_0),esk21_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]) ).
cnf(c_0_100,negated_conjecture,
esk17_2(esk18_2(esk20_0,esk21_0),esk21_0) = esk17_2(esk20_0,esk21_0),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_101,negated_conjecture,
~ precedes(esk17_2(esk20_0,esk21_0),esk17_2(esk20_0,esk21_0)),
inference(spm,[status(thm)],[c_0_98,c_0_91]) ).
cnf(c_0_102,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100]),c_0_101]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO016+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 % Computer : n004.cluster.edu
% 0.19/0.48 % Model : x86_64 x86_64
% 0.19/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48 % Memory : 8046.5625MB
% 0.19/0.48 % OS : Linux 6.8.0-71-generic
% 0.19/0.48 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Mon Sep 21 03:43:04 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/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.74/0.96 % Version: 3.5.1
% 0.74/0.96 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.74/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.74/0.96 % Starting new_bool_3 with 300s (1) cores
% 0.74/0.96 % Starting new_bool_1 with 300s (1) cores
% 0.74/0.96 % Starting sh5l with 300s (1) cores
% 0.74/0.96 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2168319 completed with status 0
% 0.74/0.96 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.74/0.96 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.74/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.74/0.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.74/0.96 % No SInE strategy applied
% 0.74/0.96 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.74/0.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.74/0.96 % Starting SubtermCWHack with 136s (1) cores
% 0.74/0.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.74/0.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.74/0.96 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.74/0.96 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.74/0.96 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 2168325 completed with status 0
% 0.74/0.96 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.74/0.96 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.74/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.74/0.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.74/0.96 % No SInE strategy applied
% 0.74/0.96 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.74/0.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.74/0.96 % Starting SubtermCWHack with 136s (1) cores
% 0.74/0.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.74/0.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.74/0.96 % Preprocessing time : 0.004 s
% 0.74/0.96 % Presaturation interreduction done
% 0.74/0.96
% 0.74/0.96 % Proof found!
% 0.74/0.96 % SZS status Theorem
% 0.74/0.96 % SZS output start CNFRefutation
% See solution above
% 0.74/0.96 % Parsed axioms : 63
% 0.74/0.96 % Removed by relevancy pruning/SinE : 0
% 0.74/0.96 % Initial clauses : 123
% 0.74/0.96 % Removed in clause preprocessing : 6
% 0.74/0.96 % Initial clauses in saturation : 117
% 0.74/0.96 % Processed clauses : 1928
% 0.74/0.96 % ...of these trivial : 44
% 0.74/0.96 % ...subsumed : 309
% 0.74/0.96 % ...remaining for further processing : 1575
% 0.74/0.96 % Other redundant clauses eliminated : 0
% 0.74/0.96 % Clauses deleted for lack of memory : 0
% 0.74/0.96 % Backward-subsumed : 127
% 0.74/0.96 % Backward-rewritten : 188
% 0.74/0.96 % Generated clauses : 4637
% 0.74/0.96 % ...of the previous two non-redundant : 4074
% 0.74/0.96 % ...aggressively subsumed : 0
% 0.74/0.96 % Contextual simplify-reflections : 13
% 0.74/0.96 % Paramodulations : 4620
% 0.74/0.96 % Factorizations : 2
% 0.74/0.96 % NegExts : 0
% 0.74/0.96 % Equation resolutions : 0
% 0.74/0.96 % Disequality decompositions : 0
% 0.74/0.96 % Total rewrite steps : 1286
% 0.74/0.96 % ...of those cached : 1099
% 0.74/0.96 % Propositional unsat checks : 0
% 0.74/0.96 % Propositional check models : 0
% 0.74/0.96 % Propositional check unsatisfiable : 0
% 0.74/0.96 % Propositional clauses : 0
% 0.74/0.96 % Propositional clauses after purity: 0
% 0.74/0.96 % Propositional unsat core size : 0
% 0.74/0.96 % Propositional preprocessing time : 0.000
% 0.74/0.96 % Propositional encoding time : 0.000
% 0.74/0.96 % Propositional solver time : 0.000
% 0.74/0.96 % Success case prop preproc time : 0.000
% 0.74/0.96 % Success case prop encoding time : 0.000
% 0.74/0.96 % Success case prop solver time : 0.000
% 0.74/0.96 % Current number of processed clauses : 1128
% 0.74/0.96 % Positive orientable unit clauses : 280
% 0.74/0.96 % Positive unorientable unit clauses: 0
% 0.74/0.96 % Negative unit clauses : 185
% 0.74/0.96 % Non-unit-clauses : 663
% 0.74/0.96 % Current number of unprocessed clauses: 2262
% 0.74/0.96 % ...number of literals in the above : 7381
% 0.74/0.96 % Current number of archived formulas : 0
% 0.74/0.96 % Current number of archived clauses : 447
% 0.74/0.96 % Clause-clause subsumption calls (NU) : 86358
% 0.74/0.96 % Rec. Clause-clause subsumption calls : 38212
% 0.74/0.96 % Non-unit clause-clause subsumptions : 220
% 0.74/0.96 % Unit Clause-clause subsumption calls : 21234
% 0.74/0.96 % Rewrite failures with RHS unbound : 0
% 0.74/0.96 % BW rewrite match attempts : 62
% 0.74/0.96 % BW rewrite match successes : 48
% 0.74/0.96 % Condensation attempts : 0
% 0.74/0.96 % Condensation successes : 0
% 0.74/0.96 % Termbank termtop insertions : 107808
% 0.74/0.96 % Search garbage collected termcells : 2058
% 0.74/0.96
% 0.74/0.96 % -------------------------------------------------
% 0.74/0.96 % User time : 0.352 s
% 0.74/0.96 % System time : 0.023 s
% 0.74/0.96 % Total time : 0.375 s
% 0.74/0.96 % Maximum resident set size: 4072 pages
% 0.74/0.96
% 0.74/0.96 % -------------------------------------------------
% 0.74/0.96 % User time : 1.372 s
% 0.74/0.96 % System time : 0.069 s
% 0.74/0.96 % Total time : 1.441 s
% 0.74/0.96 % Maximum resident set size: 5120 pages
% 0.74/0.96 % E exiting
%------------------------------------------------------------------------------