TSTP Solution File: KLE146+1 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : KLE146+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.6ufHGn7AlW true

% Computer : n031.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 Aug 31 05:38:49 EDT 2023

% Result   : Theorem 0.18s 0.77s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   25 (  17 unt;   6 typ;   0 def)
%            Number of atoms       :   21 (  15 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   86 (   5   ~;   1   |;   0   &;  79   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0   ^;  24   !;   0   ?;  24   :)

% 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_cl27,plain,
    ( ( addition @ one @ ( strong_iteration @ sk_ ) )
   != ( strong_iteration @ sk_ ) ),
    inference('s_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_cl29,plain,
    ! [X0: $i] :
      ( ( addition @ one @ ( multiplication @ X0 @ ( strong_iteration @ X0 ) ) )
      = ( strong_iteration @ X0 ) ),
    inference('s_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_cl41,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_cl140,plain,
    ! [X0: $i] :
      ( ( addition @ one @ ( strong_iteration @ X0 ) )
      = ( strong_iteration @ X0 ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl29,zip_derived_cl41]) ).

thf(zip_derived_cl148,plain,
    ( ( strong_iteration @ sk_ )
   != ( strong_iteration @ sk_ ) ),
    inference(demod,[status(thm)],[zip_derived_cl27,zip_derived_cl140]) ).

thf(zip_derived_cl149,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl148]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : KLE146+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.6ufHGn7AlW true
% 0.11/0.32  % Computer : n031.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 : Tue Aug 29 13:02:41 EDT 2023
% 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.60  % Total configuration time : 435
% 0.18/0.60  % Estimated wc time : 1092
% 0.18/0.60  % Estimated cpu time (7 cpus) : 156.0
% 0.18/0.70  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.18/0.70  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.18/0.71  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.18/0.71  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.18/0.71  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.18/0.71  % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.18/0.71  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.18/0.77  % Solved by fo/fo1_av.sh.
% 0.18/0.77  % done 40 iterations in 0.035s
% 0.18/0.77  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.18/0.77  % SZS output start Refutation
% See solution above
% 0.18/0.77  
% 0.18/0.77  
% 0.18/0.77  % Terminating...
% 1.59/0.81  % Runner terminated.
% 1.62/0.83  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------