%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC065+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:42:50 PM UTC 2026
% Result : Theorem 0.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 13 unt; 0 def)
% Number of atoms : 231 ( 84 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 290 ( 109 ~; 104 |; 45 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 43 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X9] :
( segmentP(X1,X9)
& segmentP(X2,X9)
& neq(X9,nil)
& ssList(X9) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X9] :
( segmentP(X1,X9)
& segmentP(X2,X9)
& neq(X9,nil)
& ssList(X9) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| 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)
=> ( ( ( ? [X9] :
( segmentP(X1,X9)
& segmentP(X2,X9)
& neq(X9,nil)
& ssList(X9) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,negated_conjecture,
! [X15,X16,X17,X18] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X18)
| ~ segmentP(esk2_0,X18)
| ~ neq(X18,nil)
| ~ ssList(X18) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X18)
| ~ segmentP(esk2_0,X18)
| ~ neq(X18,nil)
| ~ ssList(X18) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( nil != esk3_0
| nil = esk4_0 )
& ( app(X17,cons(X15,nil)) != esk3_0
| ~ ssList(X17)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& equalelemsP(esk3_0)
& app(esk3_0,esk5_0) = esk4_0
& ssList(esk5_0)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
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)],[c_0_9])])])])])]) ).
fof(c_0_11,plain,
! [X63,X64] :
( ( ~ ssList(X63)
| ~ ssList(X64)
| nil = app(X63,X64)
| nil != X63
| nil != X64 )
& ( ~ ssList(X63)
| ~ ssList(X64)
| nil != app(X63,X64)
| nil = X63 )
& ( ~ ssList(X63)
| ~ ssList(X64)
| nil != app(X63,X64)
| nil = X64 ) ),
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_12,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
app(esk1_0,esk5_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X65] :
( app(X65,nil) = X65
| ~ ssList(X65) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_20,negated_conjecture,
( esk2_0 != nil
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( esk2_0 != nil
| app(esk1_0,nil) = esk2_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_27,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| ~ segmentP(esk1_0,esk2_0)
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
( esk2_0 != nil
| esk1_0 = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]) ).
fof(c_0_29,plain,
! [X30] :
( segmentP(X30,X30)
| ~ ssList(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
fof(c_0_30,plain,
! [X31,X32,X33,X34] :
( segmentP(app(app(X33,X31),X34),X32)
| ~ segmentP(X31,X32)
| ~ ssList(X34)
| ~ ssList(X33)
| ~ ssList(X32)
| ~ ssList(X31) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_31,plain,
! [X51] :
( app(nil,X51) = X51
| ~ ssList(X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_32,plain,
! [X39,X40] :
( ( ~ ssList(X39)
| ~ ssList(X40)
| neq(X39,X40)
| X39 = X40 )
& ( ~ ssList(X39)
| ~ ssList(X40)
| X39 != X40
| ~ neq(X39,X40) ) ),
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_26])])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_38,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| X1 = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37])]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk1_0,X1)
| segmentP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_16]),c_0_18]),c_0_17])]) ).
cnf(c_0_44,negated_conjecture,
( nil != esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_17])]) ).
cnf(c_0_46,negated_conjecture,
segmentP(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_17])]) ).
cnf(c_0_47,negated_conjecture,
( esk1_0 != nil
| esk2_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_14]),c_0_13]) ).
cnf(c_0_48,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC065+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n008.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 07:53:08 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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/benchmark/theBenchmark.p
% 0.23/0.58 % Version: 3.5.1
% 0.23/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % Starting sh5l with 300s (1) cores
% 0.23/0.58 % new_bool_1 with pid 523071 completed with status 0
% 0.23/0.58 % Result found by new_bool_1
% 0.23/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % SubtermCWHack with pid 523074 completed with status 0
% 0.23/0.58 % Result found by SubtermCWHack
% 0.23/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % Preprocessing time : 0.003 s
% 0.23/0.58
% 0.23/0.58 % Proof found!
% 0.23/0.58 % SZS status Theorem
% 0.23/0.58 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 96
% 0.23/0.58 % Removed by relevancy pruning/SinE : 67
% 0.23/0.58 % Initial clauses : 62
% 0.23/0.58 % Removed in clause preprocessing : 0
% 0.23/0.58 % Initial clauses in saturation : 62
% 0.23/0.58 % Processed clauses : 263
% 0.23/0.58 % ...of these trivial : 14
% 0.23/0.58 % ...subsumed : 93
% 0.23/0.58 % ...remaining for further processing : 156
% 0.23/0.58 % Other redundant clauses eliminated : 20
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 23
% 0.23/0.58 % Backward-rewritten : 29
% 0.23/0.58 % Generated clauses : 683
% 0.23/0.58 % ...of the previous two non-redundant : 557
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 2
% 0.23/0.58 % Paramodulations : 659
% 0.23/0.58 % Factorizations : 0
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 24
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 655
% 0.23/0.58 % ...of those cached : 638
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 97
% 0.23/0.58 % Positive orientable unit clauses : 15
% 0.23/0.58 % Positive unorientable unit clauses: 0
% 0.23/0.58 % Negative unit clauses : 4
% 0.23/0.58 % Non-unit-clauses : 78
% 0.23/0.58 % Current number of unprocessed clauses: 301
% 0.23/0.58 % ...number of literals in the above : 1610
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 53
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 1626
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 804
% 0.23/0.58 % Non-unit clause-clause subsumptions : 89
% 0.23/0.58 % Unit Clause-clause subsumption calls : 66
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 5
% 0.23/0.58 % BW rewrite match successes : 5
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 16320
% 0.23/0.58 % Search garbage collected termcells : 1815
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.032 s
% 0.23/0.58 % System time : 0.006 s
% 0.23/0.58 % Total time : 0.038 s
% 0.23/0.58 % Maximum resident set size: 3764 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.037 s
% 0.23/0.58 % System time : 0.008 s
% 0.23/0.58 % Total time : 0.045 s
% 0.23/0.58 % Maximum resident set size: 4864 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------