↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : KLE001+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.93Jr8cUCvu true

% Computer : n003.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:03 PM UTC 2025

% Result   : Theorem 0.58s 0.76s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   24 (  16 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  120 (   6   ~;   1   |;   0   &; 110   @)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   34 (   0   ^;  34   !;   0   ?;  34   :)

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

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

thf(sk__2_type,type,
    sk__2: $i ).

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

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

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

thf(goals,conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( leq @ X0 @ X1 )
     => ( leq @ ( addition @ X0 @ X2 ) @ ( addition @ X0 @ X2 ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [X0: $i,X1: $i,X2: $i] :
        ( ( leq @ X0 @ X1 )
       => ( leq @ ( addition @ X0 @ X2 ) @ ( addition @ X0 @ X2 ) ) ),
    inference('cnf.neg',[status(esa)],[goals]) ).

thf(zip_derived_cl13,plain,
    ~ ( leq @ ( addition @ sk_ @ sk__2 ) @ ( addition @ sk_ @ sk__2 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl28,plain,
    ( ( addition @ ( addition @ sk_ @ sk__2 ) @ ( addition @ sk_ @ sk__2 ) )
   != ( addition @ sk_ @ sk__2 ) ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl12,zip_derived_cl13]) ).

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_cl79,plain,
    ( ( addition @ sk_ @ ( addition @ sk__2 @ ( addition @ sk_ @ sk__2 ) ) )
   != ( addition @ sk_ @ sk__2 ) ),
    inference(demod,[status(thm)],[zip_derived_cl28,zip_derived_cl1]) ).

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

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_cl39,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( addition @ X0 @ ( addition @ X2 @ X1 ) )
      = ( addition @ X2 @ ( addition @ X1 @ X0 ) ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl1,zip_derived_cl0]) ).

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

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

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

thf(zip_derived_cl1_003,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_cl46,plain,
    ! [X0: $i,X1: $i] :
      ( ( addition @ X0 @ ( addition @ X0 @ X1 ) )
      = ( addition @ X0 @ X1 ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl3,zip_derived_cl1]) ).

thf(zip_derived_cl106,plain,
    ( ( addition @ sk_ @ sk__2 )
   != ( addition @ sk_ @ sk__2 ) ),
    inference(demod,[status(thm)],[zip_derived_cl79,zip_derived_cl39,zip_derived_cl3,zip_derived_cl46]) ).

thf(zip_derived_cl107,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl106]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE001+1 : TPTP v9.2.0. Released v4.0.0.
% 0.07/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.93Jr8cUCvu true
% 0.13/0.34  % Computer : n003.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Oct  1 14:00:53 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % Running portfolio for 300 s
% 0.13/0.34  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34  % Number of cores: 8
% 0.13/0.34  % Python version: Python 3.6.8
% 0.13/0.34  % Running in FO mode
% 0.57/0.64  % Total configuration time : 435
% 0.57/0.64  % Estimated wc time : 1092
% 0.57/0.64  % Estimated cpu time (7 cpus) : 156.0
% 0.58/0.71  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.58/0.72  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.58/0.76  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.58/0.76  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.58/0.76  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.58/0.76  % Solved by fo/fo6_bce.sh.
% 0.58/0.76  % BCE start: 15
% 0.58/0.76  % BCE eliminated: 0
% 0.58/0.76  % PE start: 15
% 0.58/0.76  logic: eq
% 0.58/0.76  % PE eliminated: 1
% 0.58/0.76  % done 23 iterations in 0.029s
% 0.58/0.76  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.58/0.76  % SZS output start Refutation
% See solution above
% 0.58/0.76  
% 0.58/0.76  
% 0.58/0.76  % Terminating...
% 0.61/0.86  % Runner terminated.
% 1.73/0.88  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------