↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC354-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 : n026.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:36 PM UTC 2026

% Result   : Unsatisfiable 2.12s 1.14s
% Output   : Refutation 3.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   29
% Syntax   : Number of formulae    :  123 (  21 unt;  11 def)
%            Number of atoms       :  342 (  42 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  409 ( 190   ~; 208   |;   0   &)
%                                         (  11 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   17 (  15 usr;  12 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn  40   !;   0   ?)

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

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

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(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/sandbox/benchmark/theBenchmark.p',clause173) ).

fof(f200,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).

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,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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/sandbox/benchmark/theBenchmark.p',co1_11) ).

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

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

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

fof(f238,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(f239,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | sk3 = cons(hd(sk4),nil)
    | ~ ssItem(hd(sk4))
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f238]) ).

fof(f240,plain,
    neq(sk2,nil),
    inference(duplicate_literal_removal,[],[f206]) ).

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

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

fof(f249,plain,
    ( neq(sk4,nil)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f248]) ).

fof(f252,definition,
    ( spl0_2
  <=> segmentP(sk2,sk1) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f254,plain,
    ( ~ segmentP(sk2,sk1)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f252]) ).

fof(f255,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f211,f252,f248]) ).

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

fof(f258,plain,
    ( neq(nil,sk4)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f259,plain,
    ( ~ neq(nil,sk4)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f257]) ).

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

fof(f262,plain,
    ( ssItem(hd(sk4))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f263,plain,
    ( ~ ssItem(hd(sk4))
    | spl0_4 ),
    inference(avatar_component_clause,[],[f261]) ).

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

fof(f267,plain,
    ( sk3 = cons(hd(sk4),nil)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f265]) ).

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

fof(f271,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | spl0_6 ),
    inference(avatar_component_clause,[],[f269]) ).

fof(f272,plain,
    ( ~ spl0_1
    | ~ spl0_3
    | ~ spl0_4
    | spl0_5
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f239,f269,f265,f261,f257,f248]) ).

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

fof(f276,plain,
    ( neq(sk2,nil)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f274]) ).

fof(f280,plain,
    spl0_7,
    inference(avatar_split_clause,[],[f240,f274]) ).

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

fof(f287,plain,
    ( ssList(nil)
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f286]) ).

fof(f322,plain,
    spl0_9,
    inference(avatar_split_clause,[],[f8,f286]) ).

fof(f325,plain,
    ( neq(sk4,nil)
    | ~ spl0_7 ),
    inference(forward_demodulation,[],[f276,f204]) ).

fof(f328,plain,
    ( ~ segmentP(sk4,sk1)
    | spl0_2 ),
    inference(forward_demodulation,[],[f254,f204]) ).

fof(f329,plain,
    ( spl0_1
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f325,f274,f248]) ).

fof(f357,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk4)
    | nil = sk4
    | spl0_3 ),
    inference(resolution,[],[f102,f259]) ).

fof(f360,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_3
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f357,f287]) ).

fof(f361,plain,
    ( nil = sk4
    | spl0_3
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f360,f203]) ).

fof(f363,plain,
    ( ~ neq(nil,nil)
    | spl0_3
    | ~ spl0_9 ),
    inference(superposition,[],[f259,f361]) ).

fof(f364,plain,
    ( neq(nil,nil)
    | ~ spl0_1
    | spl0_3
    | ~ spl0_9 ),
    inference(superposition,[],[f249,f361]) ).

fof(f372,plain,
    ( $false
    | ~ spl0_1
    | spl0_3
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f364,f363]) ).

fof(f373,plain,
    ( ~ spl0_1
    | spl0_3
    | ~ spl0_9 ),
    inference(avatar_contradiction_clause,[],[f372]) ).

fof(f381,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_4 ),
    inference(resolution,[],[f76,f263]) ).

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

fof(f385,plain,
    ( neq(nil,nil)
    | ~ spl0_3
    | spl0_4 ),
    inference(superposition,[],[f258,f383]) ).

fof(f390,plain,
    ( ~ ssList(nil)
    | ~ spl0_3
    | spl0_4 ),
    inference(resolution,[],[f385,f245]) ).

fof(f391,plain,
    ( $false
    | ~ spl0_3
    | spl0_4
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f390,f287]) ).

fof(f392,plain,
    ( ~ spl0_3
    | spl0_4
    | ~ spl0_9 ),
    inference(avatar_contradiction_clause,[],[f391]) ).

