↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n017.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:01:59 PM UTC 2026

% Result   : Unsatisfiable 2.30s 1.16s
% Output   : Refutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   24
% Syntax   : Number of formulae    :  110 (  17 unt;  11 def)
%            Number of atoms       :  485 (  79 equ)
%            Maximal formula atoms :   11 (   4 avg)
%            Number of connectives :  751 ( 376   ~; 364   |;   0   &)
%                                         (  11 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   18 (  16 usr;  12 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-3 aty)
%            Number of variables   :   63 (   0 sgn  63   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f224,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk2
      | app(X1,X2) != sk1
      | ssItem(sk5(X2,X1,X0))
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).

fof(f225,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk2 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk1
      | ssItem(sk5(X2,X1,X0))
      | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f224]) ).

fof(f226,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk2
      | app(X1,X2) != sk1
      | memberP(sk2,sk5(X2,X1,X0))
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).

fof(f227,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk2 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk1
      | memberP(sk2,sk5(X2,X1,X0))
      | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f226]) ).

fof(f228,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk2
      | app(X1,X2) != sk1
      | geq(sk5(X2,X1,X0),X0)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).

fof(f229,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk2 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk1
      | geq(sk5(X2,X1,X0),X0)
      | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f228]) ).

fof(f230,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk2
      | app(X1,X2) != sk1
      | X0 != sk5(X2,X1,X0)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).

fof(f231,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk2 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk1
      | sk5(X2,X1,X0) != X0
      | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f230]) ).

fof(f232,negated_conjecture,
    ( ssItem(sk6)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_23) ).

fof(f233,negated_conjecture,
    ( ssList(sk7)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_24) ).

fof(f234,negated_conjecture,
    ( ssList(sk8)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_25) ).

fof(f235,negated_conjecture,
    ( app(app(sk7,cons(sk6,nil)),sk8) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_26) ).

fof(f236,plain,
    ( sk4 = app(app(sk7,cons(sk6,nil)),sk8)
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f235]) ).

fof(f237,negated_conjecture,
    ( app(sk7,sk8) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_27) ).

fof(f238,plain,
    ( sk3 = app(sk7,sk8)
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f237]) ).

fof(f239,negated_conjecture,
    ! [X0] :
      ( ~ ssItem(X0)
      | sk6 = X0
      | ~ memberP(sk4,X0)
      | ~ geq(X0,sk6)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_28) ).

fof(f242,plain,
    ( neq(sk4,nil)
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f206,f204,f204]) ).

fof(f254,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk4 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk3
      | ssItem(sk5(X2,X1,X0))
      | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f225,f204,f205]) ).

fof(f255,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk4 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk3
      | memberP(sk4,sk5(X2,X1,X0))
      | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f227,f204,f205,f204]) ).

fof(f256,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk4 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk3
      | geq(sk5(X2,X1,X0),X0)
      | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f229,f204,f205]) ).

fof(f257,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | sk4 != app(app(X1,cons(X0,nil)),X2)
      | app(X1,X2) != sk3
      | sk5(X2,X1,X0) != X0
      | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f231,f204,f205]) ).

fof(f268,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f242]) ).

fof(f270,definition,
    ( spl0_1
  <=> neq(sk4,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f274,definition,
    ( spl0_2
  <=> ! [X0] :
        ( ~ ssItem(X0)
        | ~ geq(X0,sk6)
        | ~ memberP(sk4,X0)
        | sk6 = X0 ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f275,plain,
    ( ! [X0] :
        ( ~ memberP(sk4,X0)
        | ~ geq(X0,sk6)
        | ~ ssItem(X0)
        | sk6 = X0 )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f274]) ).

fof(f276,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f239,f274,f270]) ).

fof(f278,definition,
    ( spl0_3
  <=> sk3 = app(sk7,sk8) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f280,plain,
    ( sk3 = app(sk7,sk8)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f281,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f238,f278,f270]) ).

fof(f283,definition,
    ( spl0_4
  <=> sk4 = app(app(sk7,cons(sk6,nil)),sk8) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f285,plain,
    ( sk4 = app(app(sk7,cons(sk6,nil)),sk8)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f283]) ).

fof(f286,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f236,f283,f270]) ).

