↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n019.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 01:27:06 PM UTC 2026

% Result   : Theorem 0.14s 0.63s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   45 (  16 unt;   0 def)
%            Number of atoms       :  229 (   0 equ)
%            Maximal formula atoms :   22 (   5 avg)
%            Number of connectives :  310 ( 126   ~; 117   |;  59   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :  152 (  17 sgn  76   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t4_FOL,conjecture,
    ! [X1,X10,X11,X12,X13,X14,X15] :
      ( ( ~ greater(X13,X15)
        & greater(X13,X12)
        & ~ greater(X14,X12)
        & survival_chance(X1,X11,X13)
        & survival_chance(X1,X10,X12)
        & reorganization(X1,X14,X15)
        & organization(X1,X13)
        & organization(X1,X12) )
     => greater(X10,X11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_FOL) ).

fof(a6_FOL,hypothesis,
    ! [X1,X6,X7,X8,X9,X12,X13,X14,X15] :
      ( ( ~ greater(X13,X15)
        & greater(X13,X12)
        & ~ greater(X14,X12)
        & accountability(X1,X9,X13)
        & accountability(X1,X8,X12)
        & reliability(X1,X7,X13)
        & reliability(X1,X6,X12)
        & reorganization(X1,X14,X15)
        & organization(X1,X13)
        & organization(X1,X12) )
     => ( greater(X8,X9)
        & greater(X6,X7) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a6_FOL) ).

fof(mp2,axiom,
    ! [X1,X2] :
      ( organization(X1,X2)
     => ? [X4] : accountability(X1,X4,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp2) ).

fof(a1_FOL,hypothesis,
    ! [X1,X5,X6,X7,X8,X9,X10,X11,X12,X13] :
      ( ( greater(X9,X8)
        & greater(X7,X6)
        & survival_chance(X5,X11,X13)
        & survival_chance(X1,X10,X12)
        & accountability(X5,X9,X13)
        & accountability(X1,X8,X12)
        & reliability(X5,X7,X13)
        & reliability(X1,X6,X12)
        & organization(X5,X13)
        & organization(X1,X12) )
     => greater(X11,X10) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1_FOL) ).

fof(mp1,axiom,
    ! [X1,X2] :
      ( organization(X1,X2)
     => ? [X3] : reliability(X1,X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp1) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X10,X11,X12,X13,X14,X15] :
        ( ( ~ greater(X13,X15)
          & greater(X13,X12)
          & ~ greater(X14,X12)
          & survival_chance(X1,X11,X13)
          & survival_chance(X1,X10,X12)
          & reorganization(X1,X14,X15)
          & organization(X1,X13)
          & organization(X1,X12) )
       => greater(X10,X11) ),
    inference(assume_negation,[status(cth)],[t4_FOL]) ).

fof(c_0_6,hypothesis,
    ! [X1,X6,X7,X8,X9,X12,X13,X14,X15] :
      ( ( ~ greater(X13,X15)
        & greater(X13,X12)
        & ~ greater(X14,X12)
        & accountability(X1,X9,X13)
        & accountability(X1,X8,X12)
        & reliability(X1,X7,X13)
        & reliability(X1,X6,X12)
        & reorganization(X1,X14,X15)
        & organization(X1,X13)
        & organization(X1,X12) )
     => ( greater(X8,X9)
        & greater(X6,X7) ) ),
    inference(fof_simplification,[status(thm)],[a6_FOL]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X10,X11,X12,X13,X14,X15] :
        ( ( ~ greater(X13,X15)
          & greater(X13,X12)
          & ~ greater(X14,X12)
          & survival_chance(X1,X11,X13)
          & survival_chance(X1,X10,X12)
          & reorganization(X1,X14,X15)
          & organization(X1,X13)
          & organization(X1,X12) )
       => greater(X10,X11) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_8,hypothesis,
    ! [X32,X33,X34,X35,X36,X37,X38,X39,X40] :
      ( ( greater(X38,X40)
        | ~ greater(X38,X37)
        | greater(X39,X37)
        | ~ accountability(X32,X36,X38)
        | ~ accountability(X32,X35,X37)
        | ~ reliability(X32,X34,X38)
        | ~ reliability(X32,X33,X37)
        | ~ reorganization(X32,X39,X40)
        | ~ organization(X32,X38)
        | ~ organization(X32,X37)
        | greater(X35,X36) )
      & ( greater(X38,X40)
        | ~ greater(X38,X37)
        | greater(X39,X37)
        | ~ accountability(X32,X36,X38)
        | ~ accountability(X32,X35,X37)
        | ~ reliability(X32,X34,X38)
        | ~ reliability(X32,X33,X37)
        | ~ reorganization(X32,X39,X40)
        | ~ organization(X32,X38)
        | ~ organization(X32,X37)
        | greater(X33,X34) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_9,negated_conjecture,
    ( ~ greater(esk4_0,esk5_0)
    & ~ greater(esk7_0,esk9_0)
    & greater(esk7_0,esk6_0)
    & ~ greater(esk8_0,esk6_0)
    & survival_chance(esk3_0,esk5_0,esk7_0)
    & survival_chance(esk3_0,esk4_0,esk6_0)
    & reorganization(esk3_0,esk8_0,esk9_0)
    & organization(esk3_0,esk7_0)
    & organization(esk3_0,esk6_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

fof(c_0_10,plain,
    ! [X19,X20] :
      ( accountability(X19,esk2_2(X19,X20),X20)
      | ~ organization(X19,X20) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp2])])])]) ).

cnf(c_0_11,hypothesis,
    ( ~ greater(X5,X4)
    | ~ accountability(X3,X2,X5)
    | ~ accountability(X3,X1,X4)
    | ~ reliability(X3,X9,X5)
    | ~ reliability(X3,X8,X4)
    | ~ reorganization(X3,X6,X7)
    | ~ organization(X3,X5)
    | ~ organization(X3,X4)
    | greater(X5,X7)
    | greater(X6,X4)
    | greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    reorganization(esk3_0,esk8_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    ( ~ organization(X1,X2)
    | accountability(X1,esk2_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    organization(esk3_0,esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,hypothesis,
    ! [X22,X23,X24,X25,X26,X27,X28,X29,X30,X31] :
      ( greater(X29,X28)
      | ~ greater(X27,X26)
      | ~ greater(X25,X24)
      | ~ survival_chance(X23,X29,X31)
      | ~ survival_chance(X22,X28,X30)
      | ~ accountability(X23,X27,X31)
      | ~ accountability(X22,X26,X30)
      | ~ reliability(X23,X25,X31)
      | ~ reliability(X22,X24,X30)
      | ~ organization(X23,X31)
      | ~ organization(X22,X30) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_FOL])])]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ organization(esk3_0,X2)
    | ~ organization(esk3_0,X1)
    | ~ reliability(esk3_0,X6,X2)
    | ~ reliability(esk3_0,X5,X1)
    | ~ accountability(esk3_0,X3,X2)
    | ~ accountability(esk3_0,X4,X1)
    | ~ greater(X1,X2)
    | greater(X3,X4)
    | greater(esk8_0,X2)
    | greater(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    accountability(esk3_0,esk2_2(esk3_0,esk7_0),esk7_0),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ~ greater(esk7_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    organization(esk3_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_20,plain,
    ! [X16,X17] :
      ( reliability(X16,esk1_2(X16,X17),X17)
      | ~ organization(X16,X17) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp1])])])]) ).

