%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL071-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 01:18:23 PM UTC 2026
% Result : Unsatisfiable 6.02s 1.31s
% Output : CNFRefutation 6.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 5
% Syntax : Number of clauses : 74 ( 38 unt; 0 nHn; 25 RR)
% Number of literals : 121 ( 0 equ; 50 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 183 ( 38 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(cn_60,axiom,
is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_60) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).
cnf(prove_cn_2,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_2) ).
cnf(c_0_5,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))),
cn_60 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(X1,implies(not(X4),X3)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(implies(X4,X2),X3)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(X4,implies(not(X3),X2)))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(implies(X3,X4),X2))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(implies(X4,X2),X1),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(X3,implies(X2,X4)))
| is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(X4,implies(X1,X2)))
| ~ is_a_theorem(implies(implies(X3,X1),X4))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(implies(X3,X1),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X2,X1),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(X1,X1),implies(X1,X1)),implies(X1,X1))),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(X3,implies(implies(X4,X2),implies(implies(X1,X4),X2))))),
inference(spm,[status(thm)],[c_0_19,c_0_7]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17])]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(implies(not(X4),X3))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(implies(X4,X2),X3)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_28]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(implies(implies(X3,X3),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(implies(not(X3),X2))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(implies(X1,X3),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(implies(X2,X1),not(X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_27]),c_0_17])]) ).
cnf(c_0_36,plain,
( ~ is_a_theorem(implies(not(X1),X2))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(X1,implies(X1,implies(X1,X2))))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,implies(implies(X3,X4),implies(implies(X1,X3),X4))))),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(implies(X1,X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_35]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(X1,implies(X2,not(X1))),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,not(X1)),X2))),
inference(spm,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(not(not(X4)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(implies(X4,X2),X3)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_38]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_39]) ).
cnf(c_0_44,plain,
( ~ is_a_theorem(implies(implies(X4,X1),X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_46,plain,
( ~ is_a_theorem(implies(X2,implies(X1,not(X2))))
| is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_40]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(not(not(X1)),implies(implies(X1,not(X1)),X2))),
inference(spm,[status(thm)],[c_0_34,c_0_41]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(not(not(X3)))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_42]) ).
cnf(c_0_49,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_44,c_0_29]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_52,plain,
( ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_34,c_0_12]) ).
cnf(c_0_54,plain,
( ~ is_a_theorem(implies(X1,not(X2)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(implies(X1,not(X1)),not(not(not(X1))))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,plain,
( ~ is_a_theorem(not(not(X3)))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_48,c_0_45]) ).
cnf(c_0_57,plain,
( ~ is_a_theorem(implies(implies(X2,X2),not(X1)))
| is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_46,c_0_51]) ).
cnf(c_0_59,plain,
( ~ is_a_theorem(implies(implies(X2,X4),X3))
| is_a_theorem(implies(not(implies(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
is_a_theorem(implies(implies(X1,not(X1)),implies(not(not(X1)),X2))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
( ~ is_a_theorem(not(not(X1)))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_56]) ).
cnf(c_0_62,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_43,c_0_58]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(not(not(X2)),X3))),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
is_a_theorem(not(not(implies(not(not(X1)),X1)))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( ~ is_a_theorem(implies(implies(X2,X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_65]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),X1),X2),X2)),
inference(spm,[status(thm)],[c_0_61,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
inference(fof_simplification,[status(thm)],[prove_cn_2]) ).
cnf(c_0_70,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
c_0_69 ).
cnf(c_0_72,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(spm,[status(thm)],[c_0_36,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL071-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n005.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 00:03:18 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 6.02/1.31 % Version: 3.5.1
% 6.02/1.31 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.02/1.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.02/1.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.02/1.31 % Starting new_bool_3 with 300s (1) cores
% 6.02/1.31 % Starting new_bool_1 with 300s (1) cores
% 6.02/1.31 % Starting sh5l with 300s (1) cores
% 6.02/1.31 % new_bool_1 with pid 2110125 completed with status 0
% 6.02/1.31 % Result found by new_bool_1
% 6.02/1.31 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.02/1.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.02/1.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.02/1.31 % Starting new_bool_3 with 300s (1) cores
% 6.02/1.31 % Starting new_bool_1 with 300s (1) cores
% 6.02/1.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 6.02/1.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.02/1.31 % Search class: FHUNS-FFSF21-MFFFFFNN
% 6.02/1.31 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.02/1.31 % Starting SubtermCWHack with 31s (1) cores
% 6.02/1.31 % SubtermCWHack with pid 2110131 completed with status 0
% 6.02/1.31 % Result found by SubtermCWHack
% 6.02/1.31 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.02/1.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.02/1.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.02/1.31 % Starting new_bool_3 with 300s (1) cores
% 6.02/1.31 % Starting new_bool_1 with 300s (1) cores
% 6.02/1.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 6.02/1.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.02/1.31 % Search class: FHUNS-FFSF21-MFFFFFNN
% 6.02/1.31 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.02/1.31 % Starting SubtermCWHack with 31s (1) cores
% 6.02/1.31 % Preprocessing time : 0.001 s
% 6.02/1.31
% 6.02/1.31 % Proof found!
% 6.02/1.31 % SZS status Unsatisfiable
% 6.02/1.31 % SZS output start CNFRefutation
% See solution above
% 6.02/1.31 % Parsed axioms : 5
% 6.02/1.31 % Removed by relevancy pruning/SinE : 0
% 6.02/1.31 % Initial clauses : 5
% 6.02/1.31 % Removed in clause preprocessing : 0
% 6.02/1.31 % Initial clauses in saturation : 5
% 6.02/1.31 % Processed clauses : 8641
% 6.02/1.31 % ...of these trivial : 385
% 6.02/1.31 % ...subsumed : 7091
% 6.02/1.31 % ...remaining for further processing : 1165
% 6.02/1.31 % Other redundant clauses eliminated : 0
% 6.02/1.31 % Clauses deleted for lack of memory : 0
% 6.02/1.31 % Backward-subsumed : 56
% 6.02/1.31 % Backward-rewritten : 15
% 6.02/1.31 % Generated clauses : 72277
% 6.02/1.31 % ...of the previous two non-redundant : 55929
% 6.02/1.31 % ...aggressively subsumed : 0
% 6.02/1.31 % Contextual simplify-reflections : 0
% 6.02/1.31 % Paramodulations : 72277
% 6.02/1.31 % Factorizations : 0
% 6.02/1.31 % NegExts : 0
% 6.02/1.31 % Equation resolutions : 0
% 6.02/1.31 % Disequality decompositions : 0
% 6.02/1.31 % Total rewrite steps : 16384
% 6.02/1.31 % ...of those cached : 13257
% 6.02/1.31 % Propositional unsat checks : 0
% 6.02/1.31 % Propositional check models : 0
% 6.02/1.31 % Propositional check unsatisfiable : 0
% 6.02/1.31 % Propositional clauses : 0
% 6.02/1.31 % Propositional clauses after purity: 0
% 6.02/1.31 % Propositional unsat core size : 0
% 6.02/1.31 % Propositional preprocessing time : 0.000
% 6.02/1.31 % Propositional encoding time : 0.000
% 6.02/1.31 % Propositional solver time : 0.000
% 6.02/1.31 % Success case prop preproc time : 0.000
% 6.02/1.31 % Success case prop encoding time : 0.000
% 6.02/1.31 % Success case prop solver time : 0.000
% 6.02/1.31 % Current number of processed clauses : 1094
% 6.02/1.31 % Positive orientable unit clauses : 343
% 6.02/1.31 % Positive unorientable unit clauses: 0
% 6.02/1.31 % Negative unit clauses : 2
% 6.02/1.31 % Non-unit-clauses : 749
% 6.02/1.31 % Current number of unprocessed clauses: 46906
% 6.02/1.31 % ...number of literals in the above : 97896
% 6.02/1.31 % Current number of archived formulas : 0
% 6.02/1.31 % Current number of archived clauses : 71
% 6.02/1.31 % Clause-clause subsumption calls (NU) : 120767
% 6.02/1.31 % Rec. Clause-clause subsumption calls : 120663
% 6.02/1.31 % Non-unit clause-clause subsumptions : 7145
% 6.02/1.31 % Unit Clause-clause subsumption calls : 1770
% 6.02/1.31 % Rewrite failures with RHS unbound : 0
% 6.02/1.31 % BW rewrite match attempts : 33159
% 6.02/1.31 % BW rewrite match successes : 15
% 6.02/1.31 % Condensation attempts : 0
% 6.02/1.31 % Condensation successes : 0
% 6.02/1.31 % Termbank termtop insertions : 1000062
% 6.02/1.31 % Search garbage collected termcells : 8
% 6.02/1.31
% 6.02/1.31 % -------------------------------------------------
% 6.02/1.31 % User time : 0.815 s
% 6.02/1.31 % System time : 0.038 s
% 6.02/1.31 % Total time : 0.853 s
% 6.02/1.31 % Maximum resident set size: 3636 pages
% 6.02/1.31
% 6.02/1.31 % -------------------------------------------------
% 6.02/1.31 % User time : 0.817 s
% 6.02/1.31 % System time : 0.045 s
% 6.02/1.31 % Total time : 0.861 s
% 6.02/1.31 % Maximum resident set size: 4608 pages
% 6.02/1.31 % E exiting
%------------------------------------------------------------------------------