TSTP Solution File: NUM739^4 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : NUM739^4 : TPTP v8.2.0. Released v7.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 01:15:53 EDT 2024

% Result   : Theorem 1.23s 0.64s
% Output   : CNFRefutation 1.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   42
% Syntax   : Number of formulae    :   98 (  43 unt;  24 typ;   0 def)
%            Number of atoms       :  363 (  87 equ;   0 cnn)
%            Maximal formula atoms :   24 (   4 avg)
%            Number of connectives : 1414 (  95   ~;  83   |;  13   &;1163   @)
%                                         (   0 <=>;  60  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   48 (  48   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   27 (  24 usr;   7 con; 0-3 aty)
%            Number of variables   :  144 (  94   ^  50   !;   0   ?; 144   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    is_of: $i > ( $i > $o ) > $o ).

thf(decl_23,type,
    all_of: ( $i > $o ) > ( $i > $o ) > $o ).

thf(decl_25,type,
    in: $i > $i > $o ).

thf(decl_61,type,
    imp: $o > $o > $o ).

thf(decl_62,type,
    d_not: $o > $o ).

thf(decl_67,type,
    l_or: $o > $o > $o ).

thf(decl_77,type,
    e_is: $i > $i > $i > $o ).

thf(decl_124,type,
    n_is: $i > $i > $o ).

thf(decl_127,type,
    n_some: ( $i > $o ) > $o ).

thf(decl_147,type,
    diffprop: $i > $i > $i > $o ).

thf(decl_148,type,
    d_29_ii: $i > $i > $o ).

thf(decl_149,type,
    iii: $i > $i > $o ).

thf(decl_162,type,
    n_ts: $i > $i > $i ).

thf(decl_189,type,
    frac: $i ).

thf(decl_191,type,
    num: $i > $i ).

thf(decl_192,type,
    den: $i > $i ).

thf(decl_193,type,
    n_eq: $i > $i > $o ).

thf(decl_194,type,
    moref: $i > $i > $o ).

thf(decl_195,type,
    lessf: $i > $i > $o ).

thf(decl_196,type,
    moreq: $i > $i > $o ).

thf(decl_198,type,
    esk1_0: $i ).

thf(decl_199,type,
    esk2_0: $i ).

thf(decl_200,type,
    esk3_0: $i ).

thf(decl_201,type,
    esk4_0: $i ).

thf(def_d_not,axiom,
    ( d_not
    = ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_d_not) ).

thf(def_imp,axiom,
    ( imp
    = ( ^ [X74: $o,X75: $o] :
          ( X74
         => X75 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_imp) ).

thf(def_e_is,axiom,
    ( e_is
    = ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_e_is) ).

thf(def_moref,axiom,
    ( moref
    = ( ^ [X1: $i,X449: $i] : ( d_29_ii @ ( n_ts @ ( num @ X1 ) @ ( den @ X449 ) ) @ ( n_ts @ ( num @ X449 ) @ ( den @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_moref) ).

thf(def_d_29_ii,axiom,
    ( d_29_ii
    = ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_d_29_ii) ).

thf(def_l_or,axiom,
    ( l_or
    = ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_l_or) ).

thf(def_n_eq,axiom,
    ( n_eq
    = ( ^ [X1: $i,X436: $i] : ( n_is @ ( n_ts @ ( num @ X1 ) @ ( den @ X436 ) ) @ ( n_ts @ ( num @ X436 ) @ ( den @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_n_eq) ).

thf(def_n_is,axiom,
    ( n_is
    = ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_n_is) ).

thf(def_all_of,axiom,
    ( all_of
    = ( ^ [X3: $i > $o,X2: $i > $o] :
        ! [X4: $i] :
          ( ( is_of @ X4 @ X3 )
         => ( X2 @ X4 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_all_of) ).

thf(def_is_of,axiom,
    ( is_of
    = ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_is_of) ).

thf(def_lessf,axiom,
    ( lessf
    = ( ^ [X1: $i,X450: $i] : ( iii @ ( n_ts @ ( num @ X1 ) @ ( den @ X450 ) ) @ ( n_ts @ ( num @ X450 ) @ ( den @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_lessf) ).

thf(def_iii,axiom,
    ( iii
    = ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_iii) ).

thf(def_moreq,axiom,
    ( moreq
    = ( ^ [X1: $i,X465: $i] : ( l_or @ ( moref @ X1 @ X465 ) @ ( n_eq @ X1 @ X465 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_moreq) ).

thf(satz41f,axiom,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ frac )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X473: $i] : ( in @ X473 @ frac )
        @ ^ [X474: $i] :
            ( ( d_not @ ( lessf @ X1 @ X474 ) )
           => ( moreq @ X1 @ X474 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz41f) ).

thf(satz46,conjecture,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ frac )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X483: $i] : ( in @ X483 @ frac )
        @ ^ [X484: $i] :
            ( all_of
            @ ^ [X4: $i] : ( in @ X4 @ frac )
            @ ^ [X4: $i] :
                ( all_of
                @ ^ [X13: $i] : ( in @ X13 @ frac )
                @ ^ [X13: $i] :
                    ( ( moreq @ X1 @ X484 )
                   => ( ( n_eq @ X1 @ X4 )
                     => ( ( n_eq @ X484 @ X13 )
                       => ( moreq @ X4 @ X13 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz46) ).

thf(satz41c,axiom,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ frac )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X467: $i] : ( in @ X467 @ frac )
        @ ^ [X468: $i] :
            ( ( moreq @ X1 @ X468 )
           => ( d_not @ ( lessf @ X1 @ X468 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz41c) ).

thf(satz45,axiom,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ frac )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X463: $i] : ( in @ X463 @ frac )
        @ ^ [X464: $i] :
            ( all_of
            @ ^ [X4: $i] : ( in @ X4 @ frac )
            @ ^ [X4: $i] :
                ( all_of
                @ ^ [X13: $i] : ( in @ X13 @ frac )
                @ ^ [X13: $i] :
                    ( ( lessf @ X1 @ X464 )
                   => ( ( n_eq @ X1 @ X4 )
                     => ( ( n_eq @ X464 @ X13 )
                       => ( lessf @ X4 @ X13 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz45) ).

thf(satz39,axiom,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ frac )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X439: $i] : ( in @ X439 @ frac )
        @ ^ [X440: $i] :
            ( all_of
            @ ^ [X4: $i] : ( in @ X4 @ frac )
            @ ^ [X4: $i] :
                ( ( n_eq @ X1 @ X440 )
               => ( ( n_eq @ X440 @ X4 )
                 => ( n_eq @ X1 @ X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz39) ).

thf(c_0_18,plain,
    ( d_not
    = ( ^ [Z0: $o] :
          ( Z0
         => ~ $true ) ) ),
    inference(fof_simplification,[status(thm)],[def_d_not]) ).

thf(c_0_19,plain,
    ( imp
    = ( ^ [Z0: $o,Z1: $o] :
          ( Z0
         => Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[def_imp]) ).

thf(c_0_20,plain,
    ( e_is
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
    inference(fof_simplification,[status(thm)],[def_e_is]) ).

thf(c_0_21,plain,
    ( moref
    = ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_moref]) ).

thf(c_0_22,plain,
    ( d_29_ii
    = ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ Z0 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).

thf(c_0_23,plain,
    ( l_or
    = ( ^ [Z0: $o,Z1: $o] :
          ( ( Z0
           => ~ $true )
         => Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[def_l_or]) ).

thf(c_0_24,plain,
    ( d_not
    = ( ^ [Z0: $o] :
          ( Z0
         => ~ $true ) ) ),
    inference(apply_def,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_25,plain,
    ( n_eq
    = ( ^ [Z0: $i,Z1: $i] :
          ( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
          = ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_n_eq]) ).

thf(c_0_26,axiom,
    ( n_is
    = ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
    inference(apply_def,[status(thm)],[def_n_is,c_0_20]) ).

thf(c_0_27,plain,
    ( all_of
    = ( ^ [Z0: $i > $o,Z1: $i > $o] :
        ! [X4: $i] :
          ( ( Z0 @ X4 )
         => ( Z1 @ X4 ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_all_of]) ).

thf(c_0_28,plain,
    ( is_of
    = ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
    inference(fof_simplification,[status(thm)],[def_is_of]) ).

thf(c_0_29,plain,
    ( lessf
    = ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_lessf]) ).

thf(c_0_30,plain,
    ( iii
    = ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ Z1 @ Z0 ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_iii]) ).

thf(c_0_31,plain,
    ( moreq
    = ( ^ [Z0: $i,Z1: $i] :
          ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) )
           => ~ $true )
         => ( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
            = ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_moreq]) ).

thf(c_0_32,plain,
    ( moref
    = ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_21,c_0_22]) ).

thf(c_0_33,plain,
    ( l_or
    = ( ^ [Z0: $o,Z1: $o] :
          ( ( Z0
           => ~ $true )
         => Z1 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_23,c_0_19]),c_0_24]) ).

thf(c_0_34,plain,
    ( n_eq
    = ( ^ [Z0: $i,Z1: $i] :
          ( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
          = ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_25,c_0_26]) ).

thf(c_0_35,plain,
    ( all_of
    = ( ^ [Z0: $i > $o,Z1: $i > $o] :
        ! [X4: $i] :
          ( ( Z0 @ X4 )
         => ( Z1 @ X4 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_27,c_0_28]) ).

thf(c_0_36,plain,
    ( lessf
    = ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_29,c_0_30]) ).

thf(c_0_37,plain,
    ( moreq
    = ( ^ [Z0: $i,Z1: $i] :
          ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) )
           => ~ $true )
         => ( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
            = ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).

thf(c_0_38,plain,
    ! [X532: $i] :
      ( ( in @ X532 @ frac )
     => ! [X531: $i] :
          ( ( in @ X531 @ frac )
         => ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X531 ) @ ( den @ X532 ) ) @ ( n_ts @ ( num @ X532 ) @ ( den @ X531 ) ) ) )
             => ~ $true )
           => ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X532 ) @ ( den @ X531 ) ) @ ( n_ts @ ( num @ X531 ) @ ( den @ X532 ) ) ) )
               => ~ $true )
             => ( ( n_ts @ ( num @ X532 ) @ ( den @ X531 ) )
                = ( n_ts @ ( num @ X531 ) @ ( den @ X532 ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz41f]),c_0_35]),c_0_36]),c_0_24]),c_0_37]) ).

thf(c_0_39,negated_conjecture,
    ~ ! [X528: $i] :
        ( ( in @ X528 @ frac )
       => ! [X527: $i] :
            ( ( in @ X527 @ frac )
           => ! [X526: $i] :
                ( ( in @ X526 @ frac )
               => ! [X525: $i] :
                    ( ( in @ X525 @ frac )
                   => ( ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X528 ) @ ( den @ X527 ) ) @ ( n_ts @ ( num @ X527 ) @ ( den @ X528 ) ) ) )
                         => ~ $true )
                       => ( ( n_ts @ ( num @ X528 ) @ ( den @ X527 ) )
                          = ( n_ts @ ( num @ X527 ) @ ( den @ X528 ) ) ) )
                     => ( ( ( n_ts @ ( num @ X528 ) @ ( den @ X526 ) )
                          = ( n_ts @ ( num @ X526 ) @ ( den @ X528 ) ) )
                       => ( ( ( n_ts @ ( num @ X527 ) @ ( den @ X525 ) )
                            = ( n_ts @ ( num @ X525 ) @ ( den @ X527 ) ) )
                         => ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X526 ) @ ( den @ X525 ) ) @ ( n_ts @ ( num @ X525 ) @ ( den @ X526 ) ) ) )
                             => ~ $true )
                           => ( ( n_ts @ ( num @ X526 ) @ ( den @ X525 ) )
                              = ( n_ts @ ( num @ X525 ) @ ( den @ X526 ) ) ) ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz46])]),c_0_35]),c_0_34]),c_0_37]) ).

thf(c_0_40,plain,
    ! [X530: $i] :
      ( ( in @ X530 @ frac )
     => ! [X529: $i] :
          ( ( in @ X529 @ frac )
         => ( ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X530 ) @ ( den @ X529 ) ) @ ( n_ts @ ( num @ X529 ) @ ( den @ X530 ) ) ) )
               => ~ $true )
             => ( ( n_ts @ ( num @ X530 ) @ ( den @ X529 ) )
                = ( n_ts @ ( num @ X529 ) @ ( den @ X530 ) ) ) )
           => ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X529 ) @ ( den @ X530 ) ) @ ( n_ts @ ( num @ X530 ) @ ( den @ X529 ) ) ) )
             => ~ $true ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz41c]),c_0_35]),c_0_36]),c_0_24]),c_0_37]) ).

