↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWC052+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 01:04:27 PM UTC 2026

% Result   : Theorem 2.25s 0.84s
% Output   : Refutation 2.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   19
% Syntax   : Number of formulae    :  141 (  15 unt;  12 def)
%            Number of atoms       :  480 (  50 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  629 ( 290   ~; 280   |;  27   &)
%                                         (  16 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   18 (  16 usr;  13 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   71 (   0 sgn  62   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( frontsegP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & app(X1,X2) = X0 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(f28,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(nil,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).

fof(f55,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).

fof(f56,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( segmentP(X0,X1)
                   => segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).

fof(f58,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( segmentP(nil,X0)
      <=> nil = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).

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

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

fof(f101,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( frontsegP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & app(X1,X2) = X0 ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f134,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f172,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f173,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f174,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f173]) ).

fof(f176,plain,
    ! [X0] :
      ( ( segmentP(nil,X0)
      <=> nil = X0 )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f58]) ).

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

fof(f234,plain,
    ! [X0,X1] :
      ( ~ frontsegP(X0,X1)
      | ~ ssList(X1)
      | app(X1,sK5(X0,X1)) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f235,plain,
    ! [X0,X1] :
      ( ssList(sK5(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ frontsegP(X0,X1) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f305,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f319,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    inference(cnf_transformation,[],[f134]) ).

fof(f356,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f172]) ).

fof(f357,plain,
    ! [X2,X3,X0,X1] :
      ( ~ segmentP(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssList(X0)
      | segmentP(app(app(X2,X0),X3),X1) ),
    inference(cnf_transformation,[],[f174]) ).

fof(f359,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil != X0
      | segmentP(nil,X0) ),
    inference(cnf_transformation,[],[f176]) ).

fof(f410,plain,
    ! [X5] :
      ( ~ segmentP(sK47,X5)
      | ~ segmentP(sK48,X5)
      | ~ neq(X5,nil)
      | ~ ssList(X5)
      | nil = sK48 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f411,plain,
    ! [X5] :
      ( ~ segmentP(sK47,X5)
      | ~ segmentP(sK48,X5)
      | ~ neq(X5,nil)
      | ~ ssList(X5)
      | nil != sK47 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f412,plain,
    ( ~ neq(sK50,nil)
    | frontsegP(sK49,sK51) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f413,plain,
    ( ~ neq(sK50,nil)
    | frontsegP(sK50,sK51) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f414,plain,
    ( ~ neq(sK50,nil)
    | neq(sK51,nil) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f415,plain,
    ( ~ neq(sK50,nil)
    | ssList(sK51) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f416,plain,
    ( neq(sK48,nil)
    | nil != sK47 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f417,plain,
    ( neq(sK48,nil)
    | nil = sK48 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f418,plain,
    ( nil != sK50
    | nil = sK49 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f419,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f221]) ).

fof(f420,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f221]) ).

fof(f421,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f221]) ).

fof(f422,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f221]) ).

fof(f427,plain,
    ( neq(sK50,nil)
    | nil = sK50 ),
    inference(definition_unfolding,[],[f417,f420,f420]) ).

fof(f428,plain,
    ( neq(sK50,nil)
    | nil != sK49 ),
    inference(definition_unfolding,[],[f416,f420,f419]) ).

fof(f429,plain,
    ! [X5] :
      ( ~ segmentP(sK49,X5)
      | ~ segmentP(sK50,X5)
      | ~ neq(X5,nil)
      | ~ ssList(X5)
      | nil != sK49 ),
    inference(definition_unfolding,[],[f411,f419,f420,f419]) ).

fof(f430,plain,
    ! [X5] :
      ( ~ segmentP(sK49,X5)
      | ~ segmentP(sK50,X5)
      | ~ neq(X5,nil)
      | ~ ssList(X5)
      | nil = sK50 ),
    inference(definition_unfolding,[],[f410,f419,f420,f420]) ).

fof(f450,plain,
    ( ~ ssList(nil)
    | segmentP(nil,nil) ),
    inference(equality_resolution,[],[f359]) ).

fof(f464,definition,
    ( spl52_1
  <=> nil = sK50 ),
    introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).

fof(f466,plain,
    ( nil = sK50
    | ~ spl52_1 ),
    inference(avatar_component_clause,[],[f464]) ).

fof(f468,definition,
    ( spl52_2
  <=> ! [X5] :
        ( ~ segmentP(sK49,X5)
        | ~ ssList(X5)
        | ~ neq(X5,nil)
        | ~ segmentP(sK50,X5) ) ),
    introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).

fof(f469,plain,
    ( ! [X5] :
        ( ~ segmentP(sK50,X5)
        | ~ ssList(X5)
        | ~ neq(X5,nil)
        | ~ segmentP(sK49,X5) )
    | ~ spl52_2 ),
    inference(avatar_component_clause,[],[f468]) ).

fof(f470,plain,
    ( spl52_1
    | spl52_2 ),
    inference(avatar_split_clause,[],[f430,f468,f464]) ).

fof(f472,definition,
    ( spl52_3
  <=> nil = sK49 ),
    introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).

fof(f473,plain,
    ( nil = sK49
    | ~ spl52_3 ),
    inference(avatar_component_clause,[],[f472]) ).

fof(f475,plain,
    ( ~ spl52_3
    | spl52_2 ),
    inference(avatar_split_clause,[],[f429,f468,f472]) ).

fof(f477,definition,
    ( spl52_4
  <=> frontsegP(sK49,sK51) ),
    introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).

fof(f479,plain,
    ( frontsegP(sK49,sK51)
    | ~ spl52_4 ),
    inference(avatar_component_clause,[],[f477]) ).

fof(f481,definition,
    ( spl52_5
  <=> neq(sK50,nil) ),
    introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).

fof(f482,plain,
    ( neq(sK50,nil)
    | ~ spl52_5 ),
    inference(avatar_component_clause,[],[f481]) ).

fof(f484,plain,
    ( spl52_4
    | ~ spl52_5 ),
    inference(avatar_split_clause,[],[f412,f481,f477]) ).

fof(f486,definition,
    ( spl52_6
  <=> frontsegP(sK50,sK51) ),
    introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).

fof(f488,plain,
    ( frontsegP(sK50,sK51)
    | ~ spl52_6 ),
    inference(avatar_component_clause,[],[f486]) ).

fof(f489,plain,
    ( spl52_6
    | ~ spl52_5 ),
    inference(avatar_split_clause,[],[f413,f481,f486]) ).

fof(f491,definition,
    ( spl52_7
  <=> neq(sK51,nil) ),
    introduced(definition,[new_symbols(definition,[spl52_7])],[avatar_definition]) ).

fof(f493,plain,
    ( neq(sK51,nil)
    | ~ spl52_7 ),
    inference(avatar_component_clause,[],[f491]) ).

fof(f494,plain,
    ( spl52_7
    | ~ spl52_5 ),
    inference(avatar_split_clause,[],[f414,f481,f491]) ).

fof(f496,definition,
    ( spl52_8
  <=> ssList(sK51) ),
    introduced(definition,[new_symbols(definition,[spl52_8])],[avatar_definition]) ).

fof(f498,plain,
    ( ssList(sK51)
    | ~ spl52_8 ),
    inference(avatar_component_clause,[],[f496]) ).

fof(f499,plain,
    ( spl52_8
    | ~ spl52_5 ),
    inference(avatar_split_clause,[],[f415,f481,f496]) ).

fof(f500,plain,
    ( ~ spl52_3
    | spl52_5 ),
    inference(avatar_split_clause,[],[f428,f481,f472]) ).

fof(f501,plain,
    ( spl52_1
    | spl52_5 ),
    inference(avatar_split_clause,[],[f427,f481,f464]) ).

fof(f502,plain,
    ( spl52_3
    | ~ spl52_1 ),
    inference(avatar_split_clause,[],[f418,f464,f472]) ).

fof(f508,definition,
    ( spl52_10
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl52_10])],[avatar_definition]) ).

fof(f510,plain,
    ( ~ ssList(nil)
    | spl52_10 ),
    inference(avatar_component_clause,[],[f508]) ).

fof(f521,definition,
    ( spl52_13
  <=> segmentP(nil,nil) ),
    introduced(definition,[new_symbols(definition,[spl52_13])],[avatar_definition]) ).

fof(f523,plain,
    ( segmentP(nil,nil)
    | ~ spl52_13 ),
    inference(avatar_component_clause,[],[f521]) ).

fof(f524,plain,
    ( spl52_13
    | ~ spl52_10 ),
    inference(avatar_split_clause,[],[f450,f508,f521]) ).

fof(f535,plain,
    ( ssList(nil)
    | ~ spl52_1 ),
    inference(superposition,[],[f421,f466]) ).

fof(f538,plain,
    ( neq(nil,nil)
    | ~ spl52_1
    | ~ spl52_5 ),
    inference(forward_demodulation,[],[f482,f466]) ).

fof(f540,plain,
    ( ! [X5] :
        ( ~ segmentP(nil,X5)
        | ~ ssList(X5)
        | ~ neq(X5,nil)
        | ~ segmentP(sK50,X5) )
    | ~ spl52_2
    | ~ spl52_3 ),
    inference(forward_demodulation,[],[f469,f473]) ).

fof(f541,plain,
    ( ! [X5] :
        ( ~ segmentP(nil,X5)
        | ~ segmentP(nil,X5)
        | ~ ssList(X5)
        | ~ neq(X5,nil) )
    | ~ spl52_1
    | ~ spl52_2
    | ~ spl52_3 ),
    inference(forward_demodulation,[],[f540,f466]) ).

fof(f542,plain,
    ( ! [X5] :
        ( ~ segmentP(nil,X5)
        | ~ ssList(X5)
        | ~ neq(X5,nil) )
    | ~ spl52_1
    | ~ spl52_2
    | ~ spl52_3 ),
    inference(duplicate_literal_removal,[],[f541]) ).

fof(f543,plain,
    ( ~ ssList(nil)
    | ~ neq(nil,nil)
    | ~ spl52_1
    | ~ spl52_2
    | ~ spl52_3
    | ~ spl52_13 ),
    inference(resolution,[],[f523,f542]) ).

fof(f544,plain,
    ( ~ neq(nil,nil)
    | ~ spl52_1
    | ~ spl52_2
    | ~ spl52_3
    | ~ spl52_13 ),
    inference(forward_subsumption_resolution,[],[f543,f535]) ).

fof(f545,plain,
    ( $false
    | ~ spl52_1
    | ~ spl52_2
    | ~ spl52_3
    | ~ spl52_5
    | ~ spl52_13 ),
    inference(forward_subsumption_resolution,[],[f544,f538]) ).

fof(f546,plain,
    ( ~ spl52_1
    | ~ spl52_2
    | ~ spl52_3
    | ~ spl52_5
    | ~ spl52_13 ),
    inference(avatar_contradiction_clause,[],[f545]) ).

fof(f549,plain,
    ( $false
    | spl52_10 ),
    inference(forward_subsumption_resolution,[],[f510,f305]) ).

fof(f550,plain,
    spl52_10,
    inference(avatar_contradiction_clause,[],[f549]) ).

fof(f631,plain,
    ( ~ ssList(sK51)
    | sK49 = app(sK51,sK5(sK49,sK51))
    | ~ ssList(sK49)
    | ~ spl52_4 ),
    inference(resolution,[],[f234,f479]) ).

fof(f632,plain,
    ( ~ ssList(sK51)
    | sK50 = app(sK51,sK5(sK50,sK51))
    | ~ ssList(sK50)
    | ~ spl52_6 ),
    inference(resolution,[],[f234,f488]) ).

fof(f643,plain,
    ( sK50 = app(sK51,sK5(sK50,sK51))
    | ~ ssList(sK50)
    | ~ spl52_6
    | ~ spl52_8 ),
    inference(forward_subsumption_resolution,[],[f632,f498]) ).

fof(f644,plain,
    ( sK49 = app(sK51,sK5(sK49,sK51))
    | ~ ssList(sK49)
    | ~ spl52_4
    | ~ spl52_8 ),
    inference(forward_subsumption_resolution,[],[f631,f498]) ).

fof(f645,plain,
    ( sK50 = app(sK51,sK5(sK50,sK51))
    | ~ spl52_6
    | ~ spl52_8 ),
    inference(forward_subsumption_resolution,[],[f643,f421]) ).

fof(f646,plain,
    ( sK49 = app(sK51,sK5(sK49,sK51))
    | ~ spl52_4
    | ~ spl52_8 ),
    inference(forward_subsumption_resolution,[],[f644,f422]) ).

fof(f690,definition,
    ( spl52_22
  <=> ssList(sK5(sK49,sK51)) ),
    introduced(definition,[new_symbols(definition,[spl52_22])],[avatar_definition]) ).

fof(f691,plain,
    ( ssList(sK5(sK49,sK51))
    | ~ spl52_22 ),
    inference(avatar_component_clause,[],[f690]) ).

fof(f692,plain,
    ( ~ ssList(sK5(sK49,sK51))
    | spl52_22 ),
    inference(avatar_component_clause,[],[f690]) ).

fof(f698,definition,
    ( spl52_24
  <=> ssList(sK5(sK50,sK51)) ),
    introduced(definition,[new_symbols(definition,[spl52_24])],[avatar_definition]) ).

fof(f699,plain,
    ( ssList(sK5(sK50,sK51))
    | ~ spl52_24 ),
    inference(avatar_component_clause,[],[f698]) ).

fof(f700,plain,
    ( ~ ssList(sK5(sK50,sK51))
    | spl52_24 ),
    inference(avatar_component_clause,[],[f698]) ).

fof(f721,plain,
    ( ~ ssList(sK51)
    | ~ ssList(sK49)
    | ~ frontsegP(sK49,sK51)
    | spl52_22 ),
    inference(resolution,[],[f692,f235]) ).

fof(f722,plain,
    ( ~ ssList(sK49)
    | ~ frontsegP(sK49,sK51)
    | ~ spl52_8
    | spl52_22 ),
    inference(forward_subsumption_resolution,[],[f721,f498]) ).

fof(f723,plain,
    ( ~ frontsegP(sK49,sK51)
    | ~ spl52_8
    | spl52_22 ),
    inference(forward_subsumption_resolution,[],[f722,f422]) ).

fof(f724,plain,
    ( $false
    | ~ spl52_4
    | ~ spl52_8
    | spl52_22 ),
    inference(forward_subsumption_resolution,[],[f723,f479]) ).

fof(f725,plain,
    ( ~ spl52_4
    | ~ spl52_8
    | spl52_22 ),
    inference(avatar_contradiction_clause,[],[f724]) ).

fof(f728,plain,
    ( ~ ssList(sK51)
    | ~ ssList(sK50)
    | ~ frontsegP(sK50,sK51)
    | spl52_24 ),
    inference(resolution,[],[f700,f235]) ).

fof(f729,plain,
    ( ~ ssList(sK50)
    | ~ frontsegP(sK50,sK51)
    | ~ spl52_8
    | spl52_24 ),
    inference(forward_subsumption_resolution,[],[f728,f498]) ).

fof(f730,plain,
    ( ~ frontsegP(sK50,sK51)
    | ~ spl52_8
    | spl52_24 ),
    inference(forward_subsumption_resolution,[],[f729,f421]) ).

fof(f731,plain,
    ( $false
    | ~ spl52_6
    | ~ spl52_8
    | spl52_24 ),
    inference(forward_subsumption_resolution,[],[f730,f488]) ).

fof(f732,plain,
    ( ~ spl52_6
    | ~ spl52_8
    | spl52_24 ),
    inference(avatar_contradiction_clause,[],[f731]) ).

fof(f1132,plain,
    ( sK51 = app(nil,sK51)
    | ~ spl52_8 ),
    inference(resolution,[],[f319,f498]) ).

fof(f2819,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | segmentP(app(app(X1,X0),X2),X0)
      | ~ ssList(X0) ),
    inference(resolution,[],[f357,f356]) ).

fof(f2825,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X1,X0),X2),X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f2819]) ).

fof(f16845,plain,
    ( ! [X0] :
        ( segmentP(app(sK51,X0),sK51)
        | ~ ssList(nil)
        | ~ ssList(X0)
        | ~ ssList(sK51) )
    | ~ spl52_8 ),
    inference(superposition,[],[f2825,f1132]) ).

fof(f16852,plain,
    ( ! [X0] :
        ( segmentP(app(sK51,X0),sK51)
        | ~ ssList(X0)
        | ~ ssList(sK51) )
    | ~ spl52_8 ),
    inference(forward_subsumption_resolution,[],[f16845,f305]) ).

fof(f16891,plain,
    ( ! [X0] :
        ( segmentP(app(sK51,X0),sK51)
        | ~ ssList(X0) )
    | ~ spl52_8 ),
    inference(forward_subsumption_resolution,[],[f16852,f498]) ).

fof(f17187,plain,
    ( segmentP(sK50,sK51)
    | ~ ssList(sK5(sK50,sK51))
    | ~ spl52_6
    | ~ spl52_8 ),
    inference(superposition,[],[f16891,f645]) ).

fof(f17188,plain,
    ( segmentP(sK49,sK51)
    | ~ ssList(sK5(sK49,sK51))
    | ~ spl52_4
    | ~ spl52_8 ),
    inference(superposition,[],[f16891,f646]) ).

fof(f17191,plain,
    ( segmentP(sK49,sK51)
    | ~ spl52_4
    | ~ spl52_8
    | ~ spl52_22 ),
    inference(forward_subsumption_resolution,[],[f17188,f691]) ).

fof(f17192,plain,
    ( segmentP(sK50,sK51)
    | ~ spl52_6
    | ~ spl52_8
    | ~ spl52_24 ),
    inference(forward_subsumption_resolution,[],[f17187,f699]) ).

fof(f17708,plain,
    ( ~ ssList(sK51)
    | ~ neq(sK51,nil)
    | ~ segmentP(sK49,sK51)
    | ~ spl52_2
    | ~ spl52_6
    | ~ spl52_8
    | ~ spl52_24 ),
    inference(resolution,[],[f17192,f469]) ).

fof(f17717,plain,
    ( ~ neq(sK51,nil)
    | ~ segmentP(sK49,sK51)
    | ~ spl52_2
    | ~ spl52_6
    | ~ spl52_8
    | ~ spl52_24 ),
    inference(forward_subsumption_resolution,[],[f17708,f498]) ).

fof(f17722,plain,
    ( ~ segmentP(sK49,sK51)
    | ~ spl52_2
    | ~ spl52_6
    | ~ spl52_7
    | ~ spl52_8
    | ~ spl52_24 ),
    inference(forward_subsumption_resolution,[],[f17717,f493]) ).

fof(f17728,plain,
    ( $false
    | ~ spl52_2
    | ~ spl52_4
    | ~ spl52_6
    | ~ spl52_7
    | ~ spl52_8
    | ~ spl52_22
    | ~ spl52_24 ),
    inference(forward_subsumption_resolution,[],[f17722,f17191]) ).

fof(f17729,plain,
    ( ~ spl52_2
    | ~ spl52_4
    | ~ spl52_6
    | ~ spl52_7
    | ~ spl52_8
    | ~ spl52_22
    | ~ spl52_24 ),
    inference(avatar_contradiction_clause,[],[f17728]) ).

cnf(s1,plain,
    ( spl52_1
    | spl52_2 ),
    inference(sat_conversion,[],[f470]) ).

cnf(s2,plain,
    ( spl52_2
    | ~ spl52_3 ),
    inference(sat_conversion,[],[f475]) ).

cnf(s3,plain,
    ( spl52_4
    | ~ spl52_5 ),
    inference(sat_conversion,[],[f484]) ).

cnf(s4,plain,
    ( ~ spl52_5
    | spl52_6 ),
    inference(sat_conversion,[],[f489]) ).

cnf(s5,plain,
    ( ~ spl52_5
    | spl52_7 ),
    inference(sat_conversion,[],[f494]) ).

cnf(s6,plain,
    ( ~ spl52_5
    | spl52_8 ),
    inference(sat_conversion,[],[f499]) ).

cnf(s7,plain,
    ( ~ spl52_3
    | spl52_5 ),
    inference(sat_conversion,[],[f500]) ).

cnf(s8,plain,
    ( spl52_1
    | spl52_5 ),
    inference(sat_conversion,[],[f501]) ).

cnf(s9,plain,
    ( ~ spl52_1
    | spl52_3 ),
    inference(sat_conversion,[],[f502]) ).

cnf(s13,plain,
    ( ~ spl52_10
    | spl52_13 ),
    inference(sat_conversion,[],[f524]) ).

cnf(s16,plain,
    ( ~ spl52_1
    | ~ spl52_2
    | ~ spl52_3
    | ~ spl52_5
    | ~ spl52_13 ),
    inference(sat_conversion,[],[f546]) ).

cnf(s18,plain,
    spl52_10,
    inference(sat_conversion,[],[f550]) ).

cnf(s27,plain,
    ( ~ spl52_4
    | ~ spl52_8
    | spl52_22 ),
    inference(sat_conversion,[],[f725]) ).

cnf(s28,plain,
    ( ~ spl52_6
    | ~ spl52_8
    | spl52_24 ),
    inference(sat_conversion,[],[f732]) ).

cnf(s871,plain,
    ( ~ spl52_2
    | ~ spl52_4
    | ~ spl52_6
    | ~ spl52_7
    | ~ spl52_8
    | ~ spl52_22
    | ~ spl52_24 ),
    inference(sat_conversion,[],[f17729]) ).

cnf(s905,plain,
    spl52_13,
    inference(rat,[],[s13,s18]) ).

cnf(s909,plain,
    ( ~ spl52_4
    | ~ spl52_24
    | ~ spl52_6
    | ~ spl52_7
    | ~ spl52_8
    | ~ spl52_2 ),
    inference(rat,[],[s27,s871]) ).

cnf(s910,plain,
    spl52_1,
    inference(rat,[],[s909,s28,s3,s4,s5,s6,s1,s8]) ).

cnf(s911,plain,
    spl52_3,
    inference(rat,[],[s9,s910]) ).

cnf(s912,plain,
    spl52_5,
    inference(rat,[],[s7,s911]) ).

cnf(s913,plain,
    spl52_2,
    inference(rat,[],[s2,s911]) ).

cnf(s918,plain,
    $false,
    inference(rat,[],[s16,s905,s910,s911,s912,s913]) ).

fof(f17730,plain,
    $false,
    inference(avatar_sat_refutation,[],[s918]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC052+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 28 07:37:47 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40  Running first-order model finding
% 0.09/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.25/0.84  % (623906)Will run a generic schedule for satisfiability detection.
% 2.25/0.84  % (623916)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2715935824:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.25/0.84  % (623912)% WARNING: option uhcvi not known.
% 2.25/0.84  % (623911)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=36840657_2999 on theBenchmark for (2999ds/0Mi)
% 2.25/0.84  % (623912)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1391142347:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.25/0.84  % (623913)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3182979082:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.25/0.84  % (623915)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2185490925:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.25/0.84  % (623914)dis+10_1_sil=32000:sp=arity:random_seed=2616666445:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.25/0.84  % (623917)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1700742097:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.25/0.84  % TRYING [1]
% 2.25/0.84  % TRYING [2]
% 2.25/0.84  % TRYING [3]
% 2.25/0.84  % (623916)Instruction limit reached! 
% 2.25/0.84  % (623916)------------------------------
% 2.25/0.84  % (623916)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623916)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623916)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623916)Termination reason: Instruction limit
% 2.25/0.84  % (623916)Termination phase: Saturation
% 2.25/0.84  % (623916)Time elapsed: 0.041 s
% 2.25/0.84  % (623916)Peak memory usage: 14 MB
% 2.25/0.84  % (623916)Instructions burned: 135 (million)
% 2.25/0.84  % TRYING [4]
% 2.25/0.84  % (623925)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=163006861:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.25/0.84  % TRYING [1]
% 2.25/0.84  % TRYING [2]
% 2.25/0.84  % TRYING [3]
% 2.25/0.84  % (623914)Instruction limit reached! 
% 2.25/0.84  % (623914)------------------------------
% 2.25/0.84  % (623914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623914)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623914)Termination reason: Instruction limit
% 2.25/0.84  % (623914)Termination phase: Saturation
% 2.25/0.84  % (623914)Time elapsed: 0.061 s
% 2.25/0.84  % (623914)Peak memory usage: 13 MB
% 2.25/0.84  % (623914)Instructions burned: 103 (million)
% 2.25/0.84  % TRYING [4]
% 2.25/0.84  % (623915)Instruction limit reached! 
% 2.25/0.84  % (623915)------------------------------
% 2.25/0.84  % (623915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623915)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623915)Termination reason: Instruction limit
% 2.25/0.84  % (623915)Termination phase: Saturation
% 2.25/0.84  % (623915)Time elapsed: 0.070 s
% 2.25/0.84  % (623915)Peak memory usage: 13 MB
% 2.25/0.84  % (623915)Instructions burned: 116 (million)
% 2.25/0.84  % (623927)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=380118614:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.25/0.84  % TRYING [5]
% 2.25/0.84  % (623928)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=78229288:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.25/0.84  % TRYING [5]
% 2.25/0.84  % (623917)Instruction limit reached! 
% 2.25/0.84  % (623917)------------------------------
% 2.25/0.84  % (623917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623917)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623917)Termination reason: Instruction limit
% 2.25/0.84  % (623917)Termination phase: Saturation
% 2.25/0.84  % (623917)Time elapsed: 0.101 s
% 2.25/0.84  % (623917)Peak memory usage: 16 MB
% 2.25/0.84  % (623917)Instructions burned: 159 (million)
% 2.25/0.84  % (623931)ott-21_1_sil=16000:fs=off:random_seed=4241487720:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.25/0.84  % (623927)Instruction limit reached! 
% 2.25/0.84  % (623927)------------------------------
% 2.25/0.84  % (623927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623927)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623927)Termination reason: Instruction limit
% 2.25/0.84  % (623927)Termination phase: Saturation
% 2.25/0.84  % (623927)Time elapsed: 0.074 s
% 2.25/0.84  % (623927)Peak memory usage: 13 MB
% 2.25/0.84  % (623927)Instructions burned: 132 (million)
% 2.25/0.84  % (623933)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2055814655:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.25/0.84  % TRYING [6]
% 2.25/0.84  % (623925)Instruction limit reached! 
% 2.25/0.84  % (623925)------------------------------
% 2.25/0.84  % (623925)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623925)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623925)Termination reason: Instruction limit
% 2.25/0.84  % (623925)Termination phase: Finite model building constraint generation
% 2.25/0.84  % (623925)Time elapsed: 0.158 s
% 2.25/0.84  % (623925)Peak memory usage: 28 MB
% 2.25/0.84  % (623925)Instructions burned: 716 (million)
% 2.25/0.84  % TRYING [6]
% 2.25/0.84  % (623931)Instruction limit reached! 
% 2.25/0.84  % (623931)------------------------------
% 2.25/0.84  % (623931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623931)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623931)Termination reason: Instruction limit
% 2.25/0.84  % (623931)Termination phase: Saturation
% 2.25/0.84  % (623931)Time elapsed: 0.092 s
% 2.25/0.84  % (623931)Peak memory usage: 14 MB
% 2.25/0.84  % (623931)Instructions burned: 181 (million)
% 2.25/0.84  % (623935)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4246703300:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.25/0.84  % TRYING [1]
% 2.25/0.84  % TRYING [2]
% 2.25/0.84  % TRYING [3]
% 2.25/0.84  % (623936)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2016021021:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.25/0.84  % TRYING [4]
% 2.25/0.84  % TRYING [5]
% 2.25/0.84  % (623928) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-623906-623928"...
% 2.25/0.84  % (623928)...printing done.
% 2.25/0.84  % (623928)Refutation found. Thanks to Tanya!
% 2.25/0.84  % SZS status Theorem for theBenchmark
% 2.25/0.84  % SZS output start Proof for theBenchmark
% See solution above
% 2.25/0.84  % (623928)------------------------------
% 2.25/0.84  % (623928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.84  % (623928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.84  % (623928)CaDiCaL version: 2.1.3
% 2.25/0.84  % (623928)Termination reason: Refutation
% 2.25/0.84  % (623928)Time elapsed: 0.295 s
% 2.25/0.84  % (623928)Peak memory usage: 21 MB
% 2.25/0.84  % (623928)Instructions burned: 541 (million)
% 2.25/0.84  % (623906)Success in time 0.432 s
% 2.25/0.84  % Vampire exiting
%------------------------------------------------------------------------------