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

View Problem - Process Solution

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

% Computer : n003.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:44:00 EDT 2023

% Result   : Unsatisfiable 0.16s 0.45s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   61 (  25 unt;  14 nHn;  38 RR)
%            Number of literals    :  111 (  14 equ;  42 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   6 con; 0-3 aty)
%            Number of variables   :  105 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Set_OsubsetD_0) ).

cnf(cls_Message_OkeysFor__mono_0,axiom,
    ( c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_OkeysFor__mono_0) ).

cnf(cls_Message_Oparts__insert__subset__Un_0,axiom,
    ( c_lessequals(c_Message_Oparts(c_insert(X1,X3,tc_Message_Omsg)),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg))
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_Oparts__insert__subset__Un_0) ).

cnf(cls_Message_Oparts__Un_0,axiom,
    c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_Oparts__Un_0) ).

cnf(cls_Set_OUn__iff_1,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Set_OUn__iff_1) ).

cnf(cls_Message_OkeysFor__Un_0,axiom,
    c_Message_OkeysFor(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_OkeysFor__Un_0) ).

cnf(cls_Set_OUn__iff_0,axiom,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Set_OUn__iff_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_conjecture_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_conjecture_2) ).

cnf(cls_Set_OUn__iff_2,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Set_OUn__iff_2) ).

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.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_Oparts__synth_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_conjecture_1) ).

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

cnf(cls_Event_OkeysFor__synth_H_1,axiom,
    ( c_in(X1,c_Message_OkeysFor(X2),tc_nat)
    | X1 = c_Message_OinvKey(v_sko__uhi(X2,X1))
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Event_OkeysFor__synth_H_1) ).

cnf(cls_Event_OkeysFor__synth_H_0,axiom,
    ( c_in(X1,c_Message_OkeysFor(X2),tc_nat)
    | c_in(c_Message_Omsg_OKey(v_sko__uhi(X2,X1)),X2,tc_Message_Omsg)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Event_OkeysFor__synth_H_0) ).

cnf(cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0,axiom,
    c_Message_OinvKey(c_Message_OinvKey(X1)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0) ).

cnf(cls_Message_Oanalz__subset__parts_0,axiom,
    c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_Oanalz__subset__parts_0) ).

cnf(cls_Message_Oanalz__conj__parts_0,axiom,
    ( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
    | ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_Message_Oanalz__conj__parts_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p',cls_conjecture_3) ).

cnf(c_0_19,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    cls_Set_OsubsetD_0 ).

cnf(c_0_20,axiom,
    ( c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    cls_Message_OkeysFor__mono_0 ).

cnf(c_0_21,axiom,
    ( c_lessequals(c_Message_Oparts(c_insert(X1,X3,tc_Message_Omsg)),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg))
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    cls_Message_Oparts__insert__subset__Un_0 ).

cnf(c_0_22,axiom,
    c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
    cls_Message_Oparts__Un_0 ).

cnf(c_0_23,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUn__iff_1 ).

cnf(c_0_24,axiom,
    c_Message_OkeysFor(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_nat),
    cls_Message_OkeysFor__Un_0 ).

cnf(c_0_25,axiom,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    cls_Set_OUn__iff_0 ).

cnf(c_0_26,plain,
    ( c_in(X1,c_Message_OkeysFor(X2),tc_nat)
    | ~ c_lessequals(X3,X2,tc_set(tc_Message_Omsg))
    | ~ c_in(X1,c_Message_OkeysFor(X3),tc_nat) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,plain,
    ( c_lessequals(c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),c_Message_Oparts(c_union(X3,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_in(X1,X3,tc_Message_Omsg) ),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,plain,
    ( c_in(X1,c_Message_OkeysFor(c_union(X2,X3,tc_Message_Omsg)),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(X2),tc_nat) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    ( c_in(X1,c_Message_OkeysFor(X2),tc_nat)
    | c_in(X1,c_Message_OkeysFor(X3),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_union(X2,X3,tc_Message_Omsg)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_25,c_0_24]) ).

cnf(c_0_30,plain,
    ( c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg))),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_insert(X4,X3,tc_Message_Omsg))),tc_nat)
    | ~ c_in(X4,X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat),
    cls_conjecture_0 ).

cnf(c_0_32,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),
    cls_conjecture_2 ).

cnf(c_0_33,plain,
    ( c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg))),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_28,c_0_22]) ).

