↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ALG441-1 : TPTP v9.3.1. Released v5.4.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 11:56:07 AM UTC 2026

% Result   : Unsatisfiable 18.60s 13.27s
% Output   : CNFRefutation 18.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   75 (  46 unt;   0 nHn;  52 RR)
%            Number of literals    :  133 (  23 equ;  61 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-4 aty)
%            Number of variables   :  217 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(sos_010,axiom,
    ( ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(u(X1,X4),u(X2,X5),u(X3,X6)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_010) ).

cnf(sos_008,axiom,
    u(X1,X2) = v(X1,X1,X1,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_008) ).

cnf(sos_007,axiom,
    v(X1,X2,X1,X1) = v(X2,X1,X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_007) ).

cnf(sos_006,axiom,
    v(X1,X1,X2,X1) = v(X1,X2,X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_006) ).

cnf(sos_004,axiom,
    u(X1,X2) = u(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_004) ).

cnf(sos_011,axiom,
    ( ~ r(X10,X11,X12)
    | ~ r(X7,X8,X9)
    | ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(v(X1,X4,X7,X10),v(X2,X5,X8,X11),v(X3,X6,X9,X12)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_011) ).

cnf(sos_014,axiom,
    r(b,a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_014) ).

cnf(sos_002,axiom,
    u(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_002) ).

cnf(sos_005,axiom,
    v(X1,X1,X1,X2) = v(X1,X1,X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_005) ).

cnf(sos_012,axiom,
    r(a,a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_012) ).

cnf(sos_009,axiom,
    ( ~ r(X7,X8,X9)
    | ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(m(X1,X4,X7),m(X2,X5,X8),m(X3,X6,X9)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_009) ).

cnf(sos_013,axiom,
    r(a,b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_013) ).

cnf(sos_001,axiom,
    m(X1,X2,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_001) ).

cnf(sos,axiom,
    m(X1,X1,X2) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).

cnf(goals,negated_conjecture,
    ~ r(a,a,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(c_0_15,plain,
    ( ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(u(X1,X4),u(X2,X5),u(X3,X6)) ),
    inference(fof_simplification,[status(thm)],[sos_010]) ).

cnf(c_0_16,plain,
    ( ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(u(X1,X4),u(X2,X5),u(X3,X6)) ),
    c_0_15 ).

cnf(c_0_17,axiom,
    u(X1,X2) = v(X1,X1,X1,X2),
    sos_008 ).

cnf(c_0_18,axiom,
    v(X1,X2,X1,X1) = v(X2,X1,X1,X1),
    sos_007 ).

cnf(c_0_19,axiom,
    v(X1,X1,X2,X1) = v(X1,X2,X1,X1),
    sos_006 ).

cnf(c_0_20,axiom,
    u(X1,X2) = u(X2,X1),
    sos_004 ).

cnf(c_0_21,plain,
    ( ~ r(X10,X11,X12)
    | ~ r(X7,X8,X9)
    | ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(v(X1,X4,X7,X10),v(X2,X5,X8,X11),v(X3,X6,X9,X12)) ),
    inference(fof_simplification,[status(thm)],[sos_011]) ).

cnf(c_0_22,plain,
    ( ~ r(X1,X2,X3)
    | ~ r(X4,X5,X6)
    | r(v(X1,X1,X1,X4),v(X2,X2,X2,X5),v(X3,X3,X3,X6)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]) ).

cnf(c_0_23,axiom,
    r(b,a,a),
    sos_014 ).

cnf(c_0_24,axiom,
    u(X1,X1) = X1,
    sos_002 ).

cnf(c_0_25,axiom,
    v(X1,X1,X1,X2) = v(X1,X1,X2,X1),
    sos_005 ).

cnf(c_0_26,plain,
    v(X1,X1,X2,X1) = v(X2,X1,X1,X1),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_27,plain,
    v(X1,X1,X1,X2) = v(X2,X2,X2,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17]),c_0_17]) ).

cnf(c_0_28,plain,
    ( ~ r(X10,X11,X12)
    | ~ r(X7,X8,X9)
    | ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(v(X1,X4,X7,X10),v(X2,X5,X8,X11),v(X3,X6,X9,X12)) ),
    c_0_21 ).

cnf(c_0_29,axiom,
    r(a,a,b),
    sos_012 ).

cnf(c_0_30,plain,
    ( ~ r(X7,X8,X9)
    | ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(m(X1,X4,X7),m(X2,X5,X8),m(X3,X6,X9)) ),
    inference(fof_simplification,[status(thm)],[sos_009]) ).

cnf(c_0_31,plain,
    ( ~ r(X1,X2,X3)
    | r(v(X1,X1,X1,b),v(X2,X2,X2,a),v(X3,X3,X3,a)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_32,axiom,
    r(a,b,a),
    sos_013 ).

cnf(c_0_33,plain,
    v(X1,X1,X1,X1) = X1,
    inference(rw,[status(thm)],[c_0_24,c_0_17]) ).

cnf(c_0_34,plain,
    v(X1,X1,X1,X2) = v(X2,X1,X1,X1),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_35,plain,
    v(X1,X1,X2,X1) = v(X2,X2,X2,X1),
    inference(spm,[status(thm)],[c_0_27,c_0_25]) ).

cnf(c_0_36,plain,
    ( ~ r(X1,X4,X7)
    | ~ r(X2,X5,X8)
    | ~ r(X3,X6,X9)
    | r(v(X1,X2,X3,b),v(X4,X5,X6,a),v(X7,X8,X9,a)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_23]) ).

cnf(c_0_37,plain,
    ( ~ r(X1,X4,X7)
    | ~ r(X2,X5,X8)
    | ~ r(X3,X6,X9)
    | r(v(X1,X2,X3,a),v(X4,X5,X6,a),v(X7,X8,X9,b)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_38,plain,
    ( ~ r(X7,X8,X9)
    | ~ r(X4,X5,X6)
    | ~ r(X1,X2,X3)
    | r(m(X1,X4,X7),m(X2,X5,X8),m(X3,X6,X9)) ),
    c_0_30 ).

cnf(c_0_39,plain,
    r(v(a,a,a,b),v(a,b,b,b),a),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).

cnf(c_0_40,plain,
    v(X1,X1,X1,X2) = v(X1,X2,X2,X2),
    inference(spm,[status(thm)],[c_0_26,c_0_35]) ).

cnf(c_0_41,plain,
    ( ~ r(X1,X3,X5)
    | ~ r(X2,X4,X6)
    | r(v(X1,X2,a,b),v(X3,X4,a,a),v(X5,X6,b,a)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_29]) ).

cnf(c_0_42,plain,
    ( ~ r(X1,X3,X5)
    | ~ r(X2,X4,X6)
    | r(v(X1,X2,b,a),v(X3,X4,a,a),v(X5,X6,a,b)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_23]) ).

cnf(c_0_43,plain,
    ( ~ r(X1,X3,X5)
    | ~ r(X2,X4,X6)
    | r(m(X1,X2,a),m(X3,X4,b),m(X5,X6,a)) ),
    inference(spm,[status(thm)],[c_0_38,c_0_32]) ).

cnf(c_0_44,plain,
    r(v(a,a,a,b),v(a,a,a,b),a),
    inference(rw,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,axiom,
    m(X1,X2,X2) = X1,
    sos_001 ).

cnf(c_0_46,plain,
    ( ~ r(X1,X2,X3)
    | r(v(X1,a,a,b),v(X2,a,a,a),v(X3,b,b,a)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_29]) ).

cnf(c_0_47,plain,
    v(X1,X2,X2,X2) = v(X2,X1,X1,X1),
    inference(spm,[status(thm)],[c_0_34,c_0_40]) ).

cnf(c_0_48,plain,
    ( ~ r(X1,X2,X3)
    | r(v(X1,a,b,a),v(X2,b,a,a),v(X3,a,a,b)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_32]) ).

cnf(c_0_49,plain,
    ( ~ r(X1,X2,X3)
    | r(m(X1,v(a,a,a,b),a),m(X2,v(a,a,a,b),b),X3) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).

cnf(c_0_50,plain,
    r(v(a,a,a,b),v(a,a,a,b),v(a,b,b,a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_32]),c_0_47]),c_0_40]) ).

cnf(c_0_51,axiom,
    m(X1,X1,X2) = X2,
    sos ).

cnf(c_0_52,plain,
    r(v(a,a,a,b),v(a,a,a,b),v(b,a,a,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_29]),c_0_25]),c_0_19]),c_0_25]) ).

