↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET640+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.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 02:14:51 PM UTC 2026

% Result   : Theorem 0.12s 0.45s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   48 (  12 unt;   0 def)
%            Number of atoms       :  194 (   0 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  239 (  93   ~;  91   |;  20   &)
%                                         (   5 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-2 aty)
%            Number of variables   :   87 (   2 sgn  43   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p13,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ( ilf_type(X2,set_type)
            & ~ empty(X2) )
         => ( ilf_type(X1,member_type(X2))
          <=> member(X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p13) ).

fof(p12,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ( ilf_type(power_set(X1),set_type)
        & ~ empty(power_set(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12) ).

fof(p19,axiom,
    ! [X1] : ilf_type(X1,set_type),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p19) ).

fof(p8,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( ilf_type(X2,subset_type(X1))
          <=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8) ).

fof(p4,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( ! [X4] :
                ( ilf_type(X4,relation_type(X1,X2))
               => ilf_type(X4,subset_type(cross_product(X1,X2))) )
            & ! [X3] :
                ( ilf_type(X3,subset_type(cross_product(X1,X2)))
               => ilf_type(X3,relation_type(X1,X2)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4) ).

fof(prove_relset_1_2,conjecture,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,set_type)
             => ! [X4] :
                  ( ilf_type(X4,relation_type(X2,X3))
                 => ( subset(X1,X4)
                   => subset(X1,cross_product(X2,X3)) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_relset_1_2) ).

fof(p6,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( subset(X1,X2)
          <=> ! [X3] :
                ( ilf_type(X3,set_type)
               => ( member(X3,X1)
                 => member(X3,X2) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6) ).

fof(p11,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( member(X1,power_set(X2))
          <=> ! [X3] :
                ( ilf_type(X3,set_type)
               => ( member(X3,X1)
                 => member(X3,X2) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11) ).

fof(c_0_8,plain,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ( ilf_type(X2,set_type)
            & ~ empty(X2) )
         => ( ilf_type(X1,member_type(X2))
          <=> member(X1,X2) ) ) ),
    inference(fof_simplification,[status(thm)],[p13]) ).

fof(c_0_9,plain,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ( ilf_type(power_set(X1),set_type)
        & ~ empty(power_set(X1)) ) ),
    inference(fof_simplification,[status(thm)],[p12]) ).

fof(c_0_10,plain,
    ! [X41,X42] :
      ( ( ~ ilf_type(X41,set_type)
        | ~ ilf_type(X42,set_type)
        | empty(X42)
        | ilf_type(X41,member_type(X42))
        | ~ member(X41,X42) )
      & ( ~ ilf_type(X41,set_type)
        | ~ ilf_type(X42,set_type)
        | empty(X42)
        | member(X41,X42)
        | ~ ilf_type(X41,member_type(X42)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).

fof(c_0_11,plain,
    ! [X59] : ilf_type(X59,set_type),
    inference(variable_rename,[status(thm)],[p19]) ).

fof(c_0_12,plain,
    ! [X31,X32] :
      ( ( ~ ilf_type(X31,set_type)
        | ~ ilf_type(X32,set_type)
        | ilf_type(X32,subset_type(X31))
        | ~ ilf_type(X32,member_type(power_set(X31))) )
      & ( ~ ilf_type(X31,set_type)
        | ~ ilf_type(X32,set_type)
        | ilf_type(X32,member_type(power_set(X31)))
        | ~ ilf_type(X32,subset_type(X31)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p8])])])])]) ).

fof(c_0_13,plain,
    ! [X40] :
      ( ( ~ ilf_type(X40,set_type)
        | ilf_type(power_set(X40),set_type) )
      & ( ~ ilf_type(X40,set_type)
        | ~ empty(power_set(X40)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

cnf(c_0_14,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,member_type(X2))
    | empty(X2)
    | member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ilf_type(X1,set_type),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    ( ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X1,subset_type(X2))
    | ilf_type(X1,member_type(power_set(X2))) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ empty(power_set(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_18,plain,
    ! [X18,X19,X20,X21] :
      ( ( ~ ilf_type(X18,set_type)
        | ~ ilf_type(X19,set_type)
        | ilf_type(X21,subset_type(cross_product(X18,X19)))
        | ~ ilf_type(X21,relation_type(X18,X19)) )
      & ( ~ ilf_type(X18,set_type)
        | ~ ilf_type(X19,set_type)
        | ilf_type(X20,relation_type(X18,X19))
        | ~ ilf_type(X20,subset_type(cross_product(X18,X19))) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p4])])])])]) ).

cnf(c_0_19,plain,
    ( ~ ilf_type(X2,member_type(X1))
    | member(X2,X1)
    | empty(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).

cnf(c_0_20,plain,
    ( ~ ilf_type(X1,subset_type(X2))
    | ilf_type(X1,member_type(power_set(X2))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_15])]) ).

cnf(c_0_21,plain,
    ~ empty(power_set(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15])]) ).

