TSTP Solution File: SWC108+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC108+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Tue May 21 04:23:26 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 12 unt; 0 def)
% Number of atoms : 219 ( 59 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 266 ( 104 ~; 109 |; 29 &)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 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 : 61 ( 0 sgn 35 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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/benchmark/Axioms/SWC001+0.ax',ax7) ).
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)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax48,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( rearsegP(X1,X2)
& rearsegP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax48) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax51) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(c_0_10,plain,
! [X35,X36,X39,X40] :
( ( ssList(esk8_2(X35,X36))
| ~ segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) )
& ( ssList(esk9_2(X35,X36))
| ~ segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) )
& ( app(app(esk8_2(X35,X36),X36),esk9_2(X35,X36)) = X35
| ~ segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) )
& ( ~ ssList(X39)
| ~ ssList(X40)
| app(app(X39,X36),X40) != X35
| segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) ) ),
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)],[ax7])])])])])]) ).
fof(c_0_11,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)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
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,
! [X72] :
( ~ ssList(X72)
| app(X72,nil) = X72 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_14,plain,
! [X53,X54] :
( ~ ssList(X53)
| ~ ssList(X54)
| ssList(app(X53,X54)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_15,negated_conjecture,
( 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 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| 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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
cnf(c_0_16,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_17,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X11,X12,X14] :
( ( ssList(esk5_2(X11,X12))
| ~ rearsegP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( app(esk5_2(X11,X12),X12) = X11
| ~ rearsegP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( ~ ssList(X14)
| app(X14,X12) != X11
| rearsegP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) ) ),
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)],[ax6])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( neq(esk3_0,nil)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,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_16,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_25,plain,
( app(esk5_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ssList(esk5_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( rearsegP(esk4_0,esk3_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_28,plain,
! [X18,X19] :
( ~ ssList(X18)
| ~ ssList(X19)
| ~ rearsegP(X18,X19)
| ~ rearsegP(X19,X18)
| X18 = X19 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax48])])])]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk2_0
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,negated_conjecture,
( esk2_0 = nil
| neq(esk1_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_31,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( esk1_0 = nil
| rearsegP(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_23]),c_0_22]),c_0_23]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ~ rearsegP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk2_0,esk1_0) ),
inference(csr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( esk1_0 = nil
| segmentP(esk2_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
( esk1_0 = nil
| esk2_0 = esk1_0
| ~ rearsegP(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_34]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
( esk1_0 = nil
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_40,plain,
! [X24] :
( ~ ssList(X24)
| rearsegP(X24,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
cnf(c_0_41,negated_conjecture,
( esk1_0 = nil
| ~ rearsegP(esk1_0,nil) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_43,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_33])]) ).
fof(c_0_44,plain,
! [X51] :
( ~ ssList(X51)
| segmentP(X51,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_45,plain,
! [X52] :
( ( ~ segmentP(nil,X52)
| nil = X52
| ~ ssList(X52) )
& ( nil != X52
| segmentP(nil,X52)
| ~ ssList(X52) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_47,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_48,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_51,negated_conjecture,
( ~ segmentP(esk2_0,nil)
| ~ neq(nil,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_43]),c_0_43]),c_0_43])]) ).
cnf(c_0_52,negated_conjecture,
esk2_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_34])]) ).
cnf(c_0_53,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_18])]) ).
cnf(c_0_54,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_43])]) ).
cnf(c_0_55,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_52]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC108+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 03:43:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # new_bool_3 with pid 10536 completed with status 0
% 0.20/0.53 # Result found by new_bool_3
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10539 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.53 # Preprocessing time : 0.002 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 96
% 0.20/0.53 # Removed by relevancy pruning/SinE : 63
% 0.20/0.53 # Initial clauses : 62
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 62
% 0.20/0.53 # Processed clauses : 387
% 0.20/0.53 # ...of these trivial : 2
% 0.20/0.53 # ...subsumed : 86
% 0.20/0.53 # ...remaining for further processing : 298
% 0.20/0.53 # Other redundant clauses eliminated : 20
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 23
% 0.20/0.53 # Backward-rewritten : 117
% 0.20/0.53 # Generated clauses : 909
% 0.20/0.53 # ...of the previous two non-redundant : 882
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 37
% 0.20/0.53 # Paramodulations : 886
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 24
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 632
% 0.20/0.53 # ...of those cached : 620
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 91
% 0.20/0.53 # Positive orientable unit clauses : 13
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 2
% 0.20/0.53 # Non-unit-clauses : 76
% 0.20/0.53 # Current number of unprocessed clauses: 613
% 0.20/0.53 # ...number of literals in the above : 2838
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 200
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 5948
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 2040
% 0.20/0.53 # Non-unit clause-clause subsumptions : 145
% 0.20/0.53 # Unit Clause-clause subsumption calls : 179
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 4
% 0.20/0.53 # BW rewrite match successes : 4
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 20927
% 0.20/0.53 # Search garbage collected termcells : 1703
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.039 s
% 0.20/0.53 # System time : 0.004 s
% 0.20/0.53 # Total time : 0.043 s
% 0.20/0.53 # Maximum resident set size: 2020 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.043 s
% 0.20/0.53 # System time : 0.006 s
% 0.20/0.53 # Total time : 0.049 s
% 0.20/0.53 # Maximum resident set size: 1820 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E exiting
%------------------------------------------------------------------------------