cnf(c_0_53,plain,
    ( ~ r(X1,X3,X5)
    | ~ r(X2,X4,X6)
    | r(v(X1,X2,a,a),v(X3,X4,b,a),v(X5,X6,a,b)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_32]) ).

cnf(c_0_54,plain,
    r(a,b,v(a,b,b,a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_51]) ).

cnf(c_0_55,plain,
    r(a,b,v(b,a,a,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_52]),c_0_51]),c_0_51]) ).

cnf(c_0_56,plain,
    ( ~ r(X1,X2,X3)
    | r(v(X1,a,a,a),v(X2,b,b,a),v(X3,a,a,b)) ),
    inference(spm,[status(thm)],[c_0_53,c_0_32]) ).

cnf(c_0_57,plain,
    ( ~ r(X1,X2,X3)
    | r(X1,X2,m(X3,v(a,b,b,a),a)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_54]),c_0_45]),c_0_45]) ).

cnf(c_0_58,plain,
    r(v(b,a,a,b),a,v(a,b,b,a)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_23]),c_0_33]) ).

cnf(c_0_59,plain,
    ( ~ r(X1,X3,X5)
    | ~ r(X2,X4,X6)
    | r(v(X1,X2,a,b),v(X3,X4,b,a),v(X5,X6,a,a)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_32]) ).