cnf(c_0_22,plain,
    ( ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X1,relation_type(X2,X3))
    | ilf_type(X1,subset_type(cross_product(X2,X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_23,negated_conjecture,
    ~ ! [X1] :
        ( ilf_type(X1,set_type)
       => ! [X2] :
            ( ilf_type(X2,set_type)
           => ! [X3] :
                ( ilf_type(X3,set_type)
               => ! [X4] :
                    ( ilf_type(X4,relation_type(X2,X3))
                   => ( subset(X1,X4)
                     => subset(X1,cross_product(X2,X3)) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[prove_relset_1_2]) ).

fof(c_0_24,plain,
    ! [X25,X26,X27] :
      ( ( ~ ilf_type(X25,set_type)
        | ~ ilf_type(X26,set_type)
        | subset(X25,X26)
        | ~ member(esk4_2(X25,X26),X26) )
      & ( ~ ilf_type(X25,set_type)
        | ~ ilf_type(X26,set_type)
        | subset(X25,X26)
        | member(esk4_2(X25,X26),X25) )
      & ( ~ ilf_type(X25,set_type)
        | ~ ilf_type(X26,set_type)
        | subset(X25,X26)
        | ilf_type(esk4_2(X25,X26),set_type) )
      & ( ~ ilf_type(X25,set_type)
        | ~ ilf_type(X26,set_type)
        | member(X27,X26)
        | ~ member(X27,X25)
        | ~ ilf_type(X27,set_type)
        | ~ subset(X25,X26) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p6])])])])])]) ).

fof(c_0_25,plain,
    ! [X36,X37,X38] :
      ( ( ~ ilf_type(X36,set_type)
        | ~ ilf_type(X37,set_type)
        | member(X36,power_set(X37))
        | ~ member(esk6_2(X36,X37),X37) )
      & ( ~ ilf_type(X36,set_type)
        | ~ ilf_type(X37,set_type)
        | member(X36,power_set(X37))
        | member(esk6_2(X36,X37),X36) )
      & ( ~ ilf_type(X36,set_type)
        | ~ ilf_type(X37,set_type)
        | member(X36,power_set(X37))
        | ilf_type(esk6_2(X36,X37),set_type) )
      & ( ~ ilf_type(X36,set_type)
        | ~ ilf_type(X37,set_type)
        | member(X38,X37)
        | ~ member(X38,X36)
        | ~ ilf_type(X38,set_type)
        | ~ member(X36,power_set(X37)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p11])])])])])]) ).

cnf(c_0_26,plain,
    ( ~ ilf_type(X1,subset_type(X2))
    | member(X1,power_set(X2)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_27,plain,
    ( ~ ilf_type(X1,relation_type(X2,X3))
    | ilf_type(X1,subset_type(cross_product(X2,X3))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_15]),c_0_15])]) ).

fof(c_0_28,negated_conjecture,
    ( ~ subset(esk12_0,cross_product(esk13_0,esk14_0))
    & subset(esk12_0,esk15_0)
    & ilf_type(esk15_0,relation_type(esk13_0,esk14_0))
    & ilf_type(esk14_0,set_type)
    & ilf_type(esk13_0,set_type)
    & ilf_type(esk12_0,set_type) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).

cnf(c_0_29,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ member(esk4_2(X1,X2),X2)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_30,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ member(X3,X1)
    | ~ ilf_type(X3,set_type)
    | ~ member(X1,power_set(X2))
    | member(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_31,plain,
    ( ~ ilf_type(X1,relation_type(X2,X3))
    | member(X1,power_set(cross_product(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    ilf_type(esk15_0,relation_type(esk13_0,esk14_0)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    ~ subset(esk12_0,cross_product(esk13_0,esk14_0)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,plain,
    ( ~ member(esk4_2(X1,X2),X2)
    | subset(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_15]),c_0_15])]) ).

cnf(c_0_35,plain,
    ( ~ member(X1,X3)
    | ~ member(X3,power_set(X2))
    | member(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_15]),c_0_15]),c_0_15])]) ).

cnf(c_0_36,negated_conjecture,
    member(esk15_0,power_set(cross_product(esk13_0,esk14_0))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ member(X3,X1)
    | ~ ilf_type(X3,set_type)
    | ~ subset(X1,X2)
    | member(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_38,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | subset(X1,X2)
    | member(esk4_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_39,negated_conjecture,
    ~ member(esk4_2(esk12_0,cross_product(esk13_0,esk14_0)),cross_product(esk13_0,esk14_0)),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ member(X1,esk15_0)
    | member(X1,cross_product(esk13_0,esk14_0)) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_41,plain,
    ( ~ subset(X3,X2)
    | ~ member(X1,X3)
    | member(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_15]),c_0_15]),c_0_15])]) ).

cnf(c_0_42,negated_conjecture,
    subset(esk12_0,esk15_0),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_43,plain,
    ( subset(X1,X2)
    | member(esk4_2(X1,X2),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_15]),c_0_15])]) ).

