↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n010.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:40:22 PM UTC 2025

% Result   : Theorem 0.50s 2.39s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :   23 (  17 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  100 (   5   ~;   1   |;   0   &;  93   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   0   ^;  26   !;   0   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
thf(multiplication_type,type,
    multiplication: $i > $i > $i ).

thf(one_type,type,
    one: $i ).

thf(addition_type,type,
    addition: $i > $i > $i ).

thf(leq_type,type,
    leq: $i > $i > $o ).

thf(strong_iteration_type,type,
    strong_iteration: $i > $i ).

thf(sk__type,type,
    sk_: $i ).

thf(order,axiom,
    ! [A: $i,B: $i] :
      ( ( leq @ A @ B )
    <=> ( ( addition @ A @ B )
        = B ) ) ).

thf(zip_derived_cl18,plain,
    ! [X0: $i,X1: $i] :
      ( ( leq @ X0 @ X1 )
      | ( ( addition @ X0 @ X1 )
       != X1 ) ),
    inference(cnf,[status(esa)],[order]) ).

thf(goals,conjecture,
    ! [X0: $i] : ( leq @ one @ ( strong_iteration @ X0 ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [X0: $i] : ( leq @ one @ ( strong_iteration @ X0 ) ),
    inference('cnf.neg',[status(esa)],[goals]) ).

thf(zip_derived_cl19,plain,
    ~ ( leq @ one @ ( strong_iteration @ sk_ ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl43,plain,
    ( ( addition @ one @ ( strong_iteration @ sk_ ) )
   != ( strong_iteration @ sk_ ) ),
    inference('sup-',[status(thm)],[zip_derived_cl18,zip_derived_cl19]) ).

thf(infty_unfold1,axiom,
    ! [A: $i] :
      ( ( strong_iteration @ A )
      = ( addition @ ( multiplication @ A @ ( strong_iteration @ A ) ) @ one ) ) ).

thf(zip_derived_cl14,plain,
    ! [X0: $i] :
      ( ( strong_iteration @ X0 )
      = ( addition @ ( multiplication @ X0 @ ( strong_iteration @ X0 ) ) @ one ) ),
    inference(cnf,[status(esa)],[infty_unfold1]) ).

thf(additive_commutativity,axiom,
    ! [A: $i,B: $i] :
      ( ( addition @ A @ B )
      = ( addition @ B @ A ) ) ).

thf(zip_derived_cl0,plain,
    ! [X0: $i,X1: $i] :
      ( ( addition @ X1 @ X0 )
      = ( addition @ X0 @ X1 ) ),
    inference(cnf,[status(esa)],[additive_commutativity]) ).

thf(zip_derived_cl48,plain,
    ! [X0: $i] :
      ( ( addition @ one @ ( multiplication @ X0 @ ( strong_iteration @ X0 ) ) )
      = ( strong_iteration @ X0 ) ),
    inference('sup+',[status(thm)],[zip_derived_cl14,zip_derived_cl0]) ).

thf(idempotence,axiom,
    ! [A: $i] :
      ( ( addition @ A @ A )
      = A ) ).

thf(zip_derived_cl3,plain,
    ! [X0: $i] :
      ( ( addition @ X0 @ X0 )
      = X0 ),
    inference(cnf,[status(esa)],[idempotence]) ).

thf(additive_associativity,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ( addition @ A @ ( addition @ B @ C ) )
      = ( addition @ ( addition @ A @ B ) @ C ) ) ).

thf(zip_derived_cl1,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( addition @ X0 @ ( addition @ X1 @ X2 ) )
      = ( addition @ ( addition @ X0 @ X1 ) @ X2 ) ),
    inference(cnf,[status(esa)],[additive_associativity]) ).

thf(zip_derived_cl61,plain,
    ! [X0: $i,X1: $i] :
      ( ( addition @ X0 @ ( addition @ X0 @ X1 ) )
      = ( addition @ X0 @ X1 ) ),
    inference('sup+',[status(thm)],[zip_derived_cl3,zip_derived_cl1]) ).

thf(zip_derived_cl279,plain,
    ! [X0: $i] :
      ( ( addition @ one @ ( strong_iteration @ X0 ) )
      = ( addition @ one @ ( multiplication @ X0 @ ( strong_iteration @ X0 ) ) ) ),
    inference('sup+',[status(thm)],[zip_derived_cl48,zip_derived_cl61]) ).

thf(zip_derived_cl48_001,plain,
    ! [X0: $i] :
      ( ( addition @ one @ ( multiplication @ X0 @ ( strong_iteration @ X0 ) ) )
      = ( strong_iteration @ X0 ) ),
    inference('sup+',[status(thm)],[zip_derived_cl14,zip_derived_cl0]) ).

thf(zip_derived_cl292,plain,
    ! [X0: $i] :
      ( ( addition @ one @ ( strong_iteration @ X0 ) )
      = ( strong_iteration @ X0 ) ),
    inference(demod,[status(thm)],[zip_derived_cl279,zip_derived_cl48]) ).

thf(zip_derived_cl305,plain,
    ( ( strong_iteration @ sk_ )
   != ( strong_iteration @ sk_ ) ),
    inference(demod,[status(thm)],[zip_derived_cl43,zip_derived_cl292]) ).

thf(zip_derived_cl306,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl305]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.92  % Problem  : KLE146+1 : TPTP v9.2.0. Released v4.0.0.
% 0.10/1.02  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.qI0xvErGIB true
% 0.12/1.42  % Computer : n010.cluster.edu
% 0.12/1.42  % Model    : x86_64 x86_64
% 0.12/1.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/1.42  % Memory   : 8042.1875MB
% 0.12/1.42  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/1.42  % CPULimit : 300
% 0.12/1.42  % WCLimit  : 300
% 0.12/1.42  % DateTime : Wed Oct  1 14:01:09 EDT 2025
% 0.12/1.44  % CPUTime  : 
% 0.12/1.44  % Running portfolio for 300 s
% 0.12/1.44  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/1.45  % Number of cores: 8
% 0.12/1.47  % Python version: Python 3.6.8
% 0.12/1.48  % Running in FO mode
% 0.35/1.94  % Total configuration time : 435
% 0.35/1.94  % Estimated wc time : 1092
% 0.35/1.94  % Estimated cpu time (7 cpus) : 156.0
% 0.47/2.18  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.49/2.27  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.49/2.28  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.49/2.29  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.50/2.31  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.50/2.33  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.50/2.33  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 0.50/2.39  % Solved by fo/fo3_bce.sh.
% 0.50/2.39  % BCE start: 20
% 0.50/2.39  % BCE eliminated: 0
% 0.50/2.39  % PE start: 20
% 0.50/2.39  logic: eq
% 0.50/2.39  % PE eliminated: 0
% 0.50/2.39  % done 55 iterations in 0.092s
% 0.50/2.39  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.50/2.39  % SZS output start Refutation
% See solution above
% 0.50/2.39  
% 0.50/2.39  
% 0.50/2.39  % Terminating...
% 1.27/2.61  % Runner terminated.
% 1.27/2.61  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------