↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n027.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:30:31 PM UTC 2025

% Result   : Theorem 0.81s 0.65s
% Output   : Refutation 0.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   35 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  160 (  21   ~;  18   |;   3   &; 117   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   31 (   0   ^;  31   !;   0   ?;  31   :)

% Comments : 
%------------------------------------------------------------------------------
thf(state_type,type,
    state: $tType ).

thf(statement_type,type,
    statement: $tType ).

thf(label_type,type,
    label: $tType ).

thf(p8_type,type,
    p8: state ).

thf(fails_type,type,
    fails: state > state > $o ).

thf(p6_type,type,
    p6: state ).

thf(p3_type,type,
    p3: state ).

thf(goto_type,type,
    goto: label > statement ).

thf(loop_type,type,
    loop: label ).

thf(labels_type,type,
    labels: label > state > $o ).

thf(follows_type,type,
    follows: state > state > $o ).

thf(p7_type,type,
    p7: state ).

thf(has_type,type,
    has: state > statement > $o ).

thf(transition_3_to_6,axiom,
    follows @ p6 @ p3 ).

thf(zip_derived_cl12,plain,
    follows @ p6 @ p3,
    inference(cnf,[status(esa)],[transition_3_to_6]) ).

thf(direct_success,axiom,
    ! [Start_state: state,Goal_state: state] :
      ~ ( ( fails @ Goal_state @ Start_state )
        & ( follows @ Goal_state @ Start_state ) ) ).

thf(zip_derived_cl0,plain,
    ! [X0: state,X1: state] :
      ( ~ ( fails @ X0 @ X1 )
      | ~ ( follows @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[direct_success]) ).

thf(zip_derived_cl25,plain,
    ~ ( fails @ p6 @ p3 ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl12,zip_derived_cl0]) ).

thf(prove_there_is_a_loop_through_p3,conjecture,
    ~ ( fails @ p3 @ p3 ) ).

thf(zf_stmt_0,negated_conjecture,
    fails @ p3 @ p3,
    inference('cnf.neg',[status(esa)],[prove_there_is_a_loop_through_p3]) ).

thf(zip_derived_cl18,plain,
    fails @ p3 @ p3,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(transitivity_of_success,axiom,
    ! [Intermediate_state: state,Start_state: state,Goal_state: state] :
      ( ( fails @ Goal_state @ Start_state )
     => ( ( fails @ Goal_state @ Intermediate_state )
        | ( fails @ Intermediate_state @ Start_state ) ) ) ).

thf(zip_derived_cl1,plain,
    ! [X0: state,X1: state,X2: state] :
      ( ( fails @ X0 @ X1 )
      | ~ ( fails @ X2 @ X1 )
      | ( fails @ X2 @ X0 ) ),
    inference(cnf,[status(esa)],[transitivity_of_success]) ).

thf(zip_derived_cl28,plain,
    ! [X0: state] :
      ( ( fails @ X0 @ p3 )
      | ( fails @ p3 @ X0 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl18,zip_derived_cl1]) ).

thf(zip_derived_cl1_001,plain,
    ! [X0: state,X1: state,X2: state] :
      ( ( fails @ X0 @ X1 )
      | ~ ( fails @ X2 @ X1 )
      | ( fails @ X2 @ X0 ) ),
    inference(cnf,[status(esa)],[transitivity_of_success]) ).

thf(zip_derived_cl31,plain,
    ! [X0: state,X1: state] :
      ( ( fails @ p3 @ X0 )
      | ( fails @ X1 @ p3 )
      | ( fails @ X0 @ X1 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl28,zip_derived_cl1]) ).

thf(transition_7_to_8,axiom,
    follows @ p8 @ p7 ).

thf(zip_derived_cl16,plain,
    follows @ p8 @ p7,
    inference(cnf,[status(esa)],[transition_7_to_8]) ).

thf(zip_derived_cl0_002,plain,
    ! [X0: state,X1: state] :
      ( ~ ( fails @ X0 @ X1 )
      | ~ ( follows @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[direct_success]) ).

thf(zip_derived_cl27,plain,
    ~ ( fails @ p8 @ p7 ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl16,zip_derived_cl0]) ).

thf(zip_derived_cl49,plain,
    ( ( fails @ p7 @ p3 )
    | ( fails @ p3 @ p8 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl31,zip_derived_cl27]) ).

thf(state_8,axiom,
    has @ p8 @ ( goto @ loop ) ).

thf(zip_derived_cl17,plain,
    has @ p8 @ ( goto @ loop ),
    inference(cnf,[status(esa)],[state_8]) ).

thf(label_state_3,axiom,
    labels @ loop @ p3 ).

thf(zip_derived_cl7,plain,
    labels @ loop @ p3,
    inference(cnf,[status(esa)],[label_state_3]) ).

thf(goto_success,axiom,
    ! [Label: label,Start_state: state,Goal_state: state] :
      ~ ( ( fails @ Goal_state @ Start_state )
        & ( has @ Start_state @ ( goto @ Label ) )
        & ( labels @ Label @ Goal_state ) ) ).

thf(zip_derived_cl2,plain,
    ! [X0: state,X1: label,X2: state] :
      ( ~ ( has @ X0 @ ( goto @ X1 ) )
      | ~ ( labels @ X1 @ X2 )
      | ~ ( fails @ X2 @ X0 ) ),
    inference(cnf,[status(esa)],[goto_success]) ).

thf(zip_derived_cl19,plain,
    ! [X0: state] :
      ( ~ ( fails @ p3 @ X0 )
      | ~ ( has @ X0 @ ( goto @ loop ) ) ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl7,zip_derived_cl2]) ).

thf(zip_derived_cl21,plain,
    ~ ( fails @ p3 @ p8 ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl17,zip_derived_cl19]) ).