fof(f394,plain,
    ( ~ ssList(nil)
    | ~ ssItem(hd(sk4))
    | spl0_6 ),
    inference(resolution,[],[f271,f86]) ).

fof(f395,plain,
    ( ~ ssItem(hd(sk4))
    | spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f394,f287]) ).

fof(f396,plain,
    ( $false
    | ~ spl0_4
    | spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f395,f262]) ).

fof(f397,plain,
    ( ~ spl0_4
    | spl0_6
    | ~ spl0_9 ),
    inference(avatar_contradiction_clause,[],[f396]) ).

fof(f398,plain,
    ( sk1 = cons(hd(sk4),nil)
    | ~ spl0_5 ),
    inference(forward_demodulation,[],[f267,f205]) ).

fof(f486,plain,
    ( ! [X0] :
        ( cons(hd(sk4),X0) = app(sk1,X0)
        | ~ ssList(X0)
        | ~ ssItem(hd(sk4)) )
    | ~ spl0_5 ),
    inference(superposition,[],[f126,f398]) ).

fof(f491,plain,
    ( ! [X0] :
        ( cons(hd(sk4),X0) = app(sk1,X0)
        | ~ ssList(X0) )
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f486,f262]) ).

fof(f538,plain,
    ( sk4 = app(sk1,tl(sk4))
    | ~ ssList(tl(sk4))
    | ~ ssList(sk4)
    | nil = sk4
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(superposition,[],[f491,f107]) ).

fof(f581,plain,
    ( sk4 = app(sk1,tl(sk4))
    | ~ ssList(sk4)
    | nil = sk4
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f538,f75]) ).

fof(f593,plain,
    ( sk4 = app(sk1,tl(sk4))
    | nil = sk4
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f581,f203]) ).

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

fof(f605,plain,
    ( nil != sk4
    | spl0_23 ),
    inference(avatar_component_clause,[],[f604]) ).

fof(f606,plain,
    ( nil = sk4
    | ~ spl0_23 ),
    inference(avatar_component_clause,[],[f604]) ).

fof(f608,definition,
    ( spl0_24
  <=> sk4 = app(sk1,tl(sk4)) ),
    introduced(definition,[new_symbols(definition,[spl0_24])],[avatar_definition]) ).

fof(f610,plain,
    ( sk4 = app(sk1,tl(sk4))
    | ~ spl0_24 ),
    inference(avatar_component_clause,[],[f608]) ).

fof(f612,plain,
    ( spl0_23
    | spl0_24
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f593,f265,f261,f608,f604]) ).

fof(f619,plain,
    ( neq(nil,nil)
    | ~ spl0_1
    | ~ spl0_23 ),
    inference(superposition,[],[f249,f606]) ).

fof(f635,plain,
    ( ~ ssList(nil)
    | ~ spl0_1
    | ~ spl0_23 ),
    inference(resolution,[],[f619,f245]) ).

fof(f636,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_9
    | ~ spl0_23 ),
    inference(forward_subsumption_resolution,[],[f635,f287]) ).

fof(f637,plain,
    ( ~ spl0_1
    | ~ spl0_9
    | ~ spl0_23 ),
    inference(avatar_contradiction_clause,[],[f636]) ).

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

fof(f821,plain,
    ( ssList(tl(sk4))
    | ~ spl0_25 ),
    inference(avatar_component_clause,[],[f820]) ).

fof(f822,plain,
    ( ~ ssList(tl(sk4))
    | spl0_25 ),
    inference(avatar_component_clause,[],[f820]) ).

fof(f828,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | segmentP(app(X0,X1),X0)
      | ~ ssList(X0) ),
    inference(superposition,[],[f226,f74]) ).

fof(f839,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | segmentP(app(X0,X1),X0) ),
    inference(duplicate_literal_removal,[],[f828]) ).

fof(f842,plain,
    ( ! [X0,X1] :
        ( ~ ssList(app(X0,X1))
        | ~ ssList(X0)
        | ~ ssList(X1)
        | segmentP(app(X0,X1),X0) )
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f839,f287]) ).

fof(f847,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_25 ),
    inference(resolution,[],[f822,f75]) ).

fof(f848,plain,
    ( nil = sk4
    | spl0_25 ),
    inference(forward_subsumption_resolution,[],[f847,f203]) ).

