↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 0.21s 1.31s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   80 (  16 unt;   7 def)
%            Number of atoms       :  202 (  56 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  247 ( 125   ~; 115   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   8 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/sandbox2/benchmark/theBenchmark.p',clause8) ).

fof(f12,axiom,
    ! [X0] : ssItem(skaf83(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause12) ).

fof(f13,axiom,
    ! [X0] : ssList(skaf82(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).

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

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

fof(f125,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) = cons(X0,X1) ),
    file('/export/starexec/sandbox2/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(f201,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).

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

fof(f207,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | sk3 = app(X1,cons(X0,nil))
      | app(cons(X0,nil),X1) != sk4 ),
    inference(reorient_equations,[],[f206]) ).

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

fof(f210,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/sandbox2/benchmark/theBenchmark.p',co1_10) ).

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

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

fof(f213,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/sandbox2/benchmark/theBenchmark.p',co1_12) ).

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

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

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

fof(f246,definition,
    ( spl0_1
  <=> ! [X0,X1] :
        ( ~ ssItem(X0)
        | sk1 != app(X1,cons(X0,nil))
        | app(cons(X0,nil),X1) != sk2
        | ~ ssList(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f247,plain,
    ( ! [X0,X1] :
        ( sk1 != app(X1,cons(X0,nil))
        | ~ ssItem(X0)
        | app(cons(X0,nil),X1) != sk2
        | ~ ssList(X1) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f246]) ).

fof(f249,definition,
    ( spl0_2
  <=> nil = sk1 ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f251,plain,
    ( nil != sk1
    | spl0_2 ),
    inference(avatar_component_clause,[],[f249]) ).

fof(f252,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f214,f249,f246]) ).

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

fof(f256,plain,
    ( neq(sk2,nil)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f257,plain,
    ( spl0_3
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f212,f249,f254]) ).

fof(f259,definition,
    ( spl0_4
  <=> nil = sk2 ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f260,plain,
    ( nil != sk2
    | spl0_4 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f261,plain,
    ( nil = sk2
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f262,plain,
    ( spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f211,f259,f246]) ).

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

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

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

fof(f271,plain,
    ( nil = sk3
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f269]) ).

fof(f272,plain,
    ( ~ spl0_5
    | spl0_6 ),
    inference(avatar_split_clause,[],[f208,f269,f265]) ).

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

fof(f279,plain,
    ( ssList(nil)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f314,plain,
    spl0_8,
    inference(avatar_split_clause,[],[f8,f278]) ).

fof(f319,plain,
    ( nil != sk2
    | spl0_5 ),
    inference(forward_demodulation,[],[f267,f204]) ).

fof(f322,plain,
    ( ~ spl0_4
    | spl0_5 ),
    inference(avatar_split_clause,[],[f319,f265,f259]) ).

fof(f323,plain,
    ! [X0,X1] :
      ( sk1 = app(X1,cons(X0,nil))
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) != sk4 ),
    inference(forward_demodulation,[],[f207,f205]) ).

fof(f324,plain,
    ! [X0,X1] :
      ( app(cons(X0,nil),X1) != sk2
      | sk1 = app(X1,cons(X0,nil))
      | ~ ssItem(X0)
      | ~ ssList(X1) ),
    inference(forward_demodulation,[],[f323,f204]) ).

fof(f325,plain,
    ( ! [X0,X1] :
        ( app(cons(X0,nil),X1) != sk2
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f324,f247]) ).

fof(f436,plain,
    ( nil = sk1
    | ~ spl0_6 ),
    inference(superposition,[],[f205,f271]) ).

fof(f438,plain,
    ( $false
    | spl0_2
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f436,f251]) ).

fof(f439,plain,
    ( spl0_2
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f438]) ).

fof(f442,plain,
    ( neq(nil,nil)
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(forward_demodulation,[],[f256,f261]) ).

fof(f444,plain,
    ( spl0_2
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f436,f269,f249]) ).

fof(f448,plain,
    ( ~ ssList(nil)
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(resolution,[],[f243,f442]) ).

fof(f450,plain,
    ( $false
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f448,f279]) ).

fof(f451,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(avatar_contradiction_clause,[],[f450]) ).

fof(f508,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sk2
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | ~ ssList(X1)
        | ~ ssItem(X0) )
    | ~ spl0_1 ),
    inference(superposition,[],[f325,f126]) ).

fof(f516,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sk2
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl0_1 ),
    inference(duplicate_literal_removal,[],[f508]) ).

fof(f518,plain,
    ( ! [X0] :
        ( sk2 != X0
        | ~ ssItem(skaf83(X0))
        | ~ ssList(skaf82(X0))
        | ~ ssList(X0)
        | nil = X0 )
    | ~ spl0_1 ),
    inference(superposition,[],[f516,f112]) ).

fof(f519,plain,
    ( ! [X0] :
        ( sk2 != X0
        | ~ ssList(skaf82(X0))
        | ~ ssList(X0)
        | nil = X0 )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f518,f12]) ).

fof(f521,plain,
    ( ! [X0] :
        ( sk2 != X0
        | ~ ssList(X0)
        | nil = X0 )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f519,f13]) ).

fof(f523,plain,
    ( ~ ssList(sk2)
    | nil = sk2
    | ~ spl0_1 ),
    inference(equality_resolution,[],[f521]) ).

fof(f524,plain,
    ( nil = sk2
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f523,f201]) ).

fof(f525,plain,
    ( $false
    | ~ spl0_1
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f524,f260]) ).