cnf(c_0_34,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUn__iff_2 ).

cnf(c_0_35,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_36,plain,
    ( c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat)
    | c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X3)),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X3,X2,tc_Message_Omsg))),tc_nat) ),
    inference(spm,[status(thm)],[c_0_29,c_0_22]) ).

cnf(c_0_37,negated_conjecture,
    ( c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(X1,v_G,tc_Message_Omsg))),tc_nat)
    | ~ c_in(v_X,X1,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_38,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_G)),tc_nat),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_39,plain,
    ( c_in(X1,c_Message_OkeysFor(c_union(X2,X3,tc_Message_Omsg)),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(X3),tc_nat) ),
    inference(spm,[status(thm)],[c_0_34,c_0_24]) ).

cnf(c_0_40,plain,
    ( c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat)
    | c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Message_Osynth(X2))),tc_nat) ),
    inference(spm,[status(thm)],[c_0_29,c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    ( c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(X1)),tc_nat)
    | ~ c_in(v_X,X1,tc_Message_Omsg) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_42,plain,
    ( c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg))),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X3)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_39,c_0_22]) ).

cnf(c_0_43,negated_conjecture,
    ( c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(X1)),tc_nat)
    | c_in(v_K,c_Message_OkeysFor(c_Message_Osynth(X1)),tc_nat)
    | ~ c_in(v_X,c_Message_Osynth(X1),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_44,negated_conjecture,
    c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
    cls_conjecture_1 ).

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

cnf(c_0_46,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    inference(spm,[status(thm)],[c_0_32,c_0_42]) ).

cnf(c_0_47,axiom,
    ( c_in(X1,c_Message_OkeysFor(X2),tc_nat)
    | X1 = c_Message_OinvKey(v_sko__uhi(X2,X1))
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat) ),
    cls_Event_OkeysFor__synth_H_1 ).

cnf(c_0_48,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_nat),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).

cnf(c_0_49,axiom,
    ( c_in(X1,c_Message_OkeysFor(X2),tc_nat)
    | c_in(c_Message_Omsg_OKey(v_sko__uhi(X2,X1)),X2,tc_Message_Omsg)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Osynth(X2)),tc_nat) ),
    cls_Event_OkeysFor__synth_H_0 ).

cnf(c_0_50,axiom,
    c_Message_OinvKey(c_Message_OinvKey(X1)) = X1,
    cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0 ).

cnf(c_0_51,negated_conjecture,
    ( c_Message_OinvKey(v_sko__uhi(c_Message_Oanalz(v_H),v_K)) = v_K
    | c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_52,negated_conjecture,
    ( c_in(c_Message_Omsg_OKey(v_sko__uhi(c_Message_Oanalz(v_H),v_K)),c_Message_Oanalz(v_H),tc_Message_Omsg)
    | c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_49,c_0_48]) ).

cnf(c_0_53,negated_conjecture,
    ( v_sko__uhi(c_Message_Oanalz(v_H),v_K) = c_Message_OinvKey(v_K)
    | c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,axiom,
    c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    cls_Message_Oanalz__subset__parts_0 ).

cnf(c_0_55,axiom,
    ( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
    | ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
    cls_Message_Oanalz__conj__parts_0 ).

cnf(c_0_56,negated_conjecture,
    ( c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(v_H),tc_Message_Omsg)
    | c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_57,negated_conjecture,
    ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg),
    cls_conjecture_3 ).

cnf(c_0_58,plain,
    ( c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Oanalz(X2)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_26,c_0_54]) ).

