TSTP Solution File: NUM297+1 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM297+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.1NDgJ7KEVr true

% 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 : Thu Aug 31 12:39:48 EDT 2023

% Result   : Theorem 2.67s 0.94s
% Output   : Refutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   31 (  14 unt;  10 typ;   0 def)
%            Number of atoms       :   35 (   0 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  138 (  12   ~;   9   |;   3   &; 112   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^;  18   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(rdnn_type,type,
    rdnn: $i > $i ).

thf(n2_type,type,
    n2: $i ).

thf(rdn_neg_type,type,
    rdn_neg: $i > $i ).

thf(n4_type,type,
    n4: $i ).

thf(nn4_type,type,
    nn4: $i ).

thf(rdn_translate_type,type,
    rdn_translate: $i > $i > $o ).

thf(rdn_positive_less_type,type,
    rdn_positive_less: $i > $i > $o ).

thf(n3_type,type,
    n3: $i ).

thf(less_type,type,
    less: $i > $i > $o ).

thf(nn2_type,type,
    nn2: $i ).

thf(nn4_less_nn2,conjecture,
    less @ nn4 @ nn2 ).

thf(zf_stmt_0,negated_conjecture,
    ~ ( less @ nn4 @ nn2 ),
    inference('cnf.neg',[status(esa)],[nn4_less_nn2]) ).

thf(zip_derived_cl126,plain,
    ~ ( less @ nn4 @ nn2 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(rdn_positive_less23,axiom,
    rdn_positive_less @ ( rdnn @ n2 ) @ ( rdnn @ n3 ) ).

thf(zip_derived_cl14,plain,
    rdn_positive_less @ ( rdnn @ n2 ) @ ( rdnn @ n3 ),
    inference(cnf,[status(esa)],[rdn_positive_less23]) ).

thf(rdn_positive_less_transitivity,axiom,
    ! [X: $i,Y: $i,Z: $i] :
      ( ( ( rdn_positive_less @ ( rdnn @ X ) @ ( rdnn @ Y ) )
        & ( rdn_positive_less @ ( rdnn @ Y ) @ ( rdnn @ Z ) ) )
     => ( rdn_positive_less @ ( rdnn @ X ) @ ( rdnn @ Z ) ) ) ).

thf(zip_derived_cl21,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ( rdn_positive_less @ ( rdnn @ X0 ) @ ( rdnn @ X1 ) )
      | ~ ( rdn_positive_less @ ( rdnn @ X1 ) @ ( rdnn @ X2 ) )
      | ( rdn_positive_less @ ( rdnn @ X0 ) @ ( rdnn @ X2 ) ) ),
    inference(cnf,[status(esa)],[rdn_positive_less_transitivity]) ).

thf(zip_derived_cl314,plain,
    ! [X0: $i] :
      ( ( rdn_positive_less @ ( rdnn @ n2 ) @ ( rdnn @ X0 ) )
      | ~ ( rdn_positive_less @ ( rdnn @ n3 ) @ ( rdnn @ X0 ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl14,zip_derived_cl21]) ).

thf(rdn_positive_less34,axiom,
    rdn_positive_less @ ( rdnn @ n3 ) @ ( rdnn @ n4 ) ).

thf(zip_derived_cl15,plain,
    rdn_positive_less @ ( rdnn @ n3 ) @ ( rdnn @ n4 ),
    inference(cnf,[status(esa)],[rdn_positive_less34]) ).

thf(zip_derived_cl399,plain,
    rdn_positive_less @ ( rdnn @ n2 ) @ ( rdnn @ n4 ),
    inference('sup+',[status(thm)],[zip_derived_cl314,zip_derived_cl15]) ).

thf(rdnn4,axiom,
    rdn_translate @ nn4 @ ( rdn_neg @ ( rdnn @ n4 ) ) ).

thf(zip_derived_cl11,plain,
    rdn_translate @ nn4 @ ( rdn_neg @ ( rdnn @ n4 ) ),
    inference(cnf,[status(esa)],[rdnn4]) ).

thf(less_entry_point_neg_neg,axiom,
    ! [X: $i,Y: $i,RDN_X: $i,RDN_Y: $i] :
      ( ( ( rdn_translate @ X @ ( rdn_neg @ RDN_X ) )
        & ( rdn_translate @ Y @ ( rdn_neg @ RDN_Y ) )
        & ( rdn_positive_less @ RDN_Y @ RDN_X ) )
     => ( less @ X @ Y ) ) ).

thf(zip_derived_cl27,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( less @ X0 @ X1 )
      | ~ ( rdn_translate @ X0 @ ( rdn_neg @ X2 ) )
      | ~ ( rdn_translate @ X1 @ ( rdn_neg @ X3 ) )
      | ~ ( rdn_positive_less @ X3 @ X2 ) ),
    inference(cnf,[status(esa)],[less_entry_point_neg_neg]) ).

thf(zip_derived_cl357,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ( rdn_positive_less @ X0 @ ( rdnn @ n4 ) )
      | ~ ( rdn_translate @ X1 @ ( rdn_neg @ X0 ) )
      | ( less @ nn4 @ X1 ) ),
    inference('sup-',[status(thm)],[zip_derived_cl11,zip_derived_cl27]) ).

thf(zip_derived_cl1195,plain,
    ! [X0: $i] :
      ( ( less @ nn4 @ X0 )
      | ~ ( rdn_translate @ X0 @ ( rdn_neg @ ( rdnn @ n2 ) ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl399,zip_derived_cl357]) ).

thf(zip_derived_cl1525,plain,
    ~ ( rdn_translate @ nn2 @ ( rdn_neg @ ( rdnn @ n2 ) ) ),
    inference('sup+',[status(thm)],[zip_derived_cl126,zip_derived_cl1195]) ).

thf(rdnn2,axiom,
    rdn_translate @ nn2 @ ( rdn_neg @ ( rdnn @ n2 ) ) ).

thf(zip_derived_cl10,plain,
    rdn_translate @ nn2 @ ( rdn_neg @ ( rdnn @ n2 ) ),
    inference(cnf,[status(esa)],[rdnn2]) ).

thf(zip_derived_cl1530,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl1525,zip_derived_cl10]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : NUM297+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.11  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.1NDgJ7KEVr true
% 0.12/0.31  % Computer : n022.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit : 300
% 0.12/0.31  % WCLimit  : 300
% 0.12/0.31  % DateTime : Fri Aug 25 17:39:25 EDT 2023
% 0.12/0.31  % CPUTime  : 
% 0.12/0.31  % Running portfolio for 300 s
% 0.12/0.31  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.31  % Number of cores: 8
% 0.12/0.31  % Python version: Python 3.6.8
% 0.12/0.31  % Running in FO mode
% 0.16/0.56  % Total configuration time : 435
% 0.16/0.56  % Estimated wc time : 1092
% 0.16/0.56  % Estimated cpu time (7 cpus) : 156.0
% 0.16/0.67  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.16/0.67  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.16/0.68  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.16/0.68  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.16/0.68  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.16/0.68  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.16/0.68  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.16/0.74  % /export/starexec/sandbox/solver/bin/fo/fo1_lcnf.sh running for 50s
% 2.67/0.94  % Solved by fo/fo3_bce.sh.
% 2.67/0.94  % BCE start: 127
% 2.67/0.94  % BCE eliminated: 89
% 2.67/0.94  % PE start: 38
% 2.67/0.94  logic: eq
% 2.67/0.94  % PE eliminated: 2
% 2.67/0.94  % done 455 iterations in 0.239s
% 2.67/0.94  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 2.67/0.94  % SZS output start Refutation
% See solution above
% 2.67/0.94  
% 2.67/0.94  
% 2.67/0.94  % Terminating...
% 2.67/0.98  % Runner terminated.
% 2.67/1.00  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------