thf(c_0_41,plain,
    ! [X877: $i,X878: $i] :
      ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) ) @ ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) ) )
        | ( ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) )
          = ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) )
        | ( n_some @ ( diffprop @ ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) @ ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) ) ) )
        | ~ ( in @ X878 @ frac )
        | ~ ( in @ X877 @ frac ) )
      & ( $true
        | ( ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) )
          = ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) )
        | ( n_some @ ( diffprop @ ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) @ ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) ) ) )
        | ~ ( in @ X878 @ frac )
        | ~ ( in @ X877 @ frac ) )
      & ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) ) @ ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) ) )
        | ( ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) )
          = ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) )
        | $true
        | ~ ( in @ X878 @ frac )
        | ~ ( in @ X877 @ frac ) )
      & ( $true
        | ( ( n_ts @ ( num @ X877 ) @ ( den @ X878 ) )
          = ( n_ts @ ( num @ X878 ) @ ( den @ X877 ) ) )
        | $true
        | ~ ( in @ X878 @ frac )
        | ~ ( in @ X877 @ frac ) ) ),
    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_38])])])])]) ).

thf(c_0_42,negated_conjecture,
    ( ( in @ esk1_0 @ frac )
    & ( in @ esk2_0 @ frac )
    & ( in @ esk3_0 @ frac )
    & ( in @ esk4_0 @ frac )
    & ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
      | ( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) )
        = ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
    & ( $true
      | ( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) )
        = ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
    & ( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk3_0 ) )
      = ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk1_0 ) ) )
    & ( ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk4_0 ) )
      = ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk2_0 ) ) )
    & ( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk4_0 ) ) @ ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk3_0 ) ) ) )
      | ~ $true )
    & ( ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk4_0 ) )
     != ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk3_0 ) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])])]) ).

