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

View Problem - Process Solution

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

% Computer : n007.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:31:01 EDT 2023

% Result   : Theorem 0.54s 0.74s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   16 (   5 unt;   9 typ;   0 def)
%            Number of atoms       :   35 (   6 equ;   0 cnn)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   82 (  12   ~;  12   |;   8   &;  42   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   10 (   0   ^;   8   !;   2   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sk__15_type,type,
    sk__15: $i ).

thf(sk__12_type,type,
    sk__12: $i ).

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

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

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

thf(strictorderedP_type,type,
    strictorderedP: $i > $o ).

thf(sk__14_type,type,
    sk__14: $i ).

thf(sk__13_type,type,
    sk__13: $i ).

thf(segmentP_type,type,
    segmentP: $i > $i > $o ).

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 )
                    | ~ ( segmentP @ X @ W )
                    | ~ ( strictorderedP @ W )
                    | ? [Y: $i] :
                        ( ( strictorderedP @ Y )
                        & ( segmentP @ Y @ W )
                        & ( segmentP @ X @ Y )
                        & ( neq @ W @ Y )
                        & ( ssList @ Y ) )
                    | ( segmentP @ V @ U ) ) ) ) ) ) ).

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 )
                      | ~ ( segmentP @ X @ W )
                      | ~ ( strictorderedP @ W )
                      | ? [Y: $i] :
                          ( ( strictorderedP @ Y )
                          & ( segmentP @ Y @ W )
                          & ( segmentP @ X @ Y )
                          & ( neq @ W @ Y )
                          & ( ssList @ Y ) )
                      | ( segmentP @ V @ U ) ) ) ) ) ),
    inference('cnf.neg',[status(esa)],[co1]) ).

thf(zip_derived_cl80,plain,
    segmentP @ sk__15 @ sk__14,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl81,plain,
    sk__13 = sk__15,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl78,plain,
    sk__12 = sk__14,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl75,plain,
    ~ ( segmentP @ sk__13 @ sk__12 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl588,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl80,zip_derived_cl81,zip_derived_cl78,zip_derived_cl75]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC361+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.pPq1fg8kox true
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Aug 28 15:18:58 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % Running portfolio for 300 s
% 0.13/0.34  % File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.34  % Number of cores: 8
% 0.13/0.35  % Python version: Python 3.6.8
% 0.13/0.35  % Running in FO mode
% 0.45/0.63  % Total configuration time : 435
% 0.45/0.63  % Estimated wc time : 1092
% 0.45/0.63  % Estimated cpu time (7 cpus) : 156.0
% 0.54/0.69  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.54/0.69  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.54/0.74  % Solved by fo/fo3_bce.sh.
% 0.54/0.74  % BCE start: 84
% 0.54/0.74  % BCE eliminated: 2
% 0.54/0.74  % PE start: 82
% 0.54/0.74  logic: eq
% 0.54/0.74  % PE eliminated: 1
% 0.54/0.74  % done 17 iterations in 0.029s
% 0.54/0.74  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.54/0.74  % SZS output start Refutation
% See solution above
% 0.54/0.74  
% 0.54/0.74  
% 0.54/0.74  % Terminating...
% 0.60/0.83  % Runner terminated.
% 0.60/0.84  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------