↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n007.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:51 PM UTC 2025

% Result   : Theorem 0.52s 1.20s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   27 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   45 (  26 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  101 (  17   ~;   4   |;   0   &;  68   @)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   6 con; 0-2 aty)
%                                         (   5  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   20 (   5   ^;  15   !;   0   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
thf(list_list_a_type,type,
    list_list_a: $tType ).

thf(list_a_type,type,
    list_a: $tType ).

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

thf(zero_zero_nat_type,type,
    zero_zero_nat: nat ).

thf(k_type,type,
    k: nat ).

thf(listSl97544552lice_a_type,type,
    listSl97544552lice_a: list_a > nat > list_list_a ).

thf(ord_less_nat_type,type,
    ord_less_nat: nat > nat > $o ).

thf(nil_a_type,type,
    nil_a: list_a ).

thf(size_size_list_a_type,type,
    size_size_list_a: list_a > nat ).

thf(nil_list_a_type,type,
    nil_list_a: list_list_a ).

thf(conj_0,conjecture,
    ( ( listSl97544552lice_a @ nil_a @ k )
    = nil_list_a ) ).

thf(zf_stmt_0,negated_conjecture,
    ( ( listSl97544552lice_a @ nil_a @ k )
   != nil_list_a ),
    inference('cnf.neg',[status(esa)],[conj_0]) ).

thf(zip_derived_cl349,plain,
    ( ( listSl97544552lice_a @ nil_a @ k )
   != nil_list_a ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(fact_9_list__slice__less,axiom,
    ! [Xs: list_a,K: nat] :
      ( ( ord_less_nat @ ( size_size_list_a @ Xs ) @ K )
     => ( ( listSl97544552lice_a @ Xs @ K )
        = nil_list_a ) ) ).

thf(zip_derived_cl9,plain,
    ( !!
    @ ^ [Y0: list_a] :
        ( !!
        @ ^ [Y1: nat] :
            ( ( ord_less_nat @ ( size_size_list_a @ Y0 ) @ Y1 )
           => ( ( listSl97544552lice_a @ Y0 @ Y1 )
              = nil_list_a ) ) ) ),
    inference(cnf,[status(esa)],[fact_9_list__slice__less]) ).

thf(zip_derived_cl399,plain,
    ! [X2: list_a] :
      ( !!
      @ ^ [Y0: nat] :
          ( ( ord_less_nat @ ( size_size_list_a @ X2 ) @ Y0 )
         => ( ( listSl97544552lice_a @ X2 @ Y0 )
            = nil_list_a ) ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl9]) ).

thf(zip_derived_cl400,plain,
    ! [X2: list_a,X4: nat] :
      ( ( ord_less_nat @ ( size_size_list_a @ X2 ) @ X4 )
     => ( ( listSl97544552lice_a @ X2 @ X4 )
        = nil_list_a ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl399]) ).

thf(zip_derived_cl401,plain,
    ! [X2: list_a,X4: nat] :
      ( ~ ( ord_less_nat @ ( size_size_list_a @ X2 ) @ X4 )
      | ( ( listSl97544552lice_a @ X2 @ X4 )
        = nil_list_a ) ),
    inference(lazy_cnf_imply,[status(thm)],[zip_derived_cl400]) ).

thf(zip_derived_cl402,plain,
    ! [X2: list_a,X4: nat] :
      ( ~ ( ord_less_nat @ ( size_size_list_a @ X2 ) @ X4 )
      | ( ( listSl97544552lice_a @ X2 @ X4 )
        = nil_list_a ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl401]) ).

thf(zip_derived_cl349_001,plain,
    ( ( listSl97544552lice_a @ nil_a @ k )
   != nil_list_a ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl403,plain,
    ( ( nil_list_a != nil_list_a )
    | ~ ( ord_less_nat @ ( size_size_list_a @ nil_a ) @ k ) ),
    inference('sup-',[status(thm)],[zip_derived_cl402,zip_derived_cl349]) ).

thf(fact_57_list_Osize_I3_J,axiom,
    ( ( size_size_list_a @ nil_a )
    = zero_zero_nat ) ).

thf(zip_derived_cl57,plain,
    ( ( size_size_list_a @ nil_a )
    = zero_zero_nat ),
    inference(cnf,[status(esa)],[fact_57_list_Osize_I3_J]) ).

thf(zip_derived_cl405,plain,
    ( ( nil_list_a != nil_list_a )
    | ~ ( ord_less_nat @ zero_zero_nat @ k ) ),
    inference(demod,[status(thm)],[zip_derived_cl403,zip_derived_cl57]) ).

thf(zip_derived_cl406,plain,
    ~ ( ord_less_nat @ zero_zero_nat @ k ),
    inference(simplify,[status(thm)],[zip_derived_cl405]) ).

thf(fact_63_neq0__conv,axiom,
    ! [N: nat] :
      ( ( N != zero_zero_nat )
    <=> ( ord_less_nat @ zero_zero_nat @ N ) ) ).

thf(zip_derived_cl63,plain,
    ( !!
    @ ^ [Y0: nat] :
        ( ( Y0 != zero_zero_nat )
      <=> ( ord_less_nat @ zero_zero_nat @ Y0 ) ) ),
    inference(cnf,[status(esa)],[fact_63_neq0__conv]) ).

thf(zip_derived_cl625,plain,
    ! [X2: nat] :
      ( ( X2 != zero_zero_nat )
    <=> ( ord_less_nat @ zero_zero_nat @ X2 ) ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl63]) ).

thf(zip_derived_cl626,plain,
    ! [X2: nat] :
      ( ( X2 != zero_zero_nat )
      = ( ord_less_nat @ zero_zero_nat @ X2 ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl625]) ).

thf(zip_derived_cl630,plain,
    ~ ( ( k != zero_zero_nat ) ),
    inference('sup+',[status(thm)],[zip_derived_cl406,zip_derived_cl626]) ).

thf(zip_derived_cl644,plain,
    k = zero_zero_nat,
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl630]) ).

thf(fact_1_list__slice__0,axiom,
    ! [Xs: list_a] :
      ( ( listSl97544552lice_a @ Xs @ zero_zero_nat )
      = nil_list_a ) ).

thf(zip_derived_cl1,plain,
    ( !!
    @ ^ [Y0: list_a] :
        ( ( listSl97544552lice_a @ Y0 @ zero_zero_nat )
        = nil_list_a ) ),
    inference(cnf,[status(esa)],[fact_1_list__slice__0]) ).

thf(zip_derived_cl355,plain,
    ! [X2: list_a] :
      ( ( listSl97544552lice_a @ X2 @ zero_zero_nat )
      = nil_list_a ),
    inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1]) ).