cnf(c_0_59,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : SWV276-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n003.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Oct  3 04:31:18 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order theorem proving
% 0.16/0.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/tmp/tmp.4OnN8Vp5JA/E---3.1_15273.p
% 0.16/0.45  # Version: 3.1pre001
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # Starting sh5l with 300s (1) cores
% 0.16/0.45  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15351 completed with status 0
% 0.16/0.45  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # No SInE strategy applied
% 0.16/0.45  # Search class: FGUSM-FFMF31-MFFFFFNN
% 0.16/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45  # Starting SAT001_MinMin_p005000_rr_RG with 338s (1) cores
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45  # Starting new_bool_3 with 254s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 254s (1) cores
% 0.16/0.45  # Starting sh5l with 254s (1) cores
% 0.16/0.45  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15357 completed with status 0
% 0.16/0.45  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # No SInE strategy applied
% 0.16/0.45  # Search class: FGUSM-FFMF31-MFFFFFNN
% 0.16/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45  # Starting SAT001_MinMin_p005000_rr_RG with 338s (1) cores
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45  # Preprocessing time       : 0.001 s
% 0.16/0.45  # Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  # Proof found!
% 0.16/0.45  # SZS status Unsatisfiable
% 0.16/0.45  # SZS output start CNFRefutation
% See solution above
% 0.16/0.45  # Parsed axioms                        : 19
% 0.16/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.45  # Initial clauses                      : 19
% 0.16/0.45  # Removed in clause preprocessing      : 0
% 0.16/0.45  # Initial clauses in saturation        : 19
% 0.16/0.45  # Processed clauses                    : 183
% 0.16/0.45  # ...of these trivial                  : 0
% 0.16/0.45  # ...subsumed                          : 33
% 0.16/0.45  # ...remaining for further processing  : 150
% 0.16/0.45  # Other redundant clauses eliminated   : 0
% 0.16/0.45  # Clauses deleted for lack of memory   : 0
% 0.16/0.45  # Backward-subsumed                    : 0
% 0.16/0.45  # Backward-rewritten                   : 4
% 0.16/0.45  # Generated clauses                    : 538
% 0.16/0.45  # ...of the previous two non-redundant : 477
% 0.16/0.45  # ...aggressively subsumed             : 0
% 0.16/0.45  # Contextual simplify-reflections      : 0
% 0.16/0.45  # Paramodulations                      : 538
% 0.16/0.45  # Factorizations                       : 0
% 0.16/0.45  # NegExts                              : 0
% 0.16/0.45  # Equation resolutions                 : 0
% 0.16/0.45  # Total rewrite steps                  : 137
% 0.16/0.45  # Propositional unsat checks           : 0
% 0.16/0.45  #    Propositional check models        : 0
% 0.16/0.45  #    Propositional check unsatisfiable : 0
% 0.16/0.45  #    Propositional clauses             : 0
% 0.16/0.45  #    Propositional clauses after purity: 0
% 0.16/0.45  #    Propositional unsat core size     : 0
% 0.16/0.45  #    Propositional preprocessing time  : 0.000
% 0.16/0.45  #    Propositional encoding time       : 0.000
% 0.16/0.45  #    Propositional solver time         : 0.000
% 0.16/0.45  #    Success case prop preproc time    : 0.000
% 0.16/0.45  #    Success case prop encoding time   : 0.000
% 0.16/0.45  #    Success case prop solver time     : 0.000
% 0.16/0.45  # Current number of processed clauses  : 127
% 0.16/0.45  #    Positive orientable unit clauses  : 33
% 0.16/0.45  #    Positive unorientable unit clauses: 0
% 0.16/0.45  #    Negative unit clauses             : 7
% 0.16/0.45  #    Non-unit-clauses                  : 87
% 0.16/0.45  # Current number of unprocessed clauses: 332
% 0.16/0.45  # ...number of literals in the above   : 540
% 0.16/0.45  # Current number of archived formulas  : 0
% 0.16/0.45  # Current number of archived clauses   : 23
% 0.16/0.45  # Clause-clause subsumption calls (NU) : 1522
% 0.16/0.45  # Rec. Clause-clause subsumption calls : 1231
% 0.16/0.45  # Non-unit clause-clause subsumptions  : 30
% 0.16/0.45  # Unit Clause-clause subsumption calls : 134
% 0.16/0.45  # Rewrite failures with RHS unbound    : 0
% 0.16/0.45  # BW rewrite match attempts            : 40
% 0.16/0.45  # BW rewrite match successes           : 1
% 0.16/0.45  # Condensation attempts                : 0
% 0.16/0.45  # Condensation successes               : 0
% 0.16/0.45  # Termbank termtop insertions          : 12584
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.013 s
% 0.16/0.45  # System time              : 0.004 s
% 0.16/0.45  # Total time               : 0.017 s
% 0.16/0.45  # Maximum resident set size: 1640 pages
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.076 s
% 0.16/0.45  # System time              : 0.008 s
% 0.16/0.45  # Total time               : 0.083 s
% 0.16/0.45  # Maximum resident set size: 1688 pages
% 0.16/0.45  % E---3.1 exiting
% 0.16/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------