↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : ITP033^1 : TPTP v9.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Alyt0eYVZ9 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:38:37 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
thf(binary1439146945Tree_a_type,type,
    binary1439146945Tree_a: $tType ).

thf(a_type,type,
    a: $tType ).

thf(h_type,type,
    h: a > int ).

thf(t1_type,type,
    t1: binary1439146945Tree_a ).

thf(binary717961607le_T_a_type,type,
    binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a ).

thf(int_type,type,
    int: $tType ).

thf(t2_type,type,
    t2: binary1439146945Tree_a ).

thf(binary1721989714Tree_a_type,type,
    binary1721989714Tree_a: ( a > int ) > binary1439146945Tree_a > $o ).

thf(x_type,type,
    x: a ).

thf(conj_0,conjecture,
    binary1721989714Tree_a @ h @ t1 ).

thf(zf_stmt_0,negated_conjecture,
    ~ ( binary1721989714Tree_a @ h @ t1 ),
    inference('cnf.neg',[status(esa)],[conj_0]) ).

thf(zip_derived_cl353,plain,
    ~ ( binary1721989714Tree_a @ h @ t1 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(fact_3_sortLemmaL,axiom,
    ! [H: a > int,T1: binary1439146945Tree_a,X: a,T2: binary1439146945Tree_a] :
      ( ( binary1721989714Tree_a @ H @ ( binary717961607le_T_a @ T1 @ X @ T2 ) )
     => ( binary1721989714Tree_a @ H @ T1 ) ) ).

thf(zip_derived_cl3,plain,
    ( !!
    @ ^ [Y0: a > int] :
        ( !!
        @ ^ [Y1: binary1439146945Tree_a] :
            ( !!
            @ ^ [Y2: a] :
                ( !!
                @ ^ [Y3: binary1439146945Tree_a] :
                    ( ( binary1721989714Tree_a @ Y0 @ ( binary717961607le_T_a @ Y1 @ Y2 @ Y3 ) )
                   => ( binary1721989714Tree_a @ Y0 @ Y1 ) ) ) ) ) ),
    inference(cnf,[status(esa)],[fact_3_sortLemmaL]) ).

thf(zip_derived_cl405,plain,
    ! [X2: a > int] :
      ( !!
      @ ^ [Y0: binary1439146945Tree_a] :
          ( !!
          @ ^ [Y1: a] :
              ( !!
              @ ^ [Y2: binary1439146945Tree_a] :
                  ( ( binary1721989714Tree_a @ X2 @ ( binary717961607le_T_a @ Y0 @ Y1 @ Y2 ) )
                 => ( binary1721989714Tree_a @ X2 @ Y0 ) ) ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl3]) ).

thf(zip_derived_cl406,plain,
    ! [X2: a > int,X4: binary1439146945Tree_a] :
      ( !!
      @ ^ [Y0: a] :
          ( !!
          @ ^ [Y1: binary1439146945Tree_a] :
              ( ( binary1721989714Tree_a @ X2 @ ( binary717961607le_T_a @ X4 @ Y0 @ Y1 ) )
             => ( binary1721989714Tree_a @ X2 @ X4 ) ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl405]) ).

thf(zip_derived_cl407,plain,
    ! [X2: a > int,X4: binary1439146945Tree_a,X6: a] :
      ( !!
      @ ^ [Y0: binary1439146945Tree_a] :
          ( ( binary1721989714Tree_a @ X2 @ ( binary717961607le_T_a @ X4 @ X6 @ Y0 ) )
         => ( binary1721989714Tree_a @ X2 @ X4 ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl406]) ).

thf(zip_derived_cl408,plain,
    ! [X2: a > int,X4: binary1439146945Tree_a,X6: a,X8: binary1439146945Tree_a] :
      ( ( binary1721989714Tree_a @ X2 @ ( binary717961607le_T_a @ X4 @ X6 @ X8 ) )
     => ( binary1721989714Tree_a @ X2 @ X4 ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl407]) ).

thf(zip_derived_cl409,plain,
    ! [X2: a > int,X4: binary1439146945Tree_a,X6: a,X8: binary1439146945Tree_a] :
      ( ~ ( binary1721989714Tree_a @ X2 @ ( binary717961607le_T_a @ X4 @ X6 @ X8 ) )
      | ( binary1721989714Tree_a @ X2 @ X4 ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl408]) ).

thf(fact_1_s,axiom,
    binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) ).

thf(zip_derived_cl1,plain,
    binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ),
    inference(cnf,[status(esa)],[fact_1_s]) ).

thf(zip_derived_cl411,plain,
    binary1721989714Tree_a @ h @ t1,
    inference('sup+',[status(thm)],[zip_derived_cl409,zip_derived_cl1]) ).

thf(zip_derived_cl416,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl353,zip_derived_cl411]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ITP033^1 : TPTP v9.2.0. Released v7.5.0.
% 0.06/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Alyt0eYVZ9 true
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed Oct  1 15:26:23 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  % Running portfolio for 300 s
% 0.14/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.35  % Number of cores: 8
% 0.14/0.35  % Python version: Python 3.6.8
% 0.14/0.36  % Running in HO mode
% 0.56/0.66  % Total configuration time : 828
% 0.56/0.66  % Estimated wc time : 1656
% 0.56/0.66  % Estimated cpu time (8 cpus) : 207.0
% 0.57/0.71  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.57/0.73  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.57/0.74  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.57/0.75  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.57/0.75  % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.57/0.76  % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.57/0.76  % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.57/0.77  % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 0.57/0.80  % /export/starexec/sandbox/solver/bin/lams/30_b.l.sh running for 90s
% 0.57/0.80  % /export/starexec/sandbox/solver/bin/lams/35_full_unif.sh running for 56s
% 0.59/0.83  % Solved by lams/35_full_unif4.sh.
% 0.59/0.83  % done 26 iterations in 0.082s
% 0.59/0.83  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.59/0.83  % SZS output start Refutation
% See solution above
% 0.59/0.83  
% 0.59/0.83  
% 0.59/0.83  % Terminating...
% 0.62/0.87  % Runner terminated.
% 0.62/0.88  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------