%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX223+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 03:14:19 PM UTC 2026
% Result : Theorem 3.49s 0.95s
% Output : CNFRefutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 18 unt; 0 def)
% Number of atoms : 147 ( 54 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 186 ( 94 ~; 71 |; 12 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 159 ( 13 sgn 68 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_036,conjecture,
? [X7] :
( tc(nil,X7,arr(arr(a,arr(a,b)),arr(a,b)))
& nf(X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_036) ).
fof(axiom_033,axiom,
! [X1,X7,X12,X13] :
( tc(X1,lam(X7),arr(X12,X13))
<=> tc(cons(X12,X1),X7,X13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_033) ).
fof(axiom_031,axiom,
! [X1,X6,X10,X2,X11] :
( tc(X1,app(X10,X2,X11),X6)
<=> ( tc(X1,X2,X11)
& tc(X1,X10,arr(X11,X6)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_031) ).
fof(axiom_035,axiom,
! [X1,X6,X3,X14] :
( index(X1,X3) = just(X14)
=> ( tc(X1,var(X3),X6)
<=> X14 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_035) ).
fof(axiom_026,axiom,
! [X7] :
( nf(lam(X7))
<=> nf(X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_026) ).
fof(axiom_024,axiom,
! [X5,X6,X2] :
( X5 != lam(proj1Lam(X5))
=> ( nf(app(X5,X6,X2))
<=> ( nf(X6)
& nf(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_024) ).
fof(axiom_029,axiom,
! [X6,X8] : index(cons(X6,X8),zero) = just(X6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029) ).
fof(axiom_027,axiom,
! [X4] : nf(var(X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027) ).
fof(axiom_021,axiom,
! [X1,X2,X3,X4] : app(X1,X2,X3) != lam(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_021) ).
fof(axiom_030,axiom,
! [X6,X8,X9] : index(cons(X6,X8),suc(X9)) = index(X8,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_030) ).
fof(axiom_023,axiom,
! [X1,X2] : lam(X1) != var(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_023) ).
fof(c_0_11,negated_conjecture,
~ ? [X7] :
( tc(nil,X7,arr(arr(a,arr(a,b)),arr(a,b)))
& nf(X7) ),
inference(assume_negation,[status(cth)],[goal_036]) ).
fof(c_0_12,negated_conjecture,
! [X89] :
( ~ tc(nil,X89,arr(arr(a,arr(a,b)),arr(a,b)))
| ~ nf(X89) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X78,X79,X80,X81] :
( ( tc(X78,lam(X79),arr(X80,X81))
| ~ tc(cons(X80,X78),X79,X81) )
& ( tc(cons(X80,X78),X79,X81)
| ~ tc(X78,lam(X79),arr(X80,X81)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_033])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ tc(nil,X1,arr(arr(a,arr(a,b)),arr(a,b)))
| ~ nf(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( ~ tc(cons(X1,X2),X3,X4)
| tc(X2,lam(X3),arr(X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ nf(lam(X1))
| ~ tc(cons(arr(a,arr(a,b)),nil),X1,arr(a,b)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_17,plain,
! [X70,X71,X72,X73,X74] :
( ( tc(X70,app(X72,X73,X74),X71)
| ~ tc(X70,X73,X74)
| ~ tc(X70,X72,arr(X74,X71)) )
& ( ~ tc(X70,app(X72,X73,X74),X71)
| tc(X70,X73,X74) )
& ( ~ tc(X70,app(X72,X73,X74),X71)
| tc(X70,X72,arr(X74,X71)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_031])])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ nf(lam(lam(X1)))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,b) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
( ~ tc(X1,X5,X3)
| ~ tc(X1,X2,arr(X3,X4))
| tc(X1,app(X2,X5,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X85,X86,X87,X88] :
( ( index(X85,X87) != just(X88)
| tc(X85,var(X87),X86)
| X88 != X86 )
& ( index(X85,X87) != just(X88)
| X88 = X86
| ~ tc(X85,var(X87),X86) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_035])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ nf(lam(lam(app(X1,X3,X2))))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X3,X2)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,arr(X2,b)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( index(X3,X4) != just(X1)
| X1 != X2
| tc(X3,var(X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ nf(lam(lam(app(app(X1,X5,X2),X4,X3))))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X3)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_24,plain,
( index(X1,X2) != just(X3)
| tc(X1,var(X2),X3) ),
inference(er,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X62] :
( ( nf(lam(X62))
| ~ nf(X62) )
& ( nf(X62)
| ~ nf(lam(X62)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_026])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ nf(lam(lam(app(app(var(X1),X5,X2),X4,X3))))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X3)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ nf(X1)
| nf(lam(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( ~ nf(lam(app(app(var(X1),X5,X2),X4,X3)))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X3)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_29,plain,
! [X5,X6,X2] :
( X5 != lam(proj1Lam(X5))
=> ( nf(app(X5,X6,X2))
<=> ( nf(X6)
& nf(X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_024]) ).
cnf(c_0_30,negated_conjecture,
( ~ nf(app(app(var(X1),X5,X2),X4,X3))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X3)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
fof(c_0_31,plain,
! [X65,X66] : index(cons(X65,X66),zero) = just(X65),
inference(variable_rename,[status(thm)],[axiom_029]) ).
fof(c_0_32,plain,
! [X56,X57,X58] :
( ( X56 = lam(proj1Lam(X56))
| nf(app(X56,X57,X58))
| ~ nf(X57)
| ~ nf(X56) )
& ( X56 = lam(proj1Lam(X56))
| ~ nf(app(X56,X57,X58))
| nf(X57) )
& ( X56 = lam(proj1Lam(X56))
| ~ nf(app(X56,X57,X58))
| nf(X56) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
fof(c_0_33,plain,
! [X63] : nf(var(X63)),
inference(variable_rename,[status(thm)],[axiom_027]) ).
fof(c_0_34,plain,
! [X1,X2,X3,X4] : app(X1,X2,X3) != lam(X4),
inference(fof_simplification,[status(thm)],[axiom_021]) ).
cnf(c_0_35,negated_conjecture,
( ~ nf(app(app(var(X1),X5,X2),var(X4),X3))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X5,X2)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X4) != just(X3)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,plain,
index(cons(X1,X2),zero) = just(X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( ~ nf(X2)
| ~ nf(X1)
| X1 = lam(proj1Lam(X1))
| nf(app(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
nf(var(X1)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_39,plain,
! [X46,X47,X48,X49] : app(X46,X47,X48) != lam(X49),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_34])]) ).
cnf(c_0_40,negated_conjecture,
( ~ nf(app(app(var(X1),X4,X2),var(zero),X3))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X2)
| just(a) != just(X3)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( ~ nf(X1)
| nf(app(X1,var(X2),X3))
| lam(proj1Lam(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
app(X1,X2,X3) != lam(X4),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( ~ nf(app(var(X1),X4,X2))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X2)
| just(a) != just(X3)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( ~ nf(app(var(X1),var(X4),X2))
| just(a) != just(X3)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X4) != just(X2)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
fof(c_0_45,plain,
! [X67,X68,X69] : index(cons(X67,X68),suc(X69)) = index(X68,X69),
inference(variable_rename,[status(thm)],[axiom_030]) ).
fof(c_0_46,plain,
! [X1,X2] : lam(X1) != var(X2),
inference(fof_simplification,[status(thm)],[axiom_023]) ).
cnf(c_0_47,negated_conjecture,
( ~ nf(app(var(X1),var(zero),X2))
| just(a) != just(X3)
| just(a) != just(X2)
| index(cons(a,cons(arr(a,arr(a,b)),nil)),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_44,c_0_36]) ).
cnf(c_0_48,plain,
index(cons(X1,X2),suc(X3)) = index(X2,X3),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_49,plain,
! [X54,X55] : lam(X54) != var(X55),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_46])]) ).
cnf(c_0_50,negated_conjecture,
( ~ nf(app(var(suc(X1)),var(zero),X2))
| just(a) != just(X3)
| just(a) != just(X2)
| index(cons(arr(a,arr(a,b)),nil),X1) != just(arr(X2,arr(X3,b))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
lam(X1) != var(X2),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( just(a) != just(X3)
| just(a) != just(X2)
| index(cons(arr(a,arr(a,b)),nil),X1) != just(arr(X2,arr(X3,b))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_41]),c_0_38])]),c_0_51]) ).
cnf(c_0_53,negated_conjecture,
( just(a) != just(X2)
| just(a) != just(X1)
| just(arr(a,arr(a,b))) != just(arr(X1,arr(X2,b))) ),
inference(spm,[status(thm)],[c_0_52,c_0_36]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX223+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.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 10:35:34 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/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
% 3.49/0.95 % Version: 3.5.1
% 3.49/0.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.49/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.49/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.49/0.95 % Starting new_bool_3 with 300s (1) cores
% 3.49/0.95 % Starting new_bool_1 with 300s (1) cores
% 3.49/0.95 % Starting sh5l with 300s (1) cores
% 3.49/0.95 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2925250 completed with status 0
% 3.49/0.95 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.49/0.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.49/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.49/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.49/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.49/0.95 % No SInE strategy applied
% 3.49/0.95 % Search class: FGHSM-FFMF31-MFFFFFNN
% 3.49/0.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.49/0.95 % Starting SubtermCWHack with 136s (1) cores
% 3.49/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.49/0.95 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 3.49/0.95 % Starting new_bool_3 with 136s (1) cores
% 3.49/0.95 % Starting new_bool_1 with 136s (1) cores
% 3.49/0.95 % SubtermCWHack with pid 2925256 completed with status 0
% 3.49/0.95 % Result found by SubtermCWHack
% 3.49/0.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.49/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.49/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.49/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.49/0.95 % No SInE strategy applied
% 3.49/0.95 % Search class: FGHSM-FFMF31-MFFFFFNN
% 3.49/0.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.49/0.95 % Starting SubtermCWHack with 136s (1) cores
% 3.49/0.95 % Preprocessing time : 0.002 s
% 3.49/0.95
% 3.49/0.95 % Proof found!
% 3.49/0.95 % SZS status Theorem
% 3.49/0.95 % SZS output start CNFRefutation
% See solution above
% 3.49/0.95 % Parsed axioms : 36
% 3.49/0.95 % Removed by relevancy pruning/SinE : 0
% 3.49/0.95 % Initial clauses : 43
% 3.49/0.95 % Removed in clause preprocessing : 0
% 3.49/0.95 % Initial clauses in saturation : 43
% 3.49/0.95 % Processed clauses : 1029
% 3.49/0.95 % ...of these trivial : 0
% 3.49/0.95 % ...subsumed : 460
% 3.49/0.95 % ...remaining for further processing : 569
% 3.49/0.95 % Other redundant clauses eliminated : 1
% 3.49/0.95 % Clauses deleted for lack of memory : 0
% 3.49/0.95 % Backward-subsumed : 42
% 3.49/0.95 % Backward-rewritten : 0
% 3.49/0.95 % Generated clauses : 4450
% 3.49/0.95 % ...of the previous two non-redundant : 3277
% 3.49/0.95 % ...aggressively subsumed : 0
% 3.49/0.95 % Contextual simplify-reflections : 0
% 3.49/0.95 % Paramodulations : 4438
% 3.49/0.95 % Factorizations : 0
% 3.49/0.95 % NegExts : 0
% 3.49/0.95 % Equation resolutions : 12
% 3.49/0.95 % Disequality decompositions : 0
% 3.49/0.95 % Total rewrite steps : 1325
% 3.49/0.95 % ...of those cached : 1280
% 3.49/0.95 % Propositional unsat checks : 0
% 3.49/0.95 % Propositional check models : 0
% 3.49/0.95 % Propositional check unsatisfiable : 0
% 3.49/0.95 % Propositional clauses : 0
% 3.49/0.95 % Propositional clauses after purity: 0
% 3.49/0.95 % Propositional unsat core size : 0
% 3.49/0.95 % Propositional preprocessing time : 0.000
% 3.49/0.95 % Propositional encoding time : 0.000
% 3.49/0.95 % Propositional solver time : 0.000
% 3.49/0.95 % Success case prop preproc time : 0.000
% 3.49/0.95 % Success case prop encoding time : 0.000
% 3.49/0.95 % Success case prop solver time : 0.000
% 3.49/0.95 % Current number of processed clauses : 526
% 3.49/0.95 % Positive orientable unit clauses : 15
% 3.49/0.95 % Positive unorientable unit clauses: 0
% 3.49/0.95 % Negative unit clauses : 18
% 3.49/0.95 % Non-unit-clauses : 493
% 3.49/0.95 % Current number of unprocessed clauses: 2291
% 3.49/0.95 % ...number of literals in the above : 23879
% 3.49/0.95 % Current number of archived formulas : 0
% 3.49/0.95 % Current number of archived clauses : 42
% 3.49/0.95 % Clause-clause subsumption calls (NU) : 110197
% 3.49/0.95 % Rec. Clause-clause subsumption calls : 11824
% 3.49/0.95 % Non-unit clause-clause subsumptions : 252
% 3.49/0.95 % Unit Clause-clause subsumption calls : 103
% 3.49/0.95 % Rewrite failures with RHS unbound : 0
% 3.49/0.95 % BW rewrite match attempts : 0
% 3.49/0.95 % BW rewrite match successes : 0
% 3.49/0.95 % Condensation attempts : 0
% 3.49/0.95 % Condensation successes : 0
% 3.49/0.95 % Termbank termtop insertions : 252243
% 3.49/0.95 % Search garbage collected termcells : 317
% 3.49/0.95
% 3.49/0.95 % -------------------------------------------------
% 3.49/0.95 % User time : 0.370 s
% 3.49/0.95 % System time : 0.011 s
% 3.49/0.95 % Total time : 0.381 s
% 3.49/0.95 % Maximum resident set size: 3668 pages
% 3.49/0.95
% 3.49/0.95 % -------------------------------------------------
% 3.49/0.95 % User time : 2.053 s
% 3.49/0.95 % System time : 0.120 s
% 3.49/0.95 % Total time : 2.173 s
% 3.49/0.95 % Maximum resident set size: 4864 pages
% 3.49/0.95 % E exiting
%------------------------------------------------------------------------------