↑ Up

Zipperpin---2.1.9999.THM-Ref.s

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

% Computer : n014.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:13 PM UTC 2025

% Result   : Theorem 0.57s 0.76s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (  14 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   47 (   2   ~;   0   |;   0   &;  45   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 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(domain_type,type,
    domain: $i > $i ).

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

thf(zip_derived_cl5,plain,
    ! [X0: $i] :
      ( ( multiplication @ X0 @ one )
      = X0 ),
    inference(cnf,[status(esa)],[multiplicative_right_identity]) ).

thf(domain1,axiom,
    ! [X0: $i] :
      ( ( addition @ X0 @ ( multiplication @ ( domain @ X0 ) @ X0 ) )
      = ( multiplication @ ( domain @ X0 ) @ X0 ) ) ).

thf(zip_derived_cl13,plain,
    ! [X0: $i] :
      ( ( addition @ X0 @ ( multiplication @ ( domain @ X0 ) @ X0 ) )
      = ( multiplication @ ( domain @ X0 ) @ X0 ) ),
    inference(cnf,[status(esa)],[domain1]) ).

thf(zip_derived_cl135,plain,
    ( ( addition @ one @ ( domain @ one ) )
    = ( domain @ one ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl5,zip_derived_cl13]) ).

thf(domain3,axiom,
    ! [X0: $i] :
      ( ( addition @ ( domain @ X0 ) @ one )
      = one ) ).

thf(zip_derived_cl15,plain,
    ! [X0: $i] :
      ( ( addition @ ( domain @ X0 ) @ one )
      = one ),
    inference(cnf,[status(esa)],[domain3]) ).

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_cl23,plain,
    ! [X0: $i] :
      ( ( addition @ one @ ( domain @ X0 ) )
      = one ),
    inference('s_sup+',[status(thm)],[zip_derived_cl15,zip_derived_cl0]) ).

thf(zip_derived_cl139,plain,
    ( one
    = ( domain @ one ) ),
    inference(demod,[status(thm)],[zip_derived_cl135,zip_derived_cl23]) ).

thf(goals,conjecture,
    ( ( domain @ one )
    = one ) ).

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

thf(zip_derived_cl18,plain,
    ( ( domain @ one )
   != one ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl140,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl139,zip_derived_cl18]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KLE058+1 : TPTP v9.2.0. Released v4.0.0.
% 0.11/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.DlG2mRGhIg true
% 0.13/0.35  % Computer : n014.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Oct  1 14:02:38 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Running portfolio for 300 s
% 0.13/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35  % Number of cores: 8
% 0.13/0.35  % Python version: Python 3.6.8
% 0.13/0.36  % Running in FO mode
% 0.57/0.65  % Total configuration time : 435
% 0.57/0.65  % Estimated wc time : 1092
% 0.57/0.65  % Estimated cpu time (7 cpus) : 156.0
% 0.57/0.71  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.57/0.75  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.57/0.75  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.57/0.76  % Solved by fo/fo6_bce.sh.
% 0.57/0.76  % BCE start: 19
% 0.57/0.76  % BCE eliminated: 2
% 0.57/0.76  % PE start: 17
% 0.57/0.76  logic: eq
% 0.57/0.76  % PE eliminated: 0
% 0.57/0.76  % done 26 iterations in 0.025s
% 0.57/0.76  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.57/0.76  % SZS output start Refutation
% See solution above
% 0.57/0.76  
% 0.57/0.76  
% 0.57/0.76  % Terminating...
% 0.64/0.87  % Runner terminated.
% 1.71/0.88  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------