TSTP Solution File: PRO018+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : PRO018+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Mon Jun 24 13:40:03 EDT 2024
% Result : Theorem 39.69s 5.47s
% Output : CNFRefutation 39.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 14
% Syntax : Number of formulae : 105 ( 37 unt; 0 def)
% Number of atoms : 487 ( 42 equ)
% Maximal formula atoms : 130 ( 4 avg)
% Number of connectives : 605 ( 223 ~; 272 |; 91 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-3 aty)
% Number of variables : 134 ( 2 sgn 62 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_35,axiom,
! [X106,X107] :
( ( occurrence_of(X107,tptp0)
& subactivity_occurrence(X106,X107)
& arboreal(X106)
& ~ leaf_occ(X106,X107) )
=> ? [X108,X109,X110] :
( occurrence_of(X108,tptp3)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X109,tptp4)
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X109,X110,tptp0)
& ! [X111] :
( min_precedes(X108,X111,tptp0)
=> ( X111 = X109
| X111 = X110 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_35) ).
fof(goals,conjecture,
! [X112,X113] :
( ( occurrence_of(X113,tptp0)
& subactivity_occurrence(X112,X113)
& arboreal(X112)
& ~ leaf_occ(X112,X113) )
=> ? [X114,X115] :
( occurrence_of(X114,tptp3)
& next_subocc(X112,X114,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& min_precedes(X114,X115,tptp0)
& leaf_occ(X115,X113)
& ( occurrence_of(X115,tptp1)
=> ~ ? [X116] :
( occurrence_of(X116,tptp2)
& min_precedes(X114,X116,tptp0) ) )
& ( occurrence_of(X115,tptp2)
=> ~ ? [X117] :
( occurrence_of(X117,tptp1)
& min_precedes(X114,X117,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',goals) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( min_precedes(X61,X62,X63)
& ~ ? [X64] :
( min_precedes(X61,X64,X63)
& min_precedes(X64,X62,X63) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_22) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( occurrence_of(X73,X70)
& subactivity_occurrence(X71,X73)
& subactivity_occurrence(X72,X73) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_25) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_07) ).
fof(sos_41,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_41) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_02) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_21) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity(X1)
& activity_occurrence(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( activity(X4)
& occurrence_of(X3,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_01) ).
fof(sos_42,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_42) ).
fof(sos_46,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_46) ).
fof(sos_45,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/tmp/tmp.2V4k5snqgr/E---3.1_29065.p',sos_45) ).
fof(c_0_14,plain,
! [X106,X107] :
( ( occurrence_of(X107,tptp0)
& subactivity_occurrence(X106,X107)
& arboreal(X106)
& ~ leaf_occ(X106,X107) )
=> ? [X108,X109,X110] :
( occurrence_of(X108,tptp3)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X109,tptp4)
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X109,X110,tptp0)
& ! [X111] :
( min_precedes(X108,X111,tptp0)
=> ( X111 = X109
| X111 = X110 ) ) ) ),
inference(fof_simplification,[status(thm)],[sos_35]) ).
fof(c_0_15,negated_conjecture,
~ ! [X112,X113] :
( ( occurrence_of(X113,tptp0)
& subactivity_occurrence(X112,X113)
& arboreal(X112)
& ~ leaf_occ(X112,X113) )
=> ? [X114,X115] :
( occurrence_of(X114,tptp3)
& next_subocc(X112,X114,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& min_precedes(X114,X115,tptp0)
& leaf_occ(X115,X113)
& ( occurrence_of(X115,tptp1)
=> ~ ? [X116] :
( occurrence_of(X116,tptp2)
& min_precedes(X114,X116,tptp0) ) )
& ( occurrence_of(X115,tptp2)
=> ~ ? [X117] :
( occurrence_of(X117,tptp1)
& min_precedes(X114,X117,tptp0) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_16,plain,
! [X135,X136,X140] :
( ( occurrence_of(esk6_1(X135),tptp3)
| ~ occurrence_of(X136,tptp0)
| ~ subactivity_occurrence(X135,X136)
| ~ arboreal(X135)
| leaf_occ(X135,X136) )
& ( next_subocc(X135,esk6_1(X135),tptp0)
| ~ occurrence_of(X136,tptp0)
| ~ subactivity_occurrence(X135,X136)
| ~ arboreal(X135)
| leaf_occ(X135,X136) )
& ( occurrence_of(esk7_1(X135),tptp4)
| ~ occurrence_of(X136,tptp0)
| ~ subactivity_occurrence(X135,X136)
| ~ arboreal(X135)
| leaf_occ(X135,X136) )
& ( min_precedes(esk6_1(X135),esk7_1(X135),tptp0)
| ~ occurrence_of(X136,tptp0)
| ~ subactivity_occurrence(X135,X136)
| ~ arboreal(X135)
| leaf_occ(X135,X136) )
& ( occurrence_of(esk8_1(X135),tptp1)
| occurrence_of(esk8_1(X135),tptp2)
| ~ occurrence_of(X136,tptp0)
| ~ subactivity_occurrence(X135,X136)
| ~ arboreal(X135)
| leaf_occ(X135,X136) )
& ( min_precedes(esk7_1(X135),esk8_1(X135),tptp0)
| ~ occurrence_of(X136,tptp0)
| ~ subactivity_occurrence(X135,X136)
| ~ arboreal(X135)
| leaf_occ(X135,X136) )
& ( ~ min_precedes(esk6_1(X135),X140,tptp0)
| X140 = esk7_1(X135)
| X140 = esk8_1(X135)
| ~ occurrence_of(X136,tptp0)
| ~ subactivity_occurrence(X135,X136)
| ~ arboreal(X135)
| leaf_occ(X135,X136) ) ),
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_14])])])])])])]) ).
fof(c_0_17,negated_conjecture,
! [X120,X121] :
( occurrence_of(esk2_0,tptp0)
& subactivity_occurrence(esk1_0,esk2_0)
& arboreal(esk1_0)
& ~ leaf_occ(esk1_0,esk2_0)
& ( occurrence_of(X121,tptp2)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(esk4_2(X120,X121),tptp1)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( min_precedes(X120,esk4_2(X120,X121),tptp0)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(X121,tptp2)
| occurrence_of(esk3_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(esk4_2(X120,X121),tptp1)
| occurrence_of(esk3_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( min_precedes(X120,esk4_2(X120,X121),tptp0)
| occurrence_of(esk3_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(X121,tptp2)
| min_precedes(X120,esk3_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(esk4_2(X120,X121),tptp1)
| min_precedes(X120,esk3_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( min_precedes(X120,esk4_2(X120,X121),tptp0)
| min_precedes(X120,esk3_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(X121,tptp2)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(esk4_2(X120,X121),tptp1)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( min_precedes(X120,esk4_2(X120,X121),tptp0)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(X121,tptp2)
| occurrence_of(esk3_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(esk4_2(X120,X121),tptp1)
| occurrence_of(esk3_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( min_precedes(X120,esk4_2(X120,X121),tptp0)
| occurrence_of(esk3_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(X121,tptp2)
| min_precedes(X120,esk3_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( occurrence_of(esk4_2(X120,X121),tptp1)
| min_precedes(X120,esk3_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_0) )
& ( min_precedes(X120,esk4_2(X120,X121),tptp0)
| min_precedes(X120,esk3_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk1_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk2_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_15])])])])])]) ).
cnf(c_0_18,plain,
( next_subocc(X1,esk6_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X150,X151,X152,X153,X154,X155,X156] :
( ( min_precedes(X150,X151,X152)
| ~ next_subocc(X150,X151,X152) )
& ( ~ min_precedes(X150,X153,X152)
| ~ min_precedes(X153,X151,X152)
| ~ next_subocc(X150,X151,X152) )
& ( min_precedes(X154,esk10_3(X154,X155,X156),X156)
| ~ min_precedes(X154,X155,X156)
| next_subocc(X154,X155,X156) )
& ( min_precedes(esk10_3(X154,X155,X156),X155,X156)
| ~ min_precedes(X154,X155,X156)
| next_subocc(X154,X155,X156) ) ),
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_21,negated_conjecture,
( leaf_occ(X1,esk2_0)
| next_subocc(X1,esk6_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X127,X128,X129] :
( ( occurrence_of(esk5_3(X127,X128,X129),X127)
| ~ min_precedes(X128,X129,X127) )
& ( subactivity_occurrence(X128,esk5_3(X127,X128,X129))
| ~ min_precedes(X128,X129,X127) )
& ( subactivity_occurrence(X129,esk5_3(X127,X128,X129))
| ~ min_precedes(X128,X129,X127) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])])]) ).
cnf(c_0_26,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
next_subocc(esk1_0,esk6_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_28,plain,
( occurrence_of(esk6_1(X1),tptp3)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( occurrence_of(esk5_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
min_precedes(esk1_0,esk6_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
! [X158,X159] :
( ( ~ arboreal(X158)
| atomic(X159)
| ~ occurrence_of(X158,X159) )
& ( ~ atomic(X159)
| arboreal(X158)
| ~ occurrence_of(X158,X159) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_32,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk6_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),tptp0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( subactivity_occurrence(X1,esk5_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( arboreal(X2)
| ~ atomic(X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
occurrence_of(esk6_1(esk1_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_37,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_41]) ).
fof(c_0_38,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_02])])]) ).
fof(c_0_39,plain,
! [X144,X145,X147,X148,X149] :
( ( occurrence_of(X145,esk9_2(X144,X145))
| ~ leaf_occ(X144,X145) )
& ( subactivity_occurrence(X144,X145)
| ~ leaf_occ(X144,X145) )
& ( leaf(X144,esk9_2(X144,X145))
| ~ leaf_occ(X144,X145) )
& ( ~ occurrence_of(X148,X149)
| ~ subactivity_occurrence(X147,X148)
| ~ leaf(X147,X149)
| leaf_occ(X147,X148) ) ),
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_40,negated_conjecture,
( leaf_occ(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| occurrence_of(esk6_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
subactivity_occurrence(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
arboreal(esk6_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,plain,
( min_precedes(esk6_1(X1),esk7_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_44,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( occurrence_of(X1,esk9_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( leaf_occ(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
fof(c_0_47,plain,
! [X179,X180,X182,X183,X184,X185] :
( ( root(X179,X180)
| min_precedes(esk14_2(X179,X180),X179,X180)
| ~ leaf(X179,X180) )
& ( ~ min_precedes(X179,X182,X180)
| ~ leaf(X179,X180) )
& ( ~ root(X183,X184)
| min_precedes(X183,esk15_2(X183,X184),X184)
| leaf(X183,X184) )
& ( ~ min_precedes(X185,X183,X184)
| min_precedes(X183,esk15_2(X183,X184),X184)
| leaf(X183,X184) ) ),
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_21])])])])])])]) ).
cnf(c_0_48,negated_conjecture,
( leaf_occ(X1,esk2_0)
| min_precedes(esk6_1(X1),esk7_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_19]) ).
cnf(c_0_49,plain,
( leaf(X1,esk9_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_50,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_51,negated_conjecture,
( occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))))
| occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
min_precedes(esk6_1(esk1_0),esk7_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_54,negated_conjecture,
( leaf_occ(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| next_subocc(X1,esk6_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_55,plain,
( occurrence_of(esk7_1(X1),tptp4)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_56,plain,
! [X174,X175] :
( ( activity(X174)
| ~ occurrence_of(X175,X174) )
& ( activity_occurrence(X175)
| ~ occurrence_of(X175,X174) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
cnf(c_0_57,negated_conjecture,
( leaf(esk6_1(esk1_0),esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))))
| occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_58,negated_conjecture,
( esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))) = tptp0
| occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
~ leaf(esk6_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( X2 = esk7_1(X1)
| X2 = esk8_1(X1)
| leaf_occ(X1,X3)
| ~ min_precedes(esk6_1(X1),X2,tptp0)
| ~ occurrence_of(X3,tptp0)
| ~ subactivity_occurrence(X1,X3)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_61,negated_conjecture,
( leaf_occ(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| next_subocc(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_41]),c_0_42])]) ).
cnf(c_0_62,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk7_1(X1),tptp4)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_19]) ).
fof(c_0_63,plain,
! [X176] :
( ( activity(esk13_1(X176))
| ~ activity_occurrence(X176) )
& ( occurrence_of(X176,esk13_1(X176))
| ~ activity_occurrence(X176) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])]) ).
cnf(c_0_64,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_65,negated_conjecture,
occurrence_of(esk6_1(esk6_1(esk1_0)),tptp3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( X1 = esk8_1(X2)
| X1 = esk7_1(X2)
| leaf_occ(X2,esk2_0)
| ~ subactivity_occurrence(X2,esk2_0)
| ~ min_precedes(esk6_1(X2),X1,tptp0)
| ~ arboreal(X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_19]) ).
cnf(c_0_67,negated_conjecture,
( leaf_occ(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))
| min_precedes(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_26,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
occurrence_of(esk7_1(esk1_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_69,plain,
( occurrence_of(X1,esk13_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_70,negated_conjecture,
activity_occurrence(esk6_1(esk6_1(esk1_0))),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
( X1 = esk7_1(esk1_0)
| X1 = esk8_1(esk1_0)
| ~ min_precedes(esk6_1(esk1_0),X1,tptp0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_72,negated_conjecture,
( min_precedes(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0)
| occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_45,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
activity_occurrence(esk7_1(esk1_0)),
inference(spm,[status(thm)],[c_0_64,c_0_68]) ).
fof(c_0_74,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_42]) ).
cnf(c_0_75,negated_conjecture,
( X1 = tptp3
| ~ occurrence_of(esk6_1(esk6_1(esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_65]) ).
cnf(c_0_76,negated_conjecture,
occurrence_of(esk6_1(esk6_1(esk1_0)),esk13_1(esk6_1(esk6_1(esk1_0)))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk8_1(esk1_0)
| esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0)
| occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( X1 = tptp4
| ~ occurrence_of(esk7_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_68]) ).
cnf(c_0_79,negated_conjecture,
occurrence_of(esk7_1(esk1_0),esk13_1(esk7_1(esk1_0))),
inference(spm,[status(thm)],[c_0_69,c_0_73]) ).
fof(c_0_80,plain,
tptp4 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_74]) ).
cnf(c_0_81,negated_conjecture,
esk13_1(esk6_1(esk6_1(esk1_0))) = tptp3,
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0)
| occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))))
| occurrence_of(esk8_1(esk1_0),tptp3) ),
inference(spm,[status(thm)],[c_0_65,c_0_77]) ).
cnf(c_0_83,negated_conjecture,
esk13_1(esk7_1(esk1_0)) = tptp4,
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_84,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_85,negated_conjecture,
( occurrence_of(esk5_3(tptp0,esk1_0,esk6_1(esk1_0)),esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))))
| occurrence_of(esk8_1(esk1_0),tptp3) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]) ).
cnf(c_0_86,negated_conjecture,
( leaf(esk6_1(esk1_0),esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))))
| min_precedes(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_49,c_0_67]) ).
cnf(c_0_87,negated_conjecture,
( esk9_2(esk6_1(esk1_0),esk5_3(tptp0,esk1_0,esk6_1(esk1_0))) = tptp0
| occurrence_of(esk8_1(esk1_0),tptp3) ),
inference(spm,[status(thm)],[c_0_50,c_0_85]) ).
cnf(c_0_88,negated_conjecture,
( min_precedes(esk6_1(esk1_0),esk6_1(esk6_1(esk1_0)),tptp0)
| occurrence_of(esk8_1(esk1_0),tptp3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_59]) ).
cnf(c_0_89,plain,
( occurrence_of(esk8_1(X1),tptp1)
| occurrence_of(esk8_1(X1),tptp2)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_90,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk8_1(esk1_0)
| esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0)
| occurrence_of(esk8_1(esk1_0),tptp3) ),
inference(spm,[status(thm)],[c_0_71,c_0_88]) ).
cnf(c_0_91,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk8_1(X1),tptp2)
| occurrence_of(esk8_1(X1),tptp1)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_19]) ).
fof(c_0_92,plain,
tptp3 != tptp2,
inference(fof_simplification,[status(thm)],[sos_46]) ).
cnf(c_0_93,negated_conjecture,
( esk6_1(esk6_1(esk1_0)) = esk7_1(esk1_0)
| occurrence_of(esk8_1(esk1_0),tptp3) ),
inference(spm,[status(thm)],[c_0_65,c_0_90]) ).
cnf(c_0_94,negated_conjecture,
( occurrence_of(esk8_1(esk1_0),tptp1)
| occurrence_of(esk8_1(esk1_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_22]),c_0_23])]),c_0_24]) ).
fof(c_0_95,plain,
tptp3 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_92]) ).
fof(c_0_96,plain,
tptp3 != tptp1,
inference(fof_simplification,[status(thm)],[sos_45]) ).
cnf(c_0_97,negated_conjecture,
occurrence_of(esk8_1(esk1_0),tptp3),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_93]),c_0_83]),c_0_84]) ).
cnf(c_0_98,negated_conjecture,
( X1 = tptp2
| occurrence_of(esk8_1(esk1_0),tptp1)
| ~ occurrence_of(esk8_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_94]) ).
cnf(c_0_99,plain,
tptp3 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_95]) ).
fof(c_0_100,plain,
tptp3 != tptp1,
inference(fof_nnf,[status(thm)],[c_0_96]) ).
cnf(c_0_101,negated_conjecture,
( X1 = tptp3
| ~ occurrence_of(esk8_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_97]) ).
cnf(c_0_102,negated_conjecture,
occurrence_of(esk8_1(esk1_0),tptp1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_97]),c_0_99]) ).
cnf(c_0_103,plain,
tptp3 != tptp1,
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_104,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO018+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 06:25:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/tmp/tmp.2V4k5snqgr/E---3.1_29065.p
% 39.69/5.47 # Version: 3.2.0
% 39.69/5.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.69/5.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.69/5.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.69/5.47 # Starting new_bool_3 with 300s (1) cores
% 39.69/5.47 # Starting new_bool_1 with 300s (1) cores
% 39.69/5.47 # Starting sh5l with 300s (1) cores
% 39.69/5.47 # new_bool_3 with pid 29144 completed with status 0
% 39.69/5.47 # Result found by new_bool_3
% 39.69/5.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.69/5.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.69/5.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.69/5.47 # Starting new_bool_3 with 300s (1) cores
% 39.69/5.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 39.69/5.47 # Search class: FGHSF-FFMM32-SFFFFFNN
% 39.69/5.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 39.69/5.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 39.69/5.47 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 29149 completed with status 0
% 39.69/5.47 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 39.69/5.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.69/5.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.69/5.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.69/5.47 # Starting new_bool_3 with 300s (1) cores
% 39.69/5.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 39.69/5.47 # Search class: FGHSF-FFMM32-SFFFFFNN
% 39.69/5.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 39.69/5.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 39.69/5.47 # Preprocessing time : 0.005 s
% 39.69/5.47 # Presaturation interreduction done
% 39.69/5.47
% 39.69/5.47 # Proof found!
% 39.69/5.47 # SZS status Theorem
% 39.69/5.47 # SZS output start CNFRefutation
% See solution above
% 39.69/5.47 # Parsed axioms : 49
% 39.69/5.47 # Removed by relevancy pruning/SinE : 1
% 39.69/5.47 # Initial clauses : 103
% 39.69/5.47 # Removed in clause preprocessing : 6
% 39.69/5.47 # Initial clauses in saturation : 97
% 39.69/5.47 # Processed clauses : 15984
% 39.69/5.47 # ...of these trivial : 309
% 39.69/5.47 # ...subsumed : 5206
% 39.69/5.47 # ...remaining for further processing : 10469
% 39.69/5.47 # Other redundant clauses eliminated : 0
% 39.69/5.47 # Clauses deleted for lack of memory : 0
% 39.69/5.47 # Backward-subsumed : 290
% 39.69/5.47 # Backward-rewritten : 808
% 39.69/5.47 # Generated clauses : 99581
% 39.69/5.47 # ...of the previous two non-redundant : 86143
% 39.69/5.47 # ...aggressively subsumed : 0
% 39.69/5.47 # Contextual simplify-reflections : 79
% 39.69/5.47 # Paramodulations : 99577
% 39.69/5.47 # Factorizations : 4
% 39.69/5.47 # NegExts : 0
% 39.69/5.47 # Equation resolutions : 0
% 39.69/5.47 # Disequality decompositions : 0
% 39.69/5.47 # Total rewrite steps : 22733
% 39.69/5.47 # ...of those cached : 21594
% 39.69/5.47 # Propositional unsat checks : 0
% 39.69/5.47 # Propositional check models : 0
% 39.69/5.47 # Propositional check unsatisfiable : 0
% 39.69/5.47 # Propositional clauses : 0
% 39.69/5.47 # Propositional clauses after purity: 0
% 39.69/5.47 # Propositional unsat core size : 0
% 39.69/5.47 # Propositional preprocessing time : 0.000
% 39.69/5.47 # Propositional encoding time : 0.000
% 39.69/5.47 # Propositional solver time : 0.000
% 39.69/5.47 # Success case prop preproc time : 0.000
% 39.69/5.47 # Success case prop encoding time : 0.000
% 39.69/5.47 # Success case prop solver time : 0.000
% 39.69/5.47 # Current number of processed clauses : 9274
% 39.69/5.47 # Positive orientable unit clauses : 2006
% 39.69/5.47 # Positive unorientable unit clauses: 0
% 39.69/5.47 # Negative unit clauses : 292
% 39.69/5.47 # Non-unit-clauses : 6976
% 39.69/5.47 # Current number of unprocessed clauses: 67488
% 39.69/5.47 # ...number of literals in the above : 239040
% 39.69/5.47 # Current number of archived formulas : 0
% 39.69/5.47 # Current number of archived clauses : 1195
% 39.69/5.47 # Clause-clause subsumption calls (NU) : 5336123
% 39.69/5.47 # Rec. Clause-clause subsumption calls : 2664872
% 39.69/5.47 # Non-unit clause-clause subsumptions : 3960
% 39.69/5.47 # Unit Clause-clause subsumption calls : 504116
% 39.69/5.47 # Rewrite failures with RHS unbound : 0
% 39.69/5.47 # BW rewrite match attempts : 13882
% 39.69/5.47 # BW rewrite match successes : 240
% 39.69/5.47 # Condensation attempts : 0
% 39.69/5.47 # Condensation successes : 0
% 39.69/5.47 # Termbank termtop insertions : 3373097
% 39.69/5.47 # Search garbage collected termcells : 1493
% 39.69/5.47
% 39.69/5.47 # -------------------------------------------------
% 39.69/5.47 # User time : 4.845 s
% 39.69/5.47 # System time : 0.079 s
% 39.69/5.47 # Total time : 4.924 s
% 39.69/5.47 # Maximum resident set size: 2092 pages
% 39.69/5.47
% 39.69/5.47 # -------------------------------------------------
% 39.69/5.47 # User time : 4.847 s
% 39.69/5.47 # System time : 0.081 s
% 39.69/5.47 # Total time : 4.928 s
% 39.69/5.47 # Maximum resident set size: 1812 pages
% 39.69/5.47 % E---3.1 exiting
% 39.69/5.47 % E exiting
%------------------------------------------------------------------------------