TSTP Solution File: NLP149+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP149+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:31 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% 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)
& street(X1,X3)
& lonely(X1,X3)
& chevy(X1,X4)
& white(X1,X4)
& dirty(X1,X4)
& old(X1,X4)
& event(X1,X5)
& agent(X1,X5,X4)
& present(X1,X5)
& barrel(X1,X5)
& down(X1,X5,X3)
& 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/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.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/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax60) ).
fof(ax59,axiom,
! [X1,X2,X3,X4] :
( be(X1,X2,X3,X4)
=> X3 = X4 ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax59) ).
fof(ax3,axiom,
! [X1,X2] :
( frontseat(X1,X2)
=> seat(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax3) ).
fof(ax2,axiom,
! [X1,X2] :
( seat(X1,X2)
=> furniture(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax2) ).
fof(ax1,axiom,
! [X1,X2] :
( furniture(X1,X2)
=> instrumentality(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax1) ).
fof(ax49,axiom,
! [X1,X2] :
( fellow(X1,X2)
=> man(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax49) ).
fof(ax21,axiom,
! [X1,X2] :
( instrumentality(X1,X2)
=> artifact(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax21) ).
fof(ax56,axiom,
! [X1,X2] :
( unisex(X1,X2)
=> ~ male(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax56) ).
fof(ax37,axiom,
! [X1,X2] :
( man(X1,X2)
=> male(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax37) ).
fof(ax20,axiom,
! [X1,X2] :
( artifact(X1,X2)
=> object(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.p',ax20) ).
fof(ax16,axiom,
! [X1,X2] :
( object(X1,X2)
=> unisex(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TVynJga7iz/E---3.1_21755.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)
& street(X1,X3)
& lonely(X1,X3)
& chevy(X1,X4)
& white(X1,X4)
& dirty(X1,X4)
& old(X1,X4)
& event(X1,X5)
& agent(X1,X5,X4)
& present(X1,X5)
& barrel(X1,X5)
& down(X1,X5,X3)
& 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,
! [X133,X134,X137,X138,X139,X140,X141] :
( ( member(X133,esk1_2(X133,X134),X134)
| ~ two(X133,X134) )
& ( member(X133,esk2_2(X133,X134),X134)
| ~ two(X133,X134) )
& ( esk2_2(X133,X134) != esk1_2(X133,X134)
| ~ two(X133,X134) )
& ( ~ member(X133,X137,X134)
| X137 = esk2_2(X133,X134)
| X137 = esk1_2(X133,X134)
| ~ two(X133,X134) )
& ( member(X138,esk3_4(X138,X139,X140,X141),X139)
| ~ member(X138,X141,X139)
| X141 = X140
| ~ member(X138,X140,X139)
| two(X138,X139) )
& ( esk3_4(X138,X139,X140,X141) != X141
| ~ member(X138,X141,X139)
| X141 = X140
| ~ member(X138,X140,X139)
| two(X138,X139) )
& ( esk3_4(X138,X139,X140,X141) != X140
| ~ member(X138,X141,X139)
| X141 = X140
| ~ member(X138,X140,X139)
| two(X138,X139) ) ),
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,
! [X151,X154] :
( actual_world(esk4_0)
& of(esk4_0,esk5_0,esk6_0)
& city(esk4_0,esk6_0)
& hollywood_placename(esk4_0,esk5_0)
& placename(esk4_0,esk5_0)
& street(esk4_0,esk6_0)
& lonely(esk4_0,esk6_0)
& chevy(esk4_0,esk7_0)
& white(esk4_0,esk7_0)
& dirty(esk4_0,esk7_0)
& old(esk4_0,esk7_0)
& event(esk4_0,esk8_0)
& agent(esk4_0,esk8_0,esk7_0)
& present(esk4_0,esk8_0)
& barrel(esk4_0,esk8_0)
& down(esk4_0,esk8_0,esk6_0)
& in(esk4_0,esk8_0,esk6_0)
& ( frontseat(esk4_0,esk11_1(X151))
| ~ member(esk4_0,X151,esk9_0) )
& ( state(esk4_0,esk10_1(X151))
| ~ member(esk4_0,X151,esk9_0) )
& ( be(esk4_0,esk10_1(X151),X151,esk11_1(X151))
| ~ member(esk4_0,X151,esk9_0) )
& ( in(esk4_0,esk11_1(X151),esk11_1(X151))
| ~ member(esk4_0,X151,esk9_0) )
& two(esk4_0,esk9_0)
& group(esk4_0,esk9_0)
& ( fellow(esk4_0,X154)
| ~ member(esk4_0,X154,esk9_0) )
& ( young(esk4_0,X154)
| ~ member(esk4_0,X154,esk9_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,esk1_2(X1,X2),X2)
| ~ two(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
two(esk4_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X129,X130,X131,X132] :
( ~ be(X129,X130,X131,X132)
| X131 = X132 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])]) ).
cnf(c_0_18,negated_conjecture,
( be(esk4_0,esk10_1(X1),X1,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
member(esk4_0,esk1_2(esk4_0,esk9_0),esk9_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( frontseat(esk4_0,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( X3 = X4
| ~ be(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
be(esk4_0,esk10_1(esk1_2(esk4_0,esk9_0)),esk1_2(esk4_0,esk9_0),esk11_1(esk1_2(esk4_0,esk9_0))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X15,X16] :
( ~ frontseat(X15,X16)
| seat(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])]) ).
cnf(c_0_24,negated_conjecture,
frontseat(esk4_0,esk11_1(esk1_2(esk4_0,esk9_0))),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
esk11_1(esk1_2(esk4_0,esk9_0)) = esk1_2(esk4_0,esk9_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,plain,
! [X13,X14] :
( ~ seat(X13,X14)
| furniture(X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])]) ).
cnf(c_0_27,plain,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
frontseat(esk4_0,esk1_2(esk4_0,esk9_0)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
! [X11,X12] :
( ~ furniture(X11,X12)
| instrumentality(X11,X12) ),
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(esk4_0,esk1_2(esk4_0,esk9_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X107,X108] :
( ~ fellow(X107,X108)
| man(X107,X108) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])]) ).
cnf(c_0_33,negated_conjecture,
( fellow(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_34,plain,
! [X51,X52] :
( ~ instrumentality(X51,X52)
| artifact(X51,X52) ),
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(esk4_0,esk1_2(esk4_0,esk9_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,
! [X83,X84] :
( ~ man(X83,X84)
| male(X83,X84) ),
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(esk4_0,esk1_2(esk4_0,esk9_0)),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
fof(c_0_41,plain,
! [X49,X50] :
( ~ artifact(X49,X50)
| object(X49,X50) ),
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(esk4_0,esk1_2(esk4_0,esk9_0)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_44,plain,
! [X121,X122] :
( ~ unisex(X121,X122)
| ~ male(X121,X122) ),
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(esk4_0,esk1_2(esk4_0,esk9_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_47,plain,
! [X41,X42] :
( ~ object(X41,X42)
| unisex(X41,X42) ),
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(esk4_0,esk1_2(esk4_0,esk9_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(esk4_0,esk1_2(esk4_0,esk9_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(esk4_0,esk1_2(esk4_0,esk9_0)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
~ unisex(esk4_0,esk1_2(esk4_0,esk9_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.11/0.12 % Problem : NLP149+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n009.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 2400
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon Oct 2 11:13:30 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.TVynJga7iz/E---3.1_21755.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21862 completed with status 0
% 0.20/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.20/0.50 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 21870 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.20/0.50 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 62
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 92
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 92
% 0.20/0.50 # Processed clauses : 298
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 296
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 3
% 0.20/0.50 # Generated clauses : 129
% 0.20/0.50 # ...of the previous two non-redundant : 122
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 129
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 12
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 201
% 0.20/0.50 # Positive orientable unit clauses : 107
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 20
% 0.20/0.50 # Non-unit-clauses : 74
% 0.20/0.50 # Current number of unprocessed clauses: 8
% 0.20/0.50 # ...number of literals in the above : 8
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 95
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 3708
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 2572
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 83
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 5862
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1980 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.041 s
% 0.20/0.50 # System time : 0.012 s
% 0.20/0.50 # Total time : 0.053 s
% 0.20/0.50 # Maximum resident set size: 1744 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------