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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SWC353+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.2KdNLDGq1h true

% Computer : n011.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:30:57 EDT 2023

% Result   : Theorem 1.39s 0.77s
% Output   : Refutation 1.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   32 (  12 unt;  13 typ;   0 def)
%            Number of atoms       :   70 (  25 equ;   0 cnn)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  157 (  25   ~;  23   |;  15   &;  81   @)
%                                         (   1 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   7 con; 0-2 aty)
%            Number of variables   :   26 (   0   ^;  17   !;   9   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
thf(frontsegP_type,type,
    frontsegP: $i > $i > $o ).

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

thf(totalorderedP_type,type,
    totalorderedP: $i > $o ).

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

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

thf(sk__16_type,type,
    sk__16: $i ).

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

thf(sk__18_type,type,
    sk__18: $i ).

thf(sk__20_type,type,
    sk__20: $i ).

thf(sk__17_type,type,
    sk__17: $i ).

thf(leq_type,type,
    leq: $i > $i > $o ).

thf(sk__19_type,type,
    sk__19: $i ).

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

thf(co1,conjecture,
    ! [U: $i] :
      ( ( ssList @ U )
     => ! [V: $i] :
          ( ( ssList @ V )
         => ! [W: $i] :
              ( ( ssList @ W )
             => ! [X: $i] :
                  ( ( ssList @ X )
                 => ( ( V != X )
                    | ( U != W )
                    | ! [Y: $i] :
                        ( ( ssList @ Y )
                       => ( ( ( app @ W @ Y )
                           != X )
                          | ~ ( totalorderedP @ W )
                          | ? [Z: $i] :
                              ( ? [X1: $i] :
                                  ( ? [X2: $i] :
                                      ( ? [X3: $i] :
                                          ( ( leq @ X2 @ Z )
                                          & ( ( app @ X3 @ ( cons @ X2 @ nil ) )
                                            = W )
                                          & ( ssList @ X3 ) )
                                      & ( ssItem @ X2 ) )
                                  & ( ( app @ ( cons @ Z @ nil ) @ X1 )
                                    = Y )
                                  & ( ssList @ X1 ) )
                              & ( ssItem @ Z ) ) ) )
                    | ( frontsegP @ V @ U )
                    | ( ( 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 )
                      | ! [Y: $i] :
                          ( ( ssList @ Y )
                         => ( ( ( app @ W @ Y )
                             != X )
                            | ~ ( totalorderedP @ W )
                            | ? [Z: $i] :
                                ( ? [X1: $i] :
                                    ( ? [X2: $i] :
                                        ( ? [X3: $i] :
                                            ( ( leq @ X2 @ Z )
                                            & ( ( app @ X3 @ ( cons @ X2 @ nil ) )
                                              = W )
                                            & ( ssList @ X3 ) )
                                        & ( ssItem @ X2 ) )
                                    & ( ( app @ ( cons @ Z @ nil ) @ X1 )
                                      = Y )
                                    & ( ssList @ X1 ) )
                                & ( ssItem @ Z ) ) ) )
                      | ( frontsegP @ V @ U )
                      | ( ( nil != X )
                        & ( nil = W ) ) ) ) ) ) ),
    inference('cnf.neg',[status(esa)],[co1]) ).

thf(zip_derived_cl89,plain,
    ~ ( frontsegP @ sk__17 @ sk__16 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl93,plain,
    ( ( app @ sk__18 @ sk__20 )
    = sk__19 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl90,plain,
    sk__16 = sk__18,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl96,plain,
    sk__17 = sk__19,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl702,plain,
    ( ( app @ sk__16 @ sk__20 )
    = sk__17 ),
    inference(demod,[status(thm)],[zip_derived_cl93,zip_derived_cl90,zip_derived_cl96]) ).

thf(ax5,axiom,
    ! [U: $i] :
      ( ( ssList @ U )
     => ! [V: $i] :
          ( ( ssList @ V )
         => ( ( frontsegP @ U @ V )
          <=> ? [W: $i] :
                ( ( ( app @ V @ W )
                  = U )
                & ( ssList @ W ) ) ) ) ) ).

thf(zip_derived_cl5,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ( ssList @ X0 )
      | ( ( app @ X0 @ X2 )
       != X1 )
      | ~ ( ssList @ X2 )
      | ( frontsegP @ X1 @ X0 )
      | ~ ( ssList @ X1 ) ),
    inference(cnf,[status(esa)],[ax5]) ).

thf(zip_derived_cl737,plain,
    ! [X0: $i] :
      ( ( sk__17 != X0 )
      | ~ ( ssList @ X0 )
      | ( frontsegP @ X0 @ sk__16 )
      | ~ ( ssList @ sk__20 )
      | ~ ( ssList @ sk__16 ) ),
    inference('sup-',[status(thm)],[zip_derived_cl702,zip_derived_cl5]) ).

thf(zip_derived_cl92,plain,
    ssList @ sk__20,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl87,plain,
    ssList @ sk__16,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl744,plain,
    ! [X0: $i] :
      ( ( sk__17 != X0 )
      | ~ ( ssList @ X0 )
      | ( frontsegP @ X0 @ sk__16 ) ),
    inference(demod,[status(thm)],[zip_derived_cl737,zip_derived_cl92,zip_derived_cl87]) ).

thf(zip_derived_cl774,plain,
    ( ~ ( ssList @ sk__17 )
    | ( sk__17 != sk__17 ) ),
    inference('sup+',[status(thm)],[zip_derived_cl89,zip_derived_cl744]) ).

thf(zip_derived_cl97,plain,
    ssList @ sk__19,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl96_001,plain,
    sk__17 = sk__19,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl699,plain,
    ssList @ sk__17,
    inference(demod,[status(thm)],[zip_derived_cl97,zip_derived_cl96]) ).

thf(zip_derived_cl777,plain,
    sk__17 != sk__17,
    inference(demod,[status(thm)],[zip_derived_cl774,zip_derived_cl699]) ).

thf(zip_derived_cl778,plain,
    $false,
    inference(simplify,[status(thm)],[zip_derived_cl777]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC353+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.2KdNLDGq1h true
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Aug 28 14:37:10 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.14/0.34  % Running portfolio for 300 s
% 0.14/0.34  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.34  % Number of cores: 8
% 0.14/0.35  % Python version: Python 3.6.8
% 0.14/0.35  % Running in FO mode
% 0.21/0.64  % Total configuration time : 435
% 0.21/0.64  % Estimated wc time : 1092
% 0.21/0.64  % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.67  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.71  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.73  % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.21/0.73  % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.21/0.73  % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.21/0.74  % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.21/0.74  % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.39/0.77  % Solved by fo/fo3_bce.sh.
% 1.39/0.77  % BCE start: 99
% 1.39/0.77  % BCE eliminated: 2
% 1.39/0.77  % PE start: 97
% 1.39/0.77  logic: eq
% 1.39/0.77  % PE eliminated: 0
% 1.39/0.77  % done 53 iterations in 0.040s
% 1.39/0.77  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.39/0.77  % SZS output start Refutation
% See solution above
% 1.39/0.77  
% 1.39/0.77  
% 1.39/0.77  % Terminating...
% 1.61/0.82  % Runner terminated.
% 1.61/0.83  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------