fof(f849,plain,
    ( $false
    | spl0_23
    | spl0_25 ),
    inference(forward_subsumption_resolution,[],[f848,f605]) ).

fof(f850,plain,
    ( spl0_23
    | spl0_25 ),
    inference(avatar_contradiction_clause,[],[f849]) ).

fof(f2489,plain,
    ( ! [X0,X1] :
        ( segmentP(app(X0,X1),X0)
        | ~ ssList(X1)
        | ~ ssList(X0) )
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f842,f85]) ).

fof(f2508,plain,
    ( segmentP(sk4,sk1)
    | ~ ssList(tl(sk4))
    | ~ ssList(sk1)
    | ~ spl0_9
    | ~ spl0_24 ),
    inference(superposition,[],[f2489,f610]) ).

fof(f2517,plain,
    ( ~ ssList(tl(sk4))
    | ~ ssList(sk1)
    | spl0_2
    | ~ spl0_9
    | ~ spl0_24 ),
    inference(forward_subsumption_resolution,[],[f2508,f328]) ).

fof(f2525,plain,
    ( ~ ssList(sk1)
    | spl0_2
    | ~ spl0_9
    | ~ spl0_24
    | ~ spl0_25 ),
    inference(forward_subsumption_resolution,[],[f2517,f821]) ).

fof(f2532,plain,
    ( $false
    | spl0_2
    | ~ spl0_9
    | ~ spl0_24
    | ~ spl0_25 ),
    inference(forward_subsumption_resolution,[],[f2525,f200]) ).

fof(f2533,plain,
    ( spl0_2
    | ~ spl0_9
    | ~ spl0_24
    | ~ spl0_25 ),
    inference(avatar_contradiction_clause,[],[f2532]) ).

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

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

cnf(s6,plain,
    spl0_7,
    inference(sat_conversion,[],[f280]) ).

cnf(s16,plain,
    spl0_9,
    inference(sat_conversion,[],[f322]) ).

cnf(s18,plain,
    ( spl0_1
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f329]) ).

cnf(s20,plain,
    ( ~ spl0_1
    | spl0_3
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f373]) ).

cnf(s21,plain,
    ( ~ spl0_3
    | spl0_4
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f392]) ).

cnf(s22,plain,
    ( ~ spl0_4
    | spl0_6
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f397]) ).

cnf(s28,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_23
    | spl0_24 ),
    inference(sat_conversion,[],[f612]) ).

cnf(s29,plain,
    ( ~ spl0_1
    | ~ spl0_9
    | ~ spl0_23 ),
    inference(sat_conversion,[],[f637]) ).

cnf(s33,plain,
    ( spl0_23
    | spl0_25 ),
    inference(sat_conversion,[],[f850]) ).

cnf(s100,plain,
    ( spl0_2
    | ~ spl0_9
    | ~ spl0_24
    | ~ spl0_25 ),
    inference(sat_conversion,[],[f2533]) ).

cnf(s109,plain,
    spl0_1,
    inference(rat,[],[s18,s6]) ).

cnf(s110,plain,
    ~ spl0_23,
    inference(rat,[],[s29,s16,s109]) ).

cnf(s111,plain,
    spl0_3,
    inference(rat,[],[s20,s16,s109]) ).

cnf(s113,plain,
    spl0_25,
    inference(rat,[],[s33,s110]) ).

cnf(s114,plain,
    spl0_4,
    inference(rat,[],[s21,s16,s111]) ).

cnf(s117,plain,
    spl0_6,
    inference(rat,[],[s22,s16,s114]) ).

cnf(s120,plain,
    spl0_5,
    inference(rat,[],[s2,s117,s114,s111,s109]) ).

cnf(s128,plain,
    spl0_24,
    inference(rat,[],[s28,s114,s110,s120]) ).

cnf(s138,plain,
    spl0_2,
    inference(rat,[],[s100,s113,s16,s128]) ).

cnf(s142,plain,
    $false,
    inference(rat,[],[s1,s138,s109]) ).

