↑ 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  : SWV727-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n006.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:06:46 PM UTC 2026

% Result   : Unsatisfiable 35.79s 10.68s
% Output   : CNFRefutation 35.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   54 (  31 unt;   4 nHn;  35 RR)
%            Number of literals    :   87 (  18 equ;  33 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   20 (  20 usr;   9 con; 0-3 aty)
%            Number of variables   :   74 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).

cnf(cls_mem__def_1,axiom,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).

cnf(cls_conjecture_5,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

cnf(cls_invKey__K_0,axiom,
    ( ~ c_in(X1,c_Message_OsymKeys,tc_nat)
    | c_Message_OinvKey(X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_invKey__K_0) ).

cnf(cls_equalityI_0,axiom,
    ( ~ c_lessequals(X1,X2,tc_fun(X3,tc_bool))
    | ~ c_lessequals(X2,X1,tc_fun(X3,tc_bool))
    | X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_equalityI_0) ).

cnf(cls_keysFor__parts__insert_0,axiom,
    ( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(X4,X3,tc_Message_Omsg))),tc_nat)
    | ~ c_in(X4,c_Message_Osynth(c_Message_Oanalz(X2)),tc_Message_Omsg)
    | c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(X3,X2,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat)
    | c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(X1)),c_Message_Oparts(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_keysFor__parts__insert_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_K,c_Message_OsymKeys,tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_analz__increasing_0,axiom,
    c_lessequals(X1,c_Message_Oanalz(X1),tc_fun(tc_Message_Omsg,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_analz__increasing_0) ).

cnf(cls_analz__analz__Un_0,axiom,
    c_Message_Oanalz(c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oanalz(X1),X2,tc_fun(tc_Message_Omsg,tc_bool))) = c_Message_Oanalz(c_Lattices_Oupper__semilattice__class_Osup(X1,X2,tc_fun(tc_Message_Omsg,tc_bool))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_analz__analz__Un_0) ).

cnf(cls_Un__absorb_0,axiom,
    c_Lattices_Oupper__semilattice__class_Osup(X1,X1,tc_fun(X2,tc_bool)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Un__absorb_0) ).

cnf(cls_analz__idem_0,axiom,
    c_Message_Oanalz(c_Message_Oanalz(X1)) = c_Message_Oanalz(X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_analz__idem_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_6,negated_conjecture,
    ( ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat)
    | c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_Un__upper2_0,axiom,
    c_lessequals(X1,c_Lattices_Oupper__semilattice__class_Osup(X2,X1,tc_fun(X3,tc_bool)),tc_fun(X3,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Un__upper2_0) ).

cnf(cls_usedI_0,axiom,
    ( ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)
    | c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_usedI_0) ).

cnf(cls_parts__analz_0,axiom,
    c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_parts__analz_0) ).

cnf(c_0_17,plain,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).

cnf(c_0_18,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).

cnf(c_0_19,plain,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    c_0_17 ).

cnf(c_0_20,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),tc_nat),
    cls_conjecture_5 ).

cnf(c_0_21,plain,
    ( ~ c_in(X1,c_Message_OsymKeys,tc_nat)
    | c_Message_OinvKey(X1) = X1 ),
    inference(fof_simplification,[status(thm)],[cls_invKey__K_0]) ).

cnf(c_0_22,plain,
    ( ~ c_lessequals(X1,X2,tc_fun(X3,tc_bool))
    | ~ c_lessequals(X2,X1,tc_fun(X3,tc_bool))
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[cls_equalityI_0]) ).

cnf(c_0_23,plain,
    ( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(X4,X3,tc_Message_Omsg))),tc_nat)
    | ~ c_in(X4,c_Message_Osynth(c_Message_Oanalz(X2)),tc_Message_Omsg)
    | c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(X3,X2,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat)
    | c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(X1)),c_Message_Oparts(X2),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_keysFor__parts__insert_0]) ).

cnf(c_0_24,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    c_0_18 ).

cnf(c_0_25,negated_conjecture,
    hBOOL(hAPP(c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),v_K)),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,plain,
    ( ~ c_in(X1,c_Message_OsymKeys,tc_nat)
    | c_Message_OinvKey(X1) = X1 ),
    c_0_21 ).

cnf(c_0_27,negated_conjecture,
    c_in(v_K,c_Message_OsymKeys,tc_nat),
    cls_conjecture_0 ).

cnf(c_0_28,plain,
    ( ~ c_lessequals(X1,X2,tc_fun(X3,tc_bool))
    | ~ c_lessequals(X2,X1,tc_fun(X3,tc_bool))
    | X1 = X2 ),
    c_0_22 ).

cnf(c_0_29,axiom,
    c_lessequals(X1,c_Message_Oanalz(X1),tc_fun(tc_Message_Omsg,tc_bool)),
    cls_analz__increasing_0 ).

