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

View Problem - Process Solution

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

% Computer : n009.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:46 EDT 2023

% Result   : Theorem 0.54s 0.71s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   20 (  15 unt;   5 typ;   0 def)
%            Number of atoms       :   15 (  14 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   39 (   2   ~;   0   |;   0   &;  37   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   11 (   0   ^;  11   !;   0   ?;  11   :)

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

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

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

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

thf(zero_type,type,
    zero: $i ).

thf(left_annihilation,axiom,
    ! [A: $i] :
      ( ( multiplication @ zero @ A )
      = zero ) ).

thf(zip_derived_cl9,plain,
    ! [X0: $i] :
      ( ( multiplication @ zero @ X0 )
      = zero ),
    inference(cnf,[status(esa)],[left_annihilation]) ).

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(zip_derived_cl73,plain,
    ( ( strong_iteration @ zero )
    = ( addition @ zero @ one ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl9,zip_derived_cl14]) ).

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

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

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] :
      ( ( addition @ zero @ X0 )
      = X0 ),
    inference('s_sup+',[status(thm)],[zip_derived_cl2,zip_derived_cl0]) ).

thf(zip_derived_cl76,plain,
    ( ( strong_iteration @ zero )
    = one ),
    inference(demod,[status(thm)],[zip_derived_cl73,zip_derived_cl39]) ).

thf(goals,conjecture,
    ( ( strong_iteration @ zero )
    = one ) ).

thf(zf_stmt_0,negated_conjecture,
    ( ( strong_iteration @ zero )
   != one ),
    inference('cnf.neg',[status(esa)],[goals]) ).

thf(zip_derived_cl19,plain,
    ( ( strong_iteration @ zero )
   != one ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl77,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl76,zip_derived_cl19]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : KLE138+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.WsxjyVBDNa true
% 0.14/0.35  % Computer : n009.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Aug 29 11:51:20 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  % Running portfolio for 300 s
% 0.14/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.35  % Number of cores: 8
% 0.14/0.36  % Python version: Python 3.6.8
% 0.14/0.36  % Running in FO mode
% 0.43/0.59  % Total configuration time : 435
% 0.43/0.59  % Estimated wc time : 1092
% 0.43/0.59  % Estimated cpu time (7 cpus) : 156.0
% 0.53/0.67  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.54/0.70  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.54/0.71  % Solved by fo/fo6_bce.sh.
% 0.54/0.71  % BCE start: 20
% 0.54/0.71  % BCE eliminated: 0
% 0.54/0.71  % PE start: 20
% 0.54/0.71  logic: eq
% 0.54/0.71  % PE eliminated: 0
% 0.54/0.71  % done 15 iterations in 0.020s
% 0.54/0.71  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.54/0.71  % SZS output start Refutation
% See solution above
% 0.54/0.71  
% 0.54/0.71  
% 0.54/0.71  % Terminating...
% 1.54/0.81  % Runner terminated.
% 1.54/0.83  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------