TSTP Solution File: SWV252-2 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWV252-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:43:52 EDT 2023

% Result   : Unsatisfiable 1.81s 0.67s
% Output   : CNFRefutation 1.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   60 (  35 unt;   0 nHn;  33 RR)
%            Number of literals    :   91 (  15 equ;  34 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :  126 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Message_Oanalz__subset__iff_0,axiom,
    ( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Message_Oanalz__subset__iff_0) ).

cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
    ( c_lessequals(X2,X2,X1)
    | ~ class_Orderings_Oorder(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).

cnf(clsarity_set_2,axiom,
    class_Orderings_Oorder(tc_set(X1)),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',clsarity_set_2) ).

cnf(cls_Set_OUn__subset__iff_0,axiom,
    ( c_lessequals(X1,X4,tc_set(X3))
    | ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_OUn__subset__iff_0) ).

cnf(cls_Message_Oparts__synth_0,axiom,
    c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Message_Oparts__synth_0) ).

cnf(cls_Message_Oparts__analz_0,axiom,
    c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Message_Oparts__analz_0) ).

cnf(cls_Set_Oinsert__subset_2,axiom,
    ( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X4,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_Oinsert__subset_2) ).

cnf(cls_Set_OUn__subset__iff_1,axiom,
    ( c_lessequals(X2,X4,tc_set(X3))
    | ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_OUn__subset__iff_1) ).

cnf(cls_Message_Oanalz__parts_0,axiom,
    c_Message_Oanalz(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Message_Oanalz__parts_0) ).

cnf(cls_Message_Oparts__subset__iff_0,axiom,
    ( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Message_Oparts__subset__iff_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_conjecture_0) ).

cnf(cls_Set_Oinsert__subset_1,axiom,
    ( c_lessequals(X2,X4,tc_set(X3))
    | ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_Oinsert__subset_1) ).

cnf(cls_Set_OUn__subset__iff_2,axiom,
    ( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_OUn__subset__iff_2) ).

cnf(cls_Set_OUn__Diff__cancel2_0,axiom,
    c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_OUn__Diff__cancel2_0) ).

cnf(cls_Set_Oinsert__subset_0,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_Oinsert__subset_0) ).

cnf(cls_Set_Osubset__antisym_0,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_Osubset__antisym_0) ).

cnf(cls_Set_OUn__Diff__cancel_0,axiom,
    c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Set_OUn__Diff__cancel_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_conjecture_1) ).

cnf(cls_Message_Oparts__subset__iff_1,axiom,
    ( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/tmp/tmp.irhHlnnwa4/E---3.1_18748.p',cls_Message_Oparts__subset__iff_1) ).

cnf(c_0_19,axiom,
    ( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
    cls_Message_Oanalz__subset__iff_0 ).

cnf(c_0_20,axiom,
    ( c_lessequals(X2,X2,X1)
    | ~ class_Orderings_Oorder(X1) ),
    cls_Orderings_Oorder__class_Oaxioms__1_0 ).

cnf(c_0_21,axiom,
    class_Orderings_Oorder(tc_set(X1)),
    clsarity_set_2 ).

cnf(c_0_22,axiom,
    ( c_lessequals(X1,X4,tc_set(X3))
    | ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
    cls_Set_OUn__subset__iff_0 ).

cnf(c_0_23,plain,
    c_lessequals(X1,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_24,axiom,
    c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
    cls_Message_Oparts__synth_0 ).

cnf(c_0_25,axiom,
    c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
    cls_Message_Oparts__analz_0 ).

cnf(c_0_26,axiom,
    ( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X4,X2,tc_set(X3)) ),
    cls_Set_Oinsert__subset_2 ).

cnf(c_0_27,axiom,
    ( c_lessequals(X2,X4,tc_set(X3))
    | ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
    cls_Set_OUn__subset__iff_1 ).

cnf(c_0_28,plain,
    c_lessequals(X1,c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,plain,
    c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))) = c_union(c_Message_Oparts(X1),c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,axiom,
    c_Message_Oanalz(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
    cls_Message_Oanalz__parts_0 ).

cnf(c_0_31,axiom,
    ( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    cls_Message_Oparts__subset__iff_0 ).

cnf(c_0_32,plain,
    ( c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3))
    | ~ c_in(X1,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_21])]) ).

cnf(c_0_33,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
    cls_conjecture_0 ).

cnf(c_0_34,axiom,
    ( c_lessequals(X2,X4,tc_set(X3))
    | ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
    cls_Set_Oinsert__subset_1 ).

cnf(c_0_35,axiom,
    ( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X2,tc_set(X3)) ),
    cls_Set_OUn__subset__iff_2 ).

cnf(c_0_36,plain,
    c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_21])]) ).

