↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM301+1 : TPTP v9.2.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.latfTpbaWS true

% Computer : n018.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 Oct  2 04:46:07 PM UTC 2025

% Result   : Theorem 3.58s 1.16s
% Output   : Refutation 3.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   60 (   0 equ;   0 cnn)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  191 (  12   ~;   7   |;  14   &; 141   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (   9 usr;   7 con; 0-2 aty)
%                                         (  10  !!;   1  ??;   0 @@+;   0 @@-)
%            Number of variables   :   41 (  11   ^;  28   !;   2   ?;  41   :)

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

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

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

thf(nn3_type,type,
    nn3: $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(rdnn3,axiom,
    rdn_translate @ nn3 @ ( rdn_neg @ ( rdnn @ n3 ) ) ).

thf(zip_derived_cl130,plain,
    rdn_translate @ nn3 @ ( rdn_neg @ ( rdnn @ n3 ) ),
    inference(cnf,[status(esa)],[rdnn3]) ).

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

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

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

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

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

thf(zip_derived_cl282,plain,
    ( !!
    @ ^ [Y0: $i] :
        ( !!
        @ ^ [Y1: $i] :
            ( !!
            @ ^ [Y2: $i] :
                ( !!
                @ ^ [Y3: $i] :
                    ( ( ( rdn_positive_less @ Y3 @ Y2 )
                      & ( rdn_translate @ Y1 @ ( rdn_neg @ Y3 ) )
                      & ( rdn_translate @ Y0 @ ( rdn_neg @ Y2 ) ) )
                   => ( less @ Y0 @ Y1 ) ) ) ) ) ),
    inference(cnf,[status(esa)],[less_entry_point_neg_neg]) ).

thf(zip_derived_cl1046,plain,
    ! [X2: $i] :
      ( !!
      @ ^ [Y0: $i] :
          ( !!
          @ ^ [Y1: $i] :
              ( !!
              @ ^ [Y2: $i] :
                  ( ( ( rdn_positive_less @ Y2 @ Y1 )
                    & ( rdn_translate @ Y0 @ ( rdn_neg @ Y2 ) )
                    & ( rdn_translate @ X2 @ ( rdn_neg @ Y1 ) ) )
                 => ( less @ X2 @ Y0 ) ) ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl282]) ).

thf(zip_derived_cl1047,plain,
    ! [X2: $i,X4: $i] :
      ( !!
      @ ^ [Y0: $i] :
          ( !!
          @ ^ [Y1: $i] :
              ( ( ( rdn_positive_less @ Y1 @ Y0 )
                & ( rdn_translate @ X4 @ ( rdn_neg @ Y1 ) )
                & ( rdn_translate @ X2 @ ( rdn_neg @ Y0 ) ) )
             => ( less @ X2 @ X4 ) ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1046]) ).

thf(zip_derived_cl1048,plain,
    ! [X2: $i,X4: $i,X6: $i] :
      ( !!
      @ ^ [Y0: $i] :
          ( ( ( rdn_positive_less @ Y0 @ X6 )
            & ( rdn_translate @ X4 @ ( rdn_neg @ Y0 ) )
            & ( rdn_translate @ X2 @ ( rdn_neg @ X6 ) ) )
         => ( less @ X2 @ X4 ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1047]) ).

thf(zip_derived_cl1049,plain,
    ! [X2: $i,X4: $i,X6: $i,X8: $i] :
      ( ( ( rdn_positive_less @ X8 @ X6 )
        & ( rdn_translate @ X4 @ ( rdn_neg @ X8 ) )
        & ( rdn_translate @ X2 @ ( rdn_neg @ X6 ) ) )
     => ( less @ X2 @ X4 ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1048]) ).

thf(zip_derived_cl1050,plain,
    ! [X2: $i,X4: $i,X6: $i,X8: $i] :
      ( ~ ( ( rdn_positive_less @ X8 @ X6 )
          & ( rdn_translate @ X4 @ ( rdn_neg @ X8 ) )
          & ( rdn_translate @ X2 @ ( rdn_neg @ X6 ) ) )
      | ( less @ X2 @ X4 ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl1049]) ).

thf(zip_derived_cl1051,plain,
    ! [X2: $i,X4: $i,X6: $i,X8: $i] :
      ( ~ ( rdn_positive_less @ X8 @ X6 )
      | ~ ( rdn_translate @ X4 @ ( rdn_neg @ X8 ) )
      | ~ ( rdn_translate @ X2 @ ( rdn_neg @ X6 ) )
      | ( less @ X2 @ X4 ) ),
    inference(lazy_cnf_and,[status(thm)],[zip_derived_cl1050]) ).

thf(zip_derived_cl1053,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ( rdn_positive_less @ ( rdnn @ n2 ) @ X0 )
      | ~ ( rdn_translate @ X1 @ ( rdn_neg @ X0 ) )
      | ( less @ X1 @ nn2 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl129,zip_derived_cl1051]) ).

thf(something_less_nn2,conjecture,
    ? [X: $i] : ( less @ X @ nn2 ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ? [X: $i] : ( less @ X @ nn2 ),
    inference('cnf.neg',[status(esa)],[something_less_nn2]) ).

thf(zip_derived_cl401,plain,
    ~ ( ??
      @ ^ [Y0: $i] : ( less @ Y0 @ nn2 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl402,plain,
    ! [X2: $i] :
      ~ ( less @ X2 @ nn2 ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl401]) ).

thf(zip_derived_cl1181,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ( rdn_positive_less @ ( rdnn @ n2 ) @ X0 )
      | ~ ( rdn_translate @ X1 @ ( rdn_neg @ X0 ) ) ),
    inference(demod,[status(thm)],[zip_derived_cl1053,zip_derived_cl402]) ).

thf(zip_derived_cl1182,plain,
    ! [X0: $i] :
      ~ ( rdn_translate @ X0 @ ( rdn_neg @ ( rdnn @ n3 ) ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl267,zip_derived_cl1181]) ).

thf(zip_derived_cl1190,plain,
    $false,
    inference('s_sup-',[status(thm)],[zip_derived_cl130,zip_derived_cl1182]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15  % Problem  : NUM301+1 : TPTP v9.2.0. Released v3.1.0.
% 0.15/0.17  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.latfTpbaWS true
% 0.15/0.39  % Computer : n018.cluster.edu
% 0.15/0.39  % Model    : x86_64 x86_64
% 0.15/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39  % Memory   : 8042.1875MB
% 0.15/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39  % CPULimit : 300
% 0.15/0.39  % WCLimit  : 300
% 0.15/0.39  % DateTime : Wed Oct  1 16:40:38 EDT 2025
% 0.15/0.39  % CPUTime  : 
% 0.15/0.39  % Running portfolio for 300 s
% 0.15/0.39  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39  % Number of cores: 8
% 0.15/0.40  % Python version: Python 3.6.8
% 0.15/0.40  % Running in FO mode
% 0.36/0.72  % Total configuration time : 435
% 0.36/0.72  % Estimated wc time : 1092
% 0.36/0.72  % Estimated cpu time (7 cpus) : 156.0
% 0.36/0.75  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.36/0.76  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.36/0.78  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.36/0.81  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.36/0.82  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.36/0.83  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.36/0.83  % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.36/0.87  % /export/starexec/sandbox2/solver/bin/fo/fo1_lcnf.sh running for 50s
% 3.58/1.16  % Solved by fo/fo1_lcnf.sh.
% 3.58/1.16  % done 477 iterations in 0.267s
% 3.58/1.16  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 3.58/1.16  % SZS output start Refutation
% See solution above
% 3.58/1.16  
% 3.58/1.16  
% 3.58/1.16  % Terminating...
% 3.84/1.21  % Runner terminated.
% 3.84/1.22  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------