TSTP Solution File: SWW368+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWW368+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n024.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 20:11:09 EDT 2023

% Result   : Theorem 41.22s 7.31s
% Output   : CNFRefutation 41.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   50 (  30 unt;   0 def)
%            Number of atoms       :   83 (  25 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   59 (  26   ~;  23   |;   5   &)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;   7 con; 0-3 aty)
%            Number of variables   :  116 (  15 sgn;  63   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_Collect__empty__eq,axiom,
    ! [X42,X9] :
      ( hAPP(c_Set_OCollect(X9),X42) = c_Orderings_Obot__class_Obot(tc_fun(X9,tc_HOL_Obool))
    <=> ! [X3] : ~ hBOOL(hAPP(X42,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',fact_Collect__empty__eq) ).

fof(fact_Collect__def,axiom,
    ! [X42,X9] : hAPP(c_Set_OCollect(X9),X42) = X42,
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',fact_Collect__def) ).

fof(help_c__COMBK__1,axiom,
    ! [X280,X279,X9,X25] : hAPP(hAPP(c_COMBK(X25,X9),X279),X280) = X279,
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',help_c__COMBK__1) ).

fof(fact_Collect__mem__eq,axiom,
    ! [X11,X9] : hAPP(c_Set_OCollect(X9),hAPP(hAPP(c_COMBC(X9,tc_fun(X9,tc_HOL_Obool),tc_HOL_Obool),c_member(X9)),X11)) = X11,
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',fact_Collect__mem__eq) ).

fof(conj_5,hypothesis,
    ~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',conj_5) ).

fof(fact_mem__def,axiom,
    ! [X11,X10,X9] :
      ( hBOOL(hAPP(hAPP(c_member(X9),X10),X11))
    <=> hBOOL(hAPP(X11,X10)) ),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',fact_mem__def) ).

fof(help_c__COMBC__1,axiom,
    ! [X27,X41,X42,X9,X18,X7] : hAPP(hAPP(hAPP(c_COMBC(X7,X18,X9),X42),X41),X27) = hAPP(hAPP(X42,X27),X41),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',help_c__COMBC__1) ).

fof(fact_insert__subset,axiom,
    ! [X15,X11,X10,X9] :
      ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X9,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X9),X10),X11)),X15))
    <=> ( hBOOL(hAPP(hAPP(c_member(X9),X10),X15))
        & hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X9,tc_HOL_Obool)),X11),X15)) ) ),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',fact_insert__subset) ).

fof(conj_6,conjecture,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',conj_6) ).

fof(fact_imageI,axiom,
    ! [X2,X7,X11,X10,X9] :
      ( hBOOL(hAPP(hAPP(c_member(X9),X10),X11))
     => hBOOL(hAPP(hAPP(c_member(X7),hAPP(X2,X10)),hAPP(c_Set_Oimage(X9,X7,X2),X11))) ),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',fact_imageI) ).

fof(conj_1,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),v_G),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',conj_1) ).

fof(conj_4,hypothesis,
    hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),v_U)),
    file('/export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p',conj_4) ).

fof(c_0_12,plain,
    ! [X42,X9] :
      ( hAPP(c_Set_OCollect(X9),X42) = c_Orderings_Obot__class_Obot(tc_fun(X9,tc_HOL_Obool))
    <=> ! [X3] : ~ hBOOL(hAPP(X42,X3)) ),
    inference(fof_simplification,[status(thm)],[fact_Collect__empty__eq]) ).

