↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR107+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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 12:16:56 PM UTC 2026

% Result   : Theorem 51.68s 7.91s
% Output   : CNFRefutation 51.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   58 (  21 unt;   0 def)
%            Number of atoms       :  180 (  26 equ)
%            Maximal formula atoms :   45 (   3 avg)
%            Number of connectives :  198 (  76   ~;  83   |;  28   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  11 con; 0-3 aty)
%            Number of variables   :   90 (  32 sgn  33   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
    ( s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_2)
    & s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).

fof(kb_SUMO_3489,axiom,
    ! [X169,X170] :
      ( ! [X49] :
          ( ( s__instance(X169,s__Set)
            & s__instance(X170,s__Set) )
         => ( s__element(X49,X170)
          <=> s__element(X49,X169) ) )
     => X170 = X169 ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).

fof(kb_SUMO_982,axiom,
    ! [X48] :
      ( s__instance(X48,s__TimeInterval)
     => s__overlapsTemporally(X48,X48) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_982) ).

fof(local_2,axiom,
    s__instance(s__TimeInterval38_2,s__TimeInterval),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).

fof(local_1,axiom,
    s__instance(s__TimeInterval38_1,s__TimeInterval),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).

fof(kb_SUMO_3496,axiom,
    ! [X171,X172,X173] :
      ( X172 = s__UnionFn(X173,X171)
    <=> ! [X174,X175,X176] :
          ( ( s__instance(X171,s__SetOrClass)
            & s__instance(X172,s__SetOrClass)
            & s__instance(X173,s__SetOrClass) )
         => ( ( s__instance(X176,X172)
              & s__instance(X175,X171)
              & s__instance(X174,X173) )
           => ( ( s__instance(X176,X171)
                | s__instance(X176,X173) )
              & s__instance(X175,X172)
              & s__instance(X174,X172) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).

fof(kb_SUMO_3533,axiom,
    ! [X168] :
      ( s__instance(X168,s__SetOrClass)
     => ( s__instance(X168,s__NullSet)
       => ~ ? [X48] : s__instance(X48,X168) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).

fof(kb_SUMO_276,axiom,
    ! [X9,X10] :
      ( s__disjoint(X9,X10)
    <=> ! [X48] :
          ( ( s__instance(X9,s__SetOrClass)
            & s__instance(X10,s__SetOrClass) )
         => ~ ( s__instance(X48,X10)
              & s__instance(X48,X9) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_276) ).

fof(kb_SUMO_1459,axiom,
    s__disjoint(s__ObjectAttitude,s__PropositionalAttitude),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1459) ).

fof(kb_SUMO_1476,axiom,
    s__instance(s__wants__m,s__ObjectAttitude),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1476) ).

fof(kb_SUMO_1506,axiom,
    s__instance(s__knows__m,s__PropositionalAttitude),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1506) ).

fof(local_3,axiom,
    s__instance(s__TimeInterval38_3,s__TimeInterval),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).

fof(c_0_12,negated_conjecture,
    ~ ( s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_2)
      & s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_1) ),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

fof(c_0_13,negated_conjecture,
    ( ~ s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_2)
    | ~ s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_1) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).

fof(c_0_14,plain,
    ! [X6419,X6420] :
      ( ( X6420 = X6419
        | s__element(esk157_2(X6419,X6420),X6419)
        | s__element(esk157_2(X6419,X6420),X6420) )
      & ( X6420 = X6419
        | ~ s__element(esk157_2(X6419,X6420),X6419)
        | ~ s__element(esk157_2(X6419,X6420),X6420) )
      & ( X6420 = X6419
        | s__instance(X6419,s__Set) )
      & ( X6420 = X6419
        | s__instance(X6420,s__Set) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_2)
    | ~ s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,plain,
    ( X2 = X1
    | s__instance(X1,s__Set) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X2559] :
      ( s__overlapsTemporally(X2559,X2559)
      | ~ s__instance(X2559,s__TimeInterval) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_982])])]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ s__overlapsTemporally(X1,s__TimeInterval38_2)
    | ~ s__overlapsTemporally(X1,s__TimeInterval38_1)
    | s__instance(X1,s__Set) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( ~ s__instance(X1,s__TimeInterval)
    | s__overlapsTemporally(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_20,plain,
    s__instance(s__TimeInterval38_2,s__TimeInterval),
    inference(split_conjunct,[status(thm)],[local_2]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ s__overlapsTemporally(s__TimeInterval38_2,s__TimeInterval38_1)
    | s__instance(s__TimeInterval38_2,s__Set) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ s__overlapsTemporally(X1,s__TimeInterval38_1)
    | s__instance(X1,s__Set) ),
    inference(spm,[status(thm)],[c_0_21,c_0_16]) ).

cnf(c_0_23,plain,
    s__instance(s__TimeInterval38_1,s__TimeInterval),
    inference(split_conjunct,[status(thm)],[local_1]) ).

fof(c_0_24,plain,
    ! [X6422,X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430] :
      ( ( X6429 = s__UnionFn(X6430,X6428)
        | ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk160_3(X6428,X6429,X6430),X6428) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
        | ~ s__instance(esk160_3(X6428,X6429,X6430),X6430) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(esk160_3(X6428,X6429,X6430),X6429) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(esk159_3(X6428,X6429,X6430),X6428) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(esk158_3(X6428,X6429,X6430),X6430) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(X6428,s__SetOrClass) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(X6429,s__SetOrClass) )
      & ( X6429 = s__UnionFn(X6430,X6428)
        | s__instance(X6430,s__SetOrClass) )
      & ( X6423 != s__UnionFn(X6424,X6422)
        | ~ s__instance(X6422,s__SetOrClass)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6422)
        | ~ s__instance(X6425,X6424)
        | s__instance(X6427,X6422)
        | s__instance(X6427,X6424) )
      & ( X6423 != s__UnionFn(X6424,X6422)
        | ~ s__instance(X6422,s__SetOrClass)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6422)
        | ~ s__instance(X6425,X6424)
        | s__instance(X6426,X6423) )
      & ( X6423 != s__UnionFn(X6424,X6422)
        | ~ s__instance(X6422,s__SetOrClass)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6422)
        | ~ s__instance(X6425,X6424)
        | s__instance(X6425,X6423) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3496])])])])])])]) ).

