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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SWC213+1 : TPTP v8.1.2. Released v2.4.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.lAxRDWUM2P true

% Computer : n005.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 21:29:56 EDT 2023

% Result   : Theorem 1.21s 0.79s
% Output   : Refutation 1.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   33 (  12 unt;  11 typ;   0 def)
%            Number of atoms       :   81 (  36 equ;   0 cnn)
%            Maximal formula atoms :   24 (   3 avg)
%            Number of connectives :  181 (  29   ~;  26   |;  18   &;  93   @)
%                                         (   1 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  16   !;  12   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
thf(ssItem_type,type,
    ssItem: $i > $o ).

thf(sk__11_type,type,
    sk__11: $i ).

thf(nil_type,type,
    nil: $i ).

thf(app_type,type,
    app: $i > $i > $i ).

thf(sk__9_type,type,
    sk__9: $i ).

thf(equalelemsP_type,type,
    equalelemsP: $i > $o ).

thf(ssList_type,type,
    ssList: $i > $o ).

thf(sk__10_type,type,
    sk__10: $i ).

thf(neq_type,type,
    neq: $i > $i > $o ).

thf(cons_type,type,
    cons: $i > $i > $i ).

thf(sk__8_type,type,
    sk__8: $i ).

thf(ax15,axiom,
    ! [U: $i] :
      ( ( ssList @ U )
     => ! [V: $i] :
          ( ( ssList @ V )
         => ( ( neq @ U @ V )
          <=> ( U != V ) ) ) ) ).

thf(zip_derived_cl13,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ( ssList @ X0 )
      | ( X1 = X0 )
      | ( neq @ X1 @ X0 )
      | ~ ( ssList @ X1 ) ),
    inference(cnf,[status(esa)],[ax15]) ).

