TSTP Solution File: NLP143+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP143+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:42:29 EDT 2023
% Result : Timeout 0.32s 300.14s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 16 unt; 0 def)
% Number of atoms : 203 ( 15 equ)
% Maximal formula atoms : 31 ( 3 avg)
% Number of connectives : 200 ( 53 ~; 49 |; 81 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 35 ( 33 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 107 ( 2 sgn; 62 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6] :
( of(X1,X2,X3)
& city(X1,X3)
& hollywood_placename(X1,X2)
& placename(X1,X2)
& chevy(X1,X3)
& white(X1,X3)
& dirty(X1,X3)
& old(X1,X3)
& street(X1,X4)
& lonely(X1,X4)
& event(X1,X5)
& agent(X1,X5,X3)
& present(X1,X5)
& barrel(X1,X5)
& down(X1,X5,X4)
& in(X1,X5,X3)
& ! [X7] :
( member(X1,X7,X6)
=> ? [X8,X9] :
( frontseat(X1,X9)
& state(X1,X8)
& be(X1,X8,X7,X9)
& in(X1,X9,X9) ) )
& two(X1,X6)
& group(X1,X6)
& ! [X10] :
( member(X1,X10,X6)
=> ( fellow(X1,X10)
& young(X1,X10) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',co1) ).
fof(ax60,axiom,
! [X1,X2] :
( two(X1,X2)
<=> ? [X3] :
( member(X1,X3,X2)
& ? [X4] :
( member(X1,X4,X2)
& X4 != X3
& ! [X5] :
( member(X1,X5,X2)
=> ( X5 = X4
| X5 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax60) ).
fof(ax3,axiom,
! [X1,X2] :
( frontseat(X1,X2)
=> seat(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax3) ).
fof(ax59,axiom,
! [X1,X2,X3,X4] :
( be(X1,X2,X3,X4)
=> X3 = X4 ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax59) ).
fof(ax2,axiom,
! [X1,X2] :
( seat(X1,X2)
=> furniture(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax2) ).
fof(ax1,axiom,
! [X1,X2] :
( furniture(X1,X2)
=> instrumentality(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax1) ).
fof(ax49,axiom,
! [X1,X2] :
( fellow(X1,X2)
=> man(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax49) ).
fof(ax21,axiom,
! [X1,X2] :
( instrumentality(X1,X2)
=> artifact(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax21) ).
fof(ax56,axiom,
! [X1,X2] :
( unisex(X1,X2)
=> ~ male(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax56) ).
fof(ax37,axiom,
! [X1,X2] :
( man(X1,X2)
=> male(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax37) ).
fof(ax20,axiom,
! [X1,X2] :
( artifact(X1,X2)
=> object(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax20) ).
fof(ax16,axiom,
! [X1,X2] :
( object(X1,X2)
=> unisex(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Dm6xidpYf2/E---3.1_23888.p',ax16) ).
fof(c_0_12,negated_conjecture,
~ ~ ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6] :
( of(X1,X2,X3)
& city(X1,X3)
& hollywood_placename(X1,X2)
& placename(X1,X2)
& chevy(X1,X3)
& white(X1,X3)
& dirty(X1,X3)
& old(X1,X3)
& street(X1,X4)
& lonely(X1,X4)
& event(X1,X5)
& agent(X1,X5,X3)
& present(X1,X5)
& barrel(X1,X5)
& down(X1,X5,X4)
& in(X1,X5,X3)
& ! [X7] :
( member(X1,X7,X6)
=> ? [X8,X9] :
( frontseat(X1,X9)
& state(X1,X8)
& be(X1,X8,X7,X9)
& in(X1,X9,X9) ) )
& two(X1,X6)
& group(X1,X6)
& ! [X10] :
( member(X1,X10,X6)
=> ( fellow(X1,X10)
& young(X1,X10) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_13,plain,
! [X25,X26,X29,X30,X31,X32,X33] :
( ( member(X25,esk9_2(X25,X26),X26)
| ~ two(X25,X26) )
& ( member(X25,esk10_2(X25,X26),X26)
| ~ two(X25,X26) )
& ( esk10_2(X25,X26) != esk9_2(X25,X26)
| ~ two(X25,X26) )
& ( ~ member(X25,X29,X26)
| X29 = esk10_2(X25,X26)
| X29 = esk9_2(X25,X26)
| ~ two(X25,X26) )
& ( member(X30,esk11_4(X30,X31,X32,X33),X31)
| ~ member(X30,X33,X31)
| X33 = X32
| ~ member(X30,X32,X31)
| two(X30,X31) )
& ( esk11_4(X30,X31,X32,X33) != X33
| ~ member(X30,X33,X31)
| X33 = X32
| ~ member(X30,X32,X31)
| two(X30,X31) )
& ( esk11_4(X30,X31,X32,X33) != X32
| ~ member(X30,X33,X31)
| X33 = X32
| ~ member(X30,X32,X31)
| two(X30,X31) ) ),
inference(distribute,[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)],[ax60])])])])])]) ).
fof(c_0_14,negated_conjecture,
! [X17,X20] :
( actual_world(esk1_0)
& of(esk1_0,esk2_0,esk3_0)
& city(esk1_0,esk3_0)
& hollywood_placename(esk1_0,esk2_0)
& placename(esk1_0,esk2_0)
& chevy(esk1_0,esk3_0)
& white(esk1_0,esk3_0)
& dirty(esk1_0,esk3_0)
& old(esk1_0,esk3_0)
& street(esk1_0,esk4_0)
& lonely(esk1_0,esk4_0)
& event(esk1_0,esk5_0)
& agent(esk1_0,esk5_0,esk3_0)
& present(esk1_0,esk5_0)
& barrel(esk1_0,esk5_0)
& down(esk1_0,esk5_0,esk4_0)
& in(esk1_0,esk5_0,esk3_0)
& ( frontseat(esk1_0,esk8_1(X17))
| ~ member(esk1_0,X17,esk6_0) )
& ( state(esk1_0,esk7_1(X17))
| ~ member(esk1_0,X17,esk6_0) )
& ( be(esk1_0,esk7_1(X17),X17,esk8_1(X17))
| ~ member(esk1_0,X17,esk6_0) )
& ( in(esk1_0,esk8_1(X17),esk8_1(X17))
| ~ member(esk1_0,X17,esk6_0) )
& two(esk1_0,esk6_0)
& group(esk1_0,esk6_0)
& ( fellow(esk1_0,X20)
| ~ member(esk1_0,X20,esk6_0) )
& ( young(esk1_0,X20)
| ~ member(esk1_0,X20,esk6_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
cnf(c_0_15,plain,
( member(X1,esk9_2(X1,X2),X2)
| ~ two(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
two(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X49,X50] :
( ~ frontseat(X49,X50)
| seat(X49,X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])]) ).
cnf(c_0_18,negated_conjecture,
( frontseat(esk1_0,esk8_1(X1))
| ~ member(esk1_0,X1,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
member(esk1_0,esk9_2(esk1_0,esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X41,X42,X43,X44] :
( ~ be(X41,X42,X43,X44)
| X43 = X44 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])]) ).
cnf(c_0_21,negated_conjecture,
( be(esk1_0,esk7_1(X1),X1,esk8_1(X1))
| ~ member(esk1_0,X1,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
frontseat(esk1_0,esk8_1(esk9_2(esk1_0,esk6_0))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
be(esk1_0,esk7_1(esk9_2(esk1_0,esk6_0)),esk9_2(esk1_0,esk6_0),esk8_1(esk9_2(esk1_0,esk6_0))),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
fof(c_0_26,plain,
! [X77,X78] :
( ~ seat(X77,X78)
| furniture(X77,X78) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])]) ).
cnf(c_0_27,negated_conjecture,
seat(esk1_0,esk8_1(esk9_2(esk1_0,esk6_0))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
esk8_1(esk9_2(esk1_0,esk6_0)) = esk9_2(esk1_0,esk6_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
! [X103,X104] :
( ~ furniture(X103,X104)
| instrumentality(X103,X104) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])]) ).
cnf(c_0_30,plain,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
seat(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X23,X24] :
( ~ fellow(X23,X24)
| man(X23,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])]) ).
cnf(c_0_33,negated_conjecture,
( fellow(esk1_0,X1)
| ~ member(esk1_0,X1,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_34,plain,
! [X107,X108] :
( ~ instrumentality(X107,X108)
| artifact(X107,X108) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])]) ).
cnf(c_0_35,plain,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
furniture(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_37,plain,
! [X1,X2] :
( unisex(X1,X2)
=> ~ male(X1,X2) ),
inference(fof_simplification,[status(thm)],[ax56]) ).
fof(c_0_38,plain,
! [X67,X68] :
( ~ man(X67,X68)
| male(X67,X68) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])]) ).
cnf(c_0_39,plain,
( man(X1,X2)
| ~ fellow(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
fellow(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
fof(c_0_41,plain,
! [X105,X106] :
( ~ artifact(X105,X106)
| object(X105,X106) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])]) ).
cnf(c_0_42,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,negated_conjecture,
instrumentality(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_44,plain,
! [X91,X92] :
( ~ unisex(X91,X92)
| ~ male(X91,X92) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])]) ).
cnf(c_0_45,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
man(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_47,plain,
! [X99,X100] :
( ~ object(X99,X100)
| unisex(X99,X100) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])]) ).
cnf(c_0_48,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,negated_conjecture,
artifact(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
male(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
object(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
~ unisex(esk1_0,esk9_2(esk1_0,esk6_0)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : NLP143+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 11:23:59 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.Dm6xidpYf2/E---3.1_23888.p
% 0.32/300.14 # Version: 3.1pre001
% 0.32/300.14 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/300.14 # Starting new_bool_3 with 300s (1) cores
% 0.32/300.14 # Starting new_bool_1 with 300s (1) cores
% 0.32/300.14 # Starting sh5l with 300s (1) cores
% 0.32/300.14 # new_bool_3 with pid 23981 completed with status 0
% 0.32/300.14 # Result found by new_bool_3
% 0.32/300.14 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/300.14 # Starting new_bool_3 with 300s (1) cores
% 0.32/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/300.14 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.32/300.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.32/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.32/300.14 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 23984 completed with status 0
% 0.32/300.14 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.32/300.14 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/300.14 # Starting new_bool_3 with 300s (1) cores
% 0.32/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/300.14 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.32/300.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.32/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.32/300.14 # Preprocessing time : 0.003 s
% 0.32/300.14 # Presaturation interreduction done
% 0.32/300.14
% 0.32/300.14 # Proof found!
% 0.32/300.14 # SZS status Theorem
% 0.32/300.14 # SZS output start CNFRefutation
% See solution above
% 0.32/300.14 # Parsed axioms : 62
% 0.32/300.14 # Removed by relevancy pruning/SinE : 22
% 0.32/300.14 # Initial clauses : 70
% 0.32/300.14 # Removed in clause preprocessing : 0
% 0.32/300.14 # Initial clauses in saturation : 70
% 0.32/300.14 # Processed clauses : 200
% 0.32/300.14 # ...of these trivial : 0
% 0.32/300.14 # ...subsumed : 0
% 0.32/300.14 # ...remaining for further processing : 200
% 0.32/300.14 # Other redundant clauses eliminated : 0
% 0.32/300.14 # Clauses deleted for lack of memory : 0
% 0.32/300.14 # Backward-subsumed : 0
% 0.32/300.14 # Backward-rewritten : 4
% 0.32/300.14 # Generated clauses : 76
% 0.32/300.14 # ...of the previous two non-redundant : 72
% 0.32/300.14 # ...aggressively subsumed : 0
% 0.32/300.14 # Contextual simplify-reflections : 0
% 0.32/300.14 # Paramodulations : 76
% 0.32/300.14 # Factorizations : 0
% 0.32/300.14 # NegExts : 0
% 0.32/300.14 # Equation resolutions : 0
% 0.32/300.14 # Total rewrite steps : 13
% 0.32/300.14 # Propositional unsat checks : 0
% 0.32/300.14 # Propositional check models : 0
% 0.32/300.14 # Propositional check unsatisfiable : 0
% 0.32/300.14 # Propositional clauses : 0
% 0.32/300.14 # Propositional clauses after purity: 0
% 0.32/300.14 # Propositional unsat core size : 0
% 0.32/300.14 # Propositional preprocessing time : 0.000
% 0.32/300.14 # Propositional encoding time : 0.000
% 0.32/300.14 # Propositional solver time : 0.000
% 0.32/300.14 # Success case prop preproc time : 0.000
% 0.32/300.14 # Success case prop encoding time : 0.000
% 0.32/300.14 # Success case prop solver time : 0.000
% 0.32/300.14 # Current number of processed clauses : 126
% 0.32/300.14 # Positive orientable unit clauses : 71
% 0.32/300.14 # Positive unorientable unit clauses: 0
% 0.32/300.14 # Negative unit clauses : 4
% 0.32/300.15 # Non-unit-clauses : 51
% 0.32/300.15 # Current number of unprocessed clauses: 12
% 0.32/300.15 # ...number of literals in the above : 12
% 0.32/300.15 # Current number of archived formulas : 0
% 0.32/300.15 # Current number of archived clauses : 74
% 0.32/300.15 # Clause-clause subsumption calls (NU) : 1663
% 0.32/300.15 # Rec. Clause-clause subsumption calls : 1009
% 0.32/300.15 # Non-unit clause-clause subsumptions : 0
% 0.32/300.15 # Unit Clause-clause subsumption calls : 12
% 0.32/300.15 # Rewrite failures with RHS unbound : 0
% 0.32/300.15 # BW rewrite match attempts : 1
% 0.32/300.15 # BW rewrite match successes : 1
% 0.32/300.15 # Condensation attempts : 0
% 0.32/300.15 # Condensation successes : 0
% 0.32/300.15 # Termbank termtop insertions : 4415
% 0.32/300.15
% 0.32/300.15 # -------------------------------------------------
% 0.32/300.15 # User time : 0.010 s
% 0.32/300.15 # System time : 0.004 s
% 0.32/300.15 # Total time : 0.014 s
% 0.32/300.15 # Maximum resident set size: 1940 pages
% 0.32/300.15
% 0.32/300.15 # -------------------------------------------------
% 0.32/300.15 # User time : 0.011 s
% 0.32/300.15 # System time : 0.006 s
% 0.32/300.15 # Total time : 0.017 s
% 0.32/300.15 # Maximum resident set size: 1744 pages
% 0.32/300.15 % E---3.1 exiting
% 0.32/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------