TSTP Solution File: PRO014+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PRO014+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:10:27 EDT 2024
% Result : Theorem 1.51s 0.63s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 126 ( 34 unt; 0 def)
% Number of atoms : 441 ( 17 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 508 ( 193 ~; 210 |; 83 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 210 ( 5 sgn 109 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_32,axiom,
! [X102,X103] :
( ( occurrence_of(X103,tptp0)
& subactivity_occurrence(X102,X103)
& arboreal(X102)
& ~ leaf_occ(X102,X103) )
=> ? [X104,X105,X106] :
( occurrence_of(X104,tptp3)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X104,X105,tptp0)
& ( occurrence_of(X106,tptp2)
| occurrence_of(X106,tptp1) )
& next_subocc(X105,X106,tptp0)
& leaf(X106,tptp0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_32) ).
fof(goals,conjecture,
! [X107,X108] :
( ( occurrence_of(X108,tptp0)
& subactivity_occurrence(X107,X108)
& arboreal(X107)
& ~ leaf_occ(X107,X108) )
=> ? [X109,X110] :
( occurrence_of(X109,tptp3)
& next_subocc(X107,X109,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& min_precedes(X109,X110,tptp0)
& leaf(X110,tptp0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',goals) ).
fof(sos_26,axiom,
! [X79,X80,X81] :
( next_subocc(X79,X80,X81)
<=> ( min_precedes(X79,X80,X81)
& ~ ? [X82] :
( min_precedes(X79,X82,X81)
& min_precedes(X82,X80,X81) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_26) ).
fof(sos_27,axiom,
! [X83,X84,X85,X86] :
( ( min_precedes(X83,X84,X85)
& occurrence_of(X86,X85)
& subactivity_occurrence(X84,X86) )
=> subactivity_occurrence(X83,X86) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_27) ).
fof(sos_07,axiom,
! [X26,X27] :
( ( leaf(X26,X27)
& ~ atomic(X27) )
=> ? [X28] :
( occurrence_of(X28,X27)
& leaf_occ(X26,X28) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_07) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_34) ).
fof(sos_02,axiom,
! [X9,X10,X11,X12] :
( ( occurrence_of(X10,X9)
& subactivity_occurrence(X11,X10)
& leaf_occ(X12,X10)
& arboreal(X11)
& ~ min_precedes(X11,X12,X9) )
=> X12 = X11 ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_02) ).
fof(sos_18,axiom,
! [X56,X57] :
( leaf_occ(X56,X57)
<=> ? [X58] :
( occurrence_of(X57,X58)
& subactivity_occurrence(X56,X57)
& leaf(X56,X58) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_18) ).
fof(sos_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity(X13)
& activity_occurrence(X14) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_03) ).
fof(sos_24,axiom,
! [X73,X74,X75] :
( min_precedes(X73,X74,X75)
=> precedes(X73,X74) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_24) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X30)
& occurrence_of(X29,X31) )
=> X30 = X31 ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_08) ).
fof(sos_21,axiom,
! [X64,X65] :
( precedes(X64,X65)
<=> ( earlier(X64,X65)
& legal(X65) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_21) ).
fof(sos_15,axiom,
! [X48,X49] :
( leaf(X48,X49)
<=> ( ( root(X48,X49)
| ? [X50] : min_precedes(X50,X48,X49) )
& ~ ? [X51] : min_precedes(X48,X51,X49) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_15) ).
fof(sos_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( activity(X43)
& occurrence_of(X42,X43) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_12) ).
fof(sos_30,axiom,
! [X95,X96,X97] :
( ( earlier(X95,X96)
& earlier(X96,X97) )
=> earlier(X95,X97) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_30) ).
fof(sos_17,axiom,
! [X54,X55] :
( root(X54,X55)
=> legal(X54) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_17) ).
fof(sos_31,axiom,
! [X98,X99,X100,X101] :
( ( min_precedes(X98,X99,X101)
& min_precedes(X98,X100,X101)
& precedes(X99,X100) )
=> min_precedes(X99,X100,X101) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_31) ).
fof(sos_20,axiom,
! [X62,X63] :
( earlier(X62,X63)
=> ~ earlier(X63,X62) ),
file('/export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p',sos_20) ).
fof(c_0_18,plain,
! [X102,X103] :
( ( occurrence_of(X103,tptp0)
& subactivity_occurrence(X102,X103)
& arboreal(X102)
& ~ leaf_occ(X102,X103) )
=> ? [X104,X105,X106] :
( occurrence_of(X104,tptp3)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X104,X105,tptp0)
& ( occurrence_of(X106,tptp2)
| occurrence_of(X106,tptp1) )
& next_subocc(X105,X106,tptp0)
& leaf(X106,tptp0) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_19,negated_conjecture,
~ ! [X107,X108] :
( ( occurrence_of(X108,tptp0)
& subactivity_occurrence(X107,X108)
& arboreal(X107)
& ~ leaf_occ(X107,X108) )
=> ? [X109,X110] :
( occurrence_of(X109,tptp3)
& next_subocc(X107,X109,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& min_precedes(X109,X110,tptp0)
& leaf(X110,tptp0) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_20,plain,
! [X229,X230] :
( ( occurrence_of(esk13_1(X229),tptp3)
| ~ occurrence_of(X230,tptp0)
| ~ subactivity_occurrence(X229,X230)
| ~ arboreal(X229)
| leaf_occ(X229,X230) )
& ( next_subocc(X229,esk13_1(X229),tptp0)
| ~ occurrence_of(X230,tptp0)
| ~ subactivity_occurrence(X229,X230)
| ~ arboreal(X229)
| leaf_occ(X229,X230) )
& ( occurrence_of(esk14_1(X229),tptp4)
| ~ occurrence_of(X230,tptp0)
| ~ subactivity_occurrence(X229,X230)
| ~ arboreal(X229)
| leaf_occ(X229,X230) )
& ( next_subocc(esk13_1(X229),esk14_1(X229),tptp0)
| ~ occurrence_of(X230,tptp0)
| ~ subactivity_occurrence(X229,X230)
| ~ arboreal(X229)
| leaf_occ(X229,X230) )
& ( occurrence_of(esk15_1(X229),tptp2)
| occurrence_of(esk15_1(X229),tptp1)
| ~ occurrence_of(X230,tptp0)
| ~ subactivity_occurrence(X229,X230)
| ~ arboreal(X229)
| leaf_occ(X229,X230) )
& ( next_subocc(esk14_1(X229),esk15_1(X229),tptp0)
| ~ occurrence_of(X230,tptp0)
| ~ subactivity_occurrence(X229,X230)
| ~ arboreal(X229)
| leaf_occ(X229,X230) )
& ( leaf(esk15_1(X229),tptp0)
| ~ occurrence_of(X230,tptp0)
| ~ subactivity_occurrence(X229,X230)
| ~ arboreal(X229)
| leaf_occ(X229,X230) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])])]) ).
fof(c_0_21,negated_conjecture,
! [X236,X237] :
( occurrence_of(esk17_0,tptp0)
& subactivity_occurrence(esk16_0,esk17_0)
& arboreal(esk16_0)
& ~ leaf_occ(esk16_0,esk17_0)
& ( ~ occurrence_of(X237,tptp2)
| ~ occurrence_of(X236,tptp3)
| ~ next_subocc(esk16_0,X236,tptp0)
| ~ min_precedes(X236,X237,tptp0)
| ~ leaf(X237,tptp0) )
& ( ~ occurrence_of(X237,tptp1)
| ~ occurrence_of(X236,tptp3)
| ~ next_subocc(esk16_0,X236,tptp0)
| ~ min_precedes(X236,X237,tptp0)
| ~ leaf(X237,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_19])])])])])]) ).
cnf(c_0_22,plain,
( next_subocc(esk13_1(X1),esk14_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
occurrence_of(esk17_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( next_subocc(esk14_1(X1),esk15_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( next_subocc(X1,esk13_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X202,X203,X204,X205,X206,X207,X208] :
( ( min_precedes(X202,X203,X204)
| ~ next_subocc(X202,X203,X204) )
& ( ~ min_precedes(X202,X205,X204)
| ~ min_precedes(X205,X203,X204)
| ~ next_subocc(X202,X203,X204) )
& ( min_precedes(X206,esk12_3(X206,X207,X208),X208)
| ~ min_precedes(X206,X207,X208)
| next_subocc(X206,X207,X208) )
& ( min_precedes(esk12_3(X206,X207,X208),X207,X208)
| ~ min_precedes(X206,X207,X208)
| next_subocc(X206,X207,X208) ) ),
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_27,negated_conjecture,
( next_subocc(esk13_1(X1),esk14_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
arboreal(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( next_subocc(esk14_1(X1),esk15_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( next_subocc(X1,esk13_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
fof(c_0_33,plain,
! [X210,X211,X212,X213] :
( ~ min_precedes(X210,X211,X212)
| ~ occurrence_of(X213,X212)
| ~ subactivity_occurrence(X211,X213)
| subactivity_occurrence(X210,X213) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_27])])]) ).
cnf(c_0_34,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_36,negated_conjecture,
next_subocc(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_29])]),c_0_30]) ).
fof(c_0_37,plain,
! [X26,X27] :
( ( leaf(X26,X27)
& ~ atomic(X27) )
=> ? [X28] :
( occurrence_of(X28,X27)
& leaf_occ(X26,X28) ) ),
inference(fof_simplification,[status(thm)],[sos_07]) ).
cnf(c_0_38,plain,
( leaf(esk15_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_39,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_40,negated_conjecture,
next_subocc(esk16_0,esk13_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_41,plain,
( subactivity_occurrence(X1,X4)
| ~ min_precedes(X1,X2,X3)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
min_precedes(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_34,c_0_36]) ).
fof(c_0_44,plain,
! [X136,X137] :
( ( occurrence_of(esk4_2(X136,X137),X137)
| ~ leaf(X136,X137)
| atomic(X137) )
& ( leaf_occ(X136,esk4_2(X136,X137))
| ~ leaf(X136,X137)
| atomic(X137) ) ),
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_37])])])])]) ).
cnf(c_0_45,negated_conjecture,
( leaf(esk15_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_23]) ).
fof(c_0_46,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_39]) ).
fof(c_0_47,plain,
! [X9,X10,X11,X12] :
( ( occurrence_of(X10,X9)
& subactivity_occurrence(X11,X10)
& leaf_occ(X12,X10)
& arboreal(X11)
& ~ min_precedes(X11,X12,X9) )
=> X12 = X11 ),
inference(fof_simplification,[status(thm)],[sos_02]) ).
cnf(c_0_48,negated_conjecture,
min_precedes(esk16_0,esk13_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
( subactivity_occurrence(esk13_1(esk16_0),X1)
| ~ subactivity_occurrence(esk14_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( subactivity_occurrence(esk14_1(esk16_0),X1)
| ~ subactivity_occurrence(esk15_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
fof(c_0_51,plain,
! [X173,X174,X176,X177,X178] :
( ( occurrence_of(X174,esk9_2(X173,X174))
| ~ leaf_occ(X173,X174) )
& ( subactivity_occurrence(X173,X174)
| ~ leaf_occ(X173,X174) )
& ( leaf(X173,esk9_2(X173,X174))
| ~ leaf_occ(X173,X174) )
& ( ~ occurrence_of(X177,X178)
| ~ subactivity_occurrence(X176,X177)
| ~ leaf(X176,X178)
| leaf_occ(X176,X177) ) ),
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_52,plain,
( leaf_occ(X1,esk4_2(X1,X2))
| atomic(X2)
| ~ leaf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,negated_conjecture,
leaf(esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_54,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_55,plain,
! [X123,X124] :
( ( activity(X123)
| ~ occurrence_of(X124,X123) )
& ( activity_occurrence(X124)
| ~ occurrence_of(X124,X123) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).
fof(c_0_56,plain,
! [X196,X197,X198] :
( ~ min_precedes(X196,X197,X198)
| precedes(X196,X197) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])]) ).
fof(c_0_57,plain,
! [X119,X120,X121,X122] :
( ~ occurrence_of(X120,X119)
| ~ subactivity_occurrence(X121,X120)
| ~ leaf_occ(X122,X120)
| ~ arboreal(X121)
| min_precedes(X121,X122,X119)
| X122 = X121 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])]) ).
cnf(c_0_58,negated_conjecture,
( subactivity_occurrence(esk16_0,X1)
| ~ subactivity_occurrence(esk13_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_41,c_0_48]) ).
cnf(c_0_59,negated_conjecture,
( subactivity_occurrence(esk13_1(esk16_0),X1)
| ~ subactivity_occurrence(esk15_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,negated_conjecture,
leaf_occ(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_62,plain,
( occurrence_of(esk4_2(X1,X2),X2)
| atomic(X2)
| ~ leaf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_63,plain,
! [X139,X140,X141] :
( ~ occurrence_of(X139,X140)
| ~ occurrence_of(X139,X141)
| X140 = X141 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
cnf(c_0_64,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_65,plain,
( occurrence_of(X1,esk9_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_66,plain,
! [X187,X188] :
( ( earlier(X187,X188)
| ~ precedes(X187,X188) )
& ( legal(X188)
| ~ precedes(X187,X188) )
& ( ~ earlier(X187,X188)
| ~ legal(X188)
| precedes(X187,X188) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])]) ).
cnf(c_0_67,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
fof(c_0_68,plain,
! [X161,X162,X164,X165,X166,X167] :
( ( root(X161,X162)
| min_precedes(esk7_2(X161,X162),X161,X162)
| ~ leaf(X161,X162) )
& ( ~ min_precedes(X161,X164,X162)
| ~ leaf(X161,X162) )
& ( ~ root(X165,X166)
| min_precedes(X165,esk8_2(X165,X166),X166)
| leaf(X165,X166) )
& ( ~ min_precedes(X167,X165,X166)
| min_precedes(X165,esk8_2(X165,X166),X166)
| leaf(X165,X166) ) ),
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_15])])])])])])]) ).
cnf(c_0_69,plain,
( min_precedes(X3,X4,X2)
| X4 = X3
| ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X3,X1)
| ~ leaf_occ(X4,X1)
| ~ arboreal(X3) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_70,negated_conjecture,
( subactivity_occurrence(esk16_0,X1)
| ~ subactivity_occurrence(esk15_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_71,negated_conjecture,
subactivity_occurrence(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_72,negated_conjecture,
occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_53]),c_0_54]) ).
cnf(c_0_73,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
fof(c_0_74,plain,
! [X152] :
( ( activity(esk5_1(X152))
| ~ activity_occurrence(X152) )
& ( occurrence_of(X152,esk5_1(X152))
| ~ activity_occurrence(X152) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])]) ).
cnf(c_0_75,plain,
( activity_occurrence(X1)
| ~ leaf_occ(X2,X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
fof(c_0_76,plain,
! [X222,X223,X224] :
( ~ earlier(X222,X223)
| ~ earlier(X223,X224)
| earlier(X222,X224) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_30])])]) ).
cnf(c_0_77,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_78,negated_conjecture,
precedes(esk14_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_67,c_0_43]) ).
cnf(c_0_79,plain,
( root(X1,X2)
| min_precedes(esk7_2(X1,X2),X1,X2)
| ~ leaf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_80,negated_conjecture,
( X1 = esk15_1(esk16_0)
| min_precedes(X1,esk15_1(esk16_0),X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk4_2(esk15_1(esk16_0),tptp0))
| ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_61]) ).
cnf(c_0_81,negated_conjecture,
subactivity_occurrence(esk16_0,esk4_2(esk15_1(esk16_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]) ).
cnf(c_0_82,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_72]) ).
cnf(c_0_83,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_84,negated_conjecture,
activity_occurrence(esk4_2(esk15_1(esk16_0),tptp0)),
inference(spm,[status(thm)],[c_0_75,c_0_61]) ).
cnf(c_0_85,plain,
( earlier(X1,X3)
| ~ earlier(X1,X2)
| ~ earlier(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_86,negated_conjecture,
earlier(esk14_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_87,negated_conjecture,
precedes(esk13_1(esk16_0),esk14_1(esk16_0)),
inference(spm,[status(thm)],[c_0_67,c_0_42]) ).
cnf(c_0_88,negated_conjecture,
( min_precedes(esk7_2(esk15_1(esk16_0),tptp0),esk15_1(esk16_0),tptp0)
| root(esk15_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[c_0_79,c_0_53]) ).
fof(c_0_89,plain,
! [X171,X172] :
( ~ root(X171,X172)
| legal(X171) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_17])])]) ).
cnf(c_0_90,plain,
( occurrence_of(esk13_1(X1),tptp3)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_91,plain,
! [X225,X226,X227,X228] :
( ~ min_precedes(X225,X226,X228)
| ~ min_precedes(X225,X227,X228)
| ~ precedes(X226,X227)
| min_precedes(X226,X227,X228) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_31])])]) ).
cnf(c_0_92,negated_conjecture,
( esk15_1(esk16_0) = esk16_0
| min_precedes(esk16_0,esk15_1(esk16_0),X1)
| ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_29])]) ).
cnf(c_0_93,negated_conjecture,
esk5_1(esk4_2(esk15_1(esk16_0),tptp0)) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_94,negated_conjecture,
( earlier(X1,esk15_1(esk16_0))
| ~ earlier(X1,esk14_1(esk16_0)) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_95,negated_conjecture,
earlier(esk13_1(esk16_0),esk14_1(esk16_0)),
inference(spm,[status(thm)],[c_0_77,c_0_87]) ).
cnf(c_0_96,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_97,negated_conjecture,
( precedes(esk7_2(esk15_1(esk16_0),tptp0),esk15_1(esk16_0))
| root(esk15_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[c_0_67,c_0_88]) ).
cnf(c_0_98,plain,
( legal(X1)
| ~ root(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_99,negated_conjecture,
( leaf_occ(X1,esk17_0)
| occurrence_of(esk13_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_90,c_0_23]) ).
cnf(c_0_100,plain,
( min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X1,X4,X3)
| ~ precedes(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_101,negated_conjecture,
( esk15_1(esk16_0) = esk16_0
| min_precedes(esk16_0,esk15_1(esk16_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_83]),c_0_93]),c_0_84])]) ).
cnf(c_0_102,plain,
( precedes(X1,X2)
| ~ earlier(X1,X2)
| ~ legal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_103,negated_conjecture,
earlier(esk13_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_104,negated_conjecture,
legal(esk15_1(esk16_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]) ).
cnf(c_0_105,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X2,tptp3)
| ~ next_subocc(esk16_0,X2,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_106,negated_conjecture,
occurrence_of(esk13_1(esk16_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_107,negated_conjecture,
( esk15_1(esk16_0) = esk16_0
| min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ precedes(X1,esk15_1(esk16_0))
| ~ min_precedes(esk16_0,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_108,negated_conjecture,
precedes(esk13_1(esk16_0),esk15_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104])]) ).
cnf(c_0_109,plain,
( occurrence_of(esk15_1(X1),tptp2)
| occurrence_of(esk15_1(X1),tptp1)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_110,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X2,tptp3)
| ~ next_subocc(esk16_0,X2,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_111,plain,
! [X62,X63] :
( earlier(X62,X63)
=> ~ earlier(X63,X62) ),
inference(fof_simplification,[status(thm)],[sos_20]) ).
cnf(c_0_112,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(esk13_1(esk16_0),X1,tptp0)
| ~ occurrence_of(X1,tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_40]),c_0_106])]) ).
cnf(c_0_113,negated_conjecture,
( esk15_1(esk16_0) = esk16_0
| min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_48])]) ).
cnf(c_0_114,negated_conjecture,
( leaf_occ(X1,esk17_0)
| occurrence_of(esk15_1(X1),tptp1)
| occurrence_of(esk15_1(X1),tptp2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_109,c_0_23]) ).
cnf(c_0_115,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(esk13_1(esk16_0),X1,tptp0)
| ~ occurrence_of(X1,tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_40]),c_0_106])]) ).
fof(c_0_116,plain,
! [X185,X186] :
( ~ earlier(X185,X186)
| ~ earlier(X186,X185) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_111])])]) ).
cnf(c_0_117,negated_conjecture,
precedes(esk16_0,esk13_1(esk16_0)),
inference(spm,[status(thm)],[c_0_67,c_0_48]) ).
cnf(c_0_118,negated_conjecture,
( esk15_1(esk16_0) = esk16_0
| ~ occurrence_of(esk15_1(esk16_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_53])]) ).
cnf(c_0_119,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp2)
| occurrence_of(esk15_1(esk16_0),tptp1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_120,negated_conjecture,
( esk15_1(esk16_0) = esk16_0
| ~ occurrence_of(esk15_1(esk16_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_113]),c_0_53])]) ).
cnf(c_0_121,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_122,negated_conjecture,
earlier(esk16_0,esk13_1(esk16_0)),
inference(spm,[status(thm)],[c_0_77,c_0_117]) ).
cnf(c_0_123,negated_conjecture,
esk15_1(esk16_0) = esk16_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]) ).
cnf(c_0_124,negated_conjecture,
~ earlier(esk13_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_125,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_123]),c_0_124]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PRO014+4 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 15:48:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.uPyrnQq6YP/E---3.1_12495.p
% 1.51/0.63 # Version: 3.1.0
% 1.51/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.51/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.51/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.51/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.51/0.63 # Starting sh5l with 300s (1) cores
% 1.51/0.63 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 12574 completed with status 0
% 1.51/0.63 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.51/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.51/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.51/0.63 # No SInE strategy applied
% 1.51/0.63 # Search class: FGHSF-FFMM31-SFFFFFNN
% 1.51/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.51/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 1.51/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.51/0.63 # Starting new_bool_3 with 136s (1) cores
% 1.51/0.63 # Starting new_bool_1 with 136s (1) cores
% 1.51/0.63 # Starting U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.51/0.63 # U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 12584 completed with status 0
% 1.51/0.63 # Result found by U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.51/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.51/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.51/0.63 # No SInE strategy applied
% 1.51/0.63 # Search class: FGHSF-FFMM31-SFFFFFNN
% 1.51/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.51/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 1.51/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.51/0.63 # Starting new_bool_3 with 136s (1) cores
% 1.51/0.63 # Starting new_bool_1 with 136s (1) cores
% 1.51/0.63 # Starting U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.51/0.63 # Preprocessing time : 0.002 s
% 1.51/0.63 # Presaturation interreduction done
% 1.51/0.63
% 1.51/0.63 # Proof found!
% 1.51/0.63 # SZS status Theorem
% 1.51/0.63 # SZS output start CNFRefutation
% See solution above
% 1.51/0.63 # Parsed axioms : 46
% 1.51/0.63 # Removed by relevancy pruning/SinE : 0
% 1.51/0.63 # Initial clauses : 85
% 1.51/0.63 # Removed in clause preprocessing : 0
% 1.51/0.63 # Initial clauses in saturation : 85
% 1.51/0.63 # Processed clauses : 2071
% 1.51/0.63 # ...of these trivial : 27
% 1.51/0.63 # ...subsumed : 790
% 1.51/0.63 # ...remaining for further processing : 1254
% 1.51/0.63 # Other redundant clauses eliminated : 0
% 1.51/0.63 # Clauses deleted for lack of memory : 0
% 1.51/0.63 # Backward-subsumed : 101
% 1.51/0.63 # Backward-rewritten : 210
% 1.51/0.63 # Generated clauses : 4532
% 1.51/0.63 # ...of the previous two non-redundant : 3694
% 1.51/0.63 # ...aggressively subsumed : 0
% 1.51/0.63 # Contextual simplify-reflections : 23
% 1.51/0.63 # Paramodulations : 4514
% 1.51/0.63 # Factorizations : 0
% 1.51/0.63 # NegExts : 0
% 1.51/0.63 # Equation resolutions : 0
% 1.51/0.63 # Disequality decompositions : 0
% 1.51/0.63 # Total rewrite steps : 2267
% 1.51/0.63 # ...of those cached : 2106
% 1.51/0.63 # Propositional unsat checks : 0
% 1.51/0.63 # Propositional check models : 0
% 1.51/0.63 # Propositional check unsatisfiable : 0
% 1.51/0.63 # Propositional clauses : 0
% 1.51/0.63 # Propositional clauses after purity: 0
% 1.51/0.63 # Propositional unsat core size : 0
% 1.51/0.63 # Propositional preprocessing time : 0.000
% 1.51/0.63 # Propositional encoding time : 0.000
% 1.51/0.63 # Propositional solver time : 0.000
% 1.51/0.63 # Success case prop preproc time : 0.000
% 1.51/0.63 # Success case prop encoding time : 0.000
% 1.51/0.63 # Success case prop solver time : 0.000
% 1.51/0.63 # Current number of processed clauses : 840
% 1.51/0.63 # Positive orientable unit clauses : 175
% 1.51/0.63 # Positive unorientable unit clauses: 0
% 1.51/0.63 # Negative unit clauses : 50
% 1.51/0.63 # Non-unit-clauses : 615
% 1.51/0.63 # Current number of unprocessed clauses: 1577
% 1.51/0.63 # ...number of literals in the above : 6021
% 1.51/0.63 # Current number of archived formulas : 0
% 1.51/0.63 # Current number of archived clauses : 414
% 1.51/0.63 # Clause-clause subsumption calls (NU) : 117566
% 1.51/0.63 # Rec. Clause-clause subsumption calls : 75003
% 1.51/0.63 # Non-unit clause-clause subsumptions : 494
% 1.51/0.63 # Unit Clause-clause subsumption calls : 4220
% 1.51/0.63 # Rewrite failures with RHS unbound : 0
% 1.51/0.63 # BW rewrite match attempts : 261
% 1.51/0.63 # BW rewrite match successes : 38
% 1.51/0.63 # Condensation attempts : 0
% 1.51/0.63 # Condensation successes : 0
% 1.51/0.63 # Termbank termtop insertions : 91525
% 1.51/0.63 # Search garbage collected termcells : 1411
% 1.51/0.63
% 1.51/0.63 # -------------------------------------------------
% 1.51/0.63 # User time : 0.145 s
% 1.51/0.63 # System time : 0.007 s
% 1.51/0.63 # Total time : 0.152 s
% 1.51/0.63 # Maximum resident set size: 2028 pages
% 1.51/0.63
% 1.51/0.63 # -------------------------------------------------
% 1.51/0.63 # User time : 0.712 s
% 1.51/0.63 # System time : 0.023 s
% 1.51/0.63 # Total time : 0.735 s
% 1.51/0.63 # Maximum resident set size: 1812 pages
% 1.51/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------