TSTP Solution File: PRO009+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PRO009+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:12 EDT 2024
% Result : Theorem 0.22s 0.58s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 14 unt; 0 def)
% Number of atoms : 185 ( 7 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 226 ( 90 ~; 84 |; 42 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 87 ( 1 sgn 46 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( occurrence_of(X167,tptp3)
& root_occ(X167,X166)
& ( occurrence_of(X168,tptp2)
| occurrence_of(X168,tptp1) )
& min_precedes(X167,X168,tptp0)
& leaf_occ(X168,X166) ) ),
file('/export/starexec/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',goals) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164,X165] :
( occurrence_of(X163,tptp3)
& root_occ(X163,X162)
& occurrence_of(X164,tptp4)
& next_subocc(X163,X164,tptp0)
& ( occurrence_of(X165,tptp2)
| occurrence_of(X165,tptp1) )
& next_subocc(X164,X165,tptp0)
& leaf_occ(X165,X162) ) ),
file('/export/starexec/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',sos_49) ).
fof(sos_43,axiom,
! [X139,X140,X141,X142] :
( ( occurrence_of(X140,X139)
& subactivity_occurrence(X141,X140)
& leaf_occ(X142,X140)
& arboreal(X141)
& ~ min_precedes(X141,X142,X139) )
=> X142 = X141 ),
file('/export/starexec/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',sos_43) ).
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/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',sos_22) ).
fof(sos_33,axiom,
! [X100,X101] :
( root_occ(X100,X101)
<=> ? [X102] :
( occurrence_of(X101,X102)
& subactivity_occurrence(X100,X101)
& root(X100,X102) ) ),
file('/export/starexec/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',sos_33) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',sos_07) ).
fof(sos_37,axiom,
! [X114,X115,X116] :
( ( occurrence_of(X114,X116)
& leaf_occ(X115,X114) )
=> ~ ? [X117] : min_precedes(X115,X117,X116) ),
file('/export/starexec/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',sos_37) ).
fof(sos_55,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p',sos_55) ).
fof(c_0_8,negated_conjecture,
~ ! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( occurrence_of(X167,tptp3)
& root_occ(X167,X166)
& ( occurrence_of(X168,tptp2)
| occurrence_of(X168,tptp1) )
& min_precedes(X167,X168,tptp0)
& leaf_occ(X168,X166) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,plain,
! [X206] :
( ( occurrence_of(esk3_1(X206),tptp3)
| ~ occurrence_of(X206,tptp0) )
& ( root_occ(esk3_1(X206),X206)
| ~ occurrence_of(X206,tptp0) )
& ( occurrence_of(esk4_1(X206),tptp4)
| ~ occurrence_of(X206,tptp0) )
& ( next_subocc(esk3_1(X206),esk4_1(X206),tptp0)
| ~ occurrence_of(X206,tptp0) )
& ( occurrence_of(esk5_1(X206),tptp2)
| occurrence_of(esk5_1(X206),tptp1)
| ~ occurrence_of(X206,tptp0) )
& ( next_subocc(esk4_1(X206),esk5_1(X206),tptp0)
| ~ occurrence_of(X206,tptp0) )
& ( leaf_occ(esk5_1(X206),X206)
| ~ occurrence_of(X206,tptp0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_49])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X170,X171] :
( occurrence_of(esk1_0,tptp0)
& ( ~ occurrence_of(X171,tptp2)
| ~ occurrence_of(X170,tptp3)
| ~ root_occ(X170,esk1_0)
| ~ min_precedes(X170,X171,tptp0)
| ~ leaf_occ(X171,esk1_0) )
& ( ~ occurrence_of(X171,tptp1)
| ~ occurrence_of(X170,tptp3)
| ~ root_occ(X170,esk1_0)
| ~ min_precedes(X170,X171,tptp0)
| ~ leaf_occ(X171,esk1_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_8])])])])])]) ).
fof(c_0_11,plain,
! [X139,X140,X141,X142] :
( ( occurrence_of(X140,X139)
& subactivity_occurrence(X141,X140)
& leaf_occ(X142,X140)
& arboreal(X141)
& ~ min_precedes(X141,X142,X139) )
=> X142 = X141 ),
inference(fof_simplification,[status(thm)],[sos_43]) ).
cnf(c_0_12,plain,
( leaf_occ(esk5_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X256,X257,X258,X259,X260,X261,X262] :
( ( min_precedes(X256,X257,X258)
| ~ next_subocc(X256,X257,X258) )
& ( ~ min_precedes(X256,X259,X258)
| ~ min_precedes(X259,X257,X258)
| ~ next_subocc(X256,X257,X258) )
& ( min_precedes(X260,esk9_3(X260,X261,X262),X262)
| ~ min_precedes(X260,X261,X262)
| next_subocc(X260,X261,X262) )
& ( min_precedes(esk9_3(X260,X261,X262),X261,X262)
| ~ min_precedes(X260,X261,X262)
| next_subocc(X260,X261,X262) ) ),
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_15,plain,
( next_subocc(esk3_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X184,X185,X186,X187] :
( ~ occurrence_of(X185,X184)
| ~ subactivity_occurrence(X186,X185)
| ~ leaf_occ(X187,X185)
| ~ arboreal(X186)
| min_precedes(X186,X187,X184)
| X187 = X186 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_17,plain,
! [X213,X214,X216,X217,X218] :
( ( occurrence_of(X214,esk6_2(X213,X214))
| ~ root_occ(X213,X214) )
& ( subactivity_occurrence(X213,X214)
| ~ root_occ(X213,X214) )
& ( root(X213,esk6_2(X213,X214))
| ~ root_occ(X213,X214) )
& ( ~ occurrence_of(X217,X218)
| ~ subactivity_occurrence(X216,X217)
| ~ root(X216,X218)
| root_occ(X216,X217) ) ),
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_33])])])])])])]) ).
cnf(c_0_18,plain,
( root_occ(esk3_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X240,X241] :
( ( ~ arboreal(X240)
| atomic(X241)
| ~ occurrence_of(X240,X241) )
& ( ~ atomic(X241)
| arboreal(X240)
| ~ occurrence_of(X240,X241) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_20,plain,
( occurrence_of(esk3_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X2,tptp3)
| ~ root_occ(X2,esk1_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf_occ(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
leaf_occ(esk5_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_23,plain,
( occurrence_of(esk5_1(X1),tptp2)
| occurrence_of(esk5_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X2,tptp3)
| ~ root_occ(X2,esk1_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf_occ(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,plain,
! [X176,X177,X178,X179] :
( ~ occurrence_of(X176,X178)
| ~ leaf_occ(X177,X176)
| ~ min_precedes(X177,X179,X178) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])])]) ).
cnf(c_0_26,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
next_subocc(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_28,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_16]) ).
cnf(c_0_29,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
root_occ(esk3_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_31,plain,
( arboreal(X2)
| ~ atomic(X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_32,negated_conjecture,
occurrence_of(esk3_1(esk1_0),tptp3),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_33,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_55]) ).
cnf(c_0_34,negated_conjecture,
( ~ root_occ(X1,esk1_0)
| ~ min_precedes(X1,esk5_1(esk1_0),tptp0)
| ~ occurrence_of(esk5_1(esk1_0),tptp1)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_35,negated_conjecture,
( occurrence_of(esk5_1(esk1_0),tptp1)
| occurrence_of(esk5_1(esk1_0),tptp2) ),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_36,negated_conjecture,
( ~ root_occ(X1,esk1_0)
| ~ min_precedes(X1,esk5_1(esk1_0),tptp0)
| ~ occurrence_of(esk5_1(esk1_0),tptp2)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_37,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,negated_conjecture,
min_precedes(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_39,negated_conjecture,
( X1 = esk5_1(esk1_0)
| min_precedes(X1,esk5_1(esk1_0),X2)
| ~ subactivity_occurrence(X1,esk1_0)
| ~ arboreal(X1)
| ~ occurrence_of(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_40,negated_conjecture,
subactivity_occurrence(esk3_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
arboreal(esk3_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_42,negated_conjecture,
( ~ root_occ(X1,esk1_0)
| ~ min_precedes(X1,esk5_1(esk1_0),tptp0)
| ~ occurrence_of(X1,tptp3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( ~ leaf_occ(esk3_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( esk3_1(esk1_0) = esk5_1(esk1_0)
| min_precedes(esk3_1(esk1_0),esk5_1(esk1_0),X1)
| ~ occurrence_of(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
~ min_precedes(esk3_1(esk1_0),esk5_1(esk1_0),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_30]),c_0_32])]) ).
cnf(c_0_46,negated_conjecture,
~ leaf_occ(esk3_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_43,c_0_13]) ).
cnf(c_0_47,negated_conjecture,
esk3_1(esk1_0) = esk5_1(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_13]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : PRO009+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 15:47:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.j8OaPe4twa/E---3.1_5867.p
% 0.22/0.58 # Version: 3.1.0
% 0.22/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 # Starting sh5l with 300s (1) cores
% 0.22/0.58 # new_bool_3 with pid 5970 completed with status 0
% 0.22/0.58 # Result found by new_bool_3
% 0.22/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.58 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.22/0.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.22/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 5975 completed with status 0
% 0.22/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.22/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.58 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.22/0.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.22/0.58 # Preprocessing time : 0.003 s
% 0.22/0.58 # Presaturation interreduction done
% 0.22/0.58
% 0.22/0.58 # Proof found!
% 0.22/0.58 # SZS status Theorem
% 0.22/0.58 # SZS output start CNFRefutation
% See solution above
% 0.22/0.58 # Parsed axioms : 63
% 0.22/0.58 # Removed by relevancy pruning/SinE : 9
% 0.22/0.58 # Initial clauses : 88
% 0.22/0.58 # Removed in clause preprocessing : 0
% 0.22/0.58 # Initial clauses in saturation : 88
% 0.22/0.58 # Processed clauses : 377
% 0.22/0.58 # ...of these trivial : 8
% 0.22/0.58 # ...subsumed : 18
% 0.22/0.58 # ...remaining for further processing : 351
% 0.22/0.58 # Other redundant clauses eliminated : 0
% 0.22/0.58 # Clauses deleted for lack of memory : 0
% 0.22/0.58 # Backward-subsumed : 2
% 0.22/0.58 # Backward-rewritten : 62
% 0.22/0.58 # Generated clauses : 470
% 0.22/0.58 # ...of the previous two non-redundant : 372
% 0.22/0.58 # ...aggressively subsumed : 0
% 0.22/0.58 # Contextual simplify-reflections : 2
% 0.22/0.58 # Paramodulations : 470
% 0.22/0.58 # Factorizations : 0
% 0.22/0.58 # NegExts : 0
% 0.22/0.58 # Equation resolutions : 0
% 0.22/0.58 # Disequality decompositions : 0
% 0.22/0.58 # Total rewrite steps : 176
% 0.22/0.58 # ...of those cached : 130
% 0.22/0.58 # Propositional unsat checks : 0
% 0.22/0.58 # Propositional check models : 0
% 0.22/0.58 # Propositional check unsatisfiable : 0
% 0.22/0.58 # Propositional clauses : 0
% 0.22/0.58 # Propositional clauses after purity: 0
% 0.22/0.58 # Propositional unsat core size : 0
% 0.22/0.58 # Propositional preprocessing time : 0.000
% 0.22/0.58 # Propositional encoding time : 0.000
% 0.22/0.58 # Propositional solver time : 0.000
% 0.22/0.58 # Success case prop preproc time : 0.000
% 0.22/0.58 # Success case prop encoding time : 0.000
% 0.22/0.58 # Success case prop solver time : 0.000
% 0.22/0.58 # Current number of processed clauses : 199
% 0.22/0.58 # Positive orientable unit clauses : 55
% 0.22/0.58 # Positive unorientable unit clauses: 0
% 0.22/0.58 # Negative unit clauses : 30
% 0.22/0.58 # Non-unit-clauses : 114
% 0.22/0.58 # Current number of unprocessed clauses: 125
% 0.22/0.58 # ...number of literals in the above : 247
% 0.22/0.58 # Current number of archived formulas : 0
% 0.22/0.58 # Current number of archived clauses : 152
% 0.22/0.58 # Clause-clause subsumption calls (NU) : 6429
% 0.22/0.58 # Rec. Clause-clause subsumption calls : 2883
% 0.22/0.58 # Non-unit clause-clause subsumptions : 11
% 0.22/0.58 # Unit Clause-clause subsumption calls : 1192
% 0.22/0.58 # Rewrite failures with RHS unbound : 0
% 0.22/0.58 # BW rewrite match attempts : 12
% 0.22/0.58 # BW rewrite match successes : 10
% 0.22/0.58 # Condensation attempts : 0
% 0.22/0.58 # Condensation successes : 0
% 0.22/0.58 # Termbank termtop insertions : 13722
% 0.22/0.58 # Search garbage collected termcells : 1657
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.048 s
% 0.22/0.58 # System time : 0.004 s
% 0.22/0.58 # Total time : 0.053 s
% 0.22/0.58 # Maximum resident set size: 2132 pages
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.052 s
% 0.22/0.58 # System time : 0.008 s
% 0.22/0.58 # Total time : 0.060 s
% 0.22/0.58 # Maximum resident set size: 1884 pages
% 0.22/0.58 % E---3.1 exiting
% 0.22/0.58 % E exiting
%------------------------------------------------------------------------------