%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC108+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:43:02 PM UTC 2026
% Result : Theorem 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 10 unt; 0 def)
% Number of atoms : 225 ( 78 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 285 ( 109 ~; 113 |; 34 &)
% ( 5 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 58 ( 0 sgn 37 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ rearsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( app(X3,X2) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ rearsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ rearsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,negated_conjecture,
( ( nil = esk50_0
| rearsegP(esk51_0,esk50_0) )
& ( nil = esk50_0
| neq(esk50_0,nil) )
& ( nil = esk51_0
| rearsegP(esk51_0,esk50_0) )
& ( nil = esk51_0
| neq(esk50_0,nil) )
& ( nil != esk48_0
| ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil) )
& ( nil != esk48_0
| neq(esk49_0,nil) )
& ( nil = esk49_0
| ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil) )
& ( nil = esk49_0
| neq(esk49_0,nil) )
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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_9])])])])]) ).
fof(c_0_11,plain,
! [X24,X25,X27] :
( ( ~ ssList(X24)
| ~ ssList(X25)
| rearsegP(X24,X25)
| app(X27,X25) != X24
| ~ ssList(X27) )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| app(esk7_2(X24,X25),X25) = X24 )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| ssList(esk7_2(X24,X25)) ) ),
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_12,negated_conjecture,
( nil = esk50_0
| rearsegP(esk51_0,esk50_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X28,X29,X32,X33] :
( ( ~ ssList(X28)
| ~ ssList(X29)
| segmentP(X28,X29)
| app(app(X32,X29),X33) != X28
| ~ ssList(X33)
| ~ ssList(X32) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28 )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk9_2(X28,X29)) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk8_2(X28,X29)) ) ),
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])])])])])]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(esk7_2(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( rearsegP(esk49_0,esk48_0)
| esk48_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_13]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssList(esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( esk48_0 = nil
| app(esk7_2(esk49_0,esk48_0),esk48_0) = esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[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_23,negated_conjecture,
( ssList(esk7_2(esk49_0,esk48_0))
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]),c_0_19])]) ).
fof(c_0_24,plain,
! [X227] :
( app(X227,nil) = X227
| ~ ssList(X227) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(esk49_0,X2) != X1
| segmentP(X1,esk48_0)
| esk48_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18])]),c_0_23]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_29,plain,
! [X225,X226] :
( ( ~ ssList(X225)
| ~ ssList(X226)
| nil = app(X225,X226)
| nil != X225
| nil != X226 )
& ( ~ ssList(X225)
| ~ ssList(X226)
| nil != app(X225,X226)
| nil = X225 )
& ( ~ ssList(X225)
| ~ ssList(X226)
| nil != app(X225,X226)
| nil = X226 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil)
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( neq(esk48_0,nil)
| esk49_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_14]),c_0_13]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| esk49_0 != X1
| segmentP(X1,esk48_0)
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_19])]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
| esk49_0 = nil ),
inference(csr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( segmentP(esk49_0,esk48_0)
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_19])]) ).
cnf(c_0_36,negated_conjecture,
( esk49_0 != nil
| esk48_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_18])]),c_0_23]) ).
fof(c_0_37,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_38,negated_conjecture,
esk48_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
fof(c_0_39,plain,
! [X194] :
( segmentP(X194,nil)
| ~ ssList(X194) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_40,plain,
! [X109,X110] :
( ( ~ ssList(X109)
| ~ ssList(X110)
| neq(X109,X110)
| X109 = X110 )
& ( ~ ssList(X109)
| ~ ssList(X110)
| X109 != X110
| ~ neq(X109,X110) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])]) ).
cnf(c_0_41,negated_conjecture,
( ~ segmentP(esk49_0,nil)
| esk49_0 = nil ),
inference(rw,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( nil != esk48_0
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_19])]) ).
cnf(c_0_46,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_38])]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC108+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 07:54:05 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.43 Running first-order theorem proving
% 0.09/0.43 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.18/0.51 % Version: 3.5.1
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 % Starting sh5l with 300s (1) cores
% 0.18/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 583464 completed with status 0
% 0.18/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.51 % No SInE strategy applied
% 0.18/0.51 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.51 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.51 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.18/0.51 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.18/0.51 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 583473 completed with status 0
% 0.18/0.51 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.18/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.51 % No SInE strategy applied
% 0.18/0.51 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.51 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.51 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.18/0.51 % Preprocessing time : 0.004 s
% 0.18/0.51
% 0.18/0.51 % Proof found!
% 0.18/0.51 % SZS status Theorem
% 0.18/0.51 % SZS output start CNFRefutation
% See solution above
% 0.18/0.51 % Parsed axioms : 96
% 0.18/0.51 % Removed by relevancy pruning/SinE : 0
% 0.18/0.51 % Initial clauses : 204
% 0.18/0.51 % Removed in clause preprocessing : 2
% 0.18/0.51 % Initial clauses in saturation : 202
% 0.18/0.51 % Processed clauses : 417
% 0.18/0.51 % ...of these trivial : 2
% 0.18/0.51 % ...subsumed : 99
% 0.18/0.51 % ...remaining for further processing : 316
% 0.18/0.51 % Other redundant clauses eliminated : 63
% 0.18/0.51 % Clauses deleted for lack of memory : 0
% 0.18/0.51 % Backward-subsumed : 3
% 0.18/0.51 % Backward-rewritten : 84
% 0.18/0.51 % Generated clauses : 932
% 0.18/0.51 % ...of the previous two non-redundant : 802
% 0.18/0.51 % ...aggressively subsumed : 0
% 0.18/0.51 % Contextual simplify-reflections : 50
% 0.18/0.51 % Paramodulations : 838
% 0.18/0.51 % Factorizations : 0
% 0.18/0.51 % NegExts : 0
% 0.18/0.51 % Equation resolutions : 94
% 0.18/0.51 % Disequality decompositions : 0
% 0.18/0.51 % Total rewrite steps : 598
% 0.18/0.51 % ...of those cached : 583
% 0.18/0.51 % Propositional unsat checks : 0
% 0.18/0.51 % Propositional check models : 0
% 0.18/0.51 % Propositional check unsatisfiable : 0
% 0.18/0.51 % Propositional clauses : 0
% 0.18/0.51 % Propositional clauses after purity: 0
% 0.18/0.51 % Propositional unsat core size : 0
% 0.18/0.51 % Propositional preprocessing time : 0.000
% 0.18/0.51 % Propositional encoding time : 0.000
% 0.18/0.51 % Propositional solver time : 0.000
% 0.18/0.51 % Success case prop preproc time : 0.000
% 0.18/0.51 % Success case prop encoding time : 0.000
% 0.18/0.51 % Success case prop solver time : 0.000
% 0.18/0.51 % Current number of processed clauses : 223
% 0.18/0.51 % Positive orientable unit clauses : 23
% 0.18/0.51 % Positive unorientable unit clauses: 0
% 0.18/0.51 % Negative unit clauses : 2
% 0.18/0.51 % Non-unit-clauses : 198
% 0.18/0.51 % Current number of unprocessed clauses: 570
% 0.18/0.51 % ...number of literals in the above : 3793
% 0.18/0.51 % Current number of archived formulas : 0
% 0.18/0.51 % Current number of archived clauses : 87
% 0.18/0.51 % Clause-clause subsumption calls (NU) : 11804
% 0.18/0.51 % Rec. Clause-clause subsumption calls : 3314
% 0.18/0.51 % Non-unit clause-clause subsumptions : 151
% 0.18/0.51 % Unit Clause-clause subsumption calls : 144
% 0.18/0.51 % Rewrite failures with RHS unbound : 0
% 0.18/0.51 % BW rewrite match attempts : 4
% 0.18/0.51 % BW rewrite match successes : 4
% 0.18/0.51 % Condensation attempts : 0
% 0.18/0.51 % Condensation successes : 0
% 0.18/0.51 % Termbank termtop insertions : 35507
% 0.18/0.51 % Search garbage collected termcells : 4276
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.054 s
% 0.18/0.51 % System time : 0.008 s
% 0.18/0.51 % Total time : 0.062 s
% 0.18/0.51 % Maximum resident set size: 4012 pages
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.230 s
% 0.18/0.51 % System time : 0.023 s
% 0.18/0.51 % Total time : 0.253 s
% 0.18/0.51 % Maximum resident set size: 4608 pages
% 0.18/0.51 % E exiting
%------------------------------------------------------------------------------