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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : KLE001+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.fgVGgHiSRa true

% Computer : n026.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:12 EDT 2023

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

% 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_cl17,plain,
    ( ( addition @ ( addition @ sk_ @ sk__2 ) @ ( addition @ sk_ @ sk__2 ) )
   != ( addition @ sk_ @ sk__2 ) ),
    inference('sup-',[status(thm)],[zip_derived_cl12,zip_derived_cl13]) ).

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

thf(zip_derived_cl20,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl19]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : KLE001+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.fgVGgHiSRa true
% 0.10/0.30  % Computer : n026.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 300
% 0.10/0.30  % DateTime : Tue Aug 29 12:35:20 EDT 2023
% 0.10/0.30  % CPUTime  : 
% 0.10/0.30  % Running portfolio for 300 s
% 0.10/0.30  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.30  % Number of cores: 8
% 0.10/0.31  % Python version: Python 3.6.8
% 0.10/0.31  % Running in FO mode
% 0.15/0.52  % Total configuration time : 435
% 0.15/0.52  % Estimated wc time : 1092
% 0.15/0.52  % Estimated cpu time (7 cpus) : 156.0
% 0.15/0.62  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.15/0.63  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.15/0.63  % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.15/0.63  % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.15/0.63  % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.15/0.63  % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.15/0.63  % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.15/0.65  % Solved by fo/fo7.sh.
% 0.15/0.65  % done 6 iterations in 0.009s
% 0.15/0.65  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.15/0.65  % SZS output start Refutation
% See solution above
% 0.15/0.65  
% 0.15/0.65  
% 0.15/0.65  % Terminating...
% 0.15/0.72  % Runner terminated.
% 0.15/0.73  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------