↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n013.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:35:11 PM UTC 2025

% Result   : Theorem 0.63s 0.84s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   45 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :  126 (  26 equ;   0 cnn)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  359 (  45   ~;  39   |;  31   &; 233   @)
%                                         (   1 <=>;   8  =>;   0  <=;   2 <~>)
%            Maximal formula depth :   17 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  19 usr;   7 con; 0-3 aty)
%            Number of variables   :   79 (   0   ^;  75   !;   4   ?;  79   :)

% Comments : 
%------------------------------------------------------------------------------
thf(edge_type,type,
    edge: $i > $o ).

thf(sequential_type,type,
    sequential: $i > $i > $o ).

thf(length_of_type,type,
    length_of: $i > $i ).

thf(sk__11_type,type,
    sk__11: $i ).

thf(in_path_type,type,
    in_path: $i > $i > $o ).

thf(vertex_type,type,
    vertex: $i > $o ).

thf(precedes_type,type,
    precedes: $i > $i > $i > $o ).

thf(head_of_type,type,
    head_of: $i > $i ).

thf(sk__8_type,type,
    sk__8: $i ).

thf(on_path_type,type,
    on_path: $i > $i > $o ).

thf(sk__10_type,type,
    sk__10: $i ).

thf(shortest_path_type,type,
    shortest_path: $i > $i > $i > $o ).

thf(less_or_equal_type,type,
    less_or_equal: $i > $i > $o ).

thf(tail_of_type,type,
    tail_of: $i > $i ).

thf(sk__12_type,type,
    sk__12: $i ).

thf(empty_type,type,
    empty: $i ).

thf(path_type,type,
    path: $i > $i > $i > $o ).

thf(path_cons_type,type,
    path_cons: $i > $i > $i ).

thf(sk__9_type,type,
    sk__9: $i ).

