↑ 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  : LCL250-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% 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 11:58:12 AM UTC 2026

% Result   : Unsatisfiable 7.28s 1.59s
% Output   : Refutation 7.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   72 (  39 unt;  10 def)
%            Number of atoms       :  109 (  18 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   77 (  40   ~;  36   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  12 con; 0-2 aty)
%            Number of variables   :   59 (   0 sgn  59   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X2),X1))
      | ~ axiom(or(not(X0),X2))
      | theorem(or(not(X0),X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).

fof(f9,negated_conjecture,
    ~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f10,definition,
    sF0 = not(q),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f11,plain,
    not(q) = sF0,
    inference(reorient_equations,[],[f10]) ).

fof(f12,definition,
    sF1 = or(sF0,r),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f13,plain,
    or(sF0,r) = sF1,
    inference(reorient_equations,[],[f12]) ).

fof(f14,definition,
    sF2 = not(sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f15,plain,
    not(sF1) = sF2,
    inference(reorient_equations,[],[f14]) ).

fof(f16,definition,
    sF3 = not(p),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f17,plain,
    not(p) = sF3,
    inference(reorient_equations,[],[f16]) ).

fof(f18,definition,
    sF4 = or(sF3,sF0),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f19,plain,
    or(sF3,sF0) = sF4,
    inference(reorient_equations,[],[f18]) ).

fof(f20,definition,
    sF5 = not(sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f21,plain,
    not(sF4) = sF5,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF6 = not(sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f23,plain,
    not(sF5) = sF6,
    inference(reorient_equations,[],[f22]) ).

fof(f24,definition,
    sF7 = or(sF6,r),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f25,plain,
    or(sF6,r) = sF7,
    inference(reorient_equations,[],[f24]) ).

fof(f26,definition,
    sF8 = or(sF2,sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f27,plain,
    or(sF2,sF7) = sF8,
    inference(reorient_equations,[],[f26]) ).

fof(f28,plain,
    ~ theorem(sF8),
    inference(definition_folding,[],[f9,f27,f25,f23,f21,f19,f11,f17,f15,f13,f11]) ).

fof(f38,plain,
    axiom(or(not(sF0),sF4)),
    inference(superposition,[],[f2,f19]) ).

fof(f40,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f3,f6]) ).

fof(f52,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f7,f1]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f7,f3]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f7,f2]) ).

fof(f106,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f4,f7]) ).

fof(f113,plain,
    ! [X0] : axiom(or(not(or(sF2,or(X0,sF7))),or(X0,sF8))),
    inference(superposition,[],[f4,f27]) ).

fof(f115,plain,
    ! [X0] : axiom(or(not(or(sF6,or(X0,r))),or(X0,sF7))),
    inference(superposition,[],[f4,f25]) ).

fof(f116,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f5,f7]) ).

fof(f136,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),sF4))
      | ~ theorem(or(sF5,X0))
      | theorem(or(not(X1),X0)) ),
    inference(superposition,[],[f8,f21]) ).

fof(f208,plain,
    ! [X2,X0,X1] :
      ( ~ axiom(or(not(X0),or(X1,X2)))
      | theorem(or(not(X0),or(X2,X1))) ),
    inference(resolution,[],[f40,f8]) ).

fof(f244,plain,
    ! [X0] :
      ( ~ theorem(or(sF2,or(X0,sF7)))
      | theorem(or(X0,sF8)) ),
    inference(resolution,[],[f113,f7]) ).

fof(f252,plain,
    ! [X0] :
      ( ~ theorem(or(sF6,or(X0,r)))
      | theorem(or(X0,sF7)) ),
    inference(resolution,[],[f115,f7]) ).

fof(f258,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f106,f54]) ).

fof(f361,plain,
    ! [X2,X3,X0,X1] :
      ( ~ axiom(or(not(X2),or(X3,X0)))
      | ~ theorem(or(not(X0),X1))
      | theorem(or(not(X2),or(X3,X1))) ),
    inference(resolution,[],[f116,f8]) ).