cnf(c_0_60,plain,
    ( ~ r(X1,X2,X3)
    | r(X1,X2,m(X3,v(b,a,a,b),a)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_55]),c_0_45]),c_0_45]) ).

cnf(c_0_61,plain,
    r(a,v(a,b,b,a),v(b,a,a,b)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_29]),c_0_33]) ).

cnf(c_0_62,plain,
    ( ~ r(X1,X3,X5)
    | ~ r(X2,X4,X6)
    | r(m(X1,X2,b),m(X3,X4,a),m(X5,X6,a)) ),
    inference(spm,[status(thm)],[c_0_38,c_0_23]) ).

cnf(c_0_63,plain,
    r(v(b,a,a,b),a,a),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_51]) ).

cnf(c_0_64,plain,
    ( ~ r(X1,X2,X3)
    | r(v(X1,a,a,b),v(X2,b,b,a),v(X3,a,a,a)) ),
    inference(spm,[status(thm)],[c_0_59,c_0_32]) ).

cnf(c_0_65,plain,
    r(a,v(a,b,b,a),a),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_51]) ).

cnf(c_0_66,plain,
    ( ~ r(X1,X2,X3)
    | r(m(X1,v(b,a,a,b),b),X2,X3) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_45]),c_0_45]) ).

cnf(c_0_67,plain,
    r(v(b,a,a,b),v(a,b,b,a),a),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_23]),c_0_33]) ).

cnf(c_0_68,plain,
    ( ~ r(X1,X2,X3)
    | r(X1,m(X2,v(a,b,b,a),b),X3) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_65]),c_0_45]),c_0_45]) ).

cnf(c_0_69,plain,
    r(b,v(a,b,b,a),a),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_51]) ).

cnf(c_0_70,plain,
    r(b,b,a),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_51]) ).

cnf(c_0_71,negated_conjecture,
    ~ r(a,a,a),
    inference(fof_simplification,[status(thm)],[goals]) ).

cnf(c_0_72,plain,
    ( ~ r(X1,X2,X3)
    | r(m(X1,b,a),X2,X3) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_70]),c_0_45]),c_0_45]) ).

cnf(c_0_73,negated_conjecture,
    ~ r(a,a,a),
    c_0_71 ).

