↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWC382-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 : n014.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:05:48 PM UTC 2026

% Result   : Unsatisfiable 1.09s 0.47s
% Output   : Refutation 1.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   31
% Syntax   : Number of formulae    :  131 (  23 unt;   8 def)
%            Number of atoms       :  359 (  59 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  410 ( 182   ~; 220   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   9 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   49 (   0 sgn  49   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).

fof(f12,axiom,
    ! [X0] : ssItem(skaf83(X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).

fof(f13,axiom,
    ! [X0] : ssList(skaf82(X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).

fof(f74,axiom,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).

fof(f76,axiom,
    ! [X0] :
      ( ssItem(hd(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).

fof(f96,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | tl(cons(X0,X1)) = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).

fof(f101,axiom,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).

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

fof(f107,axiom,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(hd(X0),tl(X0)) = X0
      | nil = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).

fof(f112,axiom,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(skaf83(X0),skaf82(X0)) = X0
      | nil = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).

fof(f118,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).

fof(f119,axiom,
    ! [X0,X1] :
      ( cons(X0,nil) != X1
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | singletonP(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).

fof(f125,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) = cons(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).

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

fof(f187,axiom,
    ! [X2,X3,X0,X1] :
      ( app(app(X0,X1),X2) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X3)
      | segmentP(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).

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

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(f208,negated_conjecture,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | sk3 = X0
      | ~ ssItem(X1)
      | cons(X1,nil) != X0
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ( ~ singletonP(sk1)
    | ~ segmentP(sk2,sk1)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | sk3 = X0
      | ~ ssItem(X1)
      | cons(X1,nil) != X0
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ( ~ singletonP(sk1)
    | ~ segmentP(sk2,sk1)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

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

fof(f216,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | sk3 = X0
      | ~ ssItem(X1)
      | cons(X1,nil) != X0
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f208,f204]) ).

fof(f217,plain,
    ( ~ singletonP(sk3)
    | ~ segmentP(sk4,sk3)
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f209,f205,f204,f205,f204]) ).

fof(f218,plain,
    ( ~ singletonP(sk3)
    | ~ segmentP(sk4,sk3)
    | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f211,f205,f204,f205]) ).

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

fof(f226,plain,
    ! [X0] :
      ( ~ ssList(cons(X0,nil))
      | ~ ssItem(X0)
      | singletonP(cons(X0,nil)) ),
    inference(equality_resolution,[],[f119]) ).

fof(f233,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

fof(f243,plain,
    ! [X1] :
      ( ~ ssList(cons(X1,nil))
      | sk3 = cons(X1,nil)
      | ~ ssItem(X1)
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | neq(sk4,nil) ),
    inference(equality_resolution,[],[f216]) ).

fof(f244,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | sk3 = cons(hd(sk4),nil)
    | ~ ssItem(hd(sk4))
    | ~ neq(nil,sk4)
    | neq(sk4,nil) ),
    inference(equality_resolution,[],[f243]) ).

fof(f245,plain,
    ! [X1] :
      ( ~ ssList(cons(X1,nil))
      | sk3 = cons(X1,nil)
      | ~ ssItem(X1)
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f210]) ).

fof(f246,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | sk3 = cons(hd(sk4),nil)
    | ~ ssItem(hd(sk4))
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f245]) ).

fof(f247,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f214]) ).

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

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

fof(f259,definition,
    ( spl0_2
  <=> segmentP(sk4,sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f261,plain,
    ( ~ segmentP(sk4,sk3)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f263,definition,
    ( spl0_3
  <=> singletonP(sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f265,plain,
    ( ~ singletonP(sk3)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f263]) ).

fof(f266,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f218,f263,f259,f255]) ).

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

fof(f270,plain,
    ( ~ neq(nil,sk4)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f268]) ).

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

fof(f273,plain,
    ( ssItem(hd(sk4))
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f272]) ).

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

fof(f276,definition,
    ( spl0_6
  <=> sk3 = cons(hd(sk4),nil) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f278,plain,
    ( sk3 = cons(hd(sk4),nil)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f276]) ).

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

fof(f282,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | spl0_7 ),
    inference(avatar_component_clause,[],[f280]) ).

fof(f283,plain,
    ( ~ spl0_1
    | ~ spl0_4
    | ~ spl0_5
    | spl0_6
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f246,f280,f276,f272,f268,f255]) ).

fof(f284,plain,
    ( spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f217,f263,f259,f255]) ).

fof(f285,plain,
    ( spl0_1
    | ~ spl0_4
    | ~ spl0_5
    | spl0_6
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f244,f280,f276,f272,f268,f255]) ).

fof(f448,plain,
    ( ~ ssList(sk3)
    | ~ ssItem(hd(sk4))
    | singletonP(sk3)
    | ~ spl0_6 ),
    inference(superposition,[],[f226,f278]) ).

fof(f450,plain,
    ( ~ ssItem(hd(sk4))
    | singletonP(sk3)
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f448,f202]) ).

fof(f452,plain,
    ( ~ ssItem(hd(sk4))
    | spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f450,f265]) ).