cnf(c_0_37,plain,
    c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_21])]) ).

cnf(c_0_38,axiom,
    c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
    cls_Set_OUn__Diff__cancel2_0 ).

cnf(c_0_39,plain,
    c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))),tc_set(tc_Message_Omsg)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).

cnf(c_0_40,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
    cls_Set_Oinsert__subset_0 ).

cnf(c_0_41,plain,
    c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_21])]) ).

cnf(c_0_42,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    cls_Set_Osubset__antisym_0 ).

cnf(c_0_43,negated_conjecture,
    c_lessequals(c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_44,plain,
    c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_21])]) ).

cnf(c_0_45,plain,
    ( c_lessequals(c_union(X1,X2,X3),c_union(X4,X1,X3),tc_set(X3))
    | ~ c_lessequals(X2,c_union(X4,X1,X3),tc_set(X3)) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_46,plain,
    c_lessequals(c_minus(X1,X2,tc_set(X3)),c_union(X1,X2,X3),tc_set(X3)),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_47,axiom,
    c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
    cls_Set_OUn__Diff__cancel_0 ).

cnf(c_0_48,plain,
    c_lessequals(X1,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_31,c_0_39]) ).

cnf(c_0_49,plain,
    c_in(X1,c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_50,negated_conjecture,
    c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg) = c_Message_Osynth(c_Message_Oanalz(v_H)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).

cnf(c_0_51,plain,
    c_lessequals(c_union(X1,X2,X3),c_union(X2,X1,X3),tc_set(X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).

cnf(c_0_52,plain,
    ( c_lessequals(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X2))),tc_set(tc_Message_Omsg))
    | ~ c_in(X1,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X2))),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_26,c_0_48]) ).

cnf(c_0_53,negated_conjecture,
    c_in(v_X,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_54,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    cls_conjecture_1 ).

cnf(c_0_55,plain,
    c_union(X1,X2,X3) = c_union(X2,X1,X3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_51]),c_0_51])]) ).