cnf(c_0_25,negated_conjecture,
    s__instance(s__TimeInterval38_1,s__Set),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_23])]) ).

cnf(c_0_26,plain,
    ( X2 = s__UnionFn(X3,X1)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    s__instance(X1,s__Set),
    inference(spm,[status(thm)],[c_0_25,c_0_16]) ).

cnf(c_0_28,plain,
    ( s__instance(X3,s__SetOrClass)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_26,c_0_26]) ).

fof(c_0_29,plain,
    ! [X6434,X6435] :
      ( ~ s__instance(X6435,X6434)
      | ~ s__instance(X6434,s__NullSet)
      | ~ s__instance(X6434,s__SetOrClass) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).

cnf(c_0_30,negated_conjecture,
    ( s__instance(X2,X3)
    | s__instance(X1,s__SetOrClass) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

fof(c_0_31,plain,
    ! [X1512,X1513,X1514,X1515,X1516] :
      ( ( s__disjoint(X1515,X1516)
        | s__instance(esk1_2(X1515,X1516),X1516) )
      & ( s__disjoint(X1515,X1516)
        | s__instance(esk1_2(X1515,X1516),X1515) )
      & ( s__disjoint(X1515,X1516)
        | s__instance(X1515,s__SetOrClass) )
      & ( s__disjoint(X1515,X1516)
        | s__instance(X1516,s__SetOrClass) )
      & ( ~ s__instance(X1514,X1513)
        | ~ s__instance(X1514,X1512)
        | ~ s__instance(X1512,s__SetOrClass)
        | ~ s__instance(X1513,s__SetOrClass)
        | ~ s__disjoint(X1512,X1513) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_276])])])])])])]) ).