fof(f454,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_3
    | ~ spl0_6 ),
    inference(resolution,[],[f452,f76]) ).

fof(f455,plain,
    ( nil = sk4
    | spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f454,f203]) ).

fof(f459,plain,
    ( neq(nil,nil)
    | spl0_3
    | ~ spl0_6 ),
    inference(superposition,[],[f247,f455]) ).

fof(f466,plain,
    ( ~ ssList(nil)
    | spl0_3
    | ~ spl0_6 ),
    inference(resolution,[],[f459,f252]) ).

fof(f468,plain,
    ( $false
    | spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f466,f8]) ).

fof(f469,plain,
    ( spl0_3
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f468]) ).

fof(f470,plain,
    ( ~ ssList(nil)
    | ~ ssItem(hd(sk4))
    | spl0_7 ),
    inference(resolution,[],[f282,f86]) ).

fof(f471,plain,
    ( ~ ssItem(hd(sk4))
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f470,f8]) ).

fof(f472,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_7 ),
    inference(resolution,[],[f471,f76]) ).

fof(f473,plain,
    ( nil = sk4
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f472,f203]) ).

fof(f475,plain,
    ( neq(nil,nil)
    | spl0_7 ),
    inference(superposition,[],[f247,f473]) ).

fof(f480,plain,
    ( ~ ssList(nil)
    | spl0_7 ),
    inference(resolution,[],[f475,f252]) ).

fof(f482,plain,
    ( $false
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f480,f8]) ).

fof(f483,plain,
    spl0_7,
    inference(avatar_contradiction_clause,[],[f482]) ).

fof(f484,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_5 ),
    inference(resolution,[],[f274,f76]) ).

fof(f485,plain,
    ( nil = sk4
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f484,f203]) ).

fof(f487,plain,
    ( neq(nil,nil)
    | spl0_5 ),
    inference(superposition,[],[f247,f485]) ).

fof(f491,plain,
    ( ~ ssList(nil)
    | spl0_5 ),
    inference(resolution,[],[f487,f252]) ).

fof(f493,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f491,f8]) ).

fof(f494,plain,
    spl0_5,
    inference(avatar_contradiction_clause,[],[f493]) ).

fof(f500,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk4)
    | nil = sk4
    | spl0_4 ),
    inference(resolution,[],[f270,f102]) ).

fof(f501,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f500,f8]) ).

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

fof(f504,plain,
    ( nil != sk4
    | spl0_18 ),
    inference(avatar_component_clause,[],[f503]) ).

fof(f505,plain,
    ( nil = sk4
    | ~ spl0_18 ),
    inference(avatar_component_clause,[],[f503]) ).

fof(f515,plain,
    ( nil = sk4
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f501,f203]) ).

fof(f519,plain,
    ( neq(nil,nil)
    | ~ spl0_18 ),
    inference(superposition,[],[f247,f505]) ).

fof(f524,plain,
    ( ~ ssList(nil)
    | ~ spl0_18 ),
    inference(resolution,[],[f519,f252]) ).

fof(f526,plain,
    ( $false
    | ~ spl0_18 ),
    inference(forward_subsumption_resolution,[],[f524,f8]) ).

