↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n003.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:24 PM UTC 2026

% Result   : Unsatisfiable 2.47s 1.05s
% Output   : Refutation 3.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   30
% Syntax   : Number of formulae    :  115 (  10 unt;  12 def)
%            Number of atoms       :  350 (  80 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  439 ( 204   ~; 223   |;   0   &)
%                                         (  12 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   17 (  15 usr;  13 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   47 (   0 sgn  47   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f75,axiom,
    ! [X0] :
      ( ssList(tl(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause75) ).

fof(f76,axiom,
    ! [X0] :
      ( ssItem(hd(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause76) ).

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause85) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause86) ).

fof(f101,axiom,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).

fof(f102,plain,
    ! [X0,X1] :
      ( neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(reorient_equations,[],[f101]) ).

fof(f107,axiom,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause104) ).

fof(f118,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause115) ).

fof(f125,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) = cons(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause120) ).

fof(f126,plain,
    ! [X0,X1] :
      ( cons(X0,X1) = app(cons(X0,nil),X1)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(reorient_equations,[],[f125]) ).

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).

fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

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

fof(f206,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(X0)
      | sk3 = X0
      | ~ ssList(X1)
      | ~ ssList(X2)
      | tl(sk4) != X1
      | app(X1,X2) != X0
      | ~ ssItem(X3)
      | cons(X3,nil) != X2
      | hd(sk4) != X3
      | ~ neq(nil,sk4)
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ( nil = sk2
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ! [X0,X1] :
      ( nil = sk2
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk2
      | app(X1,cons(X0,nil)) != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,plain,
    ! [X0,X1] :
      ( nil = sk2
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk2
      | sk1 != app(X1,cons(X0,nil)) ),
    inference(reorient_equations,[],[f209]) ).

fof(f211,negated_conjecture,
    ( nil != sk1
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f212,negated_conjecture,
    ! [X0,X1] :
      ( nil != sk1
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk2
      | app(X1,cons(X0,nil)) != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f213,plain,
    ! [X0,X1] :
      ( nil != sk1
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk2
      | sk1 != app(X1,cons(X0,nil)) ),
    inference(reorient_equations,[],[f212]) ).

fof(f216,plain,
    ( nil = sk4
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f208,f204,f204]) ).

fof(f217,plain,
    ! [X0,X1] :
      ( nil = sk4
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk4
      | sk3 != app(X1,cons(X0,nil)) ),
    inference(definition_unfolding,[],[f210,f204,f204,f205]) ).

fof(f218,plain,
    ( nil != sk3
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f211,f205,f204]) ).

fof(f219,plain,
    ! [X0,X1] :
      ( nil != sk3
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk4
      | sk3 != app(X1,cons(X0,nil)) ),
    inference(definition_unfolding,[],[f213,f205,f204,f205]) ).

fof(f220,plain,
    ! [X2,X3,X0] :
      ( ~ ssList(X0)
      | sk3 = X0
      | ~ ssList(tl(sk4))
      | ~ ssList(X2)
      | app(tl(sk4),X2) != X0
      | ~ ssItem(X3)
      | cons(X3,nil) != X2
      | hd(sk4) != X3
      | ~ neq(nil,sk4)
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f207]) ).

fof(f221,plain,
    ! [X2,X3] :
      ( ~ ssList(app(tl(sk4),X2))
      | sk3 = app(tl(sk4),X2)
      | ~ ssList(tl(sk4))
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | cons(X3,nil) != X2
      | hd(sk4) != X3
      | ~ neq(nil,sk4)
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f220]) ).

fof(f222,plain,
    ! [X3] :
      ( ~ ssList(app(tl(sk4),cons(X3,nil)))
      | sk3 = app(tl(sk4),cons(X3,nil))
      | ~ ssList(tl(sk4))
      | ~ ssList(cons(X3,nil))
      | ~ ssItem(X3)
      | hd(sk4) != X3
      | ~ neq(nil,sk4)
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f221]) ).

fof(f223,plain,
    ( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
    | sk3 = app(tl(sk4),cons(hd(sk4),nil))
    | ~ ssList(tl(sk4))
    | ~ ssList(cons(hd(sk4),nil))
    | ~ ssItem(hd(sk4))
    | ~ neq(nil,sk4)
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f222]) ).

fof(f227,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f118]) ).

fof(f234,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f227]) ).

fof(f237,plain,
    ( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
    | sk3 = app(tl(sk4),cons(hd(sk4),nil))
    | ~ ssList(tl(sk4))
    | ~ ssList(cons(hd(sk4),nil))
    | ~ ssItem(hd(sk4))
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(duplicate_literal_removal,[],[f223]) ).

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

fof(f255,plain,
    ( ! [X0,X1] :
        ( sk3 != app(X1,cons(X0,nil))
        | ~ ssItem(X0)
        | app(cons(X0,nil),X1) != sk4
        | ~ ssList(X1) )
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f254]) ).

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