fof(c_0_13,plain,
    ! [X3530,X3531,X3532,X3533,X3535] :
      ( ( hAPP(c_Set_OCollect(X3531),X3530) != c_Orderings_Obot__class_Obot(tc_fun(X3531,tc_HOL_Obool))
        | ~ hBOOL(hAPP(X3530,X3532)) )
      & ( hBOOL(hAPP(X3533,esk127_1(X3533)))
        | hAPP(c_Set_OCollect(X3535),X3533) = c_Orderings_Obot__class_Obot(tc_fun(X3535,tc_HOL_Obool)) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).

fof(c_0_14,plain,
    ! [X3536,X3537] : hAPP(c_Set_OCollect(X3537),X3536) = X3536,
    inference(variable_rename,[status(thm)],[fact_Collect__def]) ).

fof(c_0_15,plain,
    ! [X2991,X2992,X2993,X2994] : hAPP(hAPP(c_COMBK(X2994,X2993),X2992),X2991) = X2992,
    inference(variable_rename,[status(thm)],[help_c__COMBK__1]) ).

cnf(c_0_16,plain,
    ( hBOOL(hAPP(X1,esk127_1(X1)))
    | hAPP(c_Set_OCollect(X2),X1) = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_HOL_Obool)) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    hAPP(c_Set_OCollect(X1),X2) = X2,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_18,plain,
    ! [X3547,X3548] : hAPP(c_Set_OCollect(X3548),hAPP(hAPP(c_COMBC(X3548,tc_fun(X3548,tc_HOL_Obool),tc_HOL_Obool),c_member(X3548)),X3547)) = X3547,
    inference(variable_rename,[status(thm)],[fact_Collect__mem__eq]) ).

fof(c_0_19,hypothesis,
    ~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
    inference(fof_simplification,[status(thm)],[conj_5]) ).

fof(c_0_20,plain,
    ! [X1227,X1228,X1229] :
      ( ( ~ hBOOL(hAPP(hAPP(c_member(X1229),X1228),X1227))
        | hBOOL(hAPP(X1227,X1228)) )
      & ( ~ hBOOL(hAPP(X1227,X1228))
        | hBOOL(hAPP(hAPP(c_member(X1229),X1228),X1227)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mem__def])]) ).

cnf(c_0_21,plain,
    hAPP(hAPP(c_COMBK(X1,X2),X3),X4) = X3,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    ( X1 = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_HOL_Obool))
    | hBOOL(hAPP(X1,esk127_1(X1))) ),
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

fof(c_0_23,plain,
    ! [X3465,X3466,X3467,X3468,X3469,X3470] : hAPP(hAPP(hAPP(c_COMBC(X3470,X3469,X3468),X3467),X3466),X3465) = hAPP(hAPP(X3467,X3465),X3466),
    inference(variable_rename,[status(thm)],[help_c__COMBC__1]) ).

cnf(c_0_24,plain,
    hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,hypothesis,
    ~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,plain,
    ( hBOOL(hAPP(hAPP(c_member(X3),X2),X1))
    | ~ hBOOL(hAPP(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_27,plain,
    ( hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool)),X2) = X3
    | hBOOL(X3) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_21]) ).

fof(c_0_28,plain,
    ! [X1286,X1287,X1288,X1289] :
      ( ( hBOOL(hAPP(hAPP(c_member(X1289),X1288),X1286))
        | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1289),X1288),X1287)),X1286)) )
      & ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),X1287),X1286))
        | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1289),X1288),X1287)),X1286)) )
      & ( ~ hBOOL(hAPP(hAPP(c_member(X1289),X1288),X1286))
        | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),X1287),X1286))
        | hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1289),X1288),X1287)),X1286)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_insert__subset])])]) ).

cnf(c_0_29,plain,
    hAPP(hAPP(hAPP(c_COMBC(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),X5),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_30,plain,
    hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2) = X2,
    inference(rw,[status(thm)],[c_0_24,c_0_17]) ).

fof(c_0_31,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])]) ).

cnf(c_0_32,hypothesis,
    ~ hBOOL(hAPP(v_G,hAPP(v_mgt__call,v_pn))),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_33,plain,
    ( X1 = X2
    | hBOOL(X1)
    | hBOOL(X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_27]) ).

cnf(c_0_34,plain,
    ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4)),X3))
    | ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
    | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X4),X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_35,plain,
    hAPP(hAPP(c_member(X1),X2),X3) = hAPP(X3,X2),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_36,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_37,hypothesis,
    ( X1 = hAPP(v_G,hAPP(v_mgt__call,v_pn))
    | hBOOL(X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

fof(c_0_38,plain,
    ! [X358,X359,X360,X361,X362] :
      ( ~ hBOOL(hAPP(hAPP(c_member(X362),X361),X360))
      | hBOOL(hAPP(hAPP(c_member(X359),hAPP(X358,X361)),hAPP(c_Set_Oimage(X362,X359,X358),X360))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_imageI])]) ).