fof(f526,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_contradiction_clause,[],[f525]) ).

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

cnf(s2,plain,
    ( ~ spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f257]) ).

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

cnf(s5,plain,
    ( ~ spl0_5
    | spl0_6 ),
    inference(sat_conversion,[],[f272]) ).

cnf(s15,plain,
    spl0_8,
    inference(sat_conversion,[],[f314]) ).

cnf(s18,plain,
    ( ~ spl0_4
    | spl0_5 ),
    inference(sat_conversion,[],[f322]) ).

cnf(s22,plain,
    ( spl0_2
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f439]) ).

cnf(s24,plain,
    ( spl0_2
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f444]) ).

cnf(s26,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f451]) ).

cnf(s30,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(sat_conversion,[],[f526]) ).

cnf(s35,plain,
    spl0_1,
    inference(rat,[],[s5,s24,s18,s1,s3]) ).

cnf(s36,plain,
    spl0_4,
    inference(rat,[],[s30,s35]) ).

cnf(s37,plain,
    ~ spl0_3,
    inference(rat,[],[s26,s15,s36]) ).

cnf(s38,plain,
    spl0_5,
    inference(rat,[],[s18,s36]) ).

cnf(s39,plain,
    ~ spl0_2,
    inference(rat,[],[s2,s37]) ).

cnf(s40,plain,
    spl0_6,
    inference(rat,[],[s5,s38]) ).

cnf(s41,plain,
    $false,
    inference(rat,[],[s22,s40,s39]) ).

