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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC362+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 : n017.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:23 EDT 2022

% Result   : Theorem 0.19s 0.55s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   6 unt;   0 def)
%            Number of atoms       :  153 (  28 equ)
%            Maximal formula atoms :   22 (   6 avg)
%            Number of connectives :  172 (  42   ~;  29   |;  89   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   32 (   8   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f607,plain,
    $false,
    inference(subsumption_resolution,[],[f606,f601]) ).

fof(f601,plain,
    neq(sK14,nil),
    inference(subsumption_resolution,[],[f565,f564]) ).

fof(f564,plain,
    ( neq(sK14,nil)
    | segmentP(sK14,sK15) ),
    inference(definition_unfolding,[],[f383,f389]) ).

fof(f389,plain,
    sK16 = sK14,
    inference(cnf_transformation,[],[f252]) ).

fof(f252,plain,
    ( ssList(sK13)
    & ssList(sK15)
    & sK16 = sK14
    & sK13 = sK15
    & ssList(sK16)
    & ( ( ~ neq(sK16,nil)
        & neq(sK14,nil) )
      | ( segmentP(sK16,sK15)
        & ~ segmentP(sK14,sK13)
        & neq(sK14,nil) ) )
    & ssList(sK14) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15,sK16])],[f204,f251,f250,f249,f248]) ).

fof(f248,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( X1 = X3
                    & X0 = X2
                    & ssList(X3)
                    & ( ( ~ neq(X3,nil)
                        & neq(X1,nil) )
                      | ( segmentP(X3,X2)
                        & ~ segmentP(X1,X0)
                        & neq(X1,nil) ) ) ) )
            & ssList(X1) ) )
   => ( ssList(sK13)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X1 = X3
                  & sK13 = X2
                  & ssList(X3)
                  & ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( segmentP(X3,X2)
                      & ~ segmentP(X1,sK13)
                      & neq(X1,nil) ) ) ) )
          & ssList(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f249,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( X1 = X3
                & sK13 = X2
                & ssList(X3)
                & ( ( ~ neq(X3,nil)
                    & neq(X1,nil) )
                  | ( segmentP(X3,X2)
                    & ~ segmentP(X1,sK13)
                    & neq(X1,nil) ) ) ) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( sK14 = X3
              & sK13 = X2
              & ssList(X3)
              & ( ( ~ neq(X3,nil)
                  & neq(sK14,nil) )
                | ( segmentP(X3,X2)
                  & ~ segmentP(sK14,sK13)
                  & neq(sK14,nil) ) ) ) )
      & ssList(sK14) ) ),
    introduced(choice_axiom,[]) ).