cnf(c_0_21,hypothesis,
    ( ~ greater(X8,X7)
    | ~ greater(X6,X5)
    | ~ survival_chance(X3,X10,X4)
    | ~ survival_chance(X1,X9,X2)
    | ~ accountability(X3,X8,X4)
    | ~ accountability(X1,X7,X2)
    | ~ reliability(X3,X6,X4)
    | ~ reliability(X1,X5,X2)
    | ~ organization(X3,X4)
    | ~ organization(X1,X2)
    | greater(X10,X9) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    survival_chance(esk3_0,esk4_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ organization(esk3_0,X2)
    | ~ reliability(esk3_0,X4,X2)
    | ~ reliability(esk3_0,X3,esk7_0)
    | ~ accountability(esk3_0,X1,X2)
    | ~ greater(esk7_0,X2)
    | greater(esk8_0,X2)
    | greater(X1,esk2_2(esk3_0,esk7_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14])]),c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    accountability(esk3_0,esk2_2(esk3_0,esk6_0),esk6_0),
    inference(spm,[status(thm)],[c_0_13,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    greater(esk7_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_26,negated_conjecture,
    ~ greater(esk8_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_27,plain,
    ( ~ organization(X1,X2)
    | reliability(X1,esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ organization(X6,X7)
    | ~ reliability(X6,X5,X7)
    | ~ reliability(esk3_0,X4,esk6_0)
    | ~ accountability(X6,X3,X7)
    | ~ accountability(esk3_0,X2,esk6_0)
    | ~ survival_chance(X6,X1,X7)
    | ~ greater(X4,X5)
    | ~ greater(X2,X3)
    | greater(esk4_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19])]) ).

cnf(c_0_29,negated_conjecture,
    survival_chance(esk3_0,esk5_0,esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_30,negated_conjecture,
    ~ greater(esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ reliability(esk3_0,X2,esk6_0)
    | ~ reliability(esk3_0,X1,esk7_0)
    | greater(esk2_2(esk3_0,esk6_0),esk2_2(esk3_0,esk7_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_19])]),c_0_26]) ).

cnf(c_0_32,negated_conjecture,
    reliability(esk3_0,esk1_2(esk3_0,esk7_0),esk7_0),
    inference(spm,[status(thm)],[c_0_27,c_0_14]) ).

cnf(c_0_33,hypothesis,
    ( ~ greater(X5,X4)
    | ~ accountability(X3,X9,X5)
    | ~ accountability(X3,X8,X4)
    | ~ reliability(X3,X2,X5)
    | ~ reliability(X3,X1,X4)
    | ~ reorganization(X3,X6,X7)
    | ~ organization(X3,X5)
    | ~ organization(X3,X4)
    | greater(X5,X7)
    | greater(X6,X4)
    | greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ reliability(esk3_0,X4,esk7_0)
    | ~ reliability(esk3_0,X3,esk6_0)
    | ~ accountability(esk3_0,X2,esk7_0)
    | ~ accountability(esk3_0,X1,esk6_0)
    | ~ greater(X3,X4)
    | ~ greater(X1,X2) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14])]),c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ reliability(esk3_0,X1,esk6_0)
    | greater(esk2_2(esk3_0,esk6_0),esk2_2(esk3_0,esk7_0)) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    reliability(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0),
    inference(spm,[status(thm)],[c_0_27,c_0_19]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ organization(esk3_0,X2)
    | ~ organization(esk3_0,X1)
    | ~ reliability(esk3_0,X3,X2)
    | ~ reliability(esk3_0,X4,X1)
    | ~ accountability(esk3_0,X6,X2)
    | ~ accountability(esk3_0,X5,X1)
    | ~ greater(X1,X2)
    | greater(X3,X4)
    | greater(esk8_0,X2)
    | greater(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_33,c_0_12]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ reliability(esk3_0,X3,esk7_0)
    | ~ reliability(esk3_0,X2,esk6_0)
    | ~ accountability(esk3_0,X1,esk7_0)
    | ~ greater(X2,X3)
    | ~ greater(esk2_2(esk3_0,esk6_0),X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_24]) ).