cnf(c_0_39,plain,
    ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X3)),X4))
    | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X3),X4))
    | ~ hBOOL(hAPP(X4,X2)) ),
    inference(rw,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,negated_conjecture,
    hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U)) = hAPP(v_G,hAPP(v_mgt__call,v_pn)),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),v_G),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
    inference(split_conjunct,[status(thm)],[conj_1]) ).

cnf(c_0_42,plain,
    ( hBOOL(hAPP(hAPP(c_member(X4),hAPP(X5,X2)),hAPP(c_Set_Oimage(X1,X4,X5),X3)))
    | ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_43,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(v_mgt__call,v_pn))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_32]) ).

cnf(c_0_44,plain,
    ( hBOOL(hAPP(X3,X2))
    | ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_45,hypothesis,
    hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),v_U)),
    inference(split_conjunct,[status(thm)],[conj_4]) ).

cnf(c_0_46,plain,
    ( hBOOL(hAPP(hAPP(c_Set_Oimage(X1,X2,X3),X4),hAPP(X3,X5)))
    | ~ hBOOL(hAPP(X4,X5)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_35]),c_0_35]) ).

cnf(c_0_47,hypothesis,
    hAPP(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(v_mgt__call,v_pn)) = hAPP(v_G,hAPP(v_mgt__call,v_pn)),
    inference(spm,[status(thm)],[c_0_43,c_0_37]) ).