cnf(c_0_32,plain,
    ( ~ s__instance(X2,X1)
    | ~ s__instance(X1,s__NullSet)
    | ~ s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    s__instance(X1,s__SetOrClass),
    inference(ef,[status(thm)],[c_0_30]) ).

cnf(c_0_34,plain,
    ( ~ s__instance(X3,X2)
    | ~ s__instance(X3,X1)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__disjoint(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_35,plain,
    ( ~ s__instance(X2,X1)
    | ~ s__instance(X1,s__NullSet) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).

cnf(c_0_36,plain,
    ( s__disjoint(X1,X2)
    | s__instance(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_37,plain,
    ( ~ s__instance(X3,X1)
    | ~ s__instance(X3,X2)
    | ~ s__disjoint(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_33]),c_0_33])]) ).

cnf(c_0_38,plain,
    s__disjoint(s__ObjectAttitude,s__PropositionalAttitude),
    inference(split_conjunct,[status(thm)],[kb_SUMO_1459]) ).

cnf(c_0_39,plain,
    ( ~ s__instance(X2,esk1_2(s__NullSet,X1))
    | s__disjoint(s__NullSet,X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,plain,
    ( X2 = s__UnionFn(X3,X1)
    | s__instance(esk158_3(X1,X2,X3),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_41,plain,
    ( ~ s__instance(X1,s__ObjectAttitude)
    | ~ s__instance(X1,s__PropositionalAttitude) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    s__instance(s__wants__m,s__ObjectAttitude),
    inference(split_conjunct,[status(thm)],[kb_SUMO_1476]) ).

cnf(c_0_43,plain,
    ( s__disjoint(s__NullSet,X2)
    | X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,plain,
    ~ s__instance(s__wants__m,s__PropositionalAttitude),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,plain,
    ( s__disjoint(s__NullSet,X3)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_43,c_0_43]) ).

cnf(c_0_46,plain,
    ( ~ s__instance(X2,s__PropositionalAttitude)
    | s__disjoint(s__NullSet,X1) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_47,plain,
    s__instance(s__knows__m,s__PropositionalAttitude),
    inference(split_conjunct,[status(thm)],[kb_SUMO_1506]) ).

cnf(c_0_48,plain,
    s__disjoint(s__NullSet,X1),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_49,plain,
    ( ~ s__instance(X1,X2)
    | ~ s__instance(X1,s__NullSet) ),
    inference(spm,[status(thm)],[c_0_37,c_0_48]) ).

cnf(c_0_50,plain,
    ( ~ s__instance(esk158_3(X2,X1,s__NullSet),X3)
    | X1 = s__UnionFn(s__NullSet,X2) ),
    inference(spm,[status(thm)],[c_0_49,c_0_40]) ).

cnf(c_0_51,negated_conjecture,
    X1 = s__UnionFn(s__NullSet,X2),
    inference(spm,[status(thm)],[c_0_50,c_0_27]) ).

cnf(c_0_52,negated_conjecture,
    X1 = X2,
    inference(spm,[status(thm)],[c_0_51,c_0_51]) ).

cnf(c_0_53,negated_conjecture,
    ( ~ s__overlapsTemporally(s__TimeInterval38_3,X1)
    | ~ s__overlapsTemporally(s__TimeInterval38_3,s__TimeInterval38_1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_52]) ).

cnf(c_0_54,negated_conjecture,
    ( ~ s__overlapsTemporally(s__TimeInterval38_3,X2)
    | ~ s__overlapsTemporally(s__TimeInterval38_3,X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_52]) ).

cnf(c_0_55,plain,
    s__instance(s__TimeInterval38_3,s__TimeInterval),
    inference(split_conjunct,[status(thm)],[local_3]) ).

cnf(c_0_56,negated_conjecture,
    ~ s__overlapsTemporally(s__TimeInterval38_3,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_19]),c_0_55])]) ).

cnf(c_0_57,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_19]),c_0_55])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR107+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43  % Computer : n016.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Mon Sep 21 15:05:38 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.50  Running first-order theorem proving
% 0.27/0.50  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
% 51.68/7.91  % Version: 3.5.1
% 51.68/7.91  % Preprocessing class: FMLLSMSLSSSNFFN.
% 51.68/7.91  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.68/7.91  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 51.68/7.91  % Starting new_bool_3 with 300s (1) cores
% 51.68/7.91  % Starting new_bool_1 with 300s (1) cores
% 51.68/7.91  % Starting sh5l with 300s (1) cores
% 51.68/7.91  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2698980 completed with status 0
% 51.68/7.91  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 51.68/7.91  % Preprocessing class: FMLLSMSLSSSNFFN.
% 51.68/7.91  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.68/7.91  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 51.68/7.91  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 51.68/7.91  % No SInE strategy applied
% 51.68/7.91  % Search class: FGHSM-SMLM31-MFFFFFNN
% 51.68/7.91  % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 51.68/7.91  % Starting SubtermCWHack with 135s (1) cores
% 51.68/7.91  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 51.68/7.91  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 135s (1) cores
% 51.68/7.91  % Starting new_bool_3 with 135s (1) cores
% 51.68/7.91  % Starting new_bool_1 with 135s (1) cores
% 51.68/7.91  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2698988 completed with status 0
% 51.68/7.91  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 51.68/7.91  % Preprocessing class: FMLLSMSLSSSNFFN.
% 51.68/7.91  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.68/7.91  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 51.68/7.91  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 51.68/7.91  % No SInE strategy applied
% 51.68/7.91  % Search class: FGHSM-SMLM31-MFFFFFNN
% 51.68/7.91  % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 51.68/7.91  % Starting SubtermCWHack with 135s (1) cores
% 51.68/7.91  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 51.68/7.91  % Preprocessing time       : 0.165 s
% 51.68/7.91  % Presaturation interreduction done
% 51.68/7.91  
% 51.68/7.91  % Proof found!
% 51.68/7.91  % SZS status Theorem
% 51.68/7.91  % SZS output start CNFRefutation
% See solution above
% 51.68/7.91  % Parsed axioms                        : 7228
% 51.68/7.91  % Removed by relevancy pruning/SinE    : 0
% 51.68/7.91  % Initial clauses                      : 8419
% 51.68/7.91  % Removed in clause preprocessing      : 63
% 51.68/7.91  % Initial clauses in saturation        : 8356
% 51.68/7.91  % Processed clauses                    : 17506
% 51.68/7.91  % ...of these trivial                  : 923
% 51.68/7.91  % ...subsumed                          : 384
% 51.68/7.91  % ...remaining for further processing  : 16199
% 51.68/7.91  % Other redundant clauses eliminated   : 63
% 51.68/7.91  % Clauses deleted for lack of memory   : 0
% 51.68/7.91  % Backward-subsumed                    : 1094
% 51.68/7.91  % Backward-rewritten                   : 1440
% 51.68/7.91  % Generated clauses                    : 159393
% 51.68/7.91  % ...of the previous two non-redundant : 155545
% 51.68/7.91  % ...aggressively subsumed             : 0
% 51.68/7.91  % Contextual simplify-reflections      : 668
% 51.68/7.91  % Paramodulations                      : 159278
% 51.68/7.91  % Factorizations                       : 3
% 51.68/7.91  % NegExts                              : 0
% 51.68/7.91  % Equation resolutions                 : 78
% 51.68/7.91  % Disequality decompositions           : 0
% 51.68/7.91  % Total rewrite steps                  : 6417
% 51.68/7.91  % ...of those cached                   : 3345
% 51.68/7.91  % Propositional unsat checks           : 0
% 51.68/7.91  %    Propositional check models        : 0
% 51.68/7.91  %    Propositional check unsatisfiable : 0
% 51.68/7.91  %    Propositional clauses             : 0
% 51.68/7.91  %    Propositional clauses after purity: 0
% 51.68/7.91  %    Propositional unsat core size     : 0
% 51.68/7.91  %    Propositional preprocessing time  : 0.000
% 51.68/7.91  %    Propositional encoding time       : 0.000
% 51.68/7.91  %    Propositional solver time         : 0.000
% 51.68/7.91  %    Success case prop preproc time    : 0.000
% 51.68/7.91  %    Success case prop encoding time   : 0.000
% 51.68/7.91  %    Success case prop solver time     : 0.000
% 51.68/7.91  % Current number of processed clauses  : 5463
% 51.68/7.91  %    Positive orientable unit clauses  : 3946
% 51.68/7.91  %    Positive unorientable unit clauses: 1
% 51.68/7.91  %    Negative unit clauses             : 14
% 51.68/7.91  %    Non-unit-clauses                  : 1502
% 51.68/7.91  % Current number of unprocessed clauses: 136984
% 51.68/7.91  % ...number of literals in the above   : 277874
% 51.68/7.91  % Current number of archived formulas  : 0
% 51.68/7.91  % Current number of archived clauses   : 10728
% 51.68/7.91  % Clause-clause subsumption calls (NU) : 3154318
% 51.68/7.91  % Rec. Clause-clause subsumption calls : 888513
% 51.68/7.91  % Non-unit clause-clause subsumptions  : 1079
% 51.68/7.91  % Unit Clause-clause subsumption calls : 236069
% 51.68/7.91  % Rewrite failures with RHS unbound    : 10109
% 51.68/7.91  % BW rewrite match attempts            : 33271
% 51.68/7.91  % BW rewrite match successes           : 11018
% 51.68/7.91  % Condensation attempts                : 0
% 51.68/7.91  % Condensation successes               : 0
% 51.68/7.91  % Termbank termtop insertions          : 1461073
% 51.68/7.91  % Search garbage collected termcells   : 89723
% 51.68/7.91  
% 51.68/7.91  % -------------------------------------------------
% 51.68/7.91  % User time                : 6.630 s
% 51.68/7.91  % System time              : 0.301 s
% 51.68/7.91  % Total time               : 6.930 s
% 51.68/7.91  % Maximum resident set size: 31740 pages
% 51.68/7.91  
% 51.68/7.91  % -------------------------------------------------
% 51.68/7.91  % User time                : 28.997 s
% 51.68/7.91  % System time              : 1.163 s
% 51.68/7.91  % Total time               : 30.159 s
% 51.68/7.91  % Maximum resident set size: 12288 pages
% 51.68/7.91  % E exiting
%------------------------------------------------------------------------------