↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : GRP082-1 : TPTP v9.3.1. Bugfixed v2.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 12:41:44 PM UTC 2026

% Result   : Unsatisfiable 2.05s 0.76s
% Output   : CNFRefutation 2.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   33
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   61 (  58 unt;   0 nHn;   4 RR)
%            Number of literals    :   67 (  66 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  193 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X3))),double_divide(X4,double_divide(X2,X4))))) = X3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

cnf(multiply,axiom,
    multiply(X1,X2) = inverse(double_divide(X2,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

cnf(prove_these_axioms,negated_conjecture,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).

cnf(c_0_3,axiom,
    double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X3))),double_divide(X4,double_divide(X2,X4))))) = X3,
    single_axiom ).

cnf(c_0_4,axiom,
    multiply(X1,X2) = inverse(double_divide(X2,X1)),
    multiply ).

cnf(c_0_5,plain,
    double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),multiply(double_divide(X3,X4),X1))) = X4,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).

cnf(c_0_6,plain,
    double_divide(inverse(X1),multiply(double_divide(X2,double_divide(inverse(X3),X2)),multiply(X4,X1))) = multiply(double_divide(X5,double_divide(X6,X5)),multiply(double_divide(X6,X4),X3)),
    inference(spm,[status(thm)],[c_0_5,c_0_5]) ).

cnf(c_0_7,plain,
    double_divide(multiply(X1,X2),multiply(double_divide(X3,double_divide(X4,X3)),multiply(double_divide(X4,X5),double_divide(X2,X1)))) = X5,
    inference(spm,[status(thm)],[c_0_5,c_0_4]) ).

cnf(c_0_8,plain,
    multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,double_divide(inverse(X3),X4)),X3)) = X4,
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,plain,
    double_divide(multiply(X1,X2),double_divide(inverse(X3),multiply(double_divide(X4,double_divide(multiply(X1,X2),X4)),multiply(X5,X3)))) = X5,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_4]) ).

cnf(c_0_10,plain,
    multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,double_divide(multiply(X3,X4),X5)),double_divide(X4,X3))) = X5,
    inference(spm,[status(thm)],[c_0_8,c_0_4]) ).

cnf(c_0_11,plain,
    double_divide(X1,double_divide(inverse(X2),multiply(double_divide(X3,double_divide(X1,X3)),multiply(X4,X2)))) = X4,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,plain,
    multiply(double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),multiply(X4,X1))),X3) = inverse(X4),
    inference(spm,[status(thm)],[c_0_4,c_0_11]) ).

cnf(c_0_13,plain,
    multiply(double_divide(X1,double_divide(X2,X1)),multiply(X3,X4)) = multiply(double_divide(X5,double_divide(X2,X5)),multiply(X3,X4)),
    inference(spm,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_14,plain,
    multiply(double_divide(X1,X2),X2) = multiply(double_divide(X1,X3),X3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]),c_0_4]),c_0_4]) ).

cnf(c_0_15,plain,
    double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),multiply(double_divide(X3,X4),X4))) = X1,
    inference(spm,[status(thm)],[c_0_5,c_0_14]) ).

cnf(c_0_16,plain,
    double_divide(X1,double_divide(X2,X1)) = double_divide(X3,double_divide(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_11]) ).

cnf(c_0_17,plain,
    double_divide(inverse(X1),double_divide(inverse(X2),multiply(double_divide(X3,double_divide(inverse(X4),X3)),multiply(X4,X2)))) = X1,
    inference(spm,[status(thm)],[c_0_15,c_0_6]) ).

cnf(c_0_18,plain,
    multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X3,double_divide(inverse(X4),X3)),X4)) = X2,
    inference(spm,[status(thm)],[c_0_8,c_0_16]) ).

cnf(c_0_19,plain,
    double_divide(inverse(X1),double_divide(inverse(X2),multiply(double_divide(inverse(X2),X3),X3))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_4]) ).

cnf(c_0_20,plain,
    double_divide(inverse(X1),double_divide(multiply(X2,X3),multiply(double_divide(multiply(X2,X3),X4),X4))) = X1,
    inference(spm,[status(thm)],[c_0_19,c_0_4]) ).

cnf(c_0_21,plain,
    double_divide(inverse(X1),double_divide(X2,multiply(double_divide(X2,X3),X3))) = X1,
    inference(spm,[status(thm)],[c_0_20,c_0_10]) ).