thf(c_0_43,plain,
    ! [X875: $i,X876: $i] :
      ( ( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X875 ) @ ( den @ X876 ) ) @ ( n_ts @ ( num @ X876 ) @ ( den @ X875 ) ) ) )
        | ~ $true
        | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X876 ) @ ( den @ X875 ) ) @ ( n_ts @ ( num @ X875 ) @ ( den @ X876 ) ) ) )
        | ~ $true
        | ~ ( in @ X876 @ frac )
        | ~ ( in @ X875 @ frac ) )
      & ( ( ( n_ts @ ( num @ X875 ) @ ( den @ X876 ) )
         != ( n_ts @ ( num @ X876 ) @ ( den @ X875 ) ) )
        | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X876 ) @ ( den @ X875 ) ) @ ( n_ts @ ( num @ X875 ) @ ( den @ X876 ) ) ) )
        | ~ $true
        | ~ ( in @ X876 @ frac )
        | ~ ( in @ X875 @ frac ) ) ),
    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_40])])])])]) ).

thf(c_0_44,plain,
    ! [X563: $i] :
      ( ( in @ X563 @ frac )
     => ! [X562: $i] :
          ( ( in @ X562 @ frac )
         => ! [X561: $i] :
              ( ( in @ X561 @ frac )
             => ! [X560: $i] :
                  ( ( in @ X560 @ frac )
                 => ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X562 ) @ ( den @ X563 ) ) @ ( n_ts @ ( num @ X563 ) @ ( den @ X562 ) ) ) )
                   => ( ( ( n_ts @ ( num @ X563 ) @ ( den @ X561 ) )
                        = ( n_ts @ ( num @ X561 ) @ ( den @ X563 ) ) )
                     => ( ( ( n_ts @ ( num @ X562 ) @ ( den @ X560 ) )
                          = ( n_ts @ ( num @ X560 ) @ ( den @ X562 ) ) )
                       => ( n_some @ ( diffprop @ ( n_ts @ ( num @ X560 ) @ ( den @ X561 ) ) @ ( n_ts @ ( num @ X561 ) @ ( den @ X560 ) ) ) ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz45]),c_0_35]),c_0_36]),c_0_34]) ).