cnf(c_0_39,negated_conjecture,
    greater(esk2_2(esk3_0,esk6_0),esk2_2(esk3_0,esk7_0)),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ organization(esk3_0,X1)
    | ~ reliability(esk3_0,X2,X1)
    | ~ reliability(esk3_0,X3,esk7_0)
    | ~ accountability(esk3_0,X4,X1)
    | ~ greater(esk7_0,X1)
    | greater(X2,X3)
    | greater(esk8_0,X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_17]),c_0_14])]),c_0_18]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ reliability(esk3_0,X2,esk7_0)
    | ~ reliability(esk3_0,X1,esk6_0)
    | ~ greater(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_17]),c_0_39])]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ reliability(esk3_0,X2,esk6_0)
    | ~ reliability(esk3_0,X1,esk7_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_25]),c_0_19])]),c_0_26]),c_0_41]) ).

cnf(c_0_43,negated_conjecture,
    ~ reliability(esk3_0,X1,esk6_0),
    inference(spm,[status(thm)],[c_0_42,c_0_32]) ).

cnf(c_0_44,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_36,c_0_43]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT004+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.57  % Computer : n019.cluster.edu
% 0.09/0.57  % Model    : x86_64 x86_64
% 0.09/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57  % Memory   : 8046.5625MB
% 0.09/0.57  % OS       : Linux 6.8.0-71-generic
% 0.09/0.57  % CPULimit : 300
% 0.09/0.57  % WCLimit  : 300
% 0.09/0.57  % DateTime : Mon Sep 21 01:20:35 UTC 2026
% 0.09/0.57  % CPUTime  : 
% 0.09/0.57  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.61  Running first-order theorem proving
% 0.09/0.61  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
% 0.14/0.63  % Version: 3.5.1
% 0.14/0.63  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.63  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.63  % Starting sh5l with 300s (1) cores
% 0.14/0.63  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1387474 completed with status 0
% 0.14/0.63  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.63  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.63  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.63  % No SInE strategy applied
% 0.14/0.63  % Search class: FGUNF-FFSM22-SFFFFFNN
% 0.14/0.63  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.63  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.63  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.63  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.63  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.63  % new_bool_1 with pid 1387482 completed with status 0
% 0.14/0.63  % Result found by new_bool_1
% 0.14/0.63  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.63  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.63  % No SInE strategy applied
% 0.14/0.63  % Search class: FGUNF-FFSM22-SFFFFFNN
% 0.14/0.63  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.63  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.63  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.63  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.63  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.63  % Preprocessing time       : 0.001 s
% 0.14/0.63  % Presaturation interreduction done
% 0.14/0.63  
% 0.14/0.63  % Proof found!
% 0.14/0.63  % SZS status Theorem
% 0.14/0.63  % SZS output start CNFRefutation
% See solution above
% 0.14/0.63  % Parsed axioms                        : 5
% 0.14/0.63  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.63  % Initial clauses                      : 14
% 0.14/0.63  % Removed in clause preprocessing      : 0
% 0.14/0.63  % Initial clauses in saturation        : 14
% 0.14/0.63  % Processed clauses                    : 65
% 0.14/0.63  % ...of these trivial                  : 0
% 0.14/0.63  % ...subsumed                          : 0
% 0.14/0.63  % ...remaining for further processing  : 65
% 0.14/0.63  % Other redundant clauses eliminated   : 0
% 0.14/0.63  % Clauses deleted for lack of memory   : 0
% 0.14/0.63  % Backward-subsumed                    : 16
% 0.14/0.63  % Backward-rewritten                   : 1
% 0.14/0.63  % Generated clauses                    : 42
% 0.14/0.63  % ...of the previous two non-redundant : 41
% 0.14/0.63  % ...aggressively subsumed             : 0
% 0.14/0.63  % Contextual simplify-reflections      : 1
% 0.14/0.63  % Paramodulations                      : 41
% 0.14/0.63  % Factorizations                       : 0
% 0.14/0.63  % NegExts                              : 0
% 0.14/0.63  % Equation resolutions                 : 0
% 0.14/0.63  % Disequality decompositions           : 0
% 0.14/0.63  % Total rewrite steps                  : 18
% 0.14/0.63  % ...of those cached                   : 14
% 0.14/0.63  % Propositional unsat checks           : 0
% 0.14/0.63  %    Propositional check models        : 0
% 0.14/0.63  %    Propositional check unsatisfiable : 0
% 0.14/0.63  %    Propositional clauses             : 0
% 0.14/0.63  %    Propositional clauses after purity: 0
% 0.14/0.63  %    Propositional unsat core size     : 0
% 0.14/0.63  %    Propositional preprocessing time  : 0.000
% 0.14/0.63  %    Propositional encoding time       : 0.000
% 0.14/0.63  %    Propositional solver time         : 0.000
% 0.14/0.63  %    Success case prop preproc time    : 0.000
% 0.14/0.63  %    Success case prop encoding time   : 0.000
% 0.14/0.63  %    Success case prop solver time     : 0.000
% 0.14/0.63  % Current number of processed clauses  : 33
% 0.14/0.63  %    Positive orientable unit clauses  : 10
% 0.14/0.63  %    Positive unorientable unit clauses: 0
% 0.14/0.63  %    Negative unit clauses             : 5
% 0.14/0.63  %    Non-unit-clauses                  : 18
% 0.14/0.63  % Current number of unprocessed clauses: 4
% 0.14/0.63  % ...number of literals in the above   : 24
% 0.14/0.63  % Current number of archived formulas  : 0
% 0.14/0.63  % Current number of archived clauses   : 32
% 0.14/0.63  % Clause-clause subsumption calls (NU) : 627
% 0.14/0.63  % Rec. Clause-clause subsumption calls : 26
% 0.14/0.63  % Non-unit clause-clause subsumptions  : 10
% 0.14/0.63  % Unit Clause-clause subsumption calls : 44
% 0.14/0.63  % Rewrite failures with RHS unbound    : 0
% 0.14/0.63  % BW rewrite match attempts            : 1
% 0.14/0.63  % BW rewrite match successes           : 1
% 0.14/0.63  % Condensation attempts                : 0
% 0.14/0.63  % Condensation successes               : 0
% 0.14/0.63  % Termbank termtop insertions          : 3186
% 0.14/0.63  % Search garbage collected termcells   : 359
% 0.14/0.63  
% 0.14/0.63  % -------------------------------------------------
% 0.14/0.63  % User time                : 0.004 s
% 0.14/0.63  % System time              : 0.003 s
% 0.14/0.63  % Total time               : 0.007 s
% 0.14/0.63  % Maximum resident set size: 3644 pages
% 0.14/0.63  
% 0.14/0.63  % -------------------------------------------------
% 0.14/0.63  % User time                : 0.021 s
% 0.14/0.63  % System time              : 0.015 s
% 0.14/0.63  % Total time               : 0.036 s
% 0.14/0.63  % Maximum resident set size: 4864 pages
% 0.14/0.63  % E exiting
%------------------------------------------------------------------------------