fof(f544,plain,
    ! [X0] :
      ( theorem(or(not(sF0),X0))
      | ~ theorem(or(sF5,X0)) ),
    inference(resolution,[],[f136,f38]) ).

fof(f792,plain,
    ! [X0] :
      ( ~ theorem(or(sF5,X0))
      | theorem(or(X0,not(sF0))) ),
    inference(resolution,[],[f544,f53]) ).

fof(f904,plain,
    ! [X0] :
      ( ~ theorem(or(X0,r))
      | theorem(or(X0,sF7)) ),
    inference(resolution,[],[f252,f54]) ).

fof(f912,plain,
    ! [X0,X1] :
      ( ~ theorem(or(or(X0,X1),X1))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f258,f52]) ).

fof(f1343,definition,
    ( spl9_94
  <=> theorem(or(sF5,sF7)) ),
    introduced(definition,[new_symbols(definition,[spl9_94])],[avatar_definition]) ).

fof(f1344,plain,
    ( theorem(or(sF5,sF7))
    | ~ spl9_94 ),
    inference(avatar_component_clause,[],[f1343]) ).

fof(f1345,plain,
    ( ~ theorem(or(sF5,sF7))
    | spl9_94 ),
    inference(avatar_component_clause,[],[f1343]) ).

fof(f1668,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f208,f2]) ).

fof(f1881,plain,
    ! [X0] : theorem(or(sF6,or(sF5,X0))),
    inference(superposition,[],[f1668,f23]) ).

fof(f1993,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X2)),or(X2,X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f361,f3]) ).

fof(f2318,plain,
    theorem(or(sF5,sF7)),
    inference(resolution,[],[f1881,f252]) ).

fof(f2321,plain,
    ( $false
    | spl9_94 ),
    inference(forward_subsumption_resolution,[],[f2318,f1345]) ).

fof(f2322,plain,
    spl9_94,
    inference(avatar_contradiction_clause,[],[f2321]) ).

fof(f2326,plain,
    ( theorem(or(sF7,not(sF0)))
    | ~ spl9_94 ),
    inference(resolution,[],[f1344,f792]) ).

fof(f2360,plain,
    ( theorem(or(not(sF0),sF7))
    | ~ spl9_94 ),
    inference(resolution,[],[f2326,f53]) ).

fof(f2553,plain,
    ( ~ theorem(or(sF8,sF7))
    | theorem(sF8) ),
    inference(superposition,[],[f912,f27]) ).

fof(f2558,plain,
    ~ theorem(or(sF8,sF7)),
    inference(forward_subsumption_resolution,[],[f2553,f28]) ).

fof(f6945,plain,
    ! [X0] :
      ( theorem(or(not(sF1),or(r,X0)))
      | ~ theorem(or(not(sF0),X0)) ),
    inference(superposition,[],[f1993,f13]) ).

fof(f6954,plain,
    ! [X0] :
      ( ~ theorem(or(not(sF0),X0))
      | theorem(or(sF2,or(r,X0))) ),
    inference(forward_demodulation,[],[f6945,f15]) ).

fof(f25182,plain,
    ( theorem(or(sF2,or(r,sF7)))
    | ~ spl9_94 ),
    inference(resolution,[],[f6954,f2360]) ).

fof(f25425,plain,
    ( theorem(or(r,sF8))
    | ~ spl9_94 ),
    inference(resolution,[],[f25182,f244]) ).

fof(f25444,plain,
    ( theorem(or(sF8,r))
    | ~ spl9_94 ),
    inference(resolution,[],[f25425,f53]) ).

fof(f25452,plain,
    ( theorem(or(sF8,sF7))
    | ~ spl9_94 ),
    inference(resolution,[],[f25444,f904]) ).

fof(f25456,plain,
    ( $false
    | ~ spl9_94 ),
    inference(forward_subsumption_resolution,[],[f25452,f2558]) ).

fof(f25457,plain,
    ~ spl9_94,
    inference(avatar_contradiction_clause,[],[f25456]) ).