fof(f288,definition,
    ( spl0_5
  <=> ssList(sk8) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f290,plain,
    ( ssList(sk8)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f288]) ).

fof(f291,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f234,f288,f270]) ).

fof(f293,definition,
    ( spl0_6
  <=> ssList(sk7) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f295,plain,
    ( ssList(sk7)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f293]) ).

fof(f296,plain,
    ( ~ spl0_1
    | spl0_6 ),
    inference(avatar_split_clause,[],[f233,f293,f270]) ).

fof(f298,definition,
    ( spl0_7
  <=> ssItem(sk6) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f300,plain,
    ( ssItem(sk6)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f298]) ).

fof(f301,plain,
    ( ~ spl0_1
    | spl0_7 ),
    inference(avatar_split_clause,[],[f232,f298,f270]) ).

fof(f303,definition,
    ( spl0_8
  <=> ! [X2,X0,X1] :
        ( ~ ssItem(X0)
        | sk5(X2,X1,X0) != X0
        | app(X1,X2) != sk3
        | sk4 != app(app(X1,cons(X0,nil)),X2)
        | ~ ssList(X2)
        | ~ ssList(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f304,plain,
    ( ! [X2,X0,X1] :
        ( sk4 != app(app(X1,cons(X0,nil)),X2)
        | sk5(X2,X1,X0) != X0
        | app(X1,X2) != sk3
        | ~ ssItem(X0)
        | ~ ssList(X2)
        | ~ ssList(X1) )
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f303]) ).

fof(f305,plain,
    ( ~ spl0_1
    | spl0_8 ),
    inference(avatar_split_clause,[],[f257,f303,f270]) ).

fof(f307,definition,
    ( spl0_9
  <=> ! [X2,X0,X1] :
        ( ~ ssItem(X0)
        | geq(sk5(X2,X1,X0),X0)
        | app(X1,X2) != sk3
        | sk4 != app(app(X1,cons(X0,nil)),X2)
        | ~ ssList(X2)
        | ~ ssList(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f308,plain,
    ( ! [X2,X0,X1] :
        ( sk4 != app(app(X1,cons(X0,nil)),X2)
        | geq(sk5(X2,X1,X0),X0)
        | app(X1,X2) != sk3
        | ~ ssItem(X0)
        | ~ ssList(X2)
        | ~ ssList(X1) )
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f307]) ).

fof(f309,plain,
    ( ~ spl0_1
    | spl0_9 ),
    inference(avatar_split_clause,[],[f256,f307,f270]) ).

fof(f311,definition,
    ( spl0_10
  <=> ! [X2,X0,X1] :
        ( ~ ssItem(X0)
        | memberP(sk4,sk5(X2,X1,X0))
        | app(X1,X2) != sk3
        | sk4 != app(app(X1,cons(X0,nil)),X2)
        | ~ ssList(X2)
        | ~ ssList(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f312,plain,
    ( ! [X2,X0,X1] :
        ( sk4 != app(app(X1,cons(X0,nil)),X2)
        | memberP(sk4,sk5(X2,X1,X0))
        | app(X1,X2) != sk3
        | ~ ssItem(X0)
        | ~ ssList(X2)
        | ~ ssList(X1) )
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f311]) ).

fof(f313,plain,
    ( ~ spl0_1
    | spl0_10 ),
    inference(avatar_split_clause,[],[f255,f311,f270]) ).

fof(f315,definition,
    ( spl0_11
  <=> ! [X2,X0,X1] :
        ( ~ ssItem(X0)
        | ssItem(sk5(X2,X1,X0))
        | app(X1,X2) != sk3
        | sk4 != app(app(X1,cons(X0,nil)),X2)
        | ~ ssList(X2)
        | ~ ssList(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).

fof(f316,plain,
    ( ! [X2,X0,X1] :
        ( sk4 != app(app(X1,cons(X0,nil)),X2)
        | ssItem(sk5(X2,X1,X0))
        | app(X1,X2) != sk3
        | ~ ssItem(X0)
        | ~ ssList(X2)
        | ~ ssList(X1) )
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f315]) ).

fof(f317,plain,
    ( ~ spl0_1
    | spl0_11 ),
    inference(avatar_split_clause,[],[f254,f315,f270]) ).

fof(f328,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f268,f270]) ).

fof(f329,plain,
    ( sk4 != sk4
    | ssItem(sk5(sk8,sk7,sk6))
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_11 ),
    inference(superposition,[],[f316,f285]) ).

fof(f330,plain,
    ( ssItem(sk5(sk8,sk7,sk6))
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_11 ),
    inference(trivial_inequality_removal,[],[f329]) ).

fof(f331,plain,
    ( ssItem(sk5(sk8,sk7,sk6))
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f330,f280]) ).

fof(f332,plain,
    ( ssItem(sk5(sk8,sk7,sk6))
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f331,f300]) ).

fof(f333,plain,
    ( ssItem(sk5(sk8,sk7,sk6))
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f332,f290]) ).

fof(f334,plain,
    ( ssItem(sk5(sk8,sk7,sk6))
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f333,f295]) ).

fof(f335,plain,
    ( sk4 != sk4
    | sk6 != sk5(sk8,sk7,sk6)
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(superposition,[],[f304,f285]) ).

fof(f336,plain,
    ( sk6 != sk5(sk8,sk7,sk6)
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(trivial_inequality_removal,[],[f335]) ).

fof(f337,plain,
    ( sk6 != sk5(sk8,sk7,sk6)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f336,f280]) ).

fof(f338,plain,
    ( sk6 != sk5(sk8,sk7,sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f337,f300]) ).

fof(f339,plain,
    ( sk6 != sk5(sk8,sk7,sk6)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f338,f290]) ).

fof(f340,plain,
    ( sk6 != sk5(sk8,sk7,sk6)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f339,f295]) ).

fof(f341,plain,
    ( sk4 != sk4
    | geq(sk5(sk8,sk7,sk6),sk6)
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_9 ),
    inference(superposition,[],[f308,f285]) ).

fof(f342,plain,
    ( geq(sk5(sk8,sk7,sk6),sk6)
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_9 ),
    inference(trivial_inequality_removal,[],[f341]) ).

fof(f343,plain,
    ( geq(sk5(sk8,sk7,sk6),sk6)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f342,f280]) ).