fof(f250,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( sK14 = X3
            & sK13 = X2
            & ssList(X3)
            & ( ( ~ neq(X3,nil)
                & neq(sK14,nil) )
              | ( segmentP(X3,X2)
                & ~ segmentP(sK14,sK13)
                & neq(sK14,nil) ) ) ) )
   => ( ssList(sK15)
      & ? [X3] :
          ( sK14 = X3
          & sK13 = sK15
          & ssList(X3)
          & ( ( ~ neq(X3,nil)
              & neq(sK14,nil) )
            | ( segmentP(X3,sK15)
              & ~ segmentP(sK14,sK13)
              & neq(sK14,nil) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f251,plain,
    ( ? [X3] :
        ( sK14 = X3
        & sK13 = sK15
        & ssList(X3)
        & ( ( ~ neq(X3,nil)
            & neq(sK14,nil) )
          | ( segmentP(X3,sK15)
            & ~ segmentP(sK14,sK13)
            & neq(sK14,nil) ) ) )
   => ( sK16 = sK14
      & sK13 = sK15
      & ssList(sK16)
      & ( ( ~ neq(sK16,nil)
          & neq(sK14,nil) )
        | ( segmentP(sK16,sK15)
          & ~ segmentP(sK14,sK13)
          & neq(sK14,nil) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f204,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ssList(X3)
                  & ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( segmentP(X3,X2)
                      & ~ segmentP(X1,X0)
                      & neq(X1,nil) ) ) ) )
          & ssList(X1) ) ),
    inference(flattening,[],[f203]) ).

fof(f203,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( segmentP(X3,X2)
                      & ~ segmentP(X1,X0)
                      & neq(X1,nil) ) )
                  & X0 = X2
                  & X1 = X3
                  & 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)
                   => ( ( ( ~ neq(X1,nil)
                          | ~ segmentP(X3,X2)
                          | segmentP(X1,X0) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f383,plain,
    ( neq(sK14,nil)
    | segmentP(sK16,sK15) ),
    inference(cnf_transformation,[],[f252]) ).

fof(f565,plain,
    ( ~ segmentP(sK14,sK15)
    | neq(sK14,nil) ),
    inference(definition_unfolding,[],[f382,f388]) ).

fof(f388,plain,
    sK13 = sK15,
    inference(cnf_transformation,[],[f252]) ).

fof(f382,plain,
    ( neq(sK14,nil)
    | ~ segmentP(sK14,sK13) ),
    inference(cnf_transformation,[],[f252]) ).

fof(f606,plain,
    ~ neq(sK14,nil),
    inference(resolution,[],[f562,f602]) ).

fof(f602,plain,
    segmentP(sK14,sK15),
    inference(subsumption_resolution,[],[f561,f601]) ).

fof(f561,plain,
    ( ~ neq(sK14,nil)
    | segmentP(sK14,sK15) ),
    inference(definition_unfolding,[],[f386,f389,f389]) ).

fof(f386,plain,
    ( ~ neq(sK16,nil)
    | segmentP(sK16,sK15) ),
    inference(cnf_transformation,[],[f252]) ).

fof(f562,plain,
    ( ~ segmentP(sK14,sK15)
    | ~ neq(sK14,nil) ),
    inference(definition_unfolding,[],[f385,f389,f388]) ).

fof(f385,plain,
    ( ~ neq(sK16,nil)
    | ~ segmentP(sK14,sK13) ),
    inference(cnf_transformation,[],[f252]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC362+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.13/0.34  % Computer : n017.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   : Tue Aug 30 18:15:35 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.52  % (18328)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.19/0.52  % (18326)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.19/0.52  % (18327)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.19/0.52  % (18351)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.53  % (18330)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.53  % (18325)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.19/0.53  % (18333)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.19/0.53  % (18327)First to succeed.
% 0.19/0.53  % (18339)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.53  % (18341)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53  % (18343)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.53  % (18336)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.19/0.53  % (18333)Instruction limit reached!
% 0.19/0.53  % (18333)------------------------------
% 0.19/0.53  % (18333)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (18333)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (18333)Termination reason: Unknown
% 0.19/0.53  % (18333)Termination phase: Preprocessing 1
% 0.19/0.53  
% 0.19/0.53  % (18333)Memory used [KB]: 895
% 0.19/0.53  % (18333)Time elapsed: 0.003 s
% 0.19/0.53  % (18333)Instructions burned: 2 (million)
% 0.19/0.53  % (18333)------------------------------
% 0.19/0.53  % (18333)------------------------------
% 0.19/0.54  % (18342)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.54  % (18331)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (18349)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.54  % (18348)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.54  % (18350)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.54  % (18329)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (18340)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.54  % (18346)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.54  % (18337)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.19/0.54  % (18352)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.19/0.55  % (18332)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.55  % (18330)Also succeeded, but the first one will report.
% 0.19/0.55  % (18327)Refutation found. Thanks to Tanya!
% 0.19/0.55  % SZS status Theorem for theBenchmark
% 0.19/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.55  % (18327)------------------------------
% 0.19/0.55  % (18327)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (18327)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (18327)Termination reason: Refutation
% 0.19/0.55  
% 0.19/0.55  % (18327)Memory used [KB]: 1407
% 0.19/0.55  % (18327)Time elapsed: 0.116 s
% 0.19/0.55  % (18327)Instructions burned: 16 (million)
% 0.19/0.55  % (18327)------------------------------
% 0.19/0.55  % (18327)------------------------------
% 0.19/0.55  % (18324)Success in time 0.2 s
%------------------------------------------------------------------------------