thf(co1,conjecture,
    ! [U: $i] :
      ( ( ssList @ U )
     => ! [V: $i] :
          ( ( ssList @ V )
         => ! [W: $i] :
              ( ( ssList @ W )
             => ! [X: $i] :
                  ( ( ssList @ X )
                 => ( ( V != X )
                    | ( U != W )
                    | ~ ( neq @ V @ nil )
                    | ! [Y: $i] :
                        ( ( ssList @ Y )
                       => ! [Z: $i] :
                            ( ( ssList @ Z )
                           => ( ( ( app @ ( app @ Y @ W ) @ Z )
                               != X )
                              | ~ ( equalelemsP @ W )
                              | ? [X1: $i] :
                                  ( ? [X2: $i] :
                                      ( ? [X3: $i] :
                                          ( ( ( app @ ( cons @ X1 @ nil ) @ X3 )
                                            = W )
                                          & ( ssList @ X3 ) )
                                      & ( ( app @ X2 @ ( cons @ X1 @ nil ) )
                                        = Y )
                                      & ( ssList @ X2 ) )
                                  & ( ssItem @ X1 ) )
                              | ? [X4: $i] :
                                  ( ? [X5: $i] :
                                      ( ? [X6: $i] :
                                          ( ( ( app @ X6 @ ( cons @ X4 @ nil ) )
                                            = W )
                                          & ( ssList @ X6 ) )
                                      & ( ( app @ ( cons @ X4 @ nil ) @ X5 )
                                        = Z )
                                      & ( ssList @ X5 ) )
                                  & ( ssItem @ X4 ) ) ) ) )
                    | ( neq @ U @ nil )
                    | ( ( nil != X )
                      & ( nil = W ) ) ) ) ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ! [U: $i] :
        ( ( ssList @ U )
       => ! [V: $i] :
            ( ( ssList @ V )
           => ! [W: $i] :
                ( ( ssList @ W )
               => ! [X: $i] :
                    ( ( ssList @ X )
                   => ( ( V != X )
                      | ( U != W )
                      | ~ ( neq @ V @ nil )
                      | ! [Y: $i] :
                          ( ( ssList @ Y )
                         => ! [Z: $i] :
                              ( ( ssList @ Z )
                             => ( ( ( app @ ( app @ Y @ W ) @ Z )
                                 != X )
                                | ~ ( equalelemsP @ W )
                                | ? [X1: $i] :
                                    ( ? [X2: $i] :
                                        ( ? [X3: $i] :
                                            ( ( ( app @ ( cons @ X1 @ nil ) @ X3 )
                                              = W )
                                            & ( ssList @ X3 ) )
                                        & ( ( app @ X2 @ ( cons @ X1 @ nil ) )
                                          = Y )
                                        & ( ssList @ X2 ) )
                                    & ( ssItem @ X1 ) )
                                | ? [X4: $i] :
                                    ( ? [X5: $i] :
                                        ( ? [X6: $i] :
                                            ( ( ( app @ X6 @ ( cons @ X4 @ nil ) )
                                              = W )
                                            & ( ssList @ X6 ) )
                                        & ( ( app @ ( cons @ X4 @ nil ) @ X5 )
                                          = Z )
                                        & ( ssList @ X5 ) )
                                    & ( ssItem @ X4 ) ) ) ) )
                      | ( neq @ U @ nil )
                      | ( ( nil != X )
                        & ( nil = W ) ) ) ) ) ) ),
    inference('cnf.neg',[status(esa)],[co1]) ).

thf(zip_derived_cl38,plain,
    ~ ( neq @ sk__8 @ nil ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl272,plain,
    ( ~ ( ssList @ sk__8 )
    | ( sk__8 = nil )
    | ~ ( ssList @ nil ) ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl13,zip_derived_cl38]) ).

thf(zip_derived_cl36,plain,
    ssList @ sk__8,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(ax17,axiom,
    ssList @ nil ).

thf(zip_derived_cl15,plain,
    ssList @ nil,
    inference(cnf,[status(esa)],[ax17]) ).

thf(zip_derived_cl298,plain,
    sk__8 = nil,
    inference(demod,[status(thm)],[zip_derived_cl272,zip_derived_cl36,zip_derived_cl15]) ).

thf(zip_derived_cl41,plain,
    ( ( nil = sk__11 )
    | ( nil != sk__10 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl40,plain,
    sk__8 = sk__10,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl288,plain,
    ( ( nil = sk__11 )
    | ( nil != sk__8 ) ),
    inference(demod,[status(thm)],[zip_derived_cl41,zip_derived_cl40]) ).

thf(zip_derived_cl48,plain,
    sk__9 = sk__11,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl290,plain,
    ( ( sk__9 = nil )
    | ( nil != sk__8 ) ),
    inference('sup+',[status(thm)],[zip_derived_cl288,zip_derived_cl48]) ).

thf(zip_derived_cl39,plain,
    neq @ sk__9 @ nil,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl38_001,plain,
    ~ ( neq @ sk__8 @ nil ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl277,plain,
    ( ( sk__9 != sk__8 )
    | ( nil != nil ) ),
    inference('dp-resolution',[status(thm)],[zip_derived_cl39,zip_derived_cl38]) ).

thf(zip_derived_cl287,plain,
    sk__9 != sk__8,
    inference(simplify,[status(thm)],[zip_derived_cl277]) ).

thf(zip_derived_cl291,plain,
    ( ( nil != sk__8 )
    | ( nil != sk__8 ) ),
    inference('sup-',[status(thm)],[zip_derived_cl290,zip_derived_cl287]) ).

thf(zip_derived_cl292,plain,
    nil != sk__8,
    inference(simplify,[status(thm)],[zip_derived_cl291]) ).

thf(zip_derived_cl299,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl298,zip_derived_cl292]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWC213+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.lAxRDWUM2P true
% 0.13/0.35  % Computer : n005.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 : Mon Aug 28 16:46:23 EDT 2023
% 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.35  % Running in FO mode
% 0.21/0.66  % Total configuration time : 435
% 0.21/0.66  % Estimated wc time : 1092
% 0.21/0.66  % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.73  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 1.09/0.75  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 1.09/0.75  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 1.09/0.75  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 1.21/0.76  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 1.21/0.76  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 1.21/0.79  % Solved by fo/fo3_bce.sh.
% 1.21/0.79  % BCE start: 51
% 1.21/0.79  % BCE eliminated: 0
% 1.21/0.79  % PE start: 51
% 1.21/0.79  logic: eq
% 1.21/0.79  % PE eliminated: 2
% 1.21/0.79  % done 24 iterations in 0.020s
% 1.21/0.79  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.21/0.79  % SZS output start Refutation
% See solution above
% 1.21/0.79  
% 1.21/0.79  
% 1.21/0.79  % Terminating...
% 1.45/0.87  % Runner terminated.
% 1.45/0.88  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------