fof(f344,plain,
    ( geq(sk5(sk8,sk7,sk6),sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_7
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f343,f300]) ).

fof(f345,plain,
    ( geq(sk5(sk8,sk7,sk6),sk6)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f344,f290]) ).

fof(f346,plain,
    ( geq(sk5(sk8,sk7,sk6),sk6)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f345,f295]) ).

fof(f347,plain,
    ( sk4 != sk4
    | memberP(sk4,sk5(sk8,sk7,sk6))
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_10 ),
    inference(superposition,[],[f312,f285]) ).

fof(f348,plain,
    ( memberP(sk4,sk5(sk8,sk7,sk6))
    | sk3 != app(sk7,sk8)
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_4
    | ~ spl0_10 ),
    inference(trivial_inequality_removal,[],[f347]) ).

fof(f349,plain,
    ( memberP(sk4,sk5(sk8,sk7,sk6))
    | ~ ssItem(sk6)
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f348,f280]) ).

fof(f350,plain,
    ( memberP(sk4,sk5(sk8,sk7,sk6))
    | ~ ssList(sk8)
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_7
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f349,f300]) ).

fof(f351,plain,
    ( memberP(sk4,sk5(sk8,sk7,sk6))
    | ~ ssList(sk7)
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f350,f290]) ).

fof(f352,plain,
    ( memberP(sk4,sk5(sk8,sk7,sk6))
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f351,f295]) ).

fof(f353,plain,
    ( ~ geq(sk5(sk8,sk7,sk6),sk6)
    | ~ ssItem(sk5(sk8,sk7,sk6))
    | sk6 = sk5(sk8,sk7,sk6)
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_10 ),
    inference(resolution,[],[f352,f275]) ).

fof(f354,plain,
    ( ~ ssItem(sk5(sk8,sk7,sk6))
    | sk6 = sk5(sk8,sk7,sk6)
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f353,f346]) ).

fof(f355,plain,
    ( sk6 = sk5(sk8,sk7,sk6)
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f354,f334]) ).

fof(f356,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f355,f340]) ).

fof(f357,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11 ),
    inference(avatar_contradiction_clause,[],[f356]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f276]) ).

cnf(s2,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(sat_conversion,[],[f281]) ).