cnf(c_0_30,axiom,
    c_Message_Oanalz(c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oanalz(X1),X2,tc_fun(tc_Message_Omsg,tc_bool))) = c_Message_Oanalz(c_Lattices_Oupper__semilattice__class_Osup(X1,X2,tc_fun(tc_Message_Omsg,tc_bool))),
    cls_analz__analz__Un_0 ).

cnf(c_0_31,axiom,
    c_Lattices_Oupper__semilattice__class_Osup(X1,X1,tc_fun(X2,tc_bool)) = X1,
    cls_Un__absorb_0 ).

cnf(c_0_32,axiom,
    c_Message_Oanalz(c_Message_Oanalz(X1)) = c_Message_Oanalz(X1),
    cls_analz__idem_0 ).

cnf(c_0_33,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg),
    cls_conjecture_2 ).

cnf(c_0_34,negated_conjecture,
    ( ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat)
    | c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).

cnf(c_0_35,negated_conjecture,
    ~ c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_36,plain,
    ( ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(X4,X3,tc_Message_Omsg))),tc_nat)
    | ~ c_in(X4,c_Message_Osynth(c_Message_Oanalz(X2)),tc_Message_Omsg)
    | c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(X3,X2,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat)
    | c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(X1)),c_Message_Oparts(X2),tc_Message_Omsg) ),
    c_0_23 ).

cnf(c_0_37,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),X1),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_38,negated_conjecture,
    c_Message_OinvKey(v_K) = v_K,
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_39,plain,
    ( ~ c_lessequals(c_Message_Oanalz(X1),X1,tc_fun(tc_Message_Omsg,tc_bool))
    | c_Message_Oanalz(X1) = X1 ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_40,plain,
    c_Message_Oanalz(c_Lattices_Oupper__semilattice__class_Osup(X1,c_Message_Oanalz(X1),tc_fun(tc_Message_Omsg,tc_bool))) = c_Message_Oanalz(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).

cnf(c_0_41,axiom,
    c_lessequals(X1,c_Lattices_Oupper__semilattice__class_Osup(X2,X1,tc_fun(X3,tc_bool)),tc_fun(X3,tc_bool)),
    cls_Un__upper2_0 ).

cnf(c_0_42,negated_conjecture,
    hBOOL(hAPP(c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),v_X)),
    inference(spm,[status(thm)],[c_0_19,c_0_33]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat)
    | c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg) ),
    c_0_34 ).

cnf(c_0_44,negated_conjecture,
    ~ c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg),
    c_0_35 ).

cnf(c_0_45,plain,
    ( ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)
    | c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_usedI_0]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ c_in(v_X,c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg)
    | c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Message_Oparts(X1),tc_Message_Omsg)
    | c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),X1,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_47,plain,
    c_Lattices_Oupper__semilattice__class_Osup(X1,c_Message_Oanalz(X1),tc_fun(tc_Message_Omsg,tc_bool)) = c_Message_Oanalz(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).

cnf(c_0_48,axiom,
    c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
    cls_parts__analz_0 ).

cnf(c_0_49,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),X1),
    inference(spm,[status(thm)],[c_0_24,c_0_42]) ).

cnf(c_0_50,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat),
    inference(sr,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    ( ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)
    | c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    c_0_45 ).

cnf(c_0_52,negated_conjecture,
    c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_48]),c_0_32]),c_0_49])]),c_0_50]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_44]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV727-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.37  % Computer : n006.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Mon Sep 21 09:22:06 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.42  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