fof(f527,plain,
    ~ spl0_18,
    inference(avatar_contradiction_clause,[],[f526]) ).

fof(f537,plain,
    ( $false
    | spl0_4
    | spl0_18 ),
    inference(forward_subsumption_resolution,[],[f515,f504]) ).

fof(f538,plain,
    ( spl0_4
    | spl0_18 ),
    inference(avatar_contradiction_clause,[],[f537]) ).

fof(f1073,plain,
    sk3 = app(nil,sk3),
    inference(resolution,[],[f74,f202]) ).

fof(f1359,plain,
    ! [X0] :
      ( segmentP(app(sk3,X0),sk3)
      | ~ ssList(nil)
      | ~ ssList(sk3)
      | ~ ssList(app(sk3,X0))
      | ~ ssList(X0) ),
    inference(superposition,[],[f233,f1073]) ).

fof(f1365,plain,
    ! [X0] :
      ( segmentP(app(sk3,X0),sk3)
      | ~ ssList(sk3)
      | ~ ssList(app(sk3,X0))
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f1359,f8]) ).

fof(f1383,plain,
    ! [X0] :
      ( ~ ssList(app(sk3,X0))
      | segmentP(app(sk3,X0),sk3)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f1365,f202]) ).

fof(f1680,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | tl(cons(skaf83(X1),X0)) = X0 ),
    inference(resolution,[],[f96,f12]) ).

fof(f2280,plain,
    ! [X0,X1] : skaf82(X1) = tl(cons(skaf83(X0),skaf82(X1))),
    inference(resolution,[],[f1680,f13]) ).

fof(f3019,plain,
    ( sk4 = cons(hd(sk4),tl(sk4))
    | nil = sk4 ),
    inference(resolution,[],[f107,f203]) ).

fof(f3020,plain,
    ( sk4 = cons(hd(sk4),tl(sk4))
    | spl0_18 ),
    inference(forward_subsumption_resolution,[],[f3019,f504]) ).

fof(f3251,plain,
    ( sk4 = cons(skaf83(sk4),skaf82(sk4))
    | nil = sk4 ),
    inference(resolution,[],[f112,f203]) ).

fof(f3252,plain,
    ( sk4 = cons(skaf83(sk4),skaf82(sk4))
    | spl0_18 ),
    inference(forward_subsumption_resolution,[],[f3251,f504]) ).

fof(f3259,plain,
    ( tl(sk4) = skaf82(sk4)
    | spl0_18 ),
    inference(superposition,[],[f2280,f3252]) ).

fof(f3287,plain,
    ( ssList(tl(sk4))
    | spl0_18 ),
    inference(superposition,[],[f13,f3259]) ).

fof(f4086,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | cons(hd(sk4),X0) = app(cons(hd(sk4),nil),X0) )
    | ~ spl0_5 ),
    inference(resolution,[],[f126,f273]) ).

fof(f4091,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | cons(hd(sk4),X0) = app(sk3,X0) )
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(forward_demodulation,[],[f4086,f278]) ).