thf(zip_derived_cl64,plain,
    fails @ p7 @ p3,
    inference(demod,[status(thm)],[zip_derived_cl49,zip_derived_cl21]) ).

thf(zip_derived_cl1_003,plain,
    ! [X0: state,X1: state,X2: state] :
      ( ( fails @ X0 @ X1 )
      | ~ ( fails @ X2 @ X1 )
      | ( fails @ X2 @ X0 ) ),
    inference(cnf,[status(esa)],[transitivity_of_success]) ).

thf(zip_derived_cl67,plain,
    ! [X0: state] :
      ( ( fails @ X0 @ p3 )
      | ( fails @ p7 @ X0 ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl64,zip_derived_cl1]) ).

thf(transition_6_to_7,axiom,
    follows @ p7 @ p6 ).

thf(zip_derived_cl14,plain,
    follows @ p7 @ p6,
    inference(cnf,[status(esa)],[transition_6_to_7]) ).

thf(zip_derived_cl0_004,plain,
    ! [X0: state,X1: state] :
      ( ~ ( fails @ X0 @ X1 )
      | ~ ( follows @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[direct_success]) ).

thf(zip_derived_cl26,plain,
    ~ ( fails @ p7 @ p6 ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl14,zip_derived_cl0]) ).

thf(zip_derived_cl130,plain,
    fails @ p6 @ p3,
    inference('s_sup-',[status(thm)],[zip_derived_cl67,zip_derived_cl26]) ).

thf(zip_derived_cl131,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl25,zip_derived_cl130]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : COM002_2 : TPTP v9.2.0. Released v5.0.0.
% 0.05/0.11  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.vdzbkd5vt7 true
% 0.11/0.32  % Computer : n027.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 13:49:23 EDT 2025
% 0.11/0.33  % CPUTime  : 
% 0.11/0.33  % Running portfolio for 300 s
% 0.11/0.33  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.33  % Number of cores: 8
% 0.11/0.33  % Python version: Python 3.6.8
% 0.11/0.33  % Running in FO mode
% 0.18/0.54  % Total configuration time : 435
% 0.18/0.54  % Estimated wc time : 1092
% 0.18/0.54  % Estimated cpu time (7 cpus) : 156.0
% 0.54/0.62  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.54/0.62  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.81/0.64  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.81/0.65  % Solved by fo/fo6_bce.sh.
% 0.81/0.65  % BCE start: 19
% 0.81/0.65  % BCE eliminated: 4
% 0.81/0.65  % PE start: 15
% 0.81/0.65  logic: neq
% 0.81/0.65  % PE eliminated: 5
% 0.81/0.65  % done 50 iterations in 0.022s
% 0.81/0.65  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.81/0.65  % SZS output start Refutation
% See solution above
% 0.81/0.65  
% 0.81/0.65  
% 0.81/0.66  % Terminating...
% 1.15/0.76  % Runner terminated.
% 1.42/0.78  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------