TSTP Solution File: PRO016+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PRO016+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:28 EDT 2024
% Result : Theorem 1.53s 0.62s
% Output : CNFRefutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 17
% Syntax : Number of formulae : 104 ( 37 unt; 0 def)
% Number of atoms : 484 ( 12 equ)
% Maximal formula atoms : 130 ( 4 avg)
% Number of connectives : 620 ( 240 ~; 259 |; 98 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 183 ( 4 sgn 96 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_32,axiom,
! [X102,X103] :
( ( occurrence_of(X103,tptp0)
& subactivity_occurrence(X102,X103)
& arboreal(X102)
& ~ leaf_occ(X102,X103) )
=> ? [X104,X105,X106] :
( occurrence_of(X104,tptp3)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X104,X105,tptp0)
& ( occurrence_of(X106,tptp1)
| occurrence_of(X106,tptp2) )
& next_subocc(X105,X106,tptp0)
& leaf_occ(X106,X103) ) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.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,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X109,X110,tptp0)
& leaf_occ(X110,X108)
& ( occurrence_of(X110,tptp1)
=> ~ ? [X111] :
( occurrence_of(X111,tptp2)
& min_precedes(X109,X111,tptp0) ) )
& ( occurrence_of(X110,tptp2)
=> ~ ? [X112] :
( occurrence_of(X112,tptp1)
& min_precedes(X109,X112,tptp0) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.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/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.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/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_27) ).
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/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_18) ).
fof(sos_09,axiom,
! [X32,X33,X34] :
( ( occurrence_of(X32,X34)
& leaf_occ(X33,X32) )
=> ~ ? [X35] : min_precedes(X33,X35,X34) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_09) ).
fof(sos_28,axiom,
! [X87,X88,X89,X90] :
( ( occurrence_of(X89,X90)
& ~ atomic(X90)
& leaf_occ(X87,X89)
& leaf_occ(X88,X89) )
=> X87 = X88 ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_28) ).
fof(sos_16,axiom,
! [X52,X53] :
( occurrence_of(X52,X53)
=> ( arboreal(X52)
<=> atomic(X53) ) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_16) ).
fof(sos_35,axiom,
atomic(tptp4),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_35) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X30)
& occurrence_of(X29,X31) )
=> X30 = X31 ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_08) ).
fof(sos_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity(X13)
& activity_occurrence(X14) ) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_03) ).
fof(sos_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( activity(X43)
& occurrence_of(X42,X43) ) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_12) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_34) ).
fof(sos_24,axiom,
! [X73,X74,X75] :
( min_precedes(X73,X74,X75)
=> precedes(X73,X74) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_24) ).
fof(sos_21,axiom,
! [X64,X65] :
( precedes(X64,X65)
<=> ( earlier(X64,X65)
& legal(X65) ) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_21) ).
fof(sos_30,axiom,
! [X95,X96,X97] :
( ( earlier(X95,X96)
& earlier(X96,X97) )
=> earlier(X95,X97) ),
file('/export/starexec/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_30) ).
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/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p',sos_31) ).
fof(c_0_17,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,tptp1)
| occurrence_of(X106,tptp2) )
& next_subocc(X105,X106,tptp0)
& leaf_occ(X106,X103) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_18,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,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X109,X110,tptp0)
& leaf_occ(X110,X108)
& ( occurrence_of(X110,tptp1)
=> ~ ? [X111] :
( occurrence_of(X111,tptp2)
& min_precedes(X109,X111,tptp0) ) )
& ( occurrence_of(X110,tptp2)
=> ~ ? [X112] :
( occurrence_of(X112,tptp1)
& min_precedes(X109,X112,tptp0) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_19,plain,
! [X231,X232] :
( ( occurrence_of(esk13_2(X231,X232),tptp3)
| ~ occurrence_of(X232,tptp0)
| ~ subactivity_occurrence(X231,X232)
| ~ arboreal(X231)
| leaf_occ(X231,X232) )
& ( next_subocc(X231,esk13_2(X231,X232),tptp0)
| ~ occurrence_of(X232,tptp0)
| ~ subactivity_occurrence(X231,X232)
| ~ arboreal(X231)
| leaf_occ(X231,X232) )
& ( occurrence_of(esk14_2(X231,X232),tptp4)
| ~ occurrence_of(X232,tptp0)
| ~ subactivity_occurrence(X231,X232)
| ~ arboreal(X231)
| leaf_occ(X231,X232) )
& ( next_subocc(esk13_2(X231,X232),esk14_2(X231,X232),tptp0)
| ~ occurrence_of(X232,tptp0)
| ~ subactivity_occurrence(X231,X232)
| ~ arboreal(X231)
| leaf_occ(X231,X232) )
& ( occurrence_of(esk15_2(X231,X232),tptp1)
| occurrence_of(esk15_2(X231,X232),tptp2)
| ~ occurrence_of(X232,tptp0)
| ~ subactivity_occurrence(X231,X232)
| ~ arboreal(X231)
| leaf_occ(X231,X232) )
& ( next_subocc(esk14_2(X231,X232),esk15_2(X231,X232),tptp0)
| ~ occurrence_of(X232,tptp0)
| ~ subactivity_occurrence(X231,X232)
| ~ arboreal(X231)
| leaf_occ(X231,X232) )
& ( leaf_occ(esk15_2(X231,X232),X232)
| ~ occurrence_of(X232,tptp0)
| ~ subactivity_occurrence(X231,X232)
| ~ arboreal(X231)
| leaf_occ(X231,X232) ) ),
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_17])])])])]) ).
fof(c_0_20,negated_conjecture,
! [X238,X239] :
( occurrence_of(esk17_0,tptp0)
& subactivity_occurrence(esk16_0,esk17_0)
& arboreal(esk16_0)
& ~ leaf_occ(esk16_0,esk17_0)
& ( occurrence_of(X239,tptp2)
| occurrence_of(X239,tptp1)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(esk19_2(X238,X239),tptp1)
| occurrence_of(X239,tptp1)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( min_precedes(X238,esk19_2(X238,X239),tptp0)
| occurrence_of(X239,tptp1)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(X239,tptp2)
| occurrence_of(esk18_2(X238,X239),tptp2)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(esk19_2(X238,X239),tptp1)
| occurrence_of(esk18_2(X238,X239),tptp2)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( min_precedes(X238,esk19_2(X238,X239),tptp0)
| occurrence_of(esk18_2(X238,X239),tptp2)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(X239,tptp2)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(esk19_2(X238,X239),tptp1)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( min_precedes(X238,esk19_2(X238,X239),tptp0)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| ~ occurrence_of(X239,tptp1)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(X239,tptp2)
| occurrence_of(X239,tptp1)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(esk19_2(X238,X239),tptp1)
| occurrence_of(X239,tptp1)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( min_precedes(X238,esk19_2(X238,X239),tptp0)
| occurrence_of(X239,tptp1)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(X239,tptp2)
| occurrence_of(esk18_2(X238,X239),tptp2)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(esk19_2(X238,X239),tptp1)
| occurrence_of(esk18_2(X238,X239),tptp2)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( min_precedes(X238,esk19_2(X238,X239),tptp0)
| occurrence_of(esk18_2(X238,X239),tptp2)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(X239,tptp2)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( occurrence_of(esk19_2(X238,X239),tptp1)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) )
& ( min_precedes(X238,esk19_2(X238,X239),tptp0)
| min_precedes(X238,esk18_2(X238,X239),tptp0)
| ~ occurrence_of(X239,tptp2)
| ~ occurrence_of(X238,tptp3)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ leaf_occ(X239,esk17_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])]) ).
cnf(c_0_21,plain,
( next_subocc(esk14_2(X1,X2),esk15_2(X1,X2),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
occurrence_of(esk17_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X204,X205,X206,X207,X208,X209,X210] :
( ( min_precedes(X204,X205,X206)
| ~ next_subocc(X204,X205,X206) )
& ( ~ min_precedes(X204,X207,X206)
| ~ min_precedes(X207,X205,X206)
| ~ next_subocc(X204,X205,X206) )
& ( min_precedes(X208,esk12_3(X208,X209,X210),X210)
| ~ min_precedes(X208,X209,X210)
| next_subocc(X208,X209,X210) )
& ( min_precedes(esk12_3(X208,X209,X210),X209,X210)
| ~ min_precedes(X208,X209,X210)
| next_subocc(X208,X209,X210) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_26])])])])])])]) ).
cnf(c_0_24,negated_conjecture,
( next_subocc(esk14_2(X1,esk17_0),esk15_2(X1,esk17_0),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
arboreal(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( leaf_occ(esk15_2(X1,X2),X2)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_29,plain,
! [X212,X213,X214,X215] :
( ~ min_precedes(X212,X213,X214)
| ~ occurrence_of(X215,X214)
| ~ subactivity_occurrence(X213,X215)
| subactivity_occurrence(X212,X215) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_27])])]) ).
cnf(c_0_30,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,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_24,c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_32,plain,
! [X175,X176,X178,X179,X180] :
( ( occurrence_of(X176,esk9_2(X175,X176))
| ~ leaf_occ(X175,X176) )
& ( subactivity_occurrence(X175,X176)
| ~ leaf_occ(X175,X176) )
& ( leaf(X175,esk9_2(X175,X176))
| ~ leaf_occ(X175,X176) )
& ( ~ occurrence_of(X179,X180)
| ~ subactivity_occurrence(X178,X179)
| ~ leaf(X178,X180)
| leaf_occ(X178,X179) ) ),
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_33,negated_conjecture,
( leaf_occ(esk15_2(X1,esk17_0),esk17_0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_34,plain,
( occurrence_of(esk14_2(X1,X2),tptp4)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_35,plain,
! [X144,X145,X146,X147] :
( ~ occurrence_of(X144,X146)
| ~ leaf_occ(X145,X144)
| ~ min_precedes(X145,X147,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_36,plain,
! [X87,X88,X89,X90] :
( ( occurrence_of(X89,X90)
& ~ atomic(X90)
& leaf_occ(X87,X89)
& leaf_occ(X88,X89) )
=> X87 = X88 ),
inference(fof_simplification,[status(thm)],[sos_28]) ).
cnf(c_0_37,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_29]) ).
cnf(c_0_38,negated_conjecture,
min_precedes(esk14_2(esk16_0,esk17_0),esk15_2(esk16_0,esk17_0),tptp0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,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_33,c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_41,plain,
! [X171,X172] :
( ( ~ arboreal(X171)
| atomic(X172)
| ~ occurrence_of(X171,X172) )
& ( ~ atomic(X172)
| arboreal(X171)
| ~ occurrence_of(X171,X172) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])])]) ).
cnf(c_0_42,negated_conjecture,
( leaf_occ(X1,esk17_0)
| occurrence_of(esk14_2(X1,esk17_0),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_43,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_44,plain,
! [X216,X217,X218,X219] :
( ~ occurrence_of(X218,X219)
| atomic(X219)
| ~ leaf_occ(X216,X218)
| ~ leaf_occ(X217,X218)
| X216 = X217 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
cnf(c_0_45,negated_conjecture,
( subactivity_occurrence(esk14_2(esk16_0,esk17_0),X1)
| ~ subactivity_occurrence(esk15_2(esk16_0,esk17_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
subactivity_occurrence(esk15_2(esk16_0,esk17_0),esk17_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
( arboreal(X2)
| ~ atomic(X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,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_42,c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_49,plain,
atomic(tptp4),
inference(split_conjunct,[status(thm)],[sos_35]) ).
cnf(c_0_50,negated_conjecture,
( ~ leaf_occ(esk14_2(esk16_0,esk17_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
fof(c_0_51,plain,
! [X141,X142,X143] :
( ~ occurrence_of(X141,X142)
| ~ occurrence_of(X141,X143)
| X142 = X143 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
fof(c_0_52,plain,
! [X125,X126] :
( ( activity(X125)
| ~ occurrence_of(X126,X125) )
& ( activity_occurrence(X126)
| ~ occurrence_of(X126,X125) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).
cnf(c_0_53,plain,
( atomic(X2)
| X3 = X4
| ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ leaf_occ(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,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_45,c_0_22]),c_0_46])]) ).
cnf(c_0_55,negated_conjecture,
arboreal(esk14_2(esk16_0,esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_56,negated_conjecture,
~ leaf_occ(esk14_2(esk16_0,esk17_0),esk17_0),
inference(spm,[status(thm)],[c_0_50,c_0_22]) ).
cnf(c_0_57,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_58,plain,
! [X154] :
( ( activity(esk5_1(X154))
| ~ activity_occurrence(X154) )
& ( occurrence_of(X154,esk5_1(X154))
| ~ activity_occurrence(X154) ) ),
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_59,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
fof(c_0_60,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_61,negated_conjecture,
( X1 = esk15_2(esk16_0,esk17_0)
| atomic(X2)
| ~ leaf_occ(X1,esk17_0)
| ~ occurrence_of(esk17_0,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_40]) ).
cnf(c_0_62,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_33,c_0_54]),c_0_55])]),c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk17_0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_22]) ).
cnf(c_0_64,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_65,negated_conjecture,
activity_occurrence(esk17_0),
inference(spm,[status(thm)],[c_0_59,c_0_22]) ).
fof(c_0_66,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( esk15_2(esk14_2(esk16_0,esk17_0),esk17_0) = esk15_2(esk16_0,esk17_0)
| atomic(X1)
| ~ occurrence_of(esk17_0,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
esk5_1(esk17_0) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_69,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_70,negated_conjecture,
esk15_2(esk14_2(esk16_0,esk17_0),esk17_0) = esk15_2(esk16_0,esk17_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_64]),c_0_68]),c_0_65])]),c_0_69]) ).
cnf(c_0_71,plain,
( next_subocc(esk13_2(X1,X2),esk14_2(X1,X2),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_72,plain,
! [X198,X199,X200] :
( ~ min_precedes(X198,X199,X200)
| precedes(X198,X199) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])]) ).
cnf(c_0_73,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_24,c_0_54]),c_0_55])]),c_0_56]),c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( next_subocc(esk13_2(X1,esk17_0),esk14_2(X1,esk17_0),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_71,c_0_22]) ).
fof(c_0_75,plain,
! [X189,X190] :
( ( earlier(X189,X190)
| ~ precedes(X189,X190) )
& ( legal(X190)
| ~ precedes(X189,X190) )
& ( ~ earlier(X189,X190)
| ~ legal(X190)
| precedes(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_76,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_77,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_30,c_0_73]) ).
cnf(c_0_78,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_74,c_0_54]),c_0_55])]),c_0_56]) ).
fof(c_0_79,plain,
! [X224,X225,X226] :
( ~ earlier(X224,X225)
| ~ earlier(X225,X226)
| earlier(X224,X226) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_30])])]) ).
cnf(c_0_80,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_81,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_76,c_0_77]) ).
cnf(c_0_82,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_30,c_0_78]) ).
cnf(c_0_83,plain,
( earlier(X1,X3)
| ~ earlier(X1,X2)
| ~ earlier(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_84,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_80,c_0_81]) ).
cnf(c_0_85,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_76,c_0_82]) ).
cnf(c_0_86,plain,
( next_subocc(X1,esk13_2(X1,X2),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_87,plain,
! [X227,X228,X229,X230] :
( ~ min_precedes(X227,X228,X230)
| ~ min_precedes(X227,X229,X230)
| ~ precedes(X228,X229)
| min_precedes(X228,X229,X230) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_31])])]) ).
cnf(c_0_88,plain,
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X2,X4,X3)
| ~ next_subocc(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_89,negated_conjecture,
( earlier(X1,esk15_2(esk16_0,esk17_0))
| ~ earlier(X1,esk14_2(esk14_2(esk16_0,esk17_0),esk17_0)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,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_80,c_0_85]) ).
cnf(c_0_91,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_92,negated_conjecture,
precedes(esk14_2(esk16_0,esk17_0),esk15_2(esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_76,c_0_38]) ).
cnf(c_0_93,negated_conjecture,
( next_subocc(X1,esk13_2(X1,esk17_0),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_86,c_0_22]) ).
cnf(c_0_94,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_87]) ).
cnf(c_0_95,negated_conjecture,
( ~ min_precedes(X1,esk15_2(esk16_0,esk17_0),tptp0)
| ~ min_precedes(esk14_2(esk16_0,esk17_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_88,c_0_31]) ).
cnf(c_0_96,plain,
( precedes(X1,X2)
| ~ earlier(X1,X2)
| ~ legal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_97,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_89,c_0_90]) ).
cnf(c_0_98,negated_conjecture,
legal(esk15_2(esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_99,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_93,c_0_54]),c_0_55])]),c_0_56]) ).
cnf(c_0_100,negated_conjecture,
( ~ precedes(X1,esk15_2(esk16_0,esk17_0))
| ~ min_precedes(esk14_2(esk16_0,esk17_0),X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_38]),c_0_95]) ).
cnf(c_0_101,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_96,c_0_97]),c_0_98])]) ).
cnf(c_0_102,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_30,c_0_99]) ).
cnf(c_0_103,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : PRO016+4 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n006.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 15:47:52 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.qQFJi12Tlf/E---3.1_32651.p
% 1.53/0.62 # Version: 3.1.0
% 1.53/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.53/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.53/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.53/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.53/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.53/0.62 # Starting sh5l with 300s (1) cores
% 1.53/0.62 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 32729 completed with status 0
% 1.53/0.62 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.53/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.53/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.53/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.53/0.62 # No SInE strategy applied
% 1.53/0.62 # Search class: FGHSF-FFMM32-SFFFFFNN
% 1.53/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.53/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 1.53/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.53/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.53/0.62 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.53/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.53/0.62 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 32736 completed with status 0
% 1.53/0.62 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.53/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.53/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.53/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.53/0.62 # No SInE strategy applied
% 1.53/0.62 # Search class: FGHSF-FFMM32-SFFFFFNN
% 1.53/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.53/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 1.53/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.53/0.62 # Preprocessing time : 0.002 s
% 1.53/0.62 # Presaturation interreduction done
% 1.53/0.62
% 1.53/0.62 # Proof found!
% 1.53/0.62 # SZS status Theorem
% 1.53/0.62 # SZS output start CNFRefutation
% See solution above
% 1.53/0.62 # Parsed axioms : 46
% 1.53/0.62 # Removed by relevancy pruning/SinE : 0
% 1.53/0.62 # Initial clauses : 101
% 1.53/0.62 # Removed in clause preprocessing : 6
% 1.53/0.62 # Initial clauses in saturation : 95
% 1.53/0.62 # Processed clauses : 1984
% 1.53/0.62 # ...of these trivial : 54
% 1.53/0.62 # ...subsumed : 262
% 1.53/0.62 # ...remaining for further processing : 1668
% 1.53/0.62 # Other redundant clauses eliminated : 0
% 1.53/0.62 # Clauses deleted for lack of memory : 0
% 1.53/0.62 # Backward-subsumed : 46
% 1.53/0.62 # Backward-rewritten : 80
% 1.53/0.62 # Generated clauses : 5320
% 1.53/0.62 # ...of the previous two non-redundant : 4168
% 1.53/0.62 # ...aggressively subsumed : 0
% 1.53/0.62 # Contextual simplify-reflections : 22
% 1.53/0.62 # Paramodulations : 5304
% 1.53/0.62 # Factorizations : 0
% 1.53/0.62 # NegExts : 0
% 1.53/0.62 # Equation resolutions : 0
% 1.53/0.62 # Disequality decompositions : 0
% 1.53/0.62 # Total rewrite steps : 2715
% 1.53/0.62 # ...of those cached : 2420
% 1.53/0.62 # Propositional unsat checks : 0
% 1.53/0.62 # Propositional check models : 0
% 1.53/0.62 # Propositional check unsatisfiable : 0
% 1.53/0.62 # Propositional clauses : 0
% 1.53/0.62 # Propositional clauses after purity: 0
% 1.53/0.62 # Propositional unsat core size : 0
% 1.53/0.62 # Propositional preprocessing time : 0.000
% 1.53/0.62 # Propositional encoding time : 0.000
% 1.53/0.62 # Propositional solver time : 0.000
% 1.53/0.62 # Success case prop preproc time : 0.000
% 1.53/0.62 # Success case prop encoding time : 0.000
% 1.53/0.62 # Success case prop solver time : 0.000
% 1.53/0.62 # Current number of processed clauses : 1431
% 1.53/0.62 # Positive orientable unit clauses : 383
% 1.53/0.62 # Positive unorientable unit clauses: 0
% 1.53/0.62 # Negative unit clauses : 505
% 1.53/0.62 # Non-unit-clauses : 543
% 1.53/0.62 # Current number of unprocessed clauses: 2101
% 1.53/0.62 # ...number of literals in the above : 6587
% 1.53/0.62 # Current number of archived formulas : 0
% 1.53/0.62 # Current number of archived clauses : 237
% 1.53/0.62 # Clause-clause subsumption calls (NU) : 65657
% 1.53/0.62 # Rec. Clause-clause subsumption calls : 23821
% 1.53/0.62 # Non-unit clause-clause subsumptions : 147
% 1.53/0.62 # Unit Clause-clause subsumption calls : 16042
% 1.53/0.62 # Rewrite failures with RHS unbound : 0
% 1.53/0.62 # BW rewrite match attempts : 195
% 1.53/0.62 # BW rewrite match successes : 23
% 1.53/0.62 # Condensation attempts : 0
% 1.53/0.62 # Condensation successes : 0
% 1.53/0.62 # Termbank termtop insertions : 142493
% 1.53/0.62 # Search garbage collected termcells : 1524
% 1.53/0.62
% 1.53/0.62 # -------------------------------------------------
% 1.53/0.62 # User time : 0.203 s
% 1.53/0.62 # System time : 0.013 s
% 1.53/0.62 # Total time : 0.216 s
% 1.53/0.62 # Maximum resident set size: 2100 pages
% 1.53/0.62
% 1.53/0.62 # -------------------------------------------------
% 1.53/0.62 # User time : 1.011 s
% 1.53/0.62 # System time : 0.045 s
% 1.53/0.62 # Total time : 1.056 s
% 1.53/0.62 # Maximum resident set size: 1816 pages
% 1.53/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------