%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC366+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 : n011.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:44:06 PM UTC 2026
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 210 ( 52 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 269 ( 104 ~; 97 |; 39 &)
% ( 3 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 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 : 65 ( 0 sgn 37 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( rearsegP(X2,X1)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& hd(X4) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X6,X3) = X5
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| 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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( rearsegP(X2,X1)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& hd(X4) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X6,X3) = X5
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( rearsegP(X2,X1)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& hd(X4) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X6,X3) = X5
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,negated_conjecture,
! [X256,X257,X258] :
( ( ~ rearsegP(esk49_0,esk48_0)
| ~ neq(esk51_0,nil) )
& ( ~ rearsegP(esk49_0,esk48_0)
| neq(esk49_0,nil) )
& ( ~ neq(nil,esk51_0)
| hd(esk51_0) != X258
| cons(X258,nil) != X257
| ~ ssItem(X258)
| app(X257,esk50_0) != X256
| ~ ssList(X257)
| esk51_0 = X256
| ~ ssList(X256)
| ~ neq(esk51_0,nil) )
& ( ~ neq(nil,esk51_0)
| hd(esk51_0) != X258
| cons(X258,nil) != X257
| ~ ssItem(X258)
| app(X257,esk50_0) != X256
| ~ ssList(X257)
| esk51_0 = X256
| ~ ssList(X256)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ neq(esk51_0,nil) )
& ( neq(esk49_0,nil)
| 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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X25,X26,X28] :
( ( ~ ssList(X25)
| ~ ssList(X26)
| rearsegP(X25,X26)
| app(X28,X26) != X25
| ~ ssList(X28) )
& ( ~ ssList(X25)
| ~ ssList(X26)
| ~ rearsegP(X25,X26)
| app(esk7_2(X25,X26),X26) = X25 )
& ( ~ ssList(X25)
| ~ ssList(X26)
| ~ rearsegP(X25,X26)
| ssList(esk7_2(X25,X26)) ) ),
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])])])])])]) ).
fof(c_0_14,plain,
! [X131,X132] :
( ssList(app(X131,X132))
| ~ ssList(X132)
| ~ ssList(X131) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ neq(nil,esk51_0)
| hd(esk51_0) != X3
| cons(X3,nil) != X2
| ~ ssItem(X3)
| app(X2,esk50_0) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(esk51_0,nil)
| esk51_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| rearsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(app(cons(hd(esk51_0),nil),esk48_0))
| app(cons(hd(esk51_0),nil),esk48_0) = esk51_0 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])])])])]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( ~ rearsegP(esk49_0,esk48_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(cons(hd(esk51_0),nil))
| app(cons(hd(esk51_0),nil),esk48_0) = esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
~ rearsegP(esk51_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_17]),c_0_12])]) ).
fof(c_0_26,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])])])]) ).
fof(c_0_27,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_31,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_27])])])])]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_33,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_32,c_0_12]) ).
fof(c_0_37,plain,
! [X125] :
( ssItem(hd(X125))
| nil = X125
| ~ ssList(X125) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_30])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36])]) ).
cnf(c_0_42,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_43,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_17,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC366+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.11/0.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 08:19:11 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.50 % Version: 3.5.1
% 0.18/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 % Starting sh5l with 300s (1) cores
% 0.18/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1441248 completed with status 0
% 0.18/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.50 % No SInE strategy applied
% 0.18/0.50 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.50 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.18/0.50 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.18/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.18/0.50 % G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 1441265 completed with status 0
% 0.18/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.18/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.50 % No SInE strategy applied
% 0.18/0.50 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.50 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.18/0.50 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.18/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.18/0.50 % Preprocessing time : 0.004 s
% 0.18/0.50 % Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 % Proof found!
% 0.18/0.50 % SZS status Theorem
% 0.18/0.50 % SZS output start CNFRefutation
% See solution above
% 0.18/0.50 % Parsed axioms : 96
% 0.18/0.50 % Removed by relevancy pruning/SinE : 0
% 0.18/0.50 % Initial clauses : 202
% 0.18/0.50 % Removed in clause preprocessing : 2
% 0.18/0.50 % Initial clauses in saturation : 200
% 0.18/0.50 % Processed clauses : 377
% 0.18/0.50 % ...of these trivial : 5
% 0.18/0.50 % ...subsumed : 11
% 0.18/0.50 % ...remaining for further processing : 361
% 0.18/0.50 % Other redundant clauses eliminated : 30
% 0.18/0.50 % Clauses deleted for lack of memory : 0
% 0.18/0.50 % Backward-subsumed : 8
% 0.18/0.50 % Backward-rewritten : 6
% 0.18/0.50 % Generated clauses : 103
% 0.18/0.50 % ...of the previous two non-redundant : 77
% 0.18/0.50 % ...aggressively subsumed : 0
% 0.18/0.50 % Contextual simplify-reflections : 3
% 0.18/0.50 % Paramodulations : 77
% 0.18/0.50 % Factorizations : 0
% 0.18/0.50 % NegExts : 0
% 0.18/0.50 % Equation resolutions : 30
% 0.18/0.50 % Disequality decompositions : 0
% 0.18/0.50 % Total rewrite steps : 81
% 0.18/0.50 % ...of those cached : 66
% 0.18/0.50 % Propositional unsat checks : 0
% 0.18/0.50 % Propositional check models : 0
% 0.18/0.50 % Propositional check unsatisfiable : 0
% 0.18/0.50 % Propositional clauses : 0
% 0.18/0.50 % Propositional clauses after purity: 0
% 0.18/0.50 % Propositional unsat core size : 0
% 0.18/0.50 % Propositional preprocessing time : 0.000
% 0.18/0.50 % Propositional encoding time : 0.000
% 0.18/0.50 % Propositional solver time : 0.000
% 0.18/0.50 % Success case prop preproc time : 0.000
% 0.18/0.50 % Success case prop encoding time : 0.000
% 0.18/0.50 % Success case prop solver time : 0.000
% 0.18/0.50 % Current number of processed clauses : 132
% 0.18/0.50 % Positive orientable unit clauses : 19
% 0.18/0.50 % Positive unorientable unit clauses: 0
% 0.18/0.50 % Negative unit clauses : 3
% 0.18/0.50 % Non-unit-clauses : 110
% 0.18/0.50 % Current number of unprocessed clauses: 88
% 0.18/0.50 % ...number of literals in the above : 426
% 0.18/0.50 % Current number of archived formulas : 0
% 0.18/0.50 % Current number of archived clauses : 205
% 0.18/0.50 % Clause-clause subsumption calls (NU) : 13187
% 0.18/0.50 % Rec. Clause-clause subsumption calls : 3659
% 0.18/0.50 % Non-unit clause-clause subsumptions : 20
% 0.18/0.50 % Unit Clause-clause subsumption calls : 56
% 0.18/0.50 % Rewrite failures with RHS unbound : 0
% 0.18/0.50 % BW rewrite match attempts : 1
% 0.18/0.50 % BW rewrite match successes : 1
% 0.18/0.50 % Condensation attempts : 0
% 0.18/0.50 % Condensation successes : 0
% 0.18/0.50 % Termbank termtop insertions : 21231
% 0.18/0.50 % Search garbage collected termcells : 4339
% 0.18/0.50
% 0.18/0.50 % -------------------------------------------------
% 0.18/0.50 % User time : 0.044 s
% 0.18/0.50 % System time : 0.003 s
% 0.18/0.50 % Total time : 0.047 s
% 0.18/0.50 % Maximum resident set size: 4220 pages
% 0.18/0.50
% 0.18/0.50 % -------------------------------------------------
% 0.18/0.50 % User time : 0.205 s
% 0.18/0.50 % System time : 0.028 s
% 0.18/0.50 % Total time : 0.233 s
% 0.18/0.50 % Maximum resident set size: 4608 pages
% 0.18/0.50 % E exiting
%------------------------------------------------------------------------------