thf(vertices_and_edges,conjecture,
    ! [V1: $i,V2: $i,E1: $i,E2: $i,P: $i] :
      ( ( ( shortest_path @ V1 @ V2 @ P )
        & ( precedes @ E1 @ E2 @ P ) )
     => ( ( vertex @ V1 )
        & ( vertex @ V2 )
        & ( V1 != V2 )
        & ( edge @ E1 )
        & ( edge @ E2 )
        & ( E1 != E2 )
        & ( path @ V1 @ V2 @ P ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [V1: $i,V2: $i,E1: $i,E2: $i,P: $i] :
        ( ( ( shortest_path @ V1 @ V2 @ P )
          & ( precedes @ E1 @ E2 @ P ) )
       => ( ( vertex @ V1 )
          & ( vertex @ V2 )
          & ( V1 != V2 )
          & ( edge @ E1 )
          & ( edge @ E2 )
          & ( E1 != E2 )
          & ( path @ V1 @ V2 @ P ) ) ),
    inference('cnf.neg',[status(esa)],[vertices_and_edges]) ).

thf(zip_derived_cl59,plain,
    shortest_path @ sk__8 @ sk__9 @ sk__12,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl61,plain,
    ( ~ ( vertex @ sk__8 )
    | ~ ( vertex @ sk__9 )
    | ( sk__8 = sk__9 )
    | ~ ( edge @ sk__10 )
    | ~ ( edge @ sk__11 )
    | ( sk__10 = sk__11 )
    | ~ ( path @ sk__8 @ sk__9 @ sk__12 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(path_properties,axiom,
    ! [V1: $i,V2: $i,P: $i] :
      ( ( path @ V1 @ V2 @ P )
     => ( ( vertex @ V1 )
        & ( vertex @ V2 )
        & ? [E: $i] :
            ( ( ( ( V2
                  = ( head_of @ E ) )
                & ( P
                  = ( path_cons @ E @ empty ) ) )
            <~> ? [TP: $i] :
                  ( ( P
                    = ( path_cons @ E @ TP ) )
                  & ( path @ ( head_of @ E ) @ V2 @ TP ) ) )
            & ( V1
              = ( tail_of @ E ) )
            & ( edge @ E ) ) ) ) ).

thf(zip_derived_cl11,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( vertex @ X0 )
      | ~ ( path @ X0 @ X1 @ X2 ) ),
    inference(cnf,[status(esa)],[path_properties]) ).

thf(zip_derived_cl380,plain,
    ( ~ ( path @ sk__8 @ sk__9 @ sk__12 )
    | ( sk__10 = sk__11 )
    | ~ ( edge @ sk__11 )
    | ~ ( edge @ sk__10 )
    | ( sk__8 = sk__9 )
    | ~ ( vertex @ sk__9 ) ),
    inference(clc,[status(thm)],[zip_derived_cl61,zip_derived_cl11]) ).

thf(zip_derived_cl12,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( vertex @ X0 )
      | ~ ( path @ X1 @ X0 @ X2 ) ),
    inference(cnf,[status(esa)],[path_properties]) ).

thf(zip_derived_cl381,plain,
    ( ( sk__8 = sk__9 )
    | ~ ( edge @ sk__10 )
    | ~ ( edge @ sk__11 )
    | ( sk__10 = sk__11 )
    | ~ ( path @ sk__8 @ sk__9 @ sk__12 ) ),
    inference(clc,[status(thm)],[zip_derived_cl380,zip_derived_cl12]) ).

thf(zip_derived_cl59_001,plain,
    shortest_path @ sk__8 @ sk__9 @ sk__12,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(shortest_path_defn,axiom,
    ! [V1: $i,V2: $i,SP: $i] :
      ( ( shortest_path @ V1 @ V2 @ SP )
    <=> ( ( path @ V1 @ V2 @ SP )
        & ( V1 != V2 )
        & ! [P: $i] :
            ( ( path @ V1 @ V2 @ P )
           => ( less_or_equal @ ( length_of @ SP ) @ ( length_of @ P ) ) ) ) ) ).

thf(zip_derived_cl38,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( path @ X0 @ X1 @ X2 )
      | ~ ( shortest_path @ X0 @ X1 @ X2 ) ),
    inference(cnf,[status(esa)],[shortest_path_defn]) ).

thf(zip_derived_cl385,plain,
    path @ sk__8 @ sk__9 @ sk__12,
    inference('s_sup-',[status(thm)],[zip_derived_cl59,zip_derived_cl38]) ).

thf(zip_derived_cl386,plain,
    ( ( sk__8 = sk__9 )
    | ~ ( edge @ sk__10 )
    | ~ ( edge @ sk__11 )
    | ( sk__10 = sk__11 ) ),
    inference(demod,[status(thm)],[zip_derived_cl381,zip_derived_cl385]) ).

thf(zip_derived_cl385_002,plain,
    path @ sk__8 @ sk__9 @ sk__12,
    inference('s_sup-',[status(thm)],[zip_derived_cl59,zip_derived_cl38]) ).

thf(zip_derived_cl60,plain,
    precedes @ sk__10 @ sk__11 @ sk__12,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(precedes_properties,axiom,
    ! [P: $i,V1: $i,V2: $i] :
      ( ( path @ V1 @ V2 @ P )
     => ! [E1: $i,E2: $i] :
          ( ( precedes @ E1 @ E2 @ P )
         => ( ( on_path @ E1 @ P )
            & ( on_path @ E2 @ P )
            & ( ( sequential @ E1 @ E2 )
            <~> ? [E3: $i] :
                  ( ( precedes @ E3 @ E2 @ P )
                  & ( sequential @ E1 @ E3 ) ) ) ) ) ) ).

thf(zip_derived_cl36,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ~ ( precedes @ X0 @ X1 @ X2 )
      | ( on_path @ X1 @ X2 )
      | ~ ( path @ X3 @ X4 @ X2 ) ),
    inference(cnf,[status(esa)],[precedes_properties]) ).

thf(zip_derived_cl423,plain,
    ! [X0: $i,X1: $i] :
      ( ( on_path @ sk__11 @ sk__12 )
      | ~ ( path @ X1 @ X0 @ sk__12 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl60,zip_derived_cl36]) ).

thf(zip_derived_cl424,plain,
    on_path @ sk__11 @ sk__12,
    inference('s_sup-',[status(thm)],[zip_derived_cl385,zip_derived_cl423]) ).

thf(zip_derived_cl385_003,plain,
    path @ sk__8 @ sk__9 @ sk__12,
    inference('s_sup-',[status(thm)],[zip_derived_cl59,zip_derived_cl38]) ).

thf(on_path_properties,axiom,
    ! [V1: $i,V2: $i,P: $i,E: $i] :
      ( ( ( path @ V1 @ V2 @ P )
        & ( on_path @ E @ P ) )
     => ( ( edge @ E )
        & ( in_path @ ( head_of @ E ) @ P )
        & ( in_path @ ( tail_of @ E ) @ P ) ) ) ).

thf(zip_derived_cl22,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ~ ( path @ X0 @ X1 @ X2 )
      | ~ ( on_path @ X3 @ X2 )
      | ( edge @ X3 ) ),
    inference(cnf,[status(esa)],[on_path_properties]) ).

thf(zip_derived_cl395,plain,
    ! [X0: $i] :
      ( ~ ( on_path @ X0 @ sk__12 )
      | ( edge @ X0 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl385,zip_derived_cl22]) ).

thf(zip_derived_cl430,plain,
    edge @ sk__11,
    inference('s_sup-',[status(thm)],[zip_derived_cl424,zip_derived_cl395]) ).

thf(zip_derived_cl435,plain,
    ( ( sk__8 = sk__9 )
    | ~ ( edge @ sk__10 )
    | ( sk__10 = sk__11 ) ),
    inference(demod,[status(thm)],[zip_derived_cl386,zip_derived_cl430]) ).

thf(zip_derived_cl385_004,plain,
    path @ sk__8 @ sk__9 @ sk__12,
    inference('s_sup-',[status(thm)],[zip_derived_cl59,zip_derived_cl38]) ).

thf(zip_derived_cl60_005,plain,
    precedes @ sk__10 @ sk__11 @ sk__12,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl37,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ~ ( precedes @ X0 @ X1 @ X2 )
      | ( on_path @ X0 @ X2 )
      | ~ ( path @ X3 @ X4 @ X2 ) ),
    inference(cnf,[status(esa)],[precedes_properties]) ).

thf(zip_derived_cl428,plain,
    ! [X0: $i,X1: $i] :
      ( ( on_path @ sk__10 @ sk__12 )
      | ~ ( path @ X1 @ X0 @ sk__12 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl60,zip_derived_cl37]) ).

thf(zip_derived_cl436,plain,
    on_path @ sk__10 @ sk__12,
    inference('s_sup-',[status(thm)],[zip_derived_cl385,zip_derived_cl428]) ).

thf(zip_derived_cl395_006,plain,
    ! [X0: $i] :
      ( ~ ( on_path @ X0 @ sk__12 )
      | ( edge @ X0 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl385,zip_derived_cl22]) ).

thf(zip_derived_cl445,plain,
    edge @ sk__10,
    inference('s_sup-',[status(thm)],[zip_derived_cl436,zip_derived_cl395]) ).

thf(zip_derived_cl452,plain,
    ( ( sk__8 = sk__9 )
    | ( sk__10 = sk__11 ) ),
    inference(demod,[status(thm)],[zip_derived_cl435,zip_derived_cl445]) ).

thf(zip_derived_cl60_007,plain,
    precedes @ sk__10 @ sk__11 @ sk__12,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl453,plain,
    ( ( sk__8 = sk__9 )
    | ( precedes @ sk__10 @ sk__10 @ sk__12 ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl452,zip_derived_cl60]) ).

thf(zip_derived_cl59_008,plain,
    shortest_path @ sk__8 @ sk__9 @ sk__12,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(shortest_path_properties,axiom,
    ! [V1: $i,V2: $i,E1: $i,E2: $i,P: $i] :
      ( ( ( shortest_path @ V1 @ V2 @ P )
        & ( precedes @ E1 @ E2 @ P ) )
     => ( ~ ? [E3: $i] :
              ( ( ( head_of @ E3 )
                = ( head_of @ E2 ) )
              & ( ( tail_of @ E3 )
                = ( tail_of @ E1 ) ) )
        & ~ ( precedes @ E2 @ E1 @ P ) ) ) ).

thf(zip_derived_cl44,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ~ ( precedes @ X0 @ X1 @ X2 )
      | ~ ( precedes @ X1 @ X0 @ X2 )
      | ~ ( shortest_path @ X3 @ X4 @ X2 ) ),
    inference(cnf,[status(esa)],[shortest_path_properties]) ).

thf(zip_derived_cl378,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ~ ( shortest_path @ X3 @ X2 @ X0 )
      | ~ ( precedes @ X1 @ X1 @ X0 ) ),
    inference(eq_fact,[status(thm)],[zip_derived_cl44]) ).

thf(zip_derived_cl379,plain,
    ! [X0: $i] :
      ~ ( precedes @ X0 @ X0 @ sk__12 ),
    inference('s_sup-',[status(thm)],[zip_derived_cl59,zip_derived_cl378]) ).

thf(zip_derived_cl475,plain,
    sk__8 = sk__9,
    inference(clc,[status(thm)],[zip_derived_cl453,zip_derived_cl379]) ).

thf(zip_derived_cl39,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 != X0 )
      | ~ ( shortest_path @ X1 @ X0 @ X2 ) ),
    inference(cnf,[status(esa)],[shortest_path_defn]) ).

