↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC327-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 : n015.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:03:28 PM UTC 2026

% Result   : Unsatisfiable 3.06s 1.10s
% Output   : Refutation 3.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   25
% Syntax   : Number of formulae    :  109 (  17 unt;   8 def)
%            Number of atoms       :  398 ( 116 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  552 ( 263   ~; 281   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   9 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   57 (   0 sgn  57   !;   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,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,plain,
    sk4 = app(sk3,sk5),
    inference(reorient_equations,[],[f207]) ).

fof(f209,negated_conjecture,
    equalelemsP(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f210,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk5
      | ~ ssList(X2)
      | app(X2,cons(X0,nil)) != sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f211,plain,
    ! [X2,X0,X1] :
      ( sk3 != app(X2,cons(X0,nil))
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk5
      | ~ ssList(X2)
      | ~ ssItem(X0) ),
    inference(reorient_equations,[],[f210]) ).

fof(f212,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f213,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | ssItem(sk6(X0))
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f214,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | ssItem(sk6(X0))
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    inference(reorient_equations,[],[f213]) ).

fof(f215,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | ssItem(sk6(X0))
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f216,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | ssItem(sk6(X0))
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    inference(reorient_equations,[],[f215]) ).

fof(f217,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | ssList(sk7(X0))
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

fof(f218,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | ssList(sk7(X0))
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    inference(reorient_equations,[],[f217]) ).

fof(f219,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | app(cons(sk6(X0),nil),sk7(X0)) = X0
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f220,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | app(cons(sk6(X0),nil),sk7(X0)) = X0
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    inference(reorient_equations,[],[f219]) ).

fof(f221,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | ssList(sk8(X0))
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

fof(f222,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | ssList(sk8(X0))
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    inference(reorient_equations,[],[f221]) ).

fof(f223,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | app(sk8(X0),cons(sk6(X0),nil)) = sk1
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).

fof(f224,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | sk1 = app(sk8(X0),cons(sk6(X0),nil))
      | ~ equalelemsP(sk1)
      | nil = sk1 ),
    inference(reorient_equations,[],[f223]) ).

fof(f225,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | ssList(sk7(X0))
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

fof(f226,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | ssList(sk7(X0))
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    inference(reorient_equations,[],[f225]) ).

fof(f227,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | app(cons(sk6(X0),nil),sk7(X0)) = X0
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).

fof(f228,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | app(cons(sk6(X0),nil),sk7(X0)) = X0
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    inference(reorient_equations,[],[f227]) ).

fof(f229,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | ssList(sk8(X0))
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).

fof(f230,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | ssList(sk8(X0))
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    inference(reorient_equations,[],[f229]) ).

fof(f231,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | app(sk1,X0) != sk2
      | app(sk8(X0),cons(sk6(X0),nil)) = sk1
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).

fof(f232,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk2 != app(sk1,X0)
      | sk1 = app(sk8(X0),cons(sk6(X0),nil))
      | ~ equalelemsP(sk1)
      | nil != sk2 ),
    inference(reorient_equations,[],[f231]) ).

fof(f235,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | ssItem(sk6(X0))
      | ~ equalelemsP(sk3)
      | nil = sk3 ),
    inference(definition_unfolding,[],[f214,f204,f205,f205,f205]) ).

fof(f236,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | ssItem(sk6(X0))
      | ~ equalelemsP(sk3)
      | nil != sk4 ),
    inference(definition_unfolding,[],[f216,f204,f205,f205,f204]) ).

fof(f237,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | ssList(sk7(X0))
      | ~ equalelemsP(sk3)
      | nil = sk3 ),
    inference(definition_unfolding,[],[f218,f204,f205,f205,f205]) ).

fof(f238,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | app(cons(sk6(X0),nil),sk7(X0)) = X0
      | ~ equalelemsP(sk3)
      | nil = sk3 ),
    inference(definition_unfolding,[],[f220,f204,f205,f205,f205]) ).

fof(f239,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | ssList(sk8(X0))
      | ~ equalelemsP(sk3)
      | nil = sk3 ),
    inference(definition_unfolding,[],[f222,f204,f205,f205,f205]) ).

fof(f240,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | sk3 = app(sk8(X0),cons(sk6(X0),nil))
      | ~ equalelemsP(sk3)
      | nil = sk3 ),
    inference(definition_unfolding,[],[f224,f204,f205,f205,f205,f205]) ).

