↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM736^4 : TPTP v9.2.0. Released v7.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.ALGcUF841a true

% Computer : n014.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:48:09 PM UTC 2025

% Result   : Theorem 5.14s 1.23s
% Output   : Refutation 5.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   29 (  25 unt;   0 typ;   0 def)
%            Number of atoms       :  105 (  24 equ;   0 cnn)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  250 (   2   ~;   0   |;   0   &; 233   @)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  18 usr;   4 con; 0-3 aty)
%                                         (   2  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   64 (  57   ^;   7   !;   0   ?;  64   :)

% Comments : 
%------------------------------------------------------------------------------
thf(d_29_ii_type,type,
    d_29_ii: $i > $i > $o ).

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

thf(nat_type,type,
    nat: $i ).

thf(is_of_type,type,
    is_of: $i > ( $i > $o ) > $o ).

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

thf(l_some_type,type,
    l_some: $i > ( $i > $o ) > $o ).

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

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

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

thf(pair1type_type,type,
    pair1type: $i > $i ).

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

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

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

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

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

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

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

thf(n_pl_type,type,
    n_pl: $i > $i > $i ).

thf(def_lessf,axiom,
    ( lessf
    = ( ^ [X0: $i,X1: $i] : ( iii @ ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) ) ) ).

thf(def_iii,axiom,
    ( iii
    = ( ^ [X0: $i,X1: $i] : ( n_some @ ( diffprop @ X1 @ X0 ) ) ) ) ).

thf(def_diffprop,axiom,
    ( diffprop
    = ( ^ [X0: $i,X1: $i,X2: $i] : ( n_is @ X0 @ ( n_pl @ X1 @ X2 ) ) ) ) ).

thf('0',plain,
    ( diffprop
    = ( ^ [X0: $i,X1: $i,X2: $i] : ( n_is @ X0 @ ( n_pl @ X1 @ X2 ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[def_diffprop]) ).

thf('1',plain,
    ( diffprop
    = ( ^ [V_1: $i,V_2: $i,V_3: $i] : ( n_is @ V_1 @ ( n_pl @ V_2 @ V_3 ) ) ) ),
    define([status(thm)]) ).

thf(def_n_some,axiom,
    ( n_some
    = ( l_some @ nat ) ) ).

thf('2',plain,
    ( n_some
    = ( l_some @ nat ) ),
    inference(simplify_rw_rule,[status(thm)],[def_n_some]) ).

thf('3',plain,
    ( n_some
    = ( l_some @ nat ) ),
    define([status(thm)]) ).

thf('4',plain,
    ( iii
    = ( ^ [X0: $i,X1: $i] : ( n_some @ ( diffprop @ X1 @ X0 ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[def_iii,'1','3']) ).

thf('5',plain,
    ( iii
    = ( ^ [V_1: $i,V_2: $i] : ( n_some @ ( diffprop @ V_2 @ V_1 ) ) ) ),
    define([status(thm)]) ).

thf('6',plain,
    ( lessf
    = ( ^ [X0: $i,X1: $i] : ( iii @ ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[def_lessf,'5','1','3']) ).

thf('7',plain,
    ( lessf
    = ( ^ [V_1: $i,V_2: $i] : ( iii @ ( n_ts @ ( num @ V_1 ) @ ( den @ V_2 ) ) @ ( n_ts @ ( num @ V_2 ) @ ( den @ V_1 ) ) ) ) ),
    define([status(thm)]) ).

thf(def_moref,axiom,
    ( moref
    = ( ^ [X0: $i,X1: $i] : ( d_29_ii @ ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) ) ) ).

thf(def_d_29_ii,axiom,
    ( d_29_ii
    = ( ^ [X0: $i,X1: $i] : ( n_some @ ( diffprop @ X0 @ X1 ) ) ) ) ).

thf('8',plain,
    ( d_29_ii
    = ( ^ [X0: $i,X1: $i] : ( n_some @ ( diffprop @ X0 @ X1 ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[def_d_29_ii,'1','3']) ).

thf('9',plain,
    ( d_29_ii
    = ( ^ [V_1: $i,V_2: $i] : ( n_some @ ( diffprop @ V_1 @ V_2 ) ) ) ),
    define([status(thm)]) ).

thf('10',plain,
    ( moref
    = ( ^ [X0: $i,X1: $i] : ( d_29_ii @ ( n_ts @ ( num @ X0 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X0 ) ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[def_moref,'9','1','3']) ).

thf('11',plain,
    ( moref
    = ( ^ [V_1: $i,V_2: $i] : ( d_29_ii @ ( n_ts @ ( num @ V_1 ) @ ( den @ V_2 ) ) @ ( n_ts @ ( num @ V_2 ) @ ( den @ V_1 ) ) ) ) ),
    define([status(thm)]) ).

thf(def_frac,axiom,
    ( frac
    = ( pair1type @ nat ) ) ).

thf('12',plain,
    ( frac
    = ( pair1type @ nat ) ),
    inference(simplify_rw_rule,[status(thm)],[def_frac]) ).

thf('13',plain,
    ( frac
    = ( pair1type @ nat ) ),
    define([status(thm)]) ).

thf(def_all_of,axiom,
    ( all_of
    = ( ^ [X0: $i > $o,X1: $i > $o] :
        ! [X2: $i] :
          ( ( is_of @ X2 @ X0 )
         => ( X1 @ X2 ) ) ) ) ).

thf('14',plain,
    ( all_of
    = ( ^ [X0: $i > $o,X1: $i > $o] :
        ! [X2: $i] :
          ( ( is_of @ X2 @ X0 )
         => ( X1 @ X2 ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[def_all_of]) ).

thf('15',plain,
    ( all_of
    = ( ^ [V_1: $i > $o,V_2: $i > $o] :
        ! [X4: $i] :
          ( ( is_of @ X4 @ V_1 )
         => ( V_2 @ X4 ) ) ) ),
    define([status(thm)]) ).

thf(satz42,conjecture,
    ( all_of
    @ ^ [X0: $i] : ( in @ X0 @ frac )
    @ ^ [X0: $i] :
        ( all_of
        @ ^ [X1: $i] : ( in @ X1 @ frac )
        @ ^ [X1: $i] :
            ( ( moref @ X0 @ X1 )
           => ( lessf @ X1 @ X0 ) ) ) ) ).

thf(zf_stmt_0,conjecture,
    ! [X4: $i] :
      ( ( is_of @ X4
        @ ^ [V_1: $i] : ( in @ V_1 @ ( pair1type @ nat ) ) )
     => ! [X6: $i] :
          ( ( is_of @ X6
            @ ^ [V_2: $i] : ( in @ V_2 @ ( pair1type @ nat ) ) )
         => ( ( l_some @ nat
              @ ^ [V_3: $i] : ( n_is @ ( n_ts @ ( num @ X4 ) @ ( den @ X6 ) ) @ ( n_pl @ ( n_ts @ ( num @ X6 ) @ ( den @ X4 ) ) @ V_3 ) ) )
           => ( l_some @ nat
              @ ^ [V_4: $i] : ( n_is @ ( n_ts @ ( num @ X4 ) @ ( den @ X6 ) ) @ ( n_pl @ ( n_ts @ ( num @ X6 ) @ ( den @ X4 ) ) @ V_4 ) ) ) ) ) ) ).

thf(zf_stmt_1,negated_conjecture,
    ~ ! [X4: $i] :
        ( ( is_of @ X4
          @ ^ [V_1: $i] : ( in @ V_1 @ ( pair1type @ nat ) ) )
       => ! [X6: $i] :
            ( ( is_of @ X6
              @ ^ [V_2: $i] : ( in @ V_2 @ ( pair1type @ nat ) ) )
           => ( ( l_some @ nat
                @ ^ [V_3: $i] : ( n_is @ ( n_ts @ ( num @ X4 ) @ ( den @ X6 ) ) @ ( n_pl @ ( n_ts @ ( num @ X6 ) @ ( den @ X4 ) ) @ V_3 ) ) )
             => ( l_some @ nat
                @ ^ [V_4: $i] : ( n_is @ ( n_ts @ ( num @ X4 ) @ ( den @ X6 ) ) @ ( n_pl @ ( n_ts @ ( num @ X6 ) @ ( den @ X4 ) ) @ V_4 ) ) ) ) ) ),
    inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl134,plain,
    ~ ( !!
      @ ^ [Y0: $i] :
          ( ( is_of @ Y0
            @ ^ [Y1: $i] : ( in @ Y1 @ ( pair1type @ nat ) ) )
         => ( !!
            @ ^ [Y1: $i] :
                ( ( is_of @ Y1
                  @ ^ [Y2: $i] : ( in @ Y2 @ ( pair1type @ nat ) ) )
               => ( ( l_some @ nat
                    @ ^ [Y2: $i] : ( n_is @ ( n_ts @ ( num @ Y0 ) @ ( den @ Y1 ) ) @ ( n_pl @ ( n_ts @ ( num @ Y1 ) @ ( den @ Y0 ) ) @ Y2 ) ) )
                 => ( l_some @ nat
                    @ ^ [Y2: $i] : ( n_is @ ( n_ts @ ( num @ Y0 ) @ ( den @ Y1 ) ) @ ( n_pl @ ( n_ts @ ( num @ Y1 ) @ ( den @ Y0 ) ) @ Y2 ) ) ) ) ) ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl259,plain,
    $false,
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl134]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM736^4 : TPTP v9.2.0. Released v7.1.0.
% 0.03/0.12  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.ALGcUF841a true
% 0.11/0.32  % Computer : n014.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Wed Oct  1 16:15:53 EDT 2025
% 0.11/0.32  % CPUTime  : 
% 0.11/0.32  % Running portfolio for 300 s
% 0.11/0.32  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.32  % Number of cores: 8
% 0.11/0.33  % Python version: Python 3.6.8
% 0.11/0.33  % Running in HO mode
% 0.48/0.63  % Total configuration time : 828
% 0.48/0.63  % Estimated wc time : 1656
% 0.48/0.63  % Estimated cpu time (8 cpus) : 207.0
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 0.49/0.71  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 5.14/1.23  % Solved by lams/30_sp5.sh.
% 5.14/1.23  % done 0 iterations in 0.489s
% 5.14/1.23  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 5.14/1.23  % SZS output start Refutation
% See solution above
% 5.14/1.23  
% 5.14/1.23  
% 5.14/1.23  % Terminating...
% 5.39/1.35  % Runner terminated.
% 5.39/1.36  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------