cnf(c_0_44,negated_conjecture,
    ~ member(esk4_2(esk12_0,cross_product(esk13_0,esk14_0)),esk15_0),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ member(X1,esk12_0)
    | member(X1,esk15_0) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    member(esk4_2(esk12_0,cross_product(esk13_0,esk14_0)),esk12_0),
    inference(spm,[status(thm)],[c_0_33,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET640+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n007.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 05:28:36 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.42  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
% 0.12/0.45  % Version: 3.5.1
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % Starting sh5l with 300s (1) cores
% 0.12/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 268023 completed with status 0
% 0.12/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45  % No SInE strategy applied
% 0.12/0.45  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.12/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.12/0.45  % Starting new_bool_3 with 189s (1) cores
% 0.12/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.12/0.45  % 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 268037 completed with status 0
% 0.12/0.45  % Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45  % No SInE strategy applied
% 0.12/0.45  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.12/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.12/0.45  % Starting new_bool_3 with 189s (1) cores
% 0.12/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.12/0.45  % Preprocessing time       : 0.002 s
% 0.12/0.45  % Presaturation interreduction done
% 0.12/0.45  
% 0.12/0.45  % Proof found!
% 0.12/0.45  % SZS status Theorem
% 0.12/0.45  % SZS output start CNFRefutation
% See solution above
% 0.12/0.45  % Parsed axioms                        : 20
% 0.12/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.45  % Initial clauses                      : 47
% 0.12/0.45  % Removed in clause preprocessing      : 0
% 0.12/0.45  % Initial clauses in saturation        : 47
% 0.12/0.45  % Processed clauses                    : 142
% 0.12/0.45  % ...of these trivial                  : 12
% 0.12/0.45  % ...subsumed                          : 18
% 0.12/0.45  % ...remaining for further processing  : 112
% 0.12/0.45  % Other redundant clauses eliminated   : 1
% 0.12/0.45  % Clauses deleted for lack of memory   : 0
% 0.12/0.45  % Backward-subsumed                    : 1
% 0.12/0.45  % Backward-rewritten                   : 5
% 0.12/0.45  % Generated clauses                    : 107
% 0.12/0.45  % ...of the previous two non-redundant : 93
% 0.12/0.45  % ...aggressively subsumed             : 0
% 0.12/0.45  % Contextual simplify-reflections      : 1
% 0.12/0.45  % Paramodulations                      : 106
% 0.12/0.45  % Factorizations                       : 0
% 0.12/0.45  % NegExts                              : 0
% 0.12/0.45  % Equation resolutions                 : 1
% 0.12/0.45  % Disequality decompositions           : 0
% 0.12/0.45  % Total rewrite steps                  : 105
% 0.12/0.45  % ...of those cached                   : 79
% 0.12/0.45  % Propositional unsat checks           : 0
% 0.12/0.45  %    Propositional check models        : 0
% 0.12/0.45  %    Propositional check unsatisfiable : 0
% 0.12/0.45  %    Propositional clauses             : 0
% 0.12/0.45  %    Propositional clauses after purity: 0
% 0.12/0.45  %    Propositional unsat core size     : 0
% 0.12/0.45  %    Propositional preprocessing time  : 0.000
% 0.12/0.45  %    Propositional encoding time       : 0.000
% 0.12/0.45  %    Propositional solver time         : 0.000
% 0.12/0.45  %    Success case prop preproc time    : 0.000
% 0.12/0.45  %    Success case prop encoding time   : 0.000
% 0.12/0.45  %    Success case prop solver time     : 0.000
% 0.12/0.45  % Current number of processed clauses  : 72
% 0.12/0.45  %    Positive orientable unit clauses  : 23
% 0.12/0.45  %    Positive unorientable unit clauses: 0
% 0.12/0.45  %    Negative unit clauses             : 6
% 0.12/0.45  %    Non-unit-clauses                  : 43
% 0.12/0.45  % Current number of unprocessed clauses: 31
% 0.12/0.45  % ...number of literals in the above   : 78
% 0.12/0.45  % Current number of archived formulas  : 0
% 0.12/0.45  % Current number of archived clauses   : 39
% 0.12/0.45  % Clause-clause subsumption calls (NU) : 238
% 0.12/0.45  % Rec. Clause-clause subsumption calls : 194
% 0.12/0.45  % Non-unit clause-clause subsumptions  : 7
% 0.12/0.45  % Unit Clause-clause subsumption calls : 81
% 0.12/0.45  % Rewrite failures with RHS unbound    : 0
% 0.12/0.45  % BW rewrite match attempts            : 17
% 0.12/0.45  % BW rewrite match successes           : 5
% 0.12/0.45  % Condensation attempts                : 0
% 0.12/0.45  % Condensation successes               : 0
% 0.12/0.45  % Termbank termtop insertions          : 5745
% 0.12/0.45  % Search garbage collected termcells   : 1046
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.016 s
% 0.12/0.45  % System time              : 0.001 s
% 0.12/0.45  % Total time               : 0.017 s
% 0.12/0.45  % Maximum resident set size: 3608 pages
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.053 s
% 0.12/0.45  % System time              : 0.013 s
% 0.12/0.45  % Total time               : 0.066 s
% 0.12/0.45  % Maximum resident set size: 4864 pages
% 0.12/0.45  % E exiting
%------------------------------------------------------------------------------