%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL895+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:17:41 PM UTC 2026
% Result : Theorem 121.82s 21.21s
% Output : CNFRefutation 121.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 65 ( 53 unt; 0 def)
% Number of atoms : 85 ( 84 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 30 ( 10 ~; 14 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 99 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_07,axiom,
! [X1,X2,X3] : '==>'('+'(X1,X2),X3) = '==>'(X1,'==>'(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(sos_01,axiom,
! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_01) ).
fof(sos_08,axiom,
! [X1,X2] : '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(sos_04,axiom,
! [X1] : '==>'(X1,X1) = '0',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(sos_05,axiom,
! [X1] : '==>'(X1,'0') = '0',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_05) ).
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).
fof(goals_09,conjecture,
( ( '==>'(c,b) = '0'
& '==>'(c,a) = '0' )
<=> '==>'(c,'+'(a,'==>'(a,b))) = '0' ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_09) ).
fof(sos_06,axiom,
! [X1] : '==>'('0',X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).
fof(c_0_9,plain,
! [X13,X14,X15] : '==>'('+'(X13,X14),X15) = '==>'(X13,'==>'(X14,X15)),
inference(variable_rename,[status(thm)],[sos_07]) ).
fof(c_0_10,plain,
! [X7,X8] : '+'(X7,X8) = '+'(X8,X7),
inference(variable_rename,[status(thm)],[sos_02]) ).
fof(c_0_11,plain,
! [X4,X5,X6] : '+'('+'(X4,X5),X6) = '+'(X4,'+'(X5,X6)),
inference(variable_rename,[status(thm)],[sos_01]) ).
fof(c_0_12,plain,
! [X16,X17] : '+'(X16,'==>'(X16,X17)) = '+'(X17,'==>'(X17,X16)),
inference(variable_rename,[status(thm)],[sos_08]) ).
cnf(c_0_13,plain,
'==>'('+'(X1,X2),X3) = '==>'(X1,'==>'(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X10] : '==>'(X10,X10) = '0',
inference(variable_rename,[status(thm)],[sos_04]) ).
fof(c_0_16,plain,
! [X11] : '==>'(X11,'0') = '0',
inference(variable_rename,[status(thm)],[sos_05]) ).
cnf(c_0_17,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
'==>'(X1,'==>'(X2,X3)) = '==>'(X2,'==>'(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]) ).
cnf(c_0_20,plain,
'==>'(X1,X1) = '0',
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
'==>'(X1,'0') = '0',
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X9] : '+'(X9,'0') = X9,
inference(variable_rename,[status(thm)],[sos_03]) ).
cnf(c_0_23,plain,
'+'(X1,'==>'(X1,'+'(X2,X3))) = '+'(X2,'+'(X3,'==>'(X2,'==>'(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_13]) ).
cnf(c_0_24,plain,
'==>'(X1,'==>'(X2,X1)) = '0',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,negated_conjecture,
~ ( ( '==>'(c,b) = '0'
& '==>'(c,a) = '0' )
<=> '==>'(c,'+'(a,'==>'(a,b))) = '0' ),
inference(assume_negation,[status(cth)],[goals_09]) ).
cnf(c_0_27,plain,
'+'(X1,'==>'(X1,'+'(X1,X2))) = '+'(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
fof(c_0_28,negated_conjecture,
( ( '==>'(c,'+'(a,'==>'(a,b))) = '0'
| '==>'(c,b) = '0' )
& ( '==>'(c,'+'(a,'==>'(a,b))) = '0'
| '==>'(c,a) = '0' )
& ( '==>'(c,'+'(a,'==>'(a,b))) != '0'
| '==>'(c,b) != '0'
| '==>'(c,a) != '0' ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_29,plain,
'+'(X1,'==>'(X1,'+'(X2,'==>'(X2,'+'(X1,X3))))) = '+'(X2,'==>'(X2,'+'(X1,X3))),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( '==>'(c,'+'(a,'==>'(a,b))) = '0'
| '==>'(c,a) = '0' ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( '==>'(c,a) = '0'
| '+'(a,'==>'(a,c)) = c ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25]),c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( '==>'(c,a) = '0'
| '==>'(a,'==>'('==>'(a,c),X1)) = '==>'(c,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_33,plain,
'+'(X1,'+'(X2,X3)) = '+'(X2,'+'(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_17]) ).
cnf(c_0_34,plain,
'+'(X1,'+'('==>'(X1,X2),X3)) = '+'(X2,'+'('==>'(X2,X1),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
'==>'(c,a) = '0',
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_36,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_37,plain,
'+'(X1,'+'(X2,'==>'(X1,X3))) = '+'(X2,'+'(X3,'==>'(X3,X1))),
inference(spm,[status(thm)],[c_0_33,c_0_18]) ).
cnf(c_0_38,negated_conjecture,
'+'(a,'+'('==>'(a,c),X1)) = '+'(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'('==>'(X1,X2),X3))) = '+'(X2,'==>'(X2,'+'(X3,X1))),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
fof(c_0_40,plain,
! [X12] : '==>'('0',X12) = X12,
inference(variable_rename,[status(thm)],[sos_06]) ).
cnf(c_0_41,plain,
'==>'(X1,'==>'('==>'(X1,X2),X2)) = '0',
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_42,plain,
'+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1)))) = '+'(X2,'==>'(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_25]),c_0_14]),c_0_14]) ).
cnf(c_0_43,negated_conjecture,
( '==>'(c,'+'(a,'==>'(a,b))) = '0'
| '==>'(c,b) = '0' ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,negated_conjecture,
'+'(c,'==>'(c,'+'(X1,a))) = '+'(c,'==>'('==>'(a,c),X1)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
'==>'(X1,'==>'('==>'(X1,X2),X3)) = '==>'(X2,'==>'('==>'(X2,X1),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_13]) ).
cnf(c_0_46,plain,
'==>'('0',X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
'==>'(X1,'==>'(X2,'==>'('==>'(X1,X3),X3))) = '0',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_41]),c_0_21]) ).
cnf(c_0_48,negated_conjecture,
( '==>'(c,b) = '0'
| '+'(c,'==>'(c,'+'(a,'==>'(a,b)))) = c ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_25]),c_0_13]),c_0_17]),c_0_25]),c_0_23]) ).
cnf(c_0_49,negated_conjecture,
'+'(c,'==>'(c,'+'(a,X1))) = '+'(c,'==>'('==>'(a,c),X1)),
inference(spm,[status(thm)],[c_0_44,c_0_14]) ).
cnf(c_0_50,negated_conjecture,
'==>'(a,'==>'('==>'(a,c),X1)) = '==>'(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_35]),c_0_46]) ).
cnf(c_0_51,plain,
'==>'(X1,'==>'(X2,'==>'(X3,'+'(X1,X2)))) = '0',
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_52,plain,
'==>'(X1,'==>'('==>'(X1,X2),'==>'('==>'(X2,X3),X3))) = '0',
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( '==>'(c,b) = '0'
| '+'(c,'==>'(c,b)) = c ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_19]),c_0_50]) ).
cnf(c_0_54,plain,
'==>'(X1,'==>'(X2,'==>'('==>'(X2,X3),'+'(X1,X3)))) = '0',
inference(spm,[status(thm)],[c_0_51,c_0_45]) ).
cnf(c_0_55,plain,
'==>'(X1,'==>'('==>'(X2,X3),'==>'('==>'(X1,X2),X3))) = '0',
inference(spm,[status(thm)],[c_0_52,c_0_19]) ).
cnf(c_0_56,negated_conjecture,
( '==>'(c,b) = '0'
| '==>'(c,'==>'('==>'(c,b),X1)) = '==>'(c,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( '==>'(c,'+'(a,'==>'(a,b))) != '0'
| '==>'(c,b) != '0'
| '==>'(c,a) != '0' ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_58,negated_conjecture,
'==>'(c,'==>'('==>'('==>'(a,c),X1),'+'(a,X1))) = '0',
inference(spm,[status(thm)],[c_0_54,c_0_50]) ).
cnf(c_0_59,negated_conjecture,
'==>'(c,b) = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_20]),c_0_46])]) ).
cnf(c_0_60,negated_conjecture,
( '==>'(c,b) != '0'
| '==>'(c,'+'(a,'==>'(a,b))) != '0' ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_35])]) ).
cnf(c_0_61,negated_conjecture,
'==>'(c,'==>'('==>'(c,X1),'+'(X1,'==>'(X1,a)))) = '0',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_18]),c_0_19]),c_0_50]) ).
cnf(c_0_62,negated_conjecture,
'==>'(X1,'==>'('==>'(X1,c),b)) = '0',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_59]),c_0_46]) ).
cnf(c_0_63,negated_conjecture,
'==>'(c,'+'(a,'==>'(a,b))) != '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_59])]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_20]),c_0_46]),c_0_20]),c_0_46]),c_0_46]),c_0_18]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL895+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.45 % Computer : n026.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Mon Sep 21 01:12:43 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.51 Running first-order theorem proving
% 0.22/5.51 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
% 121.82/21.21 % Version: 3.5.1
% 121.82/21.21 % Preprocessing class: FSSSSMSSSSSNFFN.
% 121.82/21.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.82/21.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 121.82/21.21 % Starting new_bool_3 with 300s (1) cores
% 121.82/21.21 % Starting new_bool_1 with 300s (1) cores
% 121.82/21.21 % Starting sh5l with 300s (1) cores
% 121.82/21.21 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1040246 completed with status 0
% 121.82/21.21 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 121.82/21.21 % Preprocessing class: FSSSSMSSSSSNFFN.
% 121.82/21.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.82/21.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 121.82/21.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 121.82/21.21 % No SInE strategy applied
% 121.82/21.21 % Search class: FGHPM-FFSF22-MFFFFFNN
% 121.82/21.21 % partial match(1): FUHPM-FFSF22-MFFFFFNN
% 121.82/21.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 121.82/21.21 % Starting SubtermCWHack with 136s (1) cores
% 121.82/21.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 121.82/21.21 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 121.82/21.21 % Starting new_bool_3 with 136s (1) cores
% 121.82/21.21 % Starting new_bool_1 with 136s (1) cores
% 121.82/21.21 % H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with pid 1040252 completed with status 0
% 121.82/21.21 % Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S
% 121.82/21.21 % Preprocessing class: FSSSSMSSSSSNFFN.
% 121.82/21.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.82/21.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 121.82/21.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 121.82/21.21 % No SInE strategy applied
% 121.82/21.21 % Search class: FGHPM-FFSF22-MFFFFFNN
% 121.82/21.21 % partial match(1): FUHPM-FFSF22-MFFFFFNN
% 121.82/21.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 121.82/21.21 % Starting SubtermCWHack with 136s (1) cores
% 121.82/21.21 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 121.82/21.21 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 121.82/21.21 % Preprocessing time : 0.002 s
% 121.82/21.21 % Presaturation interreduction done
% 121.82/21.21
% 121.82/21.21 % Proof found!
% 121.82/21.21 % SZS status Theorem
% 121.82/21.21 % SZS output start CNFRefutation
% See solution above
% 121.82/21.21 % Parsed axioms : 9
% 121.82/21.21 % Removed by relevancy pruning/SinE : 0
% 121.82/21.21 % Initial clauses : 11
% 121.82/21.21 % Removed in clause preprocessing : 0
% 121.82/21.21 % Initial clauses in saturation : 11
% 121.82/21.21 % Processed clauses : 7584
% 121.82/21.21 % ...of these trivial : 5603
% 121.82/21.21 % ...subsumed : 873
% 121.82/21.21 % ...remaining for further processing : 1107
% 121.82/21.21 % Other redundant clauses eliminated : 0
% 121.82/21.21 % Clauses deleted for lack of memory : 0
% 121.82/21.21 % Backward-subsumed : 1
% 121.82/21.21 % Backward-rewritten : 154
% 121.82/21.21 % Generated clauses : 548660
% 121.82/21.21 % ...of the previous two non-redundant : 313917
% 121.82/21.21 % ...aggressively subsumed : 0
% 121.82/21.21 % Contextual simplify-reflections : 0
% 121.82/21.21 % Paramodulations : 548660
% 121.82/21.21 % Factorizations : 0
% 121.82/21.21 % NegExts : 0
% 121.82/21.21 % Equation resolutions : 0
% 121.82/21.21 % Disequality decompositions : 0
% 121.82/21.21 % Total rewrite steps : 937769
% 121.82/21.21 % ...of those cached : 715316
% 121.82/21.21 % Propositional unsat checks : 0
% 121.82/21.21 % Propositional check models : 0
% 121.82/21.21 % Propositional check unsatisfiable : 0
% 121.82/21.21 % Propositional clauses : 0
% 121.82/21.21 % Propositional clauses after purity: 0
% 121.82/21.21 % Propositional unsat core size : 0
% 121.82/21.21 % Propositional preprocessing time : 0.000
% 121.82/21.21 % Propositional encoding time : 0.000
% 121.82/21.21 % Propositional solver time : 0.000
% 121.82/21.21 % Success case prop preproc time : 0.000
% 121.82/21.21 % Success case prop encoding time : 0.000
% 121.82/21.21 % Success case prop solver time : 0.000
% 121.82/21.21 % Current number of processed clauses : 941
% 121.82/21.21 % Positive orientable unit clauses : 912
% 121.82/21.21 % Positive unorientable unit clauses: 28
% 121.82/21.21 % Negative unit clauses : 1
% 121.82/21.21 % Non-unit-clauses : 0
% 121.82/21.21 % Current number of unprocessed clauses: 305817
% 121.82/21.21 % ...number of literals in the above : 308714
% 121.82/21.21 % Current number of archived formulas : 0
% 121.82/21.21 % Current number of archived clauses : 166
% 121.82/21.21 % Clause-clause subsumption calls (NU) : 1100
% 121.82/21.21 % Rec. Clause-clause subsumption calls : 1100
% 121.82/21.21 % Non-unit clause-clause subsumptions : 264
% 121.82/21.21 % Unit Clause-clause subsumption calls : 1792
% 121.82/21.21 % Rewrite failures with RHS unbound : 0
% 121.82/21.21 % BW rewrite match attempts : 90350
% 121.82/21.21 % BW rewrite match successes : 592
% 121.82/21.21 % Condensation attempts : 0
% 121.82/21.21 % Condensation successes : 0
% 121.82/21.21 % Termbank termtop insertions : 9061705
% 121.82/21.21 % Search garbage collected termcells : 25
% 121.82/21.21
% 121.82/21.21 % -------------------------------------------------
% 121.82/21.21 % User time : 14.497 s
% 121.82/21.21 % System time : 0.608 s
% 121.82/21.21 % Total time : 15.105 s
% 121.82/21.21 % Maximum resident set size: 3328 pages
% 121.82/21.21
% 121.82/21.21 % -------------------------------------------------
% 121.82/21.21 % User time : 71.981 s
% 121.82/21.21 % System time : 3.006 s
% 121.82/21.21 % Total time : 74.987 s
% 121.82/21.21 % Maximum resident set size: 4608 pages
% 121.82/21.21 % E exiting
%------------------------------------------------------------------------------