cnf(c_0_22,plain,
    multiply(double_divide(X1,multiply(double_divide(X1,X2),X2)),inverse(X3)) = inverse(X3),
    inference(spm,[status(thm)],[c_0_4,c_0_21]) ).

cnf(c_0_23,plain,
    multiply(double_divide(X1,multiply(double_divide(X1,X2),X2)),multiply(X3,X4)) = multiply(X3,X4),
    inference(spm,[status(thm)],[c_0_22,c_0_4]) ).

cnf(c_0_24,plain,
    multiply(double_divide(X1,multiply(double_divide(X1,X2),X2)),X3) = X3,
    inference(spm,[status(thm)],[c_0_23,c_0_10]) ).

cnf(c_0_25,plain,
    double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),X1)) = multiply(double_divide(X3,X4),X4),
    inference(spm,[status(thm)],[c_0_5,c_0_24]) ).

cnf(c_0_26,plain,
    multiply(double_divide(X1,double_divide(X2,X1)),double_divide(X2,X3)) = multiply(double_divide(X3,X4),X4),
    inference(spm,[status(thm)],[c_0_14,c_0_16]) ).

cnf(c_0_27,plain,
    multiply(double_divide(X1,multiply(double_divide(X2,double_divide(X3,X2)),double_divide(X3,X1))),X4) = X4,
    inference(spm,[status(thm)],[c_0_24,c_0_16]) ).

cnf(c_0_28,plain,
    double_divide(multiply(X1,X2),multiply(double_divide(X1,X3),X3)) = multiply(double_divide(X2,X4),X4),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_4]) ).

cnf(c_0_29,plain,
    multiply(double_divide(X1,double_divide(multiply(X2,X1),multiply(double_divide(X2,X3),X3))),X4) = X4,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,plain,
    multiply(double_divide(X1,double_divide(multiply(X2,multiply(double_divide(X2,X3),X3)),X1)),X4) = X4,
    inference(spm,[status(thm)],[c_0_27,c_0_29]) ).

cnf(c_0_31,plain,
    multiply(double_divide(double_divide(inverse(X1),multiply(X2,X1)),X2),X3) = X3,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_11]),c_0_30]) ).

cnf(c_0_32,plain,
    double_divide(X1,double_divide(inverse(X2),X1)) = double_divide(double_divide(X3,multiply(double_divide(X3,X4),X4)),X2),
    inference(spm,[status(thm)],[c_0_16,c_0_21]) ).

cnf(c_0_33,plain,
    multiply(double_divide(X1,double_divide(multiply(X2,inverse(X2)),X1)),X3) = X3,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_4]) ).

cnf(c_0_34,plain,
    multiply(double_divide(X1,double_divide(X2,X1)),double_divide(inverse(X3),X3)) = X2,
    inference(spm,[status(thm)],[c_0_10,c_0_33]) ).

cnf(c_0_35,plain,
    double_divide(multiply(X1,X2),double_divide(X3,multiply(double_divide(X3,X4),X4))) = double_divide(X2,X1),
    inference(spm,[status(thm)],[c_0_21,c_0_4]) ).

cnf(c_0_36,plain,
    multiply(double_divide(X1,X2),X2) = inverse(X1),
    inference(spm,[status(thm)],[c_0_14,c_0_34]) ).

cnf(c_0_37,plain,
    multiply(double_divide(double_divide(inverse(X1),multiply(X2,X1)),X3),X3) = X2,
    inference(spm,[status(thm)],[c_0_14,c_0_31]) ).

cnf(c_0_38,plain,
    double_divide(X1,double_divide(X2,X1)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_21]) ).

cnf(c_0_39,plain,
    multiply(multiply(X1,X2),inverse(X2)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_4]) ).

cnf(c_0_40,plain,
    multiply(X1,double_divide(X1,X2)) = inverse(X2),
    inference(spm,[status(thm)],[c_0_36,c_0_38]) ).

cnf(c_0_41,plain,
    multiply(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,X3),X4)),inverse(X4)) = inverse(X3),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_42,plain,
    multiply(double_divide(X1,inverse(X1)),X2) = X2,
    inference(spm,[status(thm)],[c_0_27,c_0_36]) ).

cnf(c_0_43,plain,
    multiply(inverse(X1),multiply(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_4]) ).

cnf(c_0_44,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38]),c_0_39]) ).