fof(f4134,plain,
    ( cons(hd(sk4),tl(sk4)) = app(sk3,tl(sk4))
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(resolution,[],[f4091,f3287]) ).

fof(f4137,plain,
    ( sk4 = app(sk3,tl(sk4))
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(forward_demodulation,[],[f4134,f3020]) ).

fof(f4145,plain,
    ( ~ ssList(sk4)
    | segmentP(sk4,sk3)
    | ~ ssList(tl(sk4))
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(superposition,[],[f1383,f4137]) ).

fof(f4152,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(tl(sk4))
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(forward_subsumption_resolution,[],[f4145,f203]) ).

fof(f4158,plain,
    ( ~ ssList(tl(sk4))
    | spl0_2
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(forward_subsumption_resolution,[],[f4152,f261]) ).

fof(f4162,plain,
    ( $false
    | spl0_2
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(forward_subsumption_resolution,[],[f4158,f3287]) ).

fof(f4163,plain,
    ( spl0_2
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(avatar_contradiction_clause,[],[f4162]) ).

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

cnf(s2,plain,
    ( ~ spl0_1
    | ~ spl0_4
    | ~ spl0_5
    | spl0_6
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f283]) ).

cnf(s3,plain,
    ( spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f284]) ).

cnf(s4,plain,
    ( spl0_1
    | ~ spl0_4
    | ~ spl0_5
    | spl0_6
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f285]) ).

cnf(s13,plain,
    ( spl0_3
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f469]) ).

cnf(s14,plain,
    spl0_7,
    inference(sat_conversion,[],[f483]) ).

cnf(s15,plain,
    spl0_5,
    inference(sat_conversion,[],[f494]) ).

cnf(s17,plain,
    ~ spl0_18,
    inference(sat_conversion,[],[f527]) ).

cnf(s21,plain,
    ( spl0_4
    | spl0_18 ),
    inference(sat_conversion,[],[f538]) ).

cnf(s34,plain,
    ( spl0_2
    | ~ spl0_5
    | ~ spl0_6
    | spl0_18 ),
    inference(sat_conversion,[],[f4163]) ).

cnf(s35,plain,
    spl0_4,
    inference(rat,[],[s21,s17]) ).

cnf(s43,plain,
    ( spl0_1
    | spl0_6 ),
    inference(rat,[],[s4,s14,s15,s35]) ).

cnf(s44,plain,
    ( ~ spl0_1
    | spl0_6 ),
    inference(rat,[],[s2,s14,s15,s35]) ).

cnf(s45,plain,
    spl0_1,
    inference(rat,[],[s3,s13,s34,s43,s15,s17]) ).

cnf(s46,plain,
    spl0_6,
    inference(rat,[],[s44,s45]) ).

cnf(s47,plain,
    spl0_2,
    inference(rat,[],[s34,s17,s15,s46]) ).

cnf(s48,plain,
    spl0_3,
    inference(rat,[],[s13,s46]) ).

cnf(s50,plain,
    $false,
    inference(rat,[],[s1,s45,s47,s48]) ).

fof(f4164,plain,
    $false,
    inference(avatar_sat_refutation,[],[s50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC382-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.08/0.17  % Computer : n014.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:22:46 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  Running first-order model finding
% 0.08/0.20  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
% 1.09/0.47  % (1655361)Will run a generic schedule for satisfiability detection.
% 1.09/0.47  % (1655372)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2695113623:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.09/0.47  % (1655367)% WARNING: option uhcvi not known.
% 1.09/0.47  % (1655368)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3174863538:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.09/0.47  % (1655366)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3515438553_2999 on theBenchmark for (2999ds/0Mi)
% 1.09/0.47  % (1655369)dis+10_1_sil=32000:sp=arity:random_seed=3668623461:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.09/0.47  % (1655370)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2782825370:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.09/0.47  % (1655371)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3885850812:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.09/0.47  % (1655367)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3583290437:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.09/0.47  % TRYING [1]
% 1.09/0.47  % TRYING [2]
% 1.09/0.47  % TRYING [3]
% 1.09/0.47  % TRYING [4]
% 1.09/0.47  % (1655372)Instruction limit reached! 
% 1.09/0.47  % (1655372)------------------------------
% 1.09/0.47  % (1655372)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655372)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655372)Termination reason: Instruction limit
% 1.09/0.47  % (1655372)Termination phase: Saturation
% 1.09/0.47  % (1655372)Time elapsed: 0.052 s
% 1.09/0.47  % (1655372)Peak memory usage: 14 MB
% 1.09/0.47  % (1655372)Instructions burned: 160 (million)
% 1.09/0.47  % (1655380)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2403967817:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.09/0.47  % (1655369)Instruction limit reached! 
% 1.09/0.47  % (1655369)------------------------------
% 1.09/0.47  % (1655369)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655369)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655369)Termination reason: Instruction limit
% 1.09/0.47  % (1655369)Termination phase: Saturation
% 1.09/0.47  % (1655369)Time elapsed: 0.061 s
% 1.09/0.47  % (1655369)Peak memory usage: 13 MB
% 1.09/0.47  % (1655369)Instructions burned: 104 (million)
% 1.09/0.47  % (1655370)Instruction limit reached! 
% 1.09/0.47  % (1655370)------------------------------
% 1.09/0.47  % (1655370)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655370)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655370)Termination reason: Instruction limit
% 1.09/0.47  % (1655370)Termination phase: Saturation
% 1.09/0.47  % (1655370)Time elapsed: 0.062 s
% 1.09/0.47  % (1655370)Peak memory usage: 13 MB
% 1.09/0.47  % (1655370)Instructions burned: 117 (million)
% 1.09/0.47  % TRYING [1]
% 1.09/0.47  % TRYING [2]
% 1.09/0.47  % TRYING [3]
% 1.09/0.47  % (1655371)Instruction limit reached! 
% 1.09/0.47  % (1655371)------------------------------
% 1.09/0.47  % (1655371)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655371)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655371)Termination reason: Instruction limit
% 1.09/0.47  % (1655371)Termination phase: Saturation
% 1.09/0.47  % (1655371)Time elapsed: 0.068 s
% 1.09/0.47  % (1655371)Peak memory usage: 14 MB
% 1.09/0.47  % (1655371)Instructions burned: 133 (million)
% 1.09/0.47  % TRYING [4]
% 1.09/0.47  % (1655382)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=414795647:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.09/0.47  % (1655383)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=763223389:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.09/0.47  % (1655384)ott-21_1_sil=16000:fs=off:random_seed=1162687389:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.09/0.47  % TRYING [5]
% 1.09/0.47  % TRYING [5]
% 1.09/0.47  % (1655382)Instruction limit reached! 
% 1.09/0.47  % (1655382)------------------------------
% 1.09/0.47  % (1655382)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655382)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655382)Termination reason: Instruction limit
% 1.09/0.47  % (1655382)Termination phase: Saturation
% 1.09/0.47  % (1655382)Time elapsed: 0.065 s
% 1.09/0.47  % (1655382)Peak memory usage: 13 MB
% 1.09/0.47  % (1655382)Instructions burned: 131 (million)
% 1.09/0.47  % (1655388)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1472336545:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.09/0.47  % (1655384)Instruction limit reached! 
% 1.09/0.47  % (1655384)------------------------------
% 1.09/0.47  % (1655384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655384)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655384)Termination reason: Instruction limit
% 1.09/0.47  % (1655384)Termination phase: Saturation
% 1.09/0.47  % (1655384)Time elapsed: 0.092 s
% 1.09/0.47  % (1655384)Peak memory usage: 13 MB
% 1.09/0.47  % (1655384)Instructions burned: 181 (million)
% 1.09/0.47  % (1655390)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2031880543:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.09/0.47  % TRYING [6]
% 1.09/0.47  % (1655380)Instruction limit reached! 
% 1.09/0.47  % (1655380)------------------------------
% 1.09/0.47  % (1655380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655380)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655380)Termination reason: Instruction limit
% 1.09/0.47  % (1655380)Termination phase: Finite model building constraint generation
% 1.09/0.47  % (1655380)Time elapsed: 0.150 s
% 1.09/0.47  % (1655380)Peak memory usage: 36 MB
% 1.09/0.47  % (1655380)Instructions burned: 720 (million)
% 1.09/0.47  % TRYING [1]
% 1.09/0.47  % TRYING [2]
% 1.09/0.47  % (1655383) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1655361-1655383"...
% 1.09/0.47  % (1655383)...printing done.
% 1.09/0.47  % (1655383)Refutation found. Thanks to Tanya!
% 1.09/0.47  % SZS status Unsatisfiable for theBenchmark
% 1.09/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 1.09/0.47  % (1655383)------------------------------
% 1.09/0.47  % (1655383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.09/0.47  % (1655383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.09/0.47  % (1655383)CaDiCaL version: 2.1.3
% 1.09/0.47  % (1655383)Termination reason: Refutation
% 1.09/0.47  % (1655383)Time elapsed: 0.135 s
% 1.09/0.47  % (1655383)Peak memory usage: 15 MB
% 1.09/0.47  % (1655383)Instructions burned: 229 (million)
% 1.09/0.47  % (1655361)Success in time 0.262 s
% 1.09/0.47  % Vampire exiting
%------------------------------------------------------------------------------