fof(f2534,plain,
    $false,
    inference(avatar_sat_refutation,[],[s142]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC354-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n026.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 09:17:27 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running first-order theorem proving
% 0.08/0.23  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.12/1.14  % (3714590)Input is clausal, will run a generic CNF schedule.
% 2.12/1.14  % (3714601)dis-21_1_sil=8000:lcm=predicate:random_seed=665133122: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.12/1.14  % (3714598)lrs+10_1_sil=8000:sp=occurrence:random_seed=4036932257:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.12/1.14  % (3714595)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=2337692685:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.12/1.14  % (3714597)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2524624825:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.12/1.14  % (3714596)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3575000380:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.12/1.14  % (3714601)Instruction limit reached! 
% 2.12/1.14  % (3714601)------------------------------
% 2.12/1.14  % (3714601)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.14  % (3714601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.14  % (3714601)CaDiCaL version: 2.1.3
% 2.12/1.14  % (3714601)Termination reason: Instruction limit
% 2.12/1.14  % (3714601)Termination phase: Saturation
% 2.12/1.14  % (3714601)Time elapsed: 0.028 s
% 2.12/1.14  % (3714601)Peak memory usage: 89 MB
% 2.12/1.14  % (3714601)Instructions burned: 120 (million)
% 2.12/1.14  % (3714600)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3618627678:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.12/1.14  % (3714599)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3276142036:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.12/1.14  % (3714598)Instruction limit reached! 
% 2.12/1.14  % (3714598)------------------------------
% 2.12/1.14  % (3714598)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.14  % (3714598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.14  % (3714598)CaDiCaL version: 2.1.3
% 2.12/1.14  % (3714598)Termination reason: Instruction limit
% 2.12/1.14  % (3714598)Termination phase: Saturation
% 2.12/1.14  % (3714598)Time elapsed: 0.068 s
% 2.12/1.14  % (3714598)Peak memory usage: 89 MB
% 2.12/1.14  % (3714598)Instructions burned: 107 (million)
% 2.12/1.14  % (3714600)First to succeed.
% 2.12/1.14  % (3714600)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3714590"
% 2.12/1.14  % (3714599)Instruction limit reached! 
% 2.12/1.14  % (3714599)------------------------------
% 2.12/1.14  % (3714599)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.14  % (3714599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.14  % (3714599)CaDiCaL version: 2.1.3
% 2.12/1.14  % (3714599)Termination reason: Instruction limit
% 2.12/1.14  % (3714599)Termination phase: Saturation
% 2.12/1.14  % (3714599)Time elapsed: 0.066 s
% 2.12/1.14  % (3714599)Peak memory usage: 89 MB
% 2.12/1.14  % (3714599)Instructions burned: 115 (million)
% 2.12/1.14  % (3714607)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=858278364:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.12/1.14  % (3714607)Also succeeded, but the first one will report.
% 2.12/1.14  % (3714610)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=4219888434:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 2.12/1.14  % (3714611)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2031956178:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 2.12/1.14  % (3714611)Also succeeded, but the first one will report.
% 2.12/1.14  % (3714610)Instruction limit reached! 
% 2.12/1.14  % (3714610)------------------------------
% 2.12/1.14  % (3714610)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.14  % (3714610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.14  % (3714610)CaDiCaL version: 2.1.3
% 2.12/1.14  % (3714610)Termination reason: Instruction limit
% 2.12/1.14  % (3714610)Termination phase: Saturation
% 2.12/1.14  % (3714610)Time elapsed: 0.100 s
% 2.12/1.14  % (3714610)Peak memory usage: 91 MB
% 2.12/1.14  % (3714610)Instructions burned: 190 (million)
% 2.12/1.14  % (3714600)Refutation found. Thanks to Tanya!
% 2.12/1.14  % SZS status Unsatisfiable for theBenchmark
% 2.12/1.14  % SZS output start Proof for theBenchmark
% See solution above
% 3.85/1.23  % (3714600)------------------------------
% 3.85/1.23  % (3714600)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.23  % (3714600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.23  % (3714600)CaDiCaL version: 2.1.3
% 3.85/1.23  % (3714600)Termination reason: Refutation
% 3.85/1.23  % (3714600)Time elapsed: 0.059 s
% 3.85/1.23  % (3714600)Peak memory usage: 90 MB
% 3.85/1.23  % (3714600)Instructions burned: 80 (million)
% 3.85/1.23  % (3714600)------------------------------
% 3.85/1.23  % (3714600)------------------------------
% 3.85/1.23  % (3714590)Success in time 0.471 s
% 3.85/1.23  % Vampire exiting
%------------------------------------------------------------------------------