thf(zip_derived_cl372,plain,
    ! [X0: $i,X1: $i] :
      ~ ( shortest_path @ X1 @ X1 @ X0 ),
    inference(eq_res,[status(thm)],[zip_derived_cl39]) ).

thf(zip_derived_cl476,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl59,zip_derived_cl475,zip_derived_cl372]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRA003+1 : TPTP v9.2.0. Bugfixed v3.2.0.
% 0.04/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.gNMbQSYIGt true
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Oct  1 13:51:23 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Running portfolio for 300 s
% 0.13/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35  % Number of cores: 8
% 0.21/0.36  % Python version: Python 3.6.8
% 0.21/0.36  % Running in FO mode
% 0.59/0.69  % Total configuration time : 435
% 0.59/0.69  % Estimated wc time : 1092
% 0.59/0.69  % Estimated cpu time (7 cpus) : 156.0
% 0.62/0.76  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.62/0.78  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.62/0.81  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.62/0.81  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.62/0.82  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.63/0.84  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.63/0.84  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.63/0.84  % Solved by fo/fo6_bce.sh.
% 0.63/0.84  % BCE start: 62
% 0.63/0.84  % BCE eliminated: 6
% 0.63/0.84  % PE start: 56
% 0.63/0.84  logic: eq
% 0.63/0.84  % PE eliminated: 8
% 0.63/0.84  % done 77 iterations in 0.058s
% 0.63/0.84  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.63/0.84  % SZS output start Refutation
% See solution above
% 0.63/0.84  
% 0.63/0.84  
% 0.63/0.84  % Terminating...
% 0.69/0.90  % Runner terminated.
% 0.69/0.91  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------