fof(f527,plain,
    $false,
    inference(avatar_sat_refutation,[],[s41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC313-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n014.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 09:01:01 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  Running first-order theorem proving
% 0.09/0.23  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.11/1.11  % (1649936)Input is clausal, will run a generic CNF schedule.
% 3.11/1.11  % (1649947)dis-21_1_sil=8000:lcm=predicate:random_seed=87812334: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.11/1.11  % (1649947)Instruction limit reached! 
% 3.11/1.11  % (1649947)------------------------------
% 3.11/1.11  % (1649947)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.11/1.11  % (1649947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.11  % (1649947)CaDiCaL version: 2.1.3
% 3.11/1.11  % (1649947)Termination reason: Instruction limit
% 3.11/1.11  % (1649947)Termination phase: Saturation
% 3.11/1.11  % (1649947)Time elapsed: 0.034 s
% 3.11/1.11  % (1649947)Peak memory usage: 90 MB
% 3.11/1.11  % (1649947)Instructions burned: 118 (million)
% 3.11/1.11  % (1649942)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2637555341:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.11/1.11  % (1649941)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=4017732023:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.11/1.11  % (1649945)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=319925108:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.11/1.11  % (1649943)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2235934121:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.11/1.11  % (1649944)lrs+10_1_sil=8000:sp=occurrence:random_seed=977086716:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.11/1.11  % (1649946)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3620312902:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.11/1.11  % (1649946)First to succeed.
% 3.11/1.11  % (1649946)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1649936"
% 3.11/1.11  % (1649945)Instruction limit reached! 
% 3.11/1.11  % (1649945)------------------------------
% 3.11/1.11  % (1649945)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.11/1.11  % (1649945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.11  % (1649945)CaDiCaL version: 2.1.3
% 3.11/1.11  % (1649945)Termination reason: Instruction limit
% 3.11/1.11  % (1649945)Termination phase: Saturation
% 3.11/1.11  % (1649945)Time elapsed: 0.049 s
% 3.11/1.11  % (1649945)Peak memory usage: 88 MB
% 3.11/1.11  % (1649945)Instructions burned: 116 (million)
% 3.11/1.11  % (1649944)Instruction limit reached! 
% 3.11/1.11  % (1649944)------------------------------
% 3.11/1.11  % (1649944)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.11/1.11  % (1649944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.11  % (1649944)CaDiCaL version: 2.1.3
% 3.11/1.11  % (1649944)Termination reason: Instruction limit
% 3.11/1.11  % (1649944)Termination phase: Saturation
% 3.11/1.11  % (1649944)Time elapsed: 0.060 s
% 3.11/1.11  % (1649944)Peak memory usage: 89 MB
% 3.11/1.11  % (1649944)Instructions burned: 107 (million)
% 3.11/1.11  % (1649949)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=549955774:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.11/1.11  % (1649949)Refutation not found, incomplete strategy
% 3.11/1.11  % (1649949)------------------------------
% 3.11/1.11  % (1649949)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.11/1.11  % (1649949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.11  % (1649949)CaDiCaL version: 2.1.3
% 3.11/1.11  % (1649949)Termination reason: Refutation not found, incomplete strategy
% 3.11/1.11  % (1649949)Time elapsed: 0.001 s
% 3.11/1.11  % (1649949)Peak memory usage: 88 MB
% 3.11/1.11  % (1649949)Instructions burned: 2 (million)
% 3.11/1.11  % (1649956)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2054051968: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)
% 3.11/1.11  % (1649957)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1530042816:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.11/1.11  % (1649957)Refutation not found, incomplete strategy
% 0.21/1.31  % (1649957)------------------------------
% 0.21/1.31  % (1649957)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.21/1.31  % (1649957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/1.31  % (1649957)CaDiCaL version: 2.1.3
% 0.21/1.31  % (1649957)Termination reason: Refutation not found, incomplete strategy
% 0.21/1.31  % (1649957)Time elapsed: 0.002 s
% 0.21/1.31  % (1649957)Peak memory usage: 88 MB
% 0.21/1.31  % (1649957)Instructions burned: 2 (million)
% 0.21/1.31  % (1649949)------------------------------
% 0.21/1.31  % (1649949)------------------------------
% 0.21/1.31  % (1649946)Refutation found. Thanks to Tanya!
% 0.21/1.31  % SZS status Unsatisfiable for theBenchmark
% 0.21/1.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/1.31  % (1649946)------------------------------
% 0.21/1.31  % (1649946)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.21/1.31  % (1649946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/1.31  % (1649946)CaDiCaL version: 2.1.3
% 0.21/1.31  % (1649946)Termination reason: Refutation
% 0.21/1.31  % (1649946)Time elapsed: 0.014 s
% 0.21/1.31  % (1649946)Peak memory usage: 90 MB
% 0.21/1.31  % (1649946)Instructions burned: 18 (million)
% 0.21/1.31  % (1649946)------------------------------
% 0.21/1.31  % (1649946)------------------------------
% 0.21/1.31  % (1649936)Success in time 0.436 s
% 0.21/1.31  % Vampire exiting
%------------------------------------------------------------------------------