fof(f259,plain,
    ( spl0_5
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f219,f257,f254]) ).

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

fof(f262,plain,
    ( neq(sk4,nil)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f263,plain,
    ( spl0_7
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f218,f257,f261]) ).

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

fof(f266,plain,
    ( nil = sk4
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f265]) ).

fof(f267,plain,
    ( spl0_5
    | spl0_8 ),
    inference(avatar_split_clause,[],[f217,f265,f254]) ).

fof(f268,plain,
    ( spl0_7
    | spl0_8 ),
    inference(avatar_split_clause,[],[f216,f265,f261]) ).

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

fof(f272,plain,
    ( ~ neq(nil,sk4)
    | spl0_9 ),
    inference(avatar_component_clause,[],[f271]) ).

fof(f274,definition,
    ( spl0_10
  <=> ssItem(hd(sk4)) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f275,plain,
    ( ~ ssItem(hd(sk4))
    | spl0_10 ),
    inference(avatar_component_clause,[],[f274]) ).

fof(f277,definition,
    ( spl0_11
  <=> ssList(cons(hd(sk4),nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).

fof(f278,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | spl0_11 ),
    inference(avatar_component_clause,[],[f277]) ).

fof(f280,definition,
    ( spl0_12
  <=> ssList(tl(sk4)) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f281,plain,
    ( ~ ssList(tl(sk4))
    | spl0_12 ),
    inference(avatar_component_clause,[],[f280]) ).

fof(f283,definition,
    ( spl0_13
  <=> sk3 = app(tl(sk4),cons(hd(sk4),nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

fof(f284,plain,
    ( sk3 = app(tl(sk4),cons(hd(sk4),nil))
    | ~ spl0_13 ),
    inference(avatar_component_clause,[],[f283]) ).

fof(f286,definition,
    ( spl0_14
  <=> ssList(app(tl(sk4),cons(hd(sk4),nil))) ),
    introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).

fof(f287,plain,
    ( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
    | spl0_14 ),
    inference(avatar_component_clause,[],[f286]) ).

fof(f288,plain,
    ( ~ spl0_7
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11
    | ~ spl0_12
    | spl0_13
    | ~ spl0_14 ),
    inference(avatar_split_clause,[],[f237,f286,f283,f280,f277,f274,f271,f261]) ).

fof(f289,plain,
    ( nil != sk4
    | spl0_8 ),
    inference(avatar_component_clause,[],[f265]) ).

fof(f291,plain,
    ( ~ spl0_8
    | spl0_6 ),
    inference(avatar_split_clause,[],[f206,f257,f265]) ).

fof(f305,plain,
    ( ~ ssList(nil)
    | ~ ssItem(hd(sk4))
    | spl0_11 ),
    inference(resolution,[],[f86,f278]) ).

fof(f306,plain,
    ( ~ ssItem(hd(sk4))
    | spl0_11 ),
    inference(forward_subsumption_resolution,[],[f305,f8]) ).

fof(f307,plain,
    ( ~ spl0_10
    | spl0_11 ),
    inference(avatar_split_clause,[],[f306,f277,f274]) ).

fof(f308,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_10 ),
    inference(resolution,[],[f275,f76]) ).

fof(f309,plain,
    ( nil = sk4
    | spl0_10 ),
    inference(forward_subsumption_resolution,[],[f308,f203]) ).

fof(f312,plain,
    ( spl0_8
    | spl0_10 ),
    inference(avatar_split_clause,[],[f309,f274,f265]) ).

fof(f316,plain,
    ( neq(nil,nil)
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(superposition,[],[f262,f266]) ).

fof(f322,plain,
    ( ~ ssList(nil)
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(resolution,[],[f316,f234]) ).

fof(f323,plain,
    ( $false
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f322,f8]) ).

fof(f324,plain,
    ( ~ spl0_7
    | ~ spl0_8 ),
    inference(avatar_contradiction_clause,[],[f323]) ).

fof(f333,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk4)
    | nil = sk4
    | spl0_9 ),
    inference(resolution,[],[f102,f272]) ).

fof(f336,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_9 ),
    inference(forward_subsumption_resolution,[],[f333,f8]) ).

fof(f337,plain,
    ( nil = sk4
    | spl0_9 ),
    inference(forward_subsumption_resolution,[],[f336,f203]) ).

fof(f338,plain,
    ( $false
    | spl0_8
    | spl0_9 ),
    inference(forward_subsumption_resolution,[],[f337,f289]) ).

fof(f339,plain,
    ( spl0_8
    | spl0_9 ),
    inference(avatar_contradiction_clause,[],[f338]) ).

fof(f340,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_12 ),
    inference(resolution,[],[f281,f75]) ).

fof(f341,plain,
    ( nil = sk4
    | spl0_12 ),
    inference(forward_subsumption_resolution,[],[f340,f203]) ).

fof(f342,plain,
    ( $false
    | spl0_8
    | spl0_12 ),
    inference(forward_subsumption_resolution,[],[f341,f289]) ).

fof(f343,plain,
    ( spl0_8
    | spl0_12 ),
    inference(avatar_contradiction_clause,[],[f342]) ).

fof(f344,plain,
    ( ~ ssList(tl(sk4))
    | ~ ssList(cons(hd(sk4),nil))
    | spl0_14 ),
    inference(resolution,[],[f287,f85]) ).

fof(f345,plain,
    ( ~ spl0_11
    | ~ spl0_12
    | spl0_14 ),
    inference(avatar_split_clause,[],[f344,f286,f280,f277]) ).

fof(f348,plain,
    ( ! [X0,X1] :
        ( app(tl(sk4),cons(hd(sk4),nil)) != app(X0,cons(X1,nil))
        | ~ ssItem(X1)
        | sk4 != app(cons(X1,nil),X0)
        | ~ ssList(X0) )
    | ~ spl0_5
    | ~ spl0_13 ),
    inference(superposition,[],[f255,f284]) ).

fof(f372,plain,
    ( ~ ssItem(hd(sk4))
    | sk4 != app(cons(hd(sk4),nil),tl(sk4))
    | ~ ssList(tl(sk4))
    | ~ spl0_5
    | ~ spl0_13 ),
    inference(equality_resolution,[],[f348]) ).

fof(f375,definition,
    ( spl0_15
  <=> sk4 = app(cons(hd(sk4),nil),tl(sk4)) ),
    introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).

fof(f376,plain,
    ( sk4 != app(cons(hd(sk4),nil),tl(sk4))
    | spl0_15 ),
    inference(avatar_component_clause,[],[f375]) ).

fof(f377,plain,
    ( ~ spl0_12
    | ~ spl0_15
    | ~ spl0_10
    | ~ spl0_5
    | ~ spl0_13 ),
    inference(avatar_split_clause,[],[f372,f283,f254,f274,f375,f280]) ).

fof(f504,plain,
    ( sk4 != cons(hd(sk4),tl(sk4))
    | ~ ssList(tl(sk4))
    | ~ ssItem(hd(sk4))
    | spl0_15 ),
    inference(superposition,[],[f376,f126]) ).

fof(f506,definition,
    ( spl0_28
  <=> sk4 = cons(hd(sk4),tl(sk4)) ),
    introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition]) ).

fof(f507,plain,
    ( sk4 != cons(hd(sk4),tl(sk4))
    | spl0_28 ),
    inference(avatar_component_clause,[],[f506]) ).

fof(f508,plain,
    ( ~ spl0_10
    | ~ spl0_12
    | ~ spl0_28
    | spl0_15 ),
    inference(avatar_split_clause,[],[f504,f375,f506,f280,f274]) ).

fof(f509,plain,
    ( sk4 != sk4
    | ~ ssList(sk4)
    | nil = sk4
    | spl0_28 ),
    inference(superposition,[],[f507,f107]) ).

fof(f510,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_28 ),
    inference(trivial_inequality_removal,[],[f509]) ).

fof(f511,plain,
    ( nil = sk4
    | spl0_28 ),
    inference(forward_subsumption_resolution,[],[f510,f203]) ).

fof(f512,plain,
    ( $false
    | spl0_8
    | spl0_28 ),
    inference(forward_subsumption_resolution,[],[f511,f289]) ).

fof(f513,plain,
    ( spl0_8
    | spl0_28 ),
    inference(avatar_contradiction_clause,[],[f512]) ).

cnf(s4,plain,
    ( spl0_5
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f259]) ).