fof(f241,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | ssList(sk7(X0))
      | ~ equalelemsP(sk3)
      | nil != sk4 ),
    inference(definition_unfolding,[],[f226,f204,f205,f205,f204]) ).

fof(f242,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | app(cons(sk6(X0),nil),sk7(X0)) = X0
      | ~ equalelemsP(sk3)
      | nil != sk4 ),
    inference(definition_unfolding,[],[f228,f204,f205,f205,f204]) ).

fof(f243,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | ssList(sk8(X0))
      | ~ equalelemsP(sk3)
      | nil != sk4 ),
    inference(definition_unfolding,[],[f230,f204,f205,f205,f204]) ).

fof(f244,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sk4 != app(sk3,X0)
      | sk3 = app(sk8(X0),cons(sk6(X0),nil))
      | ~ equalelemsP(sk3)
      | nil != sk4 ),
    inference(definition_unfolding,[],[f232,f204,f205,f205,f205,f204]) ).

fof(f257,definition,
    ( spl0_3
  <=> nil = sk4 ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f260,definition,
    ( spl0_4
  <=> equalelemsP(sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f261,plain,
    ( ~ equalelemsP(sk3)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f260]) ).

fof(f263,definition,
    ( spl0_5
  <=> ! [X0] :
        ( ~ ssList(X0)
        | sk3 = app(sk8(X0),cons(sk6(X0),nil))
        | sk4 != app(sk3,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f264,plain,
    ( ! [X0] :
        ( sk3 = app(sk8(X0),cons(sk6(X0),nil))
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f263]) ).

fof(f265,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_5 ),
    inference(avatar_split_clause,[],[f244,f263,f260,f257]) ).

fof(f267,definition,
    ( spl0_6
  <=> ! [X0] :
        ( ~ ssList(X0)
        | ssList(sk8(X0))
        | sk4 != app(sk3,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f268,plain,
    ( ! [X0] :
        ( sk4 != app(sk3,X0)
        | ssList(sk8(X0))
        | ~ ssList(X0) )
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f267]) ).

fof(f269,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_6 ),
    inference(avatar_split_clause,[],[f243,f267,f260,f257]) ).

fof(f271,definition,
    ( spl0_7
  <=> ! [X0] :
        ( ~ ssList(X0)
        | app(cons(sk6(X0),nil),sk7(X0)) = X0
        | sk4 != app(sk3,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f272,plain,
    ( ! [X0] :
        ( app(cons(sk6(X0),nil),sk7(X0)) = X0
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f271]) ).

fof(f273,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_7 ),
    inference(avatar_split_clause,[],[f242,f271,f260,f257]) ).

fof(f275,definition,
    ( spl0_8
  <=> ! [X0] :
        ( ~ ssList(X0)
        | ssList(sk7(X0))
        | sk4 != app(sk3,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f276,plain,
    ( ! [X0] :
        ( sk4 != app(sk3,X0)
        | ssList(sk7(X0))
        | ~ ssList(X0) )
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f275]) ).

fof(f277,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_8 ),
    inference(avatar_split_clause,[],[f241,f275,f260,f257]) ).

fof(f279,definition,
    ( spl0_9
  <=> nil = sk3 ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f281,plain,
    ( spl0_9
    | ~ spl0_4
    | spl0_5 ),
    inference(avatar_split_clause,[],[f240,f263,f260,f279]) ).

fof(f282,plain,
    ( spl0_9
    | ~ spl0_4
    | spl0_6 ),
    inference(avatar_split_clause,[],[f239,f267,f260,f279]) ).

fof(f283,plain,
    ( spl0_9
    | ~ spl0_4
    | spl0_7 ),
    inference(avatar_split_clause,[],[f238,f271,f260,f279]) ).

fof(f284,plain,
    ( spl0_9
    | ~ spl0_4
    | spl0_8 ),
    inference(avatar_split_clause,[],[f237,f275,f260,f279]) ).

fof(f286,definition,
    ( spl0_10
  <=> ! [X0] :
        ( ~ ssList(X0)
        | ssItem(sk6(X0))
        | sk4 != app(sk3,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f287,plain,
    ( ! [X0] :
        ( sk4 != app(sk3,X0)
        | ssItem(sk6(X0))
        | ~ ssList(X0) )
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f286]) ).

fof(f288,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_10 ),
    inference(avatar_split_clause,[],[f236,f286,f260,f257]) ).

fof(f289,plain,
    ( spl0_9
    | ~ spl0_4
    | spl0_10 ),
    inference(avatar_split_clause,[],[f235,f286,f260,f279]) ).

fof(f292,plain,
    ( ~ spl0_9
    | spl0_3 ),
    inference(avatar_split_clause,[],[f212,f257,f279]) ).

fof(f293,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f261,f209]) ).

fof(f294,plain,
    spl0_4,
    inference(avatar_contradiction_clause,[],[f293]) ).

fof(f304,plain,
    ( ! [X0,X1] :
        ( sk3 != sk3
        | ~ ssList(X1)
        | sk5 != app(cons(sk6(X0),nil),X1)
        | ~ ssList(sk8(X0))
        | ~ ssItem(sk6(X0))
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_5 ),
    inference(superposition,[],[f211,f264]) ).

fof(f305,plain,
    ( ! [X0,X1] :
        ( ~ ssList(X1)
        | sk5 != app(cons(sk6(X0),nil),X1)
        | ~ ssList(sk8(X0))
        | ~ ssItem(sk6(X0))
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_5 ),
    inference(trivial_inequality_removal,[],[f304]) ).

fof(f306,plain,
    ( ! [X0,X1] :
        ( ~ ssList(X1)
        | sk5 != app(cons(sk6(X0),nil),X1)
        | ~ ssItem(sk6(X0))
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f305,f268]) ).

fof(f307,plain,
    ( ! [X0,X1] :
        ( sk5 != app(cons(sk6(X0),nil),X1)
        | ~ ssList(X1)
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f306,f287]) ).

fof(f308,plain,
    ( ! [X0] :
        ( sk5 != X0
        | ~ ssList(sk7(X0))
        | ~ ssList(X0)
        | sk4 != app(sk3,X0)
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_10 ),
    inference(superposition,[],[f307,f272]) ).

fof(f309,plain,
    ( ! [X0] :
        ( sk5 != X0
        | ~ ssList(sk7(X0))
        | ~ ssList(X0)
        | sk4 != app(sk3,X0) )
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_10 ),
    inference(duplicate_literal_removal,[],[f308]) ).

fof(f310,plain,
    ( ! [X0] :
        ( sk4 != app(sk3,X0)
        | ~ ssList(X0)
        | sk5 != X0 )
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f309,f276]) ).

fof(f311,plain,
    ( sk4 != sk4
    | ~ ssList(sk5)
    | sk5 != sk5
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(superposition,[],[f310,f208]) ).

fof(f312,plain,
    ( ~ ssList(sk5)
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(trivial_inequality_removal,[],[f311]) ).

fof(f313,plain,
    ( $false
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f312,f206]) ).

fof(f314,plain,
    ( ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(avatar_contradiction_clause,[],[f313]) ).

cnf(s2,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_5 ),
    inference(sat_conversion,[],[f265]) ).

cnf(s3,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_6 ),
    inference(sat_conversion,[],[f269]) ).

cnf(s4,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_7 ),
    inference(sat_conversion,[],[f273]) ).

cnf(s5,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_8 ),
    inference(sat_conversion,[],[f277]) ).

cnf(s6,plain,
    ( ~ spl0_4
    | spl0_5
    | spl0_9 ),
    inference(sat_conversion,[],[f281]) ).

cnf(s7,plain,
    ( ~ spl0_4
    | spl0_6
    | spl0_9 ),
    inference(sat_conversion,[],[f282]) ).

cnf(s8,plain,
    ( ~ spl0_4
    | spl0_7
    | spl0_9 ),
    inference(sat_conversion,[],[f283]) ).

cnf(s9,plain,
    ( ~ spl0_4
    | spl0_8
    | spl0_9 ),
    inference(sat_conversion,[],[f284]) ).

cnf(s10,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | spl0_10 ),
    inference(sat_conversion,[],[f288]) ).

cnf(s11,plain,
    ( ~ spl0_4
    | spl0_9
    | spl0_10 ),
    inference(sat_conversion,[],[f289]) ).

cnf(s12,plain,
    ( spl0_3
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f292]) ).

cnf(s13,plain,
    spl0_4,
    inference(sat_conversion,[],[f294]) ).

cnf(s14,plain,
    ( ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(sat_conversion,[],[f314]) ).

cnf(s15,plain,
    ( spl0_9
    | spl0_10 ),
    inference(rat,[],[s11,s13]) ).

cnf(s16,plain,
    ( ~ spl0_3
    | spl0_10 ),
    inference(rat,[],[s10,s13]) ).

cnf(s17,plain,
    ( spl0_8
    | spl0_9 ),
    inference(rat,[],[s9,s13]) ).

cnf(s18,plain,
    ( spl0_7
    | spl0_9 ),
    inference(rat,[],[s8,s13]) ).

cnf(s19,plain,
    ( spl0_6
    | spl0_9 ),
    inference(rat,[],[s7,s13]) ).

cnf(s20,plain,
    ( spl0_5
    | spl0_9 ),
    inference(rat,[],[s6,s13]) ).

cnf(s21,plain,
    ( ~ spl0_3
    | spl0_8 ),
    inference(rat,[],[s5,s13]) ).

cnf(s22,plain,
    ( ~ spl0_3
    | spl0_7 ),
    inference(rat,[],[s4,s13]) ).

cnf(s23,plain,
    ( ~ spl0_3
    | spl0_6 ),
    inference(rat,[],[s3,s13]) ).

cnf(s24,plain,
    ( ~ spl0_3
    | spl0_5 ),
    inference(rat,[],[s2,s13]) ).

cnf(s25,plain,
    spl0_9,
    inference(rat,[],[s14,s20,s19,s18,s17,s15]) ).

cnf(s26,plain,
    spl0_3,
    inference(rat,[],[s12,s25]) ).

cnf(s27,plain,
    spl0_10,
    inference(rat,[],[s16,s26]) ).

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

cnf(s29,plain,
    spl0_7,
    inference(rat,[],[s22,s26]) ).

cnf(s30,plain,
    spl0_6,
    inference(rat,[],[s23,s26]) ).

cnf(s31,plain,
    spl0_5,
    inference(rat,[],[s24,s26]) ).

cnf(s32,plain,
    $false,
    inference(rat,[],[s14,s27,s28,s29,s30,s31]) ).

fof(f315,plain,
    $false,
    inference(avatar_sat_refutation,[],[s32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC327-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.18  % Computer : n015.cluster.edu
% 0.10/0.18  % Model    : x86_64 x86_64
% 0.10/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18  % Memory   : 8046.5625MB
% 0.10/0.18  % OS       : Linux 6.8.0-71-generic
% 0.10/0.18  % CPULimit : 300
% 0.10/0.18  % WCLimit  : 300
% 0.10/0.18  % DateTime : Mon Sep 28 09:09:31 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22  Running first-order theorem proving
% 0.10/0.22  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
% 3.06/1.10  % (2486885)Input is clausal, will run a generic CNF schedule.
% 3.06/1.10  % (2486890)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=2733451386:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.06/1.10  % (2486895)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=457841299:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.06/1.10  % (2486892)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2084924433:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.06/1.10  % (2486891)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3883199421:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.06/1.10  % (2486894)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=661951118:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.06/1.10  % (2486893)lrs+10_1_sil=8000:sp=occurrence:random_seed=1393594004:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.06/1.10  % (2486896)dis-21_1_sil=8000:lcm=predicate:random_seed=1370247158: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)
% 3.06/1.10  % (2486893)Also succeeded, but the first one will report.
% 3.06/1.10  % (2486894)First to succeed.
% 3.06/1.10  % (2486896)Also succeeded, but the first one will report.
% 3.06/1.10  % (2486894)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2486885"
% 3.06/1.10  % (2486895)Also succeeded, but the first one will report.
% 3.06/1.10  % (2486894)Refutation found. Thanks to Tanya!
% 3.06/1.10  % SZS status Unsatisfiable for theBenchmark
% 3.06/1.10  % SZS output start Proof for theBenchmark
% See solution above
% 3.63/1.19  % (2486894)------------------------------
% 3.63/1.19  % (2486894)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.19  % (2486894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.19  % (2486894)CaDiCaL version: 2.1.3
% 3.63/1.19  % (2486894)Termination reason: Refutation
% 3.63/1.19  % (2486894)Time elapsed: 0.005 s
% 3.63/1.19  % (2486894)Peak memory usage: 89 MB
% 3.63/1.19  % (2486894)Instructions burned: 6 (million)
% 3.63/1.19  % (2486894)------------------------------
% 3.63/1.19  % (2486894)------------------------------
% 3.63/1.19  % (2486885)Success in time 0.445 s
% 3.63/1.19  % Vampire exiting
%------------------------------------------------------------------------------