cnf(c_0_74,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_23]),c_0_51]),c_0_73]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG441-1 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.40  % Computer : n004.cluster.edu
% 0.11/10.40  % Model    : x86_64 x86_64
% 0.11/10.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.40  % Memory   : 8046.5625MB
% 0.11/10.40  % OS       : Linux 6.8.0-71-generic
% 0.11/10.40  % CPULimit : 300
% 0.11/10.40  % WCLimit  : 300
% 0.11/10.40  % DateTime : Mon Sep 21 13:21:15 UTC 2026
% 0.16/10.40  % CPUTime  : 
% 0.16/10.40  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/10.44  Running first-order theorem proving
% 0.16/10.44  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
% 18.60/13.27  % Version: 3.5.1
% 18.60/13.27  % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.60/13.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.60/13.27  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.60/13.27  % Starting new_bool_3 with 300s (1) cores
% 18.60/13.27  % Starting new_bool_1 with 300s (1) cores
% 18.60/13.27  % Starting sh5l with 300s (1) cores
% 18.60/13.27  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3226034 completed with status 0
% 18.60/13.27  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.60/13.27  % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.60/13.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.60/13.27  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.60/13.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.60/13.27  % No SInE strategy applied
% 18.60/13.27  % Search class: FHUSM-FFSS33-SFFFFFNN
% 18.60/13.27  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.60/13.27  % Starting SubtermCWHack with 136s (1) cores
% 18.60/13.27  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.60/13.27  % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 18.60/13.27  % Starting new_bool_3 with 136s (1) cores
% 18.60/13.27  % Starting new_bool_1 with 136s (1) cores
% 18.60/13.27  % new_bool_3 with pid 3226042 completed with status 0
% 18.60/13.27  % Result found by new_bool_3
% 18.60/13.27  % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.60/13.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.60/13.27  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.60/13.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.60/13.27  % No SInE strategy applied
% 18.60/13.27  % Search class: FHUSM-FFSS33-SFFFFFNN
% 18.60/13.27  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.60/13.27  % Starting SubtermCWHack with 136s (1) cores
% 18.60/13.27  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.60/13.27  % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 18.60/13.27  % Starting new_bool_3 with 136s (1) cores
% 18.60/13.27  % Preprocessing time       : 0.001 s
% 18.60/13.27  % Presaturation interreduction done
% 18.60/13.27  
% 18.60/13.27  % Proof found!
% 18.60/13.27  % SZS status Unsatisfiable
% 18.60/13.27  % SZS output start CNFRefutation
% See solution above
% 18.60/13.27  % Parsed axioms                        : 16
% 18.60/13.27  % Removed by relevancy pruning/SinE    : 0
% 18.60/13.27  % Initial clauses                      : 16
% 18.60/13.27  % Removed in clause preprocessing      : 1
% 18.60/13.27  % Initial clauses in saturation        : 15
% 18.60/13.27  % Processed clauses                    : 1636
% 18.60/13.27  % ...of these trivial                  : 314
% 18.60/13.27  % ...subsumed                          : 251
% 18.60/13.27  % ...remaining for further processing  : 1071
% 18.60/13.27  % Other redundant clauses eliminated   : 0
% 18.60/13.27  % Clauses deleted for lack of memory   : 0
% 18.60/13.27  % Backward-subsumed                    : 0
% 18.60/13.27  % Backward-rewritten                   : 1
% 18.60/13.27  % Generated clauses                    : 258278
% 18.60/13.27  % ...of the previous two non-redundant : 256334
% 18.60/13.27  % ...aggressively subsumed             : 0
% 18.60/13.27  % Contextual simplify-reflections      : 0
% 18.60/13.27  % Paramodulations                      : 258278
% 18.60/13.27  % Factorizations                       : 0
% 18.60/13.27  % NegExts                              : 0
% 18.60/13.27  % Equation resolutions                 : 0
% 18.60/13.27  % Disequality decompositions           : 0
% 18.60/13.27  % Total rewrite steps                  : 80854
% 18.60/13.27  % ...of those cached                   : 80230
% 18.60/13.27  % Propositional unsat checks           : 0
% 18.60/13.27  %    Propositional check models        : 0
% 18.60/13.27  %    Propositional check unsatisfiable : 0
% 18.60/13.27  %    Propositional clauses             : 0
% 18.60/13.27  %    Propositional clauses after purity: 0
% 18.60/13.27  %    Propositional unsat core size     : 0
% 18.60/13.27  %    Propositional preprocessing time  : 0.000
% 18.60/13.27  %    Propositional encoding time       : 0.000
% 18.60/13.27  %    Propositional solver time         : 0.000
% 18.60/13.27  %    Success case prop preproc time    : 0.000
% 18.60/13.27  %    Success case prop encoding time   : 0.000
% 18.60/13.27  %    Success case prop solver time     : 0.000
% 18.60/13.27  % Current number of processed clauses  : 1056
% 18.60/13.27  %    Positive orientable unit clauses  : 622
% 18.60/13.27  %    Positive unorientable unit clauses: 16
% 18.60/13.27  %    Negative unit clauses             : 1
% 18.60/13.27  %    Non-unit-clauses                  : 417
% 18.60/13.27  % Current number of unprocessed clauses: 254715
% 18.60/13.27  % ...number of literals in the above   : 299253
% 18.60/13.27  % Current number of archived formulas  : 0
% 18.60/13.27  % Current number of archived clauses   : 16
% 18.60/13.27  % Clause-clause subsumption calls (NU) : 63786
% 18.60/13.27  % Rec. Clause-clause subsumption calls : 62909
% 18.60/13.27  % Non-unit clause-clause subsumptions  : 155
% 18.60/13.27  % Unit Clause-clause subsumption calls : 4248
% 18.60/13.27  % Rewrite failures with RHS unbound    : 0
% 18.60/13.27  % BW rewrite match attempts            : 6076
% 18.60/13.27  % BW rewrite match successes           : 101
% 18.60/13.27  % Condensation attempts                : 0
% 18.60/13.27  % Condensation successes               : 0
% 18.60/13.27  % Termbank termtop insertions          : 7639244
% 18.60/13.27  % Search garbage collected termcells   : 19
% 18.60/13.27  
% 18.60/13.27  % -------------------------------------------------
% 18.60/13.27  % User time                : 2.499 s
% 18.60/13.27  % System time              : 0.206 s
% 18.60/13.27  % Total time               : 2.706 s
% 18.60/13.27  % Maximum resident set size: 3640 pages
% 18.60/13.27  
% 18.60/13.27  % -------------------------------------------------
% 18.60/13.27  % User time                : 12.822 s
% 18.60/13.27  % System time              : 0.670 s
% 18.60/13.27  % Total time               : 13.492 s
% 18.60/13.27  % Maximum resident set size: 4608 pages
% 18.60/13.27  % E exiting
%------------------------------------------------------------------------------