cnf(c_0_45,plain,
    double_divide(inverse(X1),multiply(double_divide(multiply(double_divide(X2,double_divide(X3,X2)),multiply(double_divide(X3,X4),X5)),X4),multiply(double_divide(inverse(X5),X6),X1))) = X6,
    inference(spm,[status(thm)],[c_0_5,c_0_5]) ).

cnf(c_0_46,plain,
    multiply(multiply(double_divide(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,X3),X4)),X3),multiply(double_divide(inverse(X4),X5),X6)),inverse(X6)) = inverse(X5),
    inference(spm,[status(thm)],[c_0_41,c_0_5]) ).

cnf(c_0_47,plain,
    multiply(X1,multiply(inverse(X1),X2)) = X2,
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_48,plain,
    double_divide(inverse(X1),multiply(X2,multiply(double_divide(X2,X3),X1))) = X3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_45]),c_0_46]),c_0_38]) ).

cnf(c_0_49,plain,
    double_divide(inverse(X1),X2) = multiply(X1,inverse(X2)),
    inference(spm,[status(thm)],[c_0_47,c_0_40]) ).

cnf(c_0_50,plain,
    inverse(multiply(X1,X2)) = double_divide(X2,X1),
    inference(spm,[status(thm)],[c_0_44,c_0_4]) ).

cnf(c_0_51,plain,
    double_divide(X1,double_divide(X2,X1)) = double_divide(double_divide(X3,X2),double_divide(X4,double_divide(X3,X4))),
    inference(spm,[status(thm)],[c_0_16,c_0_16]) ).

cnf(c_0_52,plain,
    multiply(X1,double_divide(multiply(double_divide(X2,X3),X1),X2)) = X3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).

cnf(c_0_53,negated_conjecture,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
    inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).

cnf(c_0_54,plain,
    double_divide(double_divide(X1,X2),X1) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_38]),c_0_38]) ).

cnf(c_0_55,plain,
    multiply(X1,multiply(X2,multiply(double_divide(X2,X1),X3))) = X3,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_52]),c_0_4]) ).

cnf(c_0_56,negated_conjecture,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
    c_0_53 ).

cnf(c_0_57,plain,
    multiply(multiply(inverse(X1),X1),X2) = X2,
    inference(spm,[status(thm)],[c_0_31,c_0_54]) ).

cnf(c_0_58,plain,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_47]),c_0_4]) ).

cnf(c_0_59,plain,
    multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_21]),c_0_4]),c_0_36]) ).

