TSTP Solution File: SWC058+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC058+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 19:41:16 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 57 ( 11 unt; 0 def)
% Number of atoms : 231 ( 60 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 292 ( 118 ~; 123 |; 32 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn; 32 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax17) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax6) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax55) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax57) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p',ax58) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,plain,
! [X36,X37,X40,X41] :
( ( ssList(esk8_2(X36,X37))
| ~ segmentP(X36,X37)
| ~ ssList(X37)
| ~ ssList(X36) )
& ( ssList(esk9_2(X36,X37))
| ~ segmentP(X36,X37)
| ~ ssList(X37)
| ~ ssList(X36) )
& ( app(app(esk8_2(X36,X37),X37),esk9_2(X36,X37)) = X36
| ~ segmentP(X36,X37)
| ~ ssList(X37)
| ~ ssList(X36) )
& ( ~ ssList(X40)
| ~ ssList(X41)
| app(app(X40,X37),X41) != X36
| segmentP(X36,X37)
| ~ ssList(X37)
| ~ ssList(X36) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
fof(c_0_11,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11)
| nil != esk1_0 )
& ( neq(esk3_0,nil)
| nil = esk4_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk4_0 )
& ( neq(esk3_0,nil)
| nil = esk3_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk3_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_9])])])])]) ).
cnf(c_0_12,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X73] :
( ~ ssList(X73)
| app(X73,nil) = X73 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_14,plain,
! [X54,X55] :
( ~ ssList(X54)
| ~ ssList(X55)
| ssList(app(X54,X55)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( neq(esk3_0,nil)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X12,X13,X15] :
( ( ssList(esk5_2(X12,X13))
| ~ rearsegP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( app(esk5_2(X12,X13),X13) = X12
| ~ rearsegP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ~ ssList(X15)
| app(X15,X13) != X12
| rearsegP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])])]) ).
cnf(c_0_25,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( esk2_0 = nil
| neq(esk3_0,nil) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
fof(c_0_28,plain,
! [X47] :
( ~ ssList(X47)
| segmentP(X47,X47) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_29,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_30,plain,
( app(esk5_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( ssList(esk5_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( rearsegP(esk4_0,esk3_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk3_0,esk3_0)
| ~ segmentP(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_34,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( esk3_0 = nil
| rearsegP(esk2_0,esk3_0) ),
inference(rw,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27])]) ).
cnf(c_0_39,negated_conjecture,
( esk3_0 = nil
| segmentP(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
( esk3_0 = nil
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_41,plain,
! [X52] :
( ~ ssList(X52)
| segmentP(X52,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_42,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk2_0,nil) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_43,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_46,plain,
! [X53] :
( ( ~ segmentP(nil,X53)
| nil = X53
| ~ ssList(X53) )
& ( nil != X53
| segmentP(nil,X53)
| ~ ssList(X53) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_47,negated_conjecture,
esk2_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37])]) ).
cnf(c_0_48,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_16]),c_0_16]) ).
cnf(c_0_49,negated_conjecture,
( neq(esk2_0,nil)
| esk3_0 != nil ),
inference(rw,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_50,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( esk3_0 = nil
| segmentP(nil,esk3_0) ),
inference(rw,[status(thm)],[c_0_39,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_37])]) ).
cnf(c_0_54,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_50]),c_0_22])]) ).
cnf(c_0_55,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_27])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_47]),c_0_47]),c_0_47]),c_0_54])]),c_0_55]),c_0_55]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC058+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n013.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:57:29 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.sGNDwaSqpk/E---3.1_32624.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # new_bool_1 with pid 32722 completed with status 0
% 0.16/0.47 # Result found by new_bool_1
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32725 completed with status 0
% 0.16/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.002 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 96
% 0.16/0.47 # Removed by relevancy pruning/SinE : 63
% 0.16/0.47 # Initial clauses : 62
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 62
% 0.16/0.47 # Processed clauses : 372
% 0.16/0.47 # ...of these trivial : 2
% 0.16/0.47 # ...subsumed : 83
% 0.16/0.47 # ...remaining for further processing : 286
% 0.16/0.47 # Other redundant clauses eliminated : 20
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 23
% 0.16/0.47 # Backward-rewritten : 98
% 0.16/0.47 # Generated clauses : 834
% 0.16/0.47 # ...of the previous two non-redundant : 793
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 39
% 0.16/0.47 # Paramodulations : 811
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 24
% 0.16/0.47 # Total rewrite steps : 616
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 98
% 0.16/0.47 # Positive orientable unit clauses : 13
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 1
% 0.16/0.47 # Non-unit-clauses : 84
% 0.16/0.47 # Current number of unprocessed clauses: 541
% 0.16/0.47 # ...number of literals in the above : 2487
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 181
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 4810
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 1533
% 0.16/0.47 # Non-unit clause-clause subsumptions : 145
% 0.16/0.47 # Unit Clause-clause subsumption calls : 121
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 3
% 0.16/0.47 # BW rewrite match successes : 3
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 19086
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.031 s
% 0.16/0.47 # System time : 0.002 s
% 0.16/0.47 # Total time : 0.033 s
% 0.16/0.47 # Maximum resident set size: 2052 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.034 s
% 0.16/0.47 # System time : 0.003 s
% 0.16/0.47 # Total time : 0.037 s
% 0.16/0.47 # Maximum resident set size: 1796 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------