cnf(s3,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(sat_conversion,[],[f286]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(sat_conversion,[],[f291]) ).

cnf(s5,plain,
    ( ~ spl0_1
    | spl0_6 ),
    inference(sat_conversion,[],[f296]) ).

cnf(s6,plain,
    ( ~ spl0_1
    | spl0_7 ),
    inference(sat_conversion,[],[f301]) ).

cnf(s7,plain,
    ( ~ spl0_1
    | spl0_8 ),
    inference(sat_conversion,[],[f305]) ).

cnf(s8,plain,
    ( ~ spl0_1
    | spl0_9 ),
    inference(sat_conversion,[],[f309]) ).

cnf(s9,plain,
    ( ~ spl0_1
    | spl0_10 ),
    inference(sat_conversion,[],[f313]) ).

cnf(s10,plain,
    ( ~ spl0_1
    | spl0_11 ),
    inference(sat_conversion,[],[f317]) ).

cnf(s21,plain,
    spl0_1,
    inference(sat_conversion,[],[f328]) ).

cnf(s22,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11 ),
    inference(sat_conversion,[],[f357]) ).

cnf(s23,plain,
    spl0_11,
    inference(rat,[],[s10,s21]) ).

cnf(s24,plain,
    spl0_10,
    inference(rat,[],[s9,s21]) ).

cnf(s25,plain,
    spl0_9,
    inference(rat,[],[s8,s21]) ).

cnf(s26,plain,
    spl0_8,
    inference(rat,[],[s7,s21]) ).

cnf(s27,plain,
    spl0_7,
    inference(rat,[],[s6,s21]) ).

cnf(s28,plain,
    spl0_6,
    inference(rat,[],[s5,s21]) ).

cnf(s29,plain,
    spl0_5,
    inference(rat,[],[s4,s21]) ).

cnf(s30,plain,
    spl0_4,
    inference(rat,[],[s3,s21]) ).

cnf(s31,plain,
    spl0_3,
    inference(rat,[],[s2,s21]) ).

cnf(s32,plain,
    ~ spl0_2,
    inference(rat,[],[s22,s23,s24,s25,s26,s27,s28,s29,s30,s31]) ).

cnf(s33,plain,
    $false,
    inference(rat,[],[s1,s32,s21]) ).

fof(f358,plain,
    $false,
    inference(avatar_sat_refutation,[],[s33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC002-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n017.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Mon Sep 28 07:17:36 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.30/1.16  % (3370108)Input is clausal, will run a generic CNF schedule.
% 2.30/1.16  % (3370116)lrs+10_1_sil=8000:sp=occurrence:random_seed=2695082858:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.30/1.16  % (3370116)First to succeed.
% 2.30/1.16  % (3370116)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3370108"
% 2.30/1.16  % (3370117)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2831175837:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.30/1.16  % (3370118)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3251082859:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.30/1.16  % (3370114)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2955877533:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.30/1.16  % (3370115)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3296779322:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.30/1.16  % (3370119)dis-21_1_sil=8000:lcm=predicate:random_seed=2990638504:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.30/1.16  % (3370113)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2792083451:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.30/1.16  % (3370117)Also succeeded, but the first one will report.
% 2.30/1.16  % (3370119)Also succeeded, but the first one will report.
% 2.30/1.16  % (3370118)Also succeeded, but the first one will report.
% 2.30/1.16  % (3370116)Refutation found. Thanks to Tanya!
% 2.30/1.16  % SZS status Unsatisfiable for theBenchmark
% 2.30/1.16  % SZS output start Proof for theBenchmark
% See solution above
% 2.67/1.36  % (3370116)------------------------------
% 2.67/1.36  % (3370116)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36  % (3370116)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36  % (3370116)CaDiCaL version: 2.1.3
% 2.67/1.36  % (3370116)Termination reason: Refutation
% 2.67/1.36  % (3370116)Time elapsed: 0.004 s
% 2.67/1.36  % (3370116)Peak memory usage: 89 MB
% 2.67/1.36  % (3370116)Instructions burned: 8 (million)
% 2.67/1.36  % (3370116)------------------------------
% 2.67/1.36  % (3370116)------------------------------
% 2.67/1.36  % (3370108)Success in time 0.292 s
% 2.67/1.36  % Vampire exiting
%------------------------------------------------------------------------------