cnf(s5,plain,
    ( ~ spl0_6
    | spl0_7 ),
    inference(sat_conversion,[],[f263]) ).

cnf(s6,plain,
    ( spl0_5
    | spl0_8 ),
    inference(sat_conversion,[],[f267]) ).

cnf(s7,plain,
    ( spl0_7
    | spl0_8 ),
    inference(sat_conversion,[],[f268]) ).

cnf(s8,plain,
    ( ~ spl0_7
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11
    | ~ spl0_12
    | spl0_13
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f288]) ).

cnf(s9,plain,
    ( spl0_6
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f291]) ).

cnf(s13,plain,
    ( ~ spl0_10
    | spl0_11 ),
    inference(sat_conversion,[],[f307]) ).

cnf(s15,plain,
    ( spl0_8
    | spl0_10 ),
    inference(sat_conversion,[],[f312]) ).

cnf(s16,plain,
    ( ~ spl0_7
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f324]) ).

cnf(s17,plain,
    ( spl0_8
    | spl0_9 ),
    inference(sat_conversion,[],[f339]) ).

cnf(s18,plain,
    ( spl0_8
    | spl0_12 ),
    inference(sat_conversion,[],[f343]) ).

cnf(s19,plain,
    ( ~ spl0_11
    | ~ spl0_12
    | spl0_14 ),
    inference(sat_conversion,[],[f345]) ).