cnf(s65,plain,
    spl9_94,
    inference(sat_conversion,[],[f2322]) ).

cnf(s224,plain,
    ~ spl9_94,
    inference(sat_conversion,[],[f25457]) ).

cnf(s227,plain,
    $false,
    inference(rat,[],[s65,s224]) ).

fof(f25458,plain,
    $false,
    inference(avatar_sat_refutation,[],[s227]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL250-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.36  % Computer : n003.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 27 15:32:11 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  Running first-order model finding
% 0.12/0.40  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.28/1.59  % (713685)Will run a generic schedule for satisfiability detection.
% 7.28/1.59  % (713693)dis+10_1_sil=32000:sp=arity:random_seed=1380707901:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.28/1.59  % (713691)% WARNING: option uhcvi not known.
% 7.28/1.59  % (713692)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2382951003:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.28/1.59  % (713690)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3633949253_2999 on theBenchmark for (2999ds/0Mi)
% 7.28/1.59  % (713695)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2302817577:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.28/1.59  % (713691)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4064733875:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.28/1.59  % (713696)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2243762597:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.28/1.59  % TRYING [1]
% 7.28/1.59  % TRYING [2]
% 7.28/1.59  % (713694)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3345152361:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.28/1.59  % TRYING [3]
% 7.28/1.59  % (713693)Instruction limit reached! 
% 7.28/1.59  % (713693)------------------------------
% 7.28/1.59  % (713693)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713693)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713693)Termination reason: Instruction limit
% 7.28/1.59  % (713693)Termination phase: Saturation
% 7.28/1.59  % (713693)Time elapsed: 0.055 s
% 7.28/1.59  % (713693)Peak memory usage: 11 MB
% 7.28/1.59  % (713693)Instructions burned: 103 (million)
% 7.28/1.59  % (713704)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2828177865:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 7.28/1.59  % TRYING [4]
% 7.28/1.59  % TRYING [1]
% 7.28/1.59  % TRYING [2]
% 7.28/1.59  % TRYING [3]
% 7.28/1.59  % (713694)Instruction limit reached! 
% 7.28/1.59  % (713694)------------------------------
% 7.28/1.59  % (713694)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713694)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713694)Termination reason: Instruction limit
% 7.28/1.59  % (713694)Termination phase: Saturation
% 7.28/1.59  % (713694)Time elapsed: 0.099 s
% 7.28/1.59  % (713694)Peak memory usage: 11 MB
% 7.28/1.59  % (713694)Instructions burned: 117 (million)
% 7.28/1.59  % TRYING [4]
% 7.28/1.59  % (713706)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=456488998:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 7.28/1.59  % (713695)Instruction limit reached! 
% 7.28/1.59  % (713695)------------------------------
% 7.28/1.59  % (713695)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713695)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713695)Termination reason: Instruction limit
% 7.28/1.59  % (713695)Termination phase: Saturation
% 7.28/1.59  % (713695)Time elapsed: 0.157 s
% 7.28/1.59  % (713695)Peak memory usage: 12 MB
% 7.28/1.59  % (713695)Instructions burned: 131 (million)
% 7.28/1.59  % (713696)Instruction limit reached! 
% 7.28/1.59  % (713696)------------------------------
% 7.28/1.59  % (713696)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713696)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713696)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713696)Termination reason: Instruction limit
% 7.28/1.59  % (713696)Termination phase: Saturation
% 7.28/1.59  % (713696)Time elapsed: 0.176 s
% 7.28/1.59  % (713696)Peak memory usage: 13 MB
% 7.28/1.59  % (713696)Instructions burned: 159 (million)
% 7.28/1.59  % (713708)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=241048829:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2997 on theBenchmark for (2997ds/684Mi)
% 7.28/1.59  % (713709)ott-21_1_sil=16000:fs=off:random_seed=2138728421:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 7.28/1.59  % (713706)Instruction limit reached! 
% 7.28/1.59  % (713706)------------------------------
% 7.28/1.59  % (713706)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713706)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713706)Termination reason: Instruction limit
% 7.28/1.59  % (713706)Termination phase: Saturation
% 7.28/1.59  % (713706)Time elapsed: 0.154 s
% 7.28/1.59  % (713706)Peak memory usage: 12 MB
% 7.28/1.59  % (713706)Instructions burned: 132 (million)
% 7.28/1.59  % (713712)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1009022415:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 7.28/1.59  % (713709)Instruction limit reached! 
% 7.28/1.59  % (713709)------------------------------
% 7.28/1.59  % (713709)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713709)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713709)Termination reason: Instruction limit
% 7.28/1.59  % (713709)Termination phase: Saturation
% 7.28/1.59  % (713709)Time elapsed: 0.163 s
% 7.28/1.59  % (713709)Peak memory usage: 11 MB
% 7.28/1.59  % (713709)Instructions burned: 180 (million)
% 7.28/1.59  % (713704)Instruction limit reached! 
% 7.28/1.59  % (713704)------------------------------
% 7.28/1.59  % (713704)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713704)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713704)Termination reason: Instruction limit
% 7.28/1.59  % (713704)Termination phase: Finite model building SAT solving
% 7.28/1.59  % (713704)Time elapsed: 0.336 s
% 7.28/1.59  % (713704)Peak memory usage: 13 MB
% 7.28/1.59  % (713704)Instructions burned: 715 (million)
% 7.28/1.59  % (713714)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2138326408:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 7.28/1.59  % TRYING [1]
% 7.28/1.59  % TRYING [2]
% 7.28/1.59  % (713715)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=347283719:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 7.28/1.59  % TRYING [3]
% 7.28/1.59  % TRYING [4]
% 7.28/1.59  % (713712)Instruction limit reached! 
% 7.28/1.59  % (713712)------------------------------
% 7.28/1.59  % (713712)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713712)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713712)Termination reason: Instruction limit
% 7.28/1.59  % (713712)Termination phase: Saturation
% 7.28/1.59  % (713712)Time elapsed: 0.481 s
% 7.28/1.59  % (713712)Peak memory usage: 14 MB
% 7.28/1.59  % (713712)Instructions burned: 478 (million)
% 7.28/1.59  % (713708)Instruction limit reached! 
% 7.28/1.59  % (713708)------------------------------
% 7.28/1.59  % (713708)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713708)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713708)Termination reason: Instruction limit
% 7.28/1.59  % (713708)Termination phase: Saturation
% 7.28/1.59  % (713708)Time elapsed: 0.665 s
% 7.28/1.59  % (713708)Peak memory usage: 17 MB
% 7.28/1.59  % (713708)Instructions burned: 684 (million)
% 7.28/1.59  % TRYING [5]
% 7.28/1.59  % (713718)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2653667732:i=889:ins=1_2990 on theBenchmark for (2990ds/889Mi)
% 7.28/1.59  % (713719)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=4003049509:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2990 on theBenchmark for (2990ds/692Mi)
% 7.28/1.59  % TRYING [14]
% 7.28/1.59  % (713715) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-713685-713715"...
% 7.28/1.59  % (713715)...printing done.
% 7.28/1.59  % (713715)Refutation found. Thanks to Tanya!
% 7.28/1.59  % SZS status Unsatisfiable for theBenchmark
% 7.28/1.59  % SZS output start Proof for theBenchmark
% See solution above
% 7.28/1.59  % (713715)------------------------------
% 7.28/1.59  % (713715)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.28/1.59  % (713715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.28/1.59  % (713715)CaDiCaL version: 2.1.3
% 7.28/1.59  % (713715)Termination reason: Refutation
% 7.28/1.59  % (713715)Time elapsed: 0.676 s
% 7.28/1.59  % (713715)Peak memory usage: 27 MB
% 7.28/1.59  % (713715)Instructions burned: 1184 (million)
% 7.28/1.59  % (713685)Success in time 1.174 s
% 7.28/1.59  % Vampire exiting
%------------------------------------------------------------------------------