cnf(c_0_48,hypothesis,
    hBOOL(hAPP(v_U,v_pn)),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_49,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : SWW368+1 : TPTP v8.1.2. Released v5.2.0.
% 0.09/0.12  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n024.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 22:48:11 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.99/1.24  Running first-order model finding
% 0.99/1.24  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.SwciqtLuuO/E---3.1_23211.p
% 41.22/7.31  # Version: 3.1pre001
% 41.22/7.31  # Preprocessing class: FMLMSMSMSSSNFFN.
% 41.22/7.31  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.22/7.31  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 41.22/7.31  # Starting new_bool_3 with 300s (1) cores
% 41.22/7.31  # Starting new_bool_1 with 300s (1) cores
% 41.22/7.31  # Starting sh5l with 300s (1) cores
% 41.22/7.31  # new_bool_1 with pid 23299 completed with status 0
% 41.22/7.31  # Result found by new_bool_1
% 41.22/7.31  # Preprocessing class: FMLMSMSMSSSNFFN.
% 41.22/7.31  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.22/7.31  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 41.22/7.31  # Starting new_bool_3 with 300s (1) cores
% 41.22/7.31  # Starting new_bool_1 with 300s (1) cores
% 41.22/7.31  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 41.22/7.31  # Search class: FGHSM-SMLM33-DFFFFFNN
% 41.22/7.31  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 41.22/7.31  # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 41.22/7.31  # SAT001_MinMin_p005000_rr with pid 23301 completed with status 0
% 41.22/7.31  # Result found by SAT001_MinMin_p005000_rr
% 41.22/7.31  # Preprocessing class: FMLMSMSMSSSNFFN.
% 41.22/7.31  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.22/7.31  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 41.22/7.31  # Starting new_bool_3 with 300s (1) cores
% 41.22/7.31  # Starting new_bool_1 with 300s (1) cores
% 41.22/7.31  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 41.22/7.31  # Search class: FGHSM-SMLM33-DFFFFFNN
% 41.22/7.31  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 41.22/7.31  # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 41.22/7.31  # Preprocessing time       : 0.056 s
% 41.22/7.31  # Presaturation interreduction done
% 41.22/7.31  
% 41.22/7.31  # Proof found!
% 41.22/7.31  # SZS status Theorem
% 41.22/7.31  # SZS output start CNFRefutation
% See solution above
% 41.22/7.31  # Parsed axioms                        : 5230
% 41.22/7.31  # Removed by relevancy pruning/SinE    : 3454
% 41.22/7.31  # Initial clauses                      : 2701
% 41.22/7.31  # Removed in clause preprocessing      : 70
% 41.22/7.31  # Initial clauses in saturation        : 2631
% 41.22/7.31  # Processed clauses                    : 11941
% 41.22/7.31  # ...of these trivial                  : 430
% 41.22/7.31  # ...subsumed                          : 5749
% 41.22/7.31  # ...remaining for further processing  : 5762
% 41.22/7.31  # Other redundant clauses eliminated   : 4122
% 41.22/7.31  # Clauses deleted for lack of memory   : 0
% 41.22/7.31  # Backward-subsumed                    : 257
% 41.22/7.31  # Backward-rewritten                   : 272
% 41.22/7.31  # Generated clauses                    : 211437
% 41.22/7.31  # ...of the previous two non-redundant : 198737
% 41.22/7.31  # ...aggressively subsumed             : 0
% 41.22/7.31  # Contextual simplify-reflections      : 31
% 41.22/7.31  # Paramodulations                      : 207254
% 41.22/7.31  # Factorizations                       : 17
% 41.22/7.31  # NegExts                              : 0
% 41.22/7.31  # Equation resolutions                 : 4187
% 41.22/7.31  # Total rewrite steps                  : 33421
% 41.22/7.31  # Propositional unsat checks           : 1
% 41.22/7.31  #    Propositional check models        : 0
% 41.22/7.31  #    Propositional check unsatisfiable : 0
% 41.22/7.31  #    Propositional clauses             : 0
% 41.22/7.31  #    Propositional clauses after purity: 0
% 41.22/7.31  #    Propositional unsat core size     : 0
% 41.22/7.31  #    Propositional preprocessing time  : 0.000
% 41.22/7.31  #    Propositional encoding time       : 0.336
% 41.22/7.31  #    Propositional solver time         : 0.127
% 41.22/7.31  #    Success case prop preproc time    : 0.000
% 41.22/7.31  #    Success case prop encoding time   : 0.000
% 41.22/7.31  #    Success case prop solver time     : 0.000
% 41.22/7.31  # Current number of processed clauses  : 3062
% 41.22/7.31  #    Positive orientable unit clauses  : 652
% 41.22/7.31  #    Positive unorientable unit clauses: 48
% 41.22/7.31  #    Negative unit clauses             : 349
% 41.22/7.31  #    Non-unit-clauses                  : 2013
% 41.22/7.31  # Current number of unprocessed clauses: 169871
% 41.22/7.31  # ...number of literals in the above   : 478880
% 41.22/7.31  # Current number of archived formulas  : 0
% 41.22/7.31  # Current number of archived clauses   : 2494
% 41.22/7.31  # Clause-clause subsumption calls (NU) : 1060276
% 41.22/7.31  # Rec. Clause-clause subsumption calls : 558250
% 41.22/7.31  # Non-unit clause-clause subsumptions  : 3994
% 41.22/7.31  # Unit Clause-clause subsumption calls : 41443
% 41.22/7.31  # Rewrite failures with RHS unbound    : 172
% 41.22/7.31  # BW rewrite match attempts            : 13947
% 41.22/7.31  # BW rewrite match successes           : 737
% 41.22/7.31  # Condensation attempts                : 0
% 41.22/7.31  # Condensation successes               : 0
% 41.22/7.31  # Termbank termtop insertions          : 5816808
% 41.22/7.31  
% 41.22/7.31  # -------------------------------------------------
% 41.22/7.31  # User time                : 5.588 s
% 41.22/7.31  # System time              : 0.185 s
% 41.22/7.31  # Total time               : 5.773 s
% 41.22/7.31  # Maximum resident set size: 17304 pages
% 41.22/7.31  
% 41.22/7.31  # -------------------------------------------------
% 41.22/7.31  # User time                : 5.746 s
% 41.22/7.31  # System time              : 0.199 s
% 41.22/7.31  # Total time               : 5.945 s
% 41.22/7.31  # Maximum resident set size: 9460 pages
% 41.22/7.31  % E---3.1 exiting
%------------------------------------------------------------------------------