TSTP Solution File: SWC359+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC359+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n021.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 : Wed Aug 31 18:43:22 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   67 (  10 equ)
%            Maximal formula atoms :   15 (   6 avg)
%            Number of connectives :   81 (  25   ~;  20   |;  28   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   20 (  10   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f484,plain,
    $false,
    inference(resolution,[],[f425,f423]) ).

fof(f423,plain,
    ~ segmentP(sK3,sK4),
    inference(definition_unfolding,[],[f248,f245]) ).

fof(f245,plain,
    sK2 = sK4,
    inference(cnf_transformation,[],[f164]) ).

fof(f164,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ segmentP(X1,X0)
                  & ssList(X3)
                  & segmentP(X3,X2)
                  & X0 = X2
                  & neq(X1,nil)
                  & X1 = X3
                  & ! [X4] :
                      ( ~ segmentP(X3,X4)
                      | ~ ssList(X4)
                      | ~ segmentP(X4,X2)
                      | ~ equalelemsP(X4)
                      | ~ neq(X2,X4) )
                  & equalelemsP(X2) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f163]) ).

fof(f163,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( segmentP(X3,X2)
                  & ! [X4] :
                      ( ~ segmentP(X3,X4)
                      | ~ ssList(X4)
                      | ~ segmentP(X4,X2)
                      | ~ equalelemsP(X4)
                      | ~ neq(X2,X4) )
                  & equalelemsP(X2)
                  & ~ segmentP(X1,X0)
                  & X1 = X3
                  & neq(X1,nil)
                  & X0 = X2
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ~ segmentP(X3,X2)
                      | ? [X4] :
                          ( segmentP(X4,X2)
                          & equalelemsP(X4)
                          & neq(X2,X4)
                          & ssList(X4)
                          & segmentP(X3,X4) )
                      | ~ equalelemsP(X2)
                      | segmentP(X1,X0)
                      | X1 != X3
                      | ~ neq(X1,nil)
                      | X0 != X2 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ~ segmentP(X3,X2)
                    | ? [X4] :
                        ( segmentP(X4,X2)
                        & equalelemsP(X4)
                        & neq(X2,X4)
                        & ssList(X4)
                        & segmentP(X3,X4) )
                    | ~ equalelemsP(X2)
                    | segmentP(X1,X0)
                    | X1 != X3
                    | ~ neq(X1,nil)
                    | X0 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f248,plain,
    ~ segmentP(sK3,sK2),
    inference(cnf_transformation,[],[f164]) ).

fof(f425,plain,
    segmentP(sK3,sK4),
    inference(definition_unfolding,[],[f246,f243]) ).

fof(f243,plain,
    sK5 = sK3,
    inference(cnf_transformation,[],[f164]) ).

fof(f246,plain,
    segmentP(sK5,sK4),
    inference(cnf_transformation,[],[f164]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC359+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.33  % Computer : n021.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % 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   : Tue Aug 30 18:47:26 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.50  % (14139)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.50  % (14123)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.50  % (14124)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.51  % (14131)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51  % (14115)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  % (14123)First to succeed.
% 0.20/0.52  % (14125)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52  % (14112)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52  % (14111)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.52  % (14114)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  % (14133)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.52  % (14113)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.52  % (14119)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.53  % (14119)Instruction limit reached!
% 0.20/0.53  % (14119)------------------------------
% 0.20/0.53  % (14119)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (14123)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (14123)------------------------------
% 0.20/0.53  % (14123)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (14123)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (14123)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (14123)Memory used [KB]: 5756
% 0.20/0.53  % (14123)Time elapsed: 0.121 s
% 0.20/0.53  % (14123)Instructions burned: 14 (million)
% 0.20/0.53  % (14123)------------------------------
% 0.20/0.53  % (14123)------------------------------
% 0.20/0.53  % (14110)Success in time 0.185 s
%------------------------------------------------------------------------------