thf(zip_derived_cl356,plain,
    ! [X2: list_a] :
      ( ( listSl97544552lice_a @ X2 @ zero_zero_nat )
      = nil_list_a ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl355]) ).

thf(zip_derived_cl656,plain,
    nil_list_a != nil_list_a,
    inference(demod,[status(thm)],[zip_derived_cl349,zip_derived_cl644,zip_derived_cl356]) ).

thf(zip_derived_cl657,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl656]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem  : ITP105^1 : TPTP v9.2.0. Released v7.5.0.
% 0.05/0.12  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.VN3eFKaPTM true
% 0.10/0.32  % Computer : n007.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Wed Oct  1 15:24:53 EDT 2025
% 0.10/0.32  % CPUTime  : 
% 0.10/0.32  % Running portfolio for 300 s
% 0.10/0.32  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.33  % Number of cores: 8
% 0.10/0.33  % Python version: Python 3.6.8
% 0.10/0.33  % Running in HO mode
% 0.49/0.63  % Total configuration time : 828
% 0.49/0.63  % Estimated wc time : 1656
% 0.49/0.63  % Estimated cpu time (8 cpus) : 207.0
% 0.50/0.83  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.50/0.86  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.50/0.86  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.50/0.87  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.51/0.90  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.51/0.92  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.51/0.92  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.51/0.96  % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 0.52/1.17  % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 0.52/1.20  % Solved by lams/35_full_unif4.sh.
% 0.52/1.20  % done 163 iterations in 0.281s
% 0.52/1.20  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.52/1.20  % SZS output start Refutation
% See solution above
% 0.52/1.20  
% 0.52/1.20  
% 0.52/1.20  % Terminating...
% 3.19/1.45  % Runner terminated.
% 3.19/1.46  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------