↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : ITP102^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.hJINySem4q true

% Computer : n029.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:50 PM UTC 2025

% Result   : Theorem 26.96s 4.09s
% Output   : Refutation 26.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   12 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (   7 equ;   1 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  100 (   5   ~;   3   |;   0   &;  78   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (   9 usr;   5 con; 0-3 aty)
%                                         (   8  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   17 (   8   ^;   9   !;   0   ?;  17   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

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

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

thf(f_type,type,
    f: nat > a ).

thf(g_type,type,
    g: nat > a ).

thf(nth_a_type,type,
    nth_a: list_a > nat > a ).

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

thf(ord_less_eq_nat_type,type,
    ord_less_eq_nat: nat > nat > $o ).

thf(listIn1312259492pend_a_type,type,
    listIn1312259492pend_a: list_a > ( nat > a ) > nat > a ).

thf(ys_type,type,
    ys: list_a ).

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

thf(xs_type,type,
    xs: list_a ).

thf(conj_0,axiom,
    ! [X5: nat] :
      ( ( listIn1312259492pend_a @ xs @ f @ X5 )
      = ( listIn1312259492pend_a @ ys @ g @ X5 ) ) ).

thf(zip_derived_cl252,plain,
    ( !!
    @ ^ [Y0: nat] :
        ( ( listIn1312259492pend_a @ xs @ f @ Y0 )
        = ( listIn1312259492pend_a @ ys @ g @ Y0 ) ) ),
    inference(cnf,[status(esa)],[conj_0]) ).

thf(fact_3_i__append__nth1,axiom,
    ! [N: nat,Xs: list_a,F: nat > a] :
      ( ( ord_less_nat @ N @ ( size_size_list_a @ Xs ) )
     => ( ( listIn1312259492pend_a @ Xs @ F @ N )
        = ( nth_a @ Xs @ N ) ) ) ).

thf(zip_derived_cl3,plain,
    ( !!
    @ ^ [Y0: nat] :
        ( !!
        @ ^ [Y1: list_a] :
            ( !!
            @ ^ [Y2: nat > a] :
                ( ( ord_less_nat @ Y0 @ ( size_size_list_a @ Y1 ) )
               => ( ( listIn1312259492pend_a @ Y1 @ Y2 @ Y0 )
                  = ( nth_a @ Y1 @ Y0 ) ) ) ) ) ),
    inference(cnf,[status(esa)],[fact_3_i__append__nth1]) ).

thf(conj_1,axiom,
    ord_less_eq_nat @ ( size_size_list_a @ xs ) @ ( size_size_list_a @ ys ) ).

thf(zip_derived_cl253,plain,
    ord_less_eq_nat @ ( size_size_list_a @ xs ) @ ( size_size_list_a @ ys ),
    inference(cnf,[status(esa)],[conj_1]) ).

thf(conj_2,conjecture,
    ! [I: nat] :
      ( ~ ( ord_less_nat @ I @ ( size_size_list_a @ xs ) )
      | ( ( nth_a @ xs @ I )
        = ( nth_a @ ys @ I ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [I: nat] :
        ( ~ ( ord_less_nat @ I @ ( size_size_list_a @ xs ) )
        | ( ( nth_a @ xs @ I )
          = ( nth_a @ ys @ I ) ) ),
    inference('cnf.neg',[status(esa)],[conj_2]) ).

thf(zip_derived_cl254,plain,
    ~ ( !!
      @ ^ [Y0: nat] :
          ( ( (~) @ ( ord_less_nat @ Y0 @ ( size_size_list_a @ xs ) ) )
          | ( ( nth_a @ xs @ Y0 )
            = ( nth_a @ ys @ Y0 ) ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(fact_102_dual__order_Ostrict__trans1,axiom,
    ! [B: nat,A: nat,C: nat] :
      ( ( ord_less_eq_nat @ B @ A )
     => ( ( ord_less_nat @ C @ B )
       => ( ord_less_nat @ C @ A ) ) ) ).

thf(zip_derived_cl102,plain,
    ( !!
    @ ^ [Y0: nat] :
        ( !!
        @ ^ [Y1: nat] :
            ( !!
            @ ^ [Y2: nat] :
                ( ( ord_less_eq_nat @ Y0 @ Y1 )
               => ( ( ord_less_nat @ Y2 @ Y0 )
                 => ( ord_less_nat @ Y2 @ Y1 ) ) ) ) ) ),
    inference(cnf,[status(esa)],[fact_102_dual__order_Ostrict__trans1]) ).

thf(zip_derived_cl3857,plain,
    $false,
    inference(eprover,[status(thm)],[zip_derived_cl252,zip_derived_cl3,zip_derived_cl253,zip_derived_cl254,zip_derived_cl102]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ITP102^1 : TPTP v9.2.0. Released v7.5.0.
% 0.06/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.hJINySem4q true
% 0.14/0.36  % Computer : n029.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Wed Oct  1 15:28:53 EDT 2025
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  % Running portfolio for 300 s
% 0.14/0.36  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36  % Number of cores: 8
% 0.14/0.36  % Python version: Python 3.6.8
% 0.14/0.36  % Running in HO mode
% 0.55/0.67  % Total configuration time : 828
% 0.55/0.67  % Estimated wc time : 1656
% 0.55/0.67  % Estimated cpu time (8 cpus) : 207.0
% 0.58/0.74  % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.58/0.74  % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.58/0.78  % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.58/0.79  % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.58/0.79  % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.58/0.80  % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.58/0.80  % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.58/0.81  % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 0.58/0.83  % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 26.96/4.09  % Solved by lams/15_e_short1.sh.
% 26.96/4.09  % done 210 iterations in 3.235s
% 26.96/4.09  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 26.96/4.09  % SZS output start Refutation
% See solution above
% 26.96/4.09  
% 26.96/4.09  
% 26.96/4.09  % Terminating...
% 27.40/4.19  % Runner terminated.
% 27.40/4.20  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------