cnf(c_0_56,axiom,
    ( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    cls_Message_Oparts__subset__iff_1 ).

cnf(c_0_57,negated_conjecture,
    c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_58,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_29]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWV252-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n019.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Oct  3 03:32:06 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  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/tmp/tmp.irhHlnnwa4/E---3.1_18748.p
% 1.81/0.67  # Version: 3.1pre001
% 1.81/0.67  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.67  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.67  # Starting new_bool_3 with 300s (1) cores
% 1.81/0.67  # Starting new_bool_1 with 300s (1) cores
% 1.81/0.67  # Starting sh5l with 300s (1) cores
% 1.81/0.67  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18826 completed with status 0
% 1.81/0.67  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.81/0.67  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.67  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.67  # No SInE strategy applied
% 1.81/0.67  # Search class: FHUSM-FFMF31-MFFFFFNN
% 1.81/0.67  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.81/0.67  # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 1.81/0.67  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.81/0.67  # Starting new_bool_3 with 136s (1) cores
% 1.81/0.67  # Starting new_bool_1 with 136s (1) cores
% 1.81/0.67  # Starting sh5l with 136s (1) cores
% 1.81/0.67  # H----_042_B03_F1_AE_Q4_SP_S2S with pid 18830 completed with status 0
% 1.81/0.67  # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 1.81/0.67  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.67  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.67  # No SInE strategy applied
% 1.81/0.67  # Search class: FHUSM-FFMF31-MFFFFFNN
% 1.81/0.67  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.81/0.67  # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 1.81/0.67  # Preprocessing time       : 0.001 s
% 1.81/0.67  
% 1.81/0.67  # Proof found!
% 1.81/0.67  # SZS status Unsatisfiable
% 1.81/0.67  # SZS output start CNFRefutation
% See solution above
% 1.81/0.67  # Parsed axioms                        : 19
% 1.81/0.67  # Removed by relevancy pruning/SinE    : 0
% 1.81/0.67  # Initial clauses                      : 19
% 1.81/0.67  # Removed in clause preprocessing      : 0
% 1.81/0.67  # Initial clauses in saturation        : 19
% 1.81/0.67  # Processed clauses                    : 1457
% 1.81/0.67  # ...of these trivial                  : 264
% 1.81/0.67  # ...subsumed                          : 468
% 1.81/0.67  # ...remaining for further processing  : 725
% 1.81/0.67  # Other redundant clauses eliminated   : 0
% 1.81/0.67  # Clauses deleted for lack of memory   : 0
% 1.81/0.67  # Backward-subsumed                    : 6
% 1.81/0.67  # Backward-rewritten                   : 30
% 1.81/0.67  # Generated clauses                    : 21671
% 1.81/0.67  # ...of the previous two non-redundant : 14624
% 1.81/0.67  # ...aggressively subsumed             : 0
% 1.81/0.67  # Contextual simplify-reflections      : 0
% 1.81/0.67  # Paramodulations                      : 21671
% 1.81/0.67  # Factorizations                       : 0
% 1.81/0.67  # NegExts                              : 0
% 1.81/0.67  # Equation resolutions                 : 0
% 1.81/0.67  # Total rewrite steps                  : 16442
% 1.81/0.67  # Propositional unsat checks           : 0
% 1.81/0.67  #    Propositional check models        : 0
% 1.81/0.67  #    Propositional check unsatisfiable : 0
% 1.81/0.67  #    Propositional clauses             : 0
% 1.81/0.67  #    Propositional clauses after purity: 0
% 1.81/0.67  #    Propositional unsat core size     : 0
% 1.81/0.67  #    Propositional preprocessing time  : 0.000
% 1.81/0.67  #    Propositional encoding time       : 0.000
% 1.81/0.67  #    Propositional solver time         : 0.000
% 1.81/0.67  #    Success case prop preproc time    : 0.000
% 1.81/0.67  #    Success case prop encoding time   : 0.000
% 1.81/0.67  #    Success case prop solver time     : 0.000
% 1.81/0.67  # Current number of processed clauses  : 689
% 1.81/0.67  #    Positive orientable unit clauses  : 561
% 1.81/0.67  #    Positive unorientable unit clauses: 9
% 1.81/0.67  #    Negative unit clauses             : 1
% 1.81/0.67  #    Non-unit-clauses                  : 118
% 1.81/0.67  # Current number of unprocessed clauses: 13017
% 1.81/0.67  # ...number of literals in the above   : 15433
% 1.81/0.67  # Current number of archived formulas  : 0
% 1.81/0.67  # Current number of archived clauses   : 36
% 1.81/0.67  # Clause-clause subsumption calls (NU) : 4926
% 1.81/0.67  # Rec. Clause-clause subsumption calls : 4317
% 1.81/0.67  # Non-unit clause-clause subsumptions  : 470
% 1.81/0.67  # Unit Clause-clause subsumption calls : 613
% 1.81/0.67  # Rewrite failures with RHS unbound    : 0
% 1.81/0.67  # BW rewrite match attempts            : 8754
% 1.81/0.67  # BW rewrite match successes           : 196
% 1.81/0.67  # Condensation attempts                : 0
% 1.81/0.67  # Condensation successes               : 0
% 1.81/0.67  # Termbank termtop insertions          : 360154
% 1.81/0.67  
% 1.81/0.67  # -------------------------------------------------
% 1.81/0.67  # User time                : 0.219 s
% 1.81/0.67  # System time              : 0.014 s
% 1.81/0.67  # Total time               : 0.232 s
% 1.81/0.67  # Maximum resident set size: 1648 pages
% 1.81/0.67  
% 1.81/0.67  # -------------------------------------------------
% 1.81/0.67  # User time                : 1.120 s
% 1.81/0.67  # System time              : 0.027 s
% 1.81/0.67  # Total time               : 1.147 s
% 1.81/0.67  # Maximum resident set size: 1688 pages
% 1.81/0.67  % E---3.1 exiting
% 1.81/0.67  % E---3.1 exiting
%------------------------------------------------------------------------------