% 35.79/10.68  % Version: 3.5.1
% 35.79/10.68  % Preprocessing class: FSLSSMSMSSSNFFN.
% 35.79/10.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.79/10.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.79/10.68  % Starting new_bool_3 with 300s (1) cores
% 35.79/10.68  % Starting new_bool_1 with 300s (1) cores
% 35.79/10.68  % Starting sh5l with 300s (1) cores
% 35.79/10.68  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2510448 completed with status 0
% 35.79/10.68  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 35.79/10.68  % Preprocessing class: FSLSSMSMSSSNFFN.
% 35.79/10.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.79/10.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.79/10.68  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.79/10.68  % No SInE strategy applied
% 35.79/10.68  % Search class: FGHSM-FSLM31-DFFFFFNN
% 35.79/10.68  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.79/10.68  % Starting SubtermCWHack with 136s (1) cores
% 35.79/10.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 35.79/10.68  % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 354s (1) cores
% 35.79/10.68  % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 35.79/10.68  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 35.79/10.68  % C07_19_nc_SAT001_MinMin_p005000_rr with pid 2510457 completed with status 0
% 35.79/10.68  % Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 35.79/10.68  % Preprocessing class: FSLSSMSMSSSNFFN.
% 35.79/10.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.79/10.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.79/10.68  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.79/10.68  % No SInE strategy applied
% 35.79/10.68  % Search class: FGHSM-FSLM31-DFFFFFNN
% 35.79/10.68  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.79/10.68  % Starting SubtermCWHack with 136s (1) cores
% 35.79/10.68  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 35.79/10.68  % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 354s (1) cores
% 35.79/10.68  % Preprocessing time       : 0.005 s
% 35.79/10.68  % Presaturation interreduction done
% 35.79/10.68  
% 35.79/10.68  % Proof found!
% 35.79/10.68  % SZS status Unsatisfiable
% 35.79/10.68  % SZS output start CNFRefutation
% See solution above
% 35.79/10.68  % Parsed axioms                        : 493
% 35.79/10.68  % Removed by relevancy pruning/SinE    : 0
% 35.79/10.68  % Initial clauses                      : 493
% 35.79/10.68  % Removed in clause preprocessing      : 3
% 35.79/10.68  % Initial clauses in saturation        : 490
% 35.79/10.68  % Processed clauses                    : 35537
% 35.79/10.68  % ...of these trivial                  : 939
% 35.79/10.68  % ...subsumed                          : 29085
% 35.79/10.68  % ...remaining for further processing  : 5513
% 35.79/10.68  % Other redundant clauses eliminated   : 329
% 35.79/10.68  % Clauses deleted for lack of memory   : 0
% 35.79/10.68  % Backward-subsumed                    : 712
% 35.79/10.68  % Backward-rewritten                   : 193
% 35.79/10.68  % Generated clauses                    : 343890
% 35.79/10.68  % ...of the previous two non-redundant : 306438
% 35.79/10.68  % ...aggressively subsumed             : 0
% 35.79/10.68  % Contextual simplify-reflections      : 6
% 35.79/10.68  % Paramodulations                      : 343525
% 35.79/10.68  % Factorizations                       : 3
% 35.79/10.68  % NegExts                              : 0
% 35.79/10.68  % Equation resolutions                 : 362
% 35.79/10.68  % Disequality decompositions           : 0
% 35.79/10.68  % Total rewrite steps                  : 232473
% 35.79/10.68  % ...of those cached                   : 204163
% 35.79/10.68  % Propositional unsat checks           : 1
% 35.79/10.68  %    Propositional check models        : 0
% 35.79/10.68  %    Propositional check unsatisfiable : 0
% 35.79/10.68  %    Propositional clauses             : 0
% 35.79/10.68  %    Propositional clauses after purity: 0
% 35.79/10.68  %    Propositional unsat core size     : 0
% 35.79/10.68  %    Propositional preprocessing time  : 0.000
% 35.79/10.68  %    Propositional encoding time       : 0.430
% 35.79/10.68  %    Propositional solver time         : 0.242
% 35.79/10.68  %    Success case prop preproc time    : 0.000
% 35.79/10.68  %    Success case prop encoding time   : 0.000
% 35.79/10.68  %    Success case prop solver time     : 0.000
% 35.79/10.68  % Current number of processed clauses  : 4235
% 35.79/10.68  %    Positive orientable unit clauses  : 1252
% 35.79/10.68  %    Positive unorientable unit clauses: 35
% 35.79/10.68  %    Negative unit clauses             : 1049
% 35.79/10.68  %    Non-unit-clauses                  : 1899
% 35.79/10.68  % Current number of unprocessed clauses: 267603
% 35.79/10.68  % ...number of literals in the above   : 569373
% 35.79/10.68  % Current number of archived formulas  : 0
% 35.79/10.68  % Current number of archived clauses   : 1279
% 35.79/10.68  % Clause-clause subsumption calls (NU) : 682276
% 35.79/10.68  % Rec. Clause-clause subsumption calls : 544869
% 35.79/10.68  % Non-unit clause-clause subsumptions  : 5978
% 35.79/10.68  % Unit Clause-clause subsumption calls : 274705
% 35.79/10.68  % Rewrite failures with RHS unbound    : 124
% 35.79/10.68  % BW rewrite match attempts            : 10828
% 35.79/10.68  % BW rewrite match successes           : 451
% 35.79/10.68  % Condensation attempts                : 0
% 35.79/10.68  % Condensation successes               : 0
% 35.79/10.68  % Termbank termtop insertions          : 9724627
% 35.79/10.68  % Search garbage collected termcells   : 792
% 35.79/10.68  
% 35.79/10.68  % -------------------------------------------------
% 35.79/10.68  % User time                : 4.880 s
% 35.79/10.68  % System time              : 0.204 s
% 35.79/10.68  % Total time               : 5.084 s
% 35.79/10.68  % Maximum resident set size: 4496 pages
% 35.79/10.68  
% 35.79/10.68  % -------------------------------------------------
% 35.79/10.68  % User time                : 24.470 s
% 35.79/10.68  % System time              : 0.889 s
% 35.79/10.68  % Total time               : 25.359 s
% 35.79/10.68  % Maximum resident set size: 4864 pages
% 35.79/10.68  % E exiting
%------------------------------------------------------------------------------