%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC149+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:43:13 PM UTC 2026
% Result : Theorem 0.22s 0.60s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 9 unt; 0 def)
% Number of atoms : 202 ( 57 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 253 ( 101 ~; 99 |; 25 &)
% ( 3 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 40 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( singletonP(X2)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(cons(X5,nil),cons(X6,nil)),X7) = X4
& ssList(X7) )
& ssItem(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( singletonP(X2)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(cons(X5,nil),cons(X6,nil)),X7) = X4
& ssList(X7) )
& ssItem(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| 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)
=> ( singletonP(X2)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(cons(X5,nil),cons(X6,nil)),X7) = X4
& ssList(X7) )
& ssItem(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,negated_conjecture,
! [X256,X257,X258] :
( ~ singletonP(esk49_0)
& ( app(app(cons(X256,nil),cons(X257,nil)),X258) != esk51_0
| ~ ssList(X258)
| ~ ssItem(X257)
| ~ ssItem(X256) )
& 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(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])])])])]) ).
cnf(c_0_11,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != esk51_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X221,X222] :
( cons(X222,X221) = app(cons(X222,nil),X221)
| ~ ssItem(X222)
| ~ ssList(X221) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != esk49_0 ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X112,X113] :
( ssList(cons(X113,X112))
| ~ ssItem(X113)
| ~ ssList(X112) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_17,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(cons(X2,nil))
| app(cons(X1,cons(X2,nil)),X3) != esk49_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_20,plain,
! [X133,X134,X135] :
( cons(X135,app(X134,X133)) = app(cons(X135,X134),X133)
| ~ ssItem(X135)
| ~ ssList(X134)
| ~ ssList(X133) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(cons(X1,cons(X2,nil)),X3) != esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(cons(X2,nil))
| cons(X1,app(cons(X2,nil),X3)) != esk49_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| cons(X1,app(cons(X2,nil),X3)) != esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_19])]) ).
fof(c_0_25,plain,
! [X120] :
( ( ~ ssList(X120)
| nil = X120
| cons(esk45_1(X120),esk44_1(X120)) = X120 )
& ( ~ ssList(X120)
| nil = X120
| ssItem(esk45_1(X120)) )
& ( ~ ssList(X120)
| nil = X120
| ssList(esk44_1(X120)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| cons(X1,cons(X2,X3)) != esk49_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk45_1(X1),esk44_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk45_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk44_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk49_0
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_32,plain,
! [X18,X20] :
( ( ~ ssList(X18)
| singletonP(X18)
| cons(X20,nil) != X18
| ~ ssItem(X20) )
& ( ~ ssList(X18)
| ~ singletonP(X18)
| cons(esk5_1(X18),nil) = X18 )
& ( ~ ssList(X18)
| ~ singletonP(X18)
| ssItem(esk5_1(X18)) ) ),
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)],[ax4])])])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(esk45_1(esk49_0))
| ~ ssList(esk44_1(esk49_0))
| esk49_0 = nil
| esk44_1(esk49_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27])]),c_0_31])]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| singletonP(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssItem(esk45_1(esk49_0))
| esk49_0 = nil
| esk44_1(esk49_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_31])]) ).
cnf(c_0_36,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( esk49_0 = nil
| esk44_1(esk49_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_31])]) ).
fof(c_0_38,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_18]),c_0_19])]) ).
cnf(c_0_40,negated_conjecture,
( esk49_0 = nil
| cons(esk45_1(esk49_0),nil) = esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_37]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
~ singletonP(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_42,plain,
! [X110,X111] :
( ( ~ ssList(X110)
| ~ ssList(X111)
| neq(X110,X111)
| X110 = X111 )
& ( ~ ssList(X110)
| ~ ssList(X111)
| X110 != X111
| ~ neq(X110,X111) ) ),
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_38])])])])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssItem(esk45_1(esk49_0))
| esk49_0 = nil ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_46,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_31])]) ).
cnf(c_0_47,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC149+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:59:39 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.22/0.60 % Version: 3.5.1
% 0.22/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.60 % Starting sh5l with 300s (1) cores
% 0.22/0.60 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 534892 completed with status 0
% 0.22/0.60 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.60 % No SInE strategy applied
% 0.22/0.60 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.60 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.60 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.22/0.60 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.22/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.22/0.60 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 534897 completed with status 0
% 0.22/0.60 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.60 % No SInE strategy applied
% 0.22/0.60 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.60 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.60 % Preprocessing time : 0.003 s
% 0.22/0.60 % Presaturation interreduction done
% 0.22/0.60
% 0.22/0.60 % Proof found!
% 0.22/0.60 % SZS status Theorem
% 0.22/0.60 % SZS output start CNFRefutation
% See solution above
% 0.22/0.60 % Parsed axioms : 96
% 0.22/0.60 % Removed by relevancy pruning/SinE : 0
% 0.22/0.60 % Initial clauses : 199
% 0.22/0.60 % Removed in clause preprocessing : 2
% 0.22/0.60 % Initial clauses in saturation : 197
% 0.22/0.60 % Processed clauses : 548
% 0.22/0.60 % ...of these trivial : 2
% 0.22/0.60 % ...subsumed : 75
% 0.22/0.60 % ...remaining for further processing : 471
% 0.22/0.60 % Other redundant clauses eliminated : 79
% 0.22/0.60 % Clauses deleted for lack of memory : 0
% 0.22/0.60 % Backward-subsumed : 8
% 0.22/0.60 % Backward-rewritten : 35
% 0.22/0.60 % Generated clauses : 946
% 0.22/0.60 % ...of the previous two non-redundant : 813
% 0.22/0.60 % ...aggressively subsumed : 0
% 0.22/0.60 % Contextual simplify-reflections : 21
% 0.22/0.60 % Paramodulations : 864
% 0.22/0.60 % Factorizations : 0
% 0.22/0.60 % NegExts : 0
% 0.22/0.60 % Equation resolutions : 84
% 0.22/0.60 % Disequality decompositions : 0
% 0.22/0.60 % Total rewrite steps : 502
% 0.22/0.60 % ...of those cached : 476
% 0.22/0.60 % Propositional unsat checks : 0
% 0.22/0.60 % Propositional check models : 0
% 0.22/0.60 % Propositional check unsatisfiable : 0
% 0.22/0.60 % Propositional clauses : 0
% 0.22/0.60 % Propositional clauses after purity: 0
% 0.22/0.60 % Propositional unsat core size : 0
% 0.22/0.60 % Propositional preprocessing time : 0.000
% 0.22/0.60 % Propositional encoding time : 0.000
% 0.22/0.60 % Propositional solver time : 0.000
% 0.22/0.60 % Success case prop preproc time : 0.000
% 0.22/0.60 % Success case prop encoding time : 0.000
% 0.22/0.60 % Success case prop solver time : 0.000
% 0.22/0.60 % Current number of processed clauses : 214
% 0.22/0.60 % Positive orientable unit clauses : 23
% 0.22/0.60 % Positive unorientable unit clauses: 0
% 0.22/0.60 % Negative unit clauses : 2
% 0.22/0.60 % Non-unit-clauses : 189
% 0.22/0.60 % Current number of unprocessed clauses: 616
% 0.22/0.60 % ...number of literals in the above : 4101
% 0.22/0.60 % Current number of archived formulas : 0
% 0.22/0.60 % Current number of archived clauses : 234
% 0.22/0.60 % Clause-clause subsumption calls (NU) : 20532
% 0.22/0.60 % Rec. Clause-clause subsumption calls : 4577
% 0.22/0.60 % Non-unit clause-clause subsumptions : 77
% 0.22/0.60 % Unit Clause-clause subsumption calls : 79
% 0.22/0.60 % Rewrite failures with RHS unbound : 0
% 0.22/0.60 % BW rewrite match attempts : 6
% 0.22/0.60 % BW rewrite match successes : 6
% 0.22/0.60 % Condensation attempts : 0
% 0.22/0.60 % Condensation successes : 0
% 0.22/0.60 % Termbank termtop insertions : 39028
% 0.22/0.60 % Search garbage collected termcells : 4257
% 0.22/0.60
% 0.22/0.60 % -------------------------------------------------
% 0.22/0.60 % User time : 0.098 s
% 0.22/0.60 % System time : 0.010 s
% 0.22/0.60 % Total time : 0.108 s
% 0.22/0.60 % Maximum resident set size: 4272 pages
% 0.22/0.60
% 0.22/0.60 % -------------------------------------------------
% 0.22/0.60 % User time : 0.349 s
% 0.22/0.60 % System time : 0.027 s
% 0.22/0.60 % Total time : 0.376 s
% 0.22/0.60 % Maximum resident set size: 4864 pages
% 0.22/0.60 % E exiting
%------------------------------------------------------------------------------