cnf(c_0_60,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),c_0_58])]),c_0_59]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP082-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n004.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 19:57:04 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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
% 2.05/0.76  % Version: 3.5.1
% 2.05/0.76  % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.05/0.76  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.76  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.05/0.76  % Starting new_bool_3 with 300s (1) cores
% 2.05/0.76  % Starting new_bool_1 with 300s (1) cores
% 2.05/0.76  % Starting sh5l with 300s (1) cores
% 2.05/0.76  % new_bool_1 with pid 1353748 completed with status 0
% 2.05/0.76  % Result found by new_bool_1
% 2.05/0.76  % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.05/0.76  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.76  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.05/0.76  % Starting new_bool_3 with 300s (1) cores
% 2.05/0.76  % Starting new_bool_1 with 300s (1) cores
% 2.05/0.76  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.05/0.76  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.05/0.76  % Search class: FUHPS-FFSF21-DFFFFFNN
% 2.05/0.76  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.05/0.76  % Starting SubtermCWHack with 31s (1) cores
% 2.05/0.76  % SubtermCWHack with pid 1353758 completed with status 0
% 2.05/0.76  % Result found by SubtermCWHack
% 2.05/0.76  % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.05/0.76  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.76  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.05/0.76  % Starting new_bool_3 with 300s (1) cores
% 2.05/0.76  % Starting new_bool_1 with 300s (1) cores
% 2.05/0.76  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.05/0.76  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.05/0.76  % Search class: FUHPS-FFSF21-DFFFFFNN
% 2.05/0.76  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.05/0.76  % Starting SubtermCWHack with 31s (1) cores
% 2.05/0.76  % Preprocessing time       : 0.001 s
% 2.05/0.76  
% 2.05/0.76  % Proof found!
% 2.05/0.76  % SZS status Unsatisfiable
% 2.05/0.76  % SZS output start CNFRefutation
% See solution above
% 2.05/0.76  % Parsed axioms                        : 3
% 2.05/0.76  % Removed by relevancy pruning/SinE    : 0
% 2.05/0.76  % Initial clauses                      : 3
% 2.05/0.76  % Removed in clause preprocessing      : 0
% 2.05/0.76  % Initial clauses in saturation        : 3
% 2.05/0.76  % Processed clauses                    : 847
% 2.05/0.76  % ...of these trivial                  : 215
% 2.05/0.76  % ...subsumed                          : 452
% 2.05/0.76  % ...remaining for further processing  : 179
% 2.05/0.76  % Other redundant clauses eliminated   : 0
% 2.05/0.76  % Clauses deleted for lack of memory   : 0
% 2.05/0.76  % Backward-subsumed                    : 1
% 2.05/0.76  % Backward-rewritten                   : 140
% 2.05/0.76  % Generated clauses                    : 23096
% 2.05/0.76  % ...of the previous two non-redundant : 19147
% 2.05/0.76  % ...aggressively subsumed             : 0
% 2.05/0.76  % Contextual simplify-reflections      : 0
% 2.05/0.76  % Paramodulations                      : 23096
% 2.05/0.76  % Factorizations                       : 0
% 2.05/0.76  % NegExts                              : 0
% 2.05/0.76  % Equation resolutions                 : 0
% 2.05/0.76  % Disequality decompositions           : 0
% 2.05/0.76  % Total rewrite steps                  : 34602
% 2.05/0.76  % ...of those cached                   : 27431
% 2.05/0.76  % Propositional unsat checks           : 0
% 2.05/0.76  %    Propositional check models        : 0
% 2.05/0.76  %    Propositional check unsatisfiable : 0
% 2.05/0.76  %    Propositional clauses             : 0
% 2.05/0.76  %    Propositional clauses after purity: 0
% 2.05/0.76  %    Propositional unsat core size     : 0
% 2.05/0.76  %    Propositional preprocessing time  : 0.000
% 2.05/0.76  %    Propositional encoding time       : 0.000
% 2.05/0.76  %    Propositional solver time         : 0.000
% 2.05/0.76  %    Success case prop preproc time    : 0.000
% 2.05/0.76  %    Success case prop encoding time   : 0.000
% 2.05/0.76  %    Success case prop solver time     : 0.000
% 2.05/0.76  % Current number of processed clauses  : 38
% 2.05/0.76  %    Positive orientable unit clauses  : 31
% 2.05/0.76  %    Positive unorientable unit clauses: 7
% 2.05/0.76  %    Negative unit clauses             : 0
% 2.05/0.76  %    Non-unit-clauses                  : 0
% 2.05/0.76  % Current number of unprocessed clauses: 11521
% 2.05/0.76  % ...number of literals in the above   : 11521
% 2.05/0.76  % Current number of archived formulas  : 0
% 2.05/0.76  % Current number of archived clauses   : 141
% 2.05/0.76  % Clause-clause subsumption calls (NU) : 0
% 2.05/0.76  % Rec. Clause-clause subsumption calls : 0
% 2.05/0.76  % Non-unit clause-clause subsumptions  : 0
% 2.05/0.76  % Unit Clause-clause subsumption calls : 361
% 2.05/0.76  % Rewrite failures with RHS unbound    : 982
% 2.05/0.76  % BW rewrite match attempts            : 1177
% 2.05/0.76  % BW rewrite match successes           : 272
% 2.05/0.76  % Condensation attempts                : 0
% 2.05/0.76  % Condensation successes               : 0
% 2.05/0.76  % Termbank termtop insertions          : 372102
% 2.05/0.76  % Search garbage collected termcells   : 8
% 2.05/0.76  
% 2.05/0.76  % -------------------------------------------------
% 2.05/0.76  % User time                : 0.290 s
% 2.05/0.76  % System time              : 0.024 s
% 2.05/0.76  % Total time               : 0.314 s
% 2.05/0.76  % Maximum resident set size: 3636 pages
% 2.05/0.76  
% 2.05/0.76  % -------------------------------------------------
% 2.05/0.76  % User time                : 0.294 s
% 2.05/0.76  % System time              : 0.026 s
% 2.05/0.76  % Total time               : 0.320 s
% 2.05/0.76  % Maximum resident set size: 4864 pages
% 2.05/0.76  % E exiting
%------------------------------------------------------------------------------