thf(c_0_45,plain,
    ! [X4: $i,X1: $i] :
      ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) ) )
      | ( ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) )
        = ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) )
      | ( n_some @ ( diffprop @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) ) )
      | ~ ( in @ X4 @ frac )
      | ~ ( in @ X1 @ frac ) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

thf(c_0_46,negated_conjecture,
    in @ esk4_0 @ frac,
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_47,negated_conjecture,
    ( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk4_0 ) ) @ ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk3_0 ) ) ) )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_48,plain,
    ! [X542: $i] :
      ( ( in @ X542 @ frac )
     => ! [X541: $i] :
          ( ( in @ X541 @ frac )
         => ! [X540: $i] :
              ( ( in @ X540 @ frac )
             => ( ( ( n_ts @ ( num @ X542 ) @ ( den @ X541 ) )
                  = ( n_ts @ ( num @ X541 ) @ ( den @ X542 ) ) )
               => ( ( ( n_ts @ ( num @ X541 ) @ ( den @ X540 ) )
                    = ( n_ts @ ( num @ X540 ) @ ( den @ X541 ) ) )
                 => ( ( n_ts @ ( num @ X542 ) @ ( den @ X540 ) )
                    = ( n_ts @ ( num @ X540 ) @ ( den @ X542 ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz39]),c_0_35]),c_0_34]) ).

thf(c_0_49,plain,
    ! [X4: $i,X1: $i] :
      ( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) ) )
      | ~ $true
      | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) ) )
      | ~ $true
      | ~ ( in @ X4 @ frac )
      | ~ ( in @ X1 @ frac ) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