cnf(s20,plain,
    ( ~ spl0_5
    | ~ spl0_10
    | ~ spl0_12
    | ~ spl0_13
    | ~ spl0_15 ),
    inference(sat_conversion,[],[f377]) ).

cnf(s36,plain,
    ( ~ spl0_10
    | ~ spl0_12
    | spl0_15
    | ~ spl0_28 ),
    inference(sat_conversion,[],[f508]) ).

cnf(s37,plain,
    ( spl0_8
    | spl0_28 ),
    inference(sat_conversion,[],[f513]) ).

cnf(s39,plain,
    spl0_5,
    inference(rat,[],[s9,s4,s6]) ).

cnf(s40,plain,
    spl0_8,
    inference(rat,[],[s8,s19,s13,s20,s36,s7,s15,s17,s18,s37,s39]) ).

cnf(s41,plain,
    ~ spl0_7,
    inference(rat,[],[s16,s40]) ).

cnf(s42,plain,
    spl0_6,
    inference(rat,[],[s9,s40]) ).

cnf(s43,plain,
    $false,
    inference(rat,[],[s5,s41,s42]) ).

fof(f514,plain,
    $false,
    inference(avatar_sat_refutation,[],[s43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC311-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n003.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Mon Sep 28 09:02:12 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  Running first-order theorem proving
% 0.08/0.19  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.47/1.05  % (1446191)Input is clausal, will run a generic CNF schedule.
% 2.47/1.05  % (1446196)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=3519354864:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.47/1.05  % (1446199)lrs+10_1_sil=8000:sp=occurrence:random_seed=1217929067:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.47/1.05  % (1446198)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=806738878:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.47/1.05  % (1446201)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2507324019:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.47/1.05  % (1446200)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1606868245:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.47/1.05  % (1446202)dis-21_1_sil=8000:lcm=predicate:random_seed=2848586364: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.47/1.05  % (1446197)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3103641334:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.47/1.05  % (1446200)First to succeed.
% 2.47/1.05  % (1446201)Also succeeded, but the first one will report.
% 2.47/1.05  % (1446200)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1446191"
% 2.47/1.05  % (1446199)Also succeeded, but the first one will report.
% 2.47/1.05  % (1446202)Instruction limit reached! 
% 2.47/1.05  % (1446202)------------------------------
% 2.47/1.05  % (1446202)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/1.05  % (1446202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/1.05  % (1446202)CaDiCaL version: 2.1.3
% 2.47/1.05  % (1446202)Termination reason: Instruction limit
% 2.47/1.05  % (1446202)Termination phase: Saturation
% 2.47/1.05  % (1446202)Time elapsed: 0.058 s
% 2.47/1.05  % (1446202)Peak memory usage: 89 MB
% 2.47/1.05  % (1446202)Instructions burned: 117 (million)
% 2.47/1.05  % (1446210)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2504471645:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 2.47/1.05  % (1446210)Also succeeded, but the first one will report.
% 2.47/1.05  % (1446200)Refutation found. Thanks to Tanya!
% 2.47/1.05  % SZS status Unsatisfiable for theBenchmark
% 2.47/1.05  % SZS output start Proof for theBenchmark
% See solution above
% 3.55/1.25  % (1446200)------------------------------
% 3.55/1.25  % (1446200)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.25  % (1446200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.25  % (1446200)CaDiCaL version: 2.1.3
% 3.55/1.25  % (1446200)Termination reason: Refutation
% 3.55/1.25  % (1446200)Time elapsed: 0.011 s
% 3.55/1.25  % (1446200)Peak memory usage: 90 MB
% 3.55/1.25  % (1446200)Instructions burned: 14 (million)
% 3.55/1.25  % (1446200)------------------------------
% 3.55/1.25  % (1446200)------------------------------
% 3.55/1.25  % (1446191)Success in time 0.421 s
% 3.55/1.25  % Vampire exiting
%------------------------------------------------------------------------------