thf(c_0_50,plain,
    ! [X908: $i,X909: $i,X910: $i,X911: $i] :
      ( ~ ( in @ X908 @ frac )
      | ~ ( in @ X909 @ frac )
      | ~ ( in @ X910 @ frac )
      | ~ ( in @ X911 @ frac )
      | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X909 ) @ ( den @ X908 ) ) @ ( n_ts @ ( num @ X908 ) @ ( den @ X909 ) ) ) )
      | ( ( n_ts @ ( num @ X908 ) @ ( den @ X910 ) )
       != ( n_ts @ ( num @ X910 ) @ ( den @ X908 ) ) )
      | ( ( n_ts @ ( num @ X909 ) @ ( den @ X911 ) )
       != ( n_ts @ ( num @ X911 ) @ ( den @ X909 ) ) )
      | ( n_some @ ( diffprop @ ( n_ts @ ( num @ X911 ) @ ( den @ X910 ) ) @ ( n_ts @ ( num @ X910 ) @ ( den @ X911 ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])]) ).

thf(c_0_51,negated_conjecture,
    ! [X1: $i] :
      ( ( ( n_ts @ ( num @ X1 ) @ ( den @ esk4_0 ) )
        = ( n_ts @ ( num @ esk4_0 ) @ ( den @ X1 ) ) )
      | ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk4_0 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ esk4_0 ) ) ) )
      | ( n_some @ ( diffprop @ ( n_ts @ ( num @ X1 ) @ ( den @ esk4_0 ) ) @ ( n_ts @ ( num @ esk4_0 ) @ ( den @ X1 ) ) ) )
      | ~ ( in @ X1 @ frac ) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

thf(c_0_52,negated_conjecture,
    in @ esk3_0 @ frac,
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_53,negated_conjecture,
    ( ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk4_0 ) )
   != ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk3_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_54,negated_conjecture,
    ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk4_0 ) ) @ ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk3_0 ) ) ) ),
    inference(cn,[status(thm)],[c_0_47]) ).

thf(c_0_55,plain,
    ! [X4: $i,X1: $i] :
      ( ( ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) )
       != ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) )
      | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) ) )
      | ~ $true
      | ~ ( in @ X4 @ frac )
      | ~ ( in @ X1 @ frac ) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

thf(c_0_56,plain,
    ! [X886: $i,X887: $i,X888: $i] :
      ( ~ ( in @ X886 @ frac )
      | ~ ( in @ X887 @ frac )
      | ~ ( in @ X888 @ frac )
      | ( ( n_ts @ ( num @ X886 ) @ ( den @ X887 ) )
       != ( n_ts @ ( num @ X887 ) @ ( den @ X886 ) ) )
      | ( ( n_ts @ ( num @ X887 ) @ ( den @ X888 ) )
       != ( n_ts @ ( num @ X888 ) @ ( den @ X887 ) ) )
      | ( ( n_ts @ ( num @ X886 ) @ ( den @ X888 ) )
        = ( n_ts @ ( num @ X888 ) @ ( den @ X886 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])])]) ).

thf(c_0_57,plain,
    ! [X4: $i,X1: $i] :
      ( ~ ( in @ X4 @ frac )
      | ~ ( in @ X1 @ frac )
      | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) ) )
      | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) ) ) ),
    inference(cn,[status(thm)],[c_0_49]) ).

thf(c_0_58,negated_conjecture,
    ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
    | ( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) )
      = ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_59,negated_conjecture,
    in @ esk1_0 @ frac,
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_60,negated_conjecture,
    in @ esk2_0 @ frac,
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_61,plain,
    ! [X1: $i,X6: $i,X5: $i,X4: $i] :
      ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X6 ) @ ( den @ X5 ) ) @ ( n_ts @ ( num @ X5 ) @ ( den @ X6 ) ) ) )
      | ~ ( in @ X1 @ frac )
      | ~ ( in @ X4 @ frac )
      | ~ ( in @ X5 @ frac )
      | ~ ( in @ X6 @ frac )
      | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) ) )
      | ( ( n_ts @ ( num @ X1 ) @ ( den @ X5 ) )
       != ( n_ts @ ( num @ X5 ) @ ( den @ X1 ) ) )
      | ( ( n_ts @ ( num @ X4 ) @ ( den @ X6 ) )
       != ( n_ts @ ( num @ X6 ) @ ( den @ X4 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

thf(c_0_62,negated_conjecture,
    n_some @ ( diffprop @ ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk3_0 ) ) @ ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk4_0 ) ) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54]) ).

thf(c_0_63,plain,
    ! [X1: $i,X4: $i] :
      ( ( ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) )
       != ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) )
      | ~ ( in @ X4 @ frac )
      | ~ ( in @ X1 @ frac )
      | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) ) ) ),
    inference(cn,[status(thm)],[c_0_55]) ).

thf(c_0_64,negated_conjecture,
    ( ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk4_0 ) )
    = ( n_ts @ ( num @ esk4_0 ) @ ( den @ esk2_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_65,plain,
    ! [X1: $i,X5: $i,X4: $i] :
      ( ( ( n_ts @ ( num @ X1 ) @ ( den @ X5 ) )
        = ( n_ts @ ( num @ X5 ) @ ( den @ X1 ) ) )
      | ~ ( in @ X1 @ frac )
      | ~ ( in @ X4 @ frac )
      | ~ ( in @ X5 @ frac )
      | ( ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) )
       != ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) )
      | ( ( n_ts @ ( num @ X4 ) @ ( den @ X5 ) )
       != ( n_ts @ ( num @ X5 ) @ ( den @ X4 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_56]) ).

thf(c_0_66,negated_conjecture,
    ( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk3_0 ) )
    = ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk1_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_67,negated_conjecture,
    ( ( ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) )
      = ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) )
    | ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60])]) ).

thf(c_0_68,negated_conjecture,
    ! [X1: $i,X4: $i] :
      ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) ) )
      | ( ( n_ts @ ( num @ esk4_0 ) @ ( den @ X1 ) )
       != ( n_ts @ ( num @ X1 ) @ ( den @ esk4_0 ) ) )
      | ( ( n_ts @ ( num @ esk3_0 ) @ ( den @ X4 ) )
       != ( n_ts @ ( num @ X4 ) @ ( den @ esk3_0 ) ) )
      | ~ ( in @ X1 @ frac )
      | ~ ( in @ X4 @ frac ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_46]),c_0_52])]) ).

thf(c_0_69,negated_conjecture,
    ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk4_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk4_0 ) ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_60]),c_0_46])]) ).

thf(c_0_70,negated_conjecture,
    ! [X1: $i] :
      ( ( ( n_ts @ ( num @ X1 ) @ ( den @ esk3_0 ) )
        = ( n_ts @ ( num @ esk3_0 ) @ ( den @ X1 ) ) )
      | ( ( n_ts @ ( num @ X1 ) @ ( den @ esk1_0 ) )
       != ( n_ts @ ( num @ esk1_0 ) @ ( den @ X1 ) ) )
      | ~ ( in @ X1 @ frac ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_52]),c_0_59])]) ).

thf(c_0_71,negated_conjecture,
    ( ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) )
    = ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_64]),c_0_66]),c_0_60]),c_0_59])]) ).

thf(c_0_72,negated_conjecture,
    ( ( n_ts @ ( num @ esk3_0 ) @ ( den @ esk2_0 ) )
   != ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk3_0 ) ) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_64]),c_0_46]),c_0_60])]),c_0_69]) ).

thf(c_0_73,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_60])]),c_0_72]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM739^4 : TPTP v8.2.0. Released v7.1.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n022.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon May 20 04:28:37 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running higher-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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
% 1.23/0.64  # Version: 3.1.0-ho
% 1.23/0.64  # Preprocessing class: HSLMSMSMLLLCHSA.
% 1.23/0.64  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.64  # Starting pre_casc_4 with 1200s (4) cores
% 1.23/0.64  # Starting full_lambda_6 with 300s (1) cores
% 1.23/0.64  # Starting sh10 with 300s (1) cores
% 1.23/0.64  # Starting post_as_ho9 with 300s (1) cores
% 1.23/0.64  # Starting post_as_ho8 with 300s (1) cores
% 1.23/0.64  # pre_casc_4 with pid 19097 completed with status 0
% 1.23/0.64  # Result found by pre_casc_4
% 1.23/0.64  # Preprocessing class: HSLMSMSMLLLCHSA.
% 1.23/0.64  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.64  # Starting pre_casc_4 with 1200s (4) cores
% 1.23/0.64  # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 1.23/0.64  # Search class: HGHSM-FSLM31-DHSMMFBN
% 1.23/0.64  # partial match(2): HGHSM-FSLM31-DHSFFFBN
% 1.23/0.64  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 1.23/0.64  # Starting sh1l with 357s (1) cores
% 1.23/0.64  # Starting pre_casc_4 with 121s (1) cores
% 1.23/0.64  # Starting new_bool_8 with 210s (1) cores
% 1.23/0.64  # Starting new_bool_9 with 208s (1) cores
% 1.23/0.64  # sh1l with pid 19102 completed with status 0
% 1.23/0.64  # Result found by sh1l
% 1.23/0.64  # Preprocessing class: HSLMSMSMLLLCHSA.
% 1.23/0.64  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.64  # Starting pre_casc_4 with 1200s (4) cores
% 1.23/0.64  # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 1.23/0.64  # Search class: HGHSM-FSLM31-DHSMMFBN
% 1.23/0.64  # partial match(2): HGHSM-FSLM31-DHSFFFBN
% 1.23/0.64  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 1.23/0.64  # Starting sh1l with 357s (1) cores
% 1.23/0.64  # Preprocessing time       : 0.016 s
% 1.23/0.64  
% 1.23/0.64  # Proof found!
% 1.23/0.64  # SZS status Theorem
% 1.23/0.64  # SZS output start CNFRefutation
% See solution above
% 1.23/0.64  # Parsed axioms                        : 560
% 1.23/0.64  # Removed by relevancy pruning/SinE    : 385
% 1.23/0.64  # Initial clauses                      : 283
% 1.23/0.64  # Removed in clause preprocessing      : 101
% 1.23/0.64  # Initial clauses in saturation        : 182
% 1.23/0.64  # Processed clauses                    : 297
% 1.23/0.64  # ...of these trivial                  : 0
% 1.23/0.64  # ...subsumed                          : 104
% 1.23/0.64  # ...remaining for further processing  : 192
% 1.23/0.64  # Other redundant clauses eliminated   : 36
% 1.23/0.64  # Clauses deleted for lack of memory   : 0
% 1.23/0.64  # Backward-subsumed                    : 2
% 1.23/0.64  # Backward-rewritten                   : 6
% 1.23/0.64  # Generated clauses                    : 1148
% 1.23/0.64  # ...of the previous two non-redundant : 1095
% 1.23/0.64  # ...aggressively subsumed             : 0
% 1.23/0.64  # Contextual simplify-reflections      : 0
% 1.23/0.64  # Paramodulations                      : 1050
% 1.23/0.64  # Factorizations                       : 0
% 1.23/0.64  # NegExts                              : 1
% 1.23/0.64  # Equation resolutions                 : 47
% 1.23/0.64  # Disequality decompositions           : 0
% 1.23/0.64  # Total rewrite steps                  : 324
% 1.23/0.64  # ...of those cached                   : 302
% 1.23/0.64  # Propositional unsat checks           : 0
% 1.23/0.64  #    Propositional check models        : 0
% 1.23/0.64  #    Propositional check unsatisfiable : 0
% 1.23/0.64  #    Propositional clauses             : 0
% 1.23/0.64  #    Propositional clauses after purity: 0
% 1.23/0.64  #    Propositional unsat core size     : 0
% 1.23/0.64  #    Propositional preprocessing time  : 0.000
% 1.23/0.64  #    Propositional encoding time       : 0.000
% 1.23/0.64  #    Propositional solver time         : 0.000
% 1.23/0.64  #    Success case prop preproc time    : 0.000
% 1.23/0.64  #    Success case prop encoding time   : 0.000
% 1.23/0.64  #    Success case prop solver time     : 0.000
% 1.23/0.64  # Current number of processed clauses  : 153
% 1.23/0.64  #    Positive orientable unit clauses  : 33
% 1.23/0.64  #    Positive unorientable unit clauses: 5
% 1.23/0.64  #    Negative unit clauses             : 21
% 1.23/0.64  #    Non-unit-clauses                  : 94
% 1.23/0.64  # Current number of unprocessed clauses: 975
% 1.23/0.64  # ...number of literals in the above   : 4153
% 1.23/0.64  # Current number of archived formulas  : 0
% 1.23/0.64  # Current number of archived clauses   : 11
% 1.23/0.64  # Clause-clause subsumption calls (NU) : 8556
% 1.23/0.64  # Rec. Clause-clause subsumption calls : 1551
% 1.23/0.64  # Non-unit clause-clause subsumptions  : 83
% 1.23/0.64  # Unit Clause-clause subsumption calls : 436
% 1.23/0.64  # Rewrite failures with RHS unbound    : 0
% 1.23/0.64  # BW rewrite match attempts            : 300
% 1.23/0.64  # BW rewrite match successes           : 144
% 1.23/0.64  # Condensation attempts                : 0
% 1.23/0.64  # Condensation successes               : 0
% 1.23/0.64  # Termbank termtop insertions          : 150133
% 1.23/0.64  # Search garbage collected termcells   : 26034
% 1.23/0.64  
% 1.23/0.64  # -------------------------------------------------
% 1.23/0.64  # User time                : 0.108 s
% 1.23/0.64  # System time              : 0.024 s
% 1.23/0.64  # Total time               : 0.132 s
% 1.23/0.64  # Maximum resident set size: 6432 pages
% 1.23/0.64  
% 1.23/0.64  # -------------------------------------------------
% 1.23/0.64  # User time                : 0.409 s
% 1.23/0.64  # System time              : 0.045 s
% 1.23/0.64  # Total time               : 0.454 s
% 1.23/0.64  # Maximum resident set size: 2720 pages
% 1.23/0.64  % E---3.1 exiting
% 1.23/0.64  % E exiting
%------------------------------------------------------------------------------