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

% Computer : n006.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:57:55 AM UTC 2026

% Result   : Unsatisfiable 5.16s 1.33s
% Output   : Refutation 5.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   98 (  62 unt;   8 def)
%            Number of atoms       :  138 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   88 (  48   ~;  38   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   9 con; 0-2 aty)
%            Number of variables   :   86 (   0 sgn  86   !;   0   ?)

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

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

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

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

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

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

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

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

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

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f13,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f16,plain,
    ~ theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))),
    inference(definition_unfolding,[],[f9,f6]) ).

fof(f17,definition,
    sF0 = or(p,q),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f18,plain,
    or(p,q) = sF0,
    inference(reorient_equations,[],[f17]) ).

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

fof(f20,plain,
    or(sF0,r) = sF1,
    inference(reorient_equations,[],[f19]) ).

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

fof(f22,plain,
    not(sF1) = sF2,
    inference(reorient_equations,[],[f21]) ).

fof(f23,definition,
    sF3 = or(q,r),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f24,plain,
    or(q,r) = sF3,
    inference(reorient_equations,[],[f23]) ).

fof(f25,definition,
    sF4 = or(p,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f26,plain,
    or(p,sF3) = sF4,
    inference(reorient_equations,[],[f25]) ).

fof(f27,definition,
    sF5 = or(sF2,sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f28,plain,
    or(sF2,sF4) = sF5,
    inference(reorient_equations,[],[f27]) ).

fof(f29,plain,
    ~ theorem(sF5),
    inference(definition_folding,[],[f16,f28,f26,f24,f22,f20,f18]) ).

fof(f30,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f10,f7]) ).

fof(f31,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f11,f7]) ).

fof(f35,plain,
    axiom(or(not(r),sF3)),
    inference(superposition,[],[f11,f24]) ).

fof(f39,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f12,f7]) ).

fof(f44,plain,
    axiom(or(not(sF5),or(sF4,sF2))),
    inference(superposition,[],[f12,f28]) ).

fof(f47,plain,
    axiom(or(not(or(r,q)),sF3)),
    inference(superposition,[],[f12,f24]) ).

fof(f49,plain,
    axiom(or(not(or(sF4,sF2)),sF5)),
    inference(superposition,[],[f12,f28]) ).

fof(f61,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f13,f7]) ).

fof(f68,plain,
    ! [X0] : axiom(or(not(or(p,or(X0,sF3))),or(X0,sF4))),
    inference(superposition,[],[f13,f26]) ).

fof(f71,plain,
    ! [X0] : axiom(or(not(or(sF2,or(X0,sF4))),or(X0,sF5))),
    inference(superposition,[],[f13,f28]) ).

fof(f72,plain,
    theorem(or(not(r),sF3)),
    inference(resolution,[],[f35,f7]) ).

fof(f73,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f14,f7]) ).

fof(f75,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
    inference(superposition,[],[f14,f18]) ).

fof(f78,plain,
    ! [X0] : axiom(or(not(or(not(r),X0)),or(not(sF1),or(sF0,X0)))),
    inference(superposition,[],[f14,f20]) ).

fof(f85,plain,
    ! [X0] : axiom(or(not(or(not(r),X0)),or(sF2,or(sF0,X0)))),
    inference(forward_demodulation,[],[f78,f22]) ).

fof(f111,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f31,f15]) ).

fof(f127,plain,
    theorem(or(not(sF5),or(sF4,sF2))),
    inference(resolution,[],[f44,f7]) ).

fof(f130,plain,
    theorem(or(not(or(r,q)),sF3)),
    inference(resolution,[],[f47,f7]) ).

fof(f139,plain,
    theorem(or(not(or(sF4,sF2)),sF5)),
    inference(resolution,[],[f49,f7]) ).

fof(f146,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f39,f15]) ).

fof(f181,plain,
    ! [X0] : theorem(or(not(or(p,or(X0,sF3))),or(X0,sF4))),
    inference(resolution,[],[f68,f7]) ).

fof(f196,plain,
    ! [X0] : theorem(or(not(or(sF2,or(X0,sF4))),or(X0,sF5))),
    inference(resolution,[],[f71,f7]) ).

fof(f199,plain,
    ! [X0] : theorem(or(not(or(not(r),X0)),or(sF2,or(sF0,X0)))),
    inference(resolution,[],[f85,f7]) ).

fof(f203,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f61,f15]) ).

fof(f217,plain,
    axiom(or(not(or(not(q),sF3)),or(not(sF0),sF4))),
    inference(superposition,[],[f75,f26]) ).

fof(f218,plain,
    ( theorem(sF5)
    | ~ theorem(or(sF4,sF2)) ),
    inference(resolution,[],[f139,f15]) ).

fof(f219,plain,
    ~ theorem(or(sF4,sF2)),
    inference(forward_subsumption_resolution,[],[f218,f29]) ).

fof(f286,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f73,f15]) ).

fof(f423,plain,
    ! [X0] :
      ( ~ theorem(or(p,or(X0,sF3)))
      | theorem(or(X0,sF4)) ),
    inference(resolution,[],[f181,f15]) ).

fof(f451,plain,
    ! [X0] :
      ( ~ theorem(or(sF2,or(X0,sF4)))
      | theorem(or(X0,sF5)) ),
    inference(resolution,[],[f196,f15]) ).

fof(f461,plain,
    theorem(or(not(or(not(q),sF3)),or(not(sF0),sF4))),
    inference(resolution,[],[f217,f7]) ).

fof(f477,plain,
    ! [X0] :
      ( ~ theorem(or(not(r),X0))
      | theorem(or(sF2,or(sF0,X0))) ),
    inference(resolution,[],[f199,f15]) ).

fof(f483,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f203,f111]) ).

fof(f492,plain,
    ! [X0,X1] : theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))),
    inference(resolution,[],[f203,f30]) ).

fof(f634,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f286,f15]) ).

fof(f635,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X2,or(not(or(X2,X0)),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f286,f203]) ).

fof(f737,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF3))
      | theorem(or(X0,sF4)) ),
    inference(resolution,[],[f423,f111]) ).

fof(f772,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF4))
      | theorem(or(X0,sF5)) ),
    inference(resolution,[],[f451,f111]) ).

fof(f826,plain,
    theorem(or(not(r),sF4)),
    inference(resolution,[],[f737,f72]) ).

fof(f866,plain,
    ( theorem(or(not(sF0),sF4))
    | ~ theorem(or(not(q),sF3)) ),
    inference(resolution,[],[f461,f15]) ).

fof(f870,definition,
    ( spl6_15
  <=> theorem(or(not(q),sF3)) ),
    introduced(definition,[new_symbols(definition,[spl6_15])],[avatar_definition]) ).

fof(f872,plain,
    ( ~ theorem(or(not(q),sF3))
    | spl6_15 ),
    inference(avatar_component_clause,[],[f870]) ).

fof(f874,definition,
    ( spl6_16
  <=> theorem(or(not(sF0),sF4)) ),
    introduced(definition,[new_symbols(definition,[spl6_16])],[avatar_definition]) ).

fof(f876,plain,
    ( theorem(or(not(sF0),sF4))
    | ~ spl6_16 ),
    inference(avatar_component_clause,[],[f874]) ).

fof(f877,plain,
    ( ~ spl6_15
    | spl6_16 ),
    inference(avatar_split_clause,[],[f866,f874,f870]) ).

fof(f907,plain,
    theorem(or(sF2,or(sF0,sF4))),
    inference(resolution,[],[f477,f826]) ).

fof(f949,plain,
    theorem(or(sF0,sF5)),
    inference(resolution,[],[f907,f451]) ).

fof(f957,plain,
    theorem(or(sF5,sF0)),
    inference(resolution,[],[f949,f146]) ).

fof(f1193,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(or(not(X0),X1),or(not(X0),X1))),X1))
      | ~ theorem(X0) ),
    inference(resolution,[],[f492,f15]) ).

fof(f1399,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(r,q)))
      | theorem(or(X0,sF3)) ),
    inference(resolution,[],[f634,f130]) ).

fof(f1440,plain,
    ! [X0] :
      ( theorem(or(X0,or(sF4,sF2)))
      | ~ theorem(or(X0,sF5)) ),
    inference(resolution,[],[f634,f127]) ).

fof(f1481,plain,
    ! [X2,X0,X1] :
      ( theorem(or(or(not(or(X2,X0)),X1),X2))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f635,f146]) ).

fof(f2424,plain,
    theorem(or(not(q),sF3)),
    inference(resolution,[],[f1399,f31]) ).

fof(f2434,plain,
    ( $false
    | spl6_15 ),
    inference(forward_subsumption_resolution,[],[f2424,f872]) ).

fof(f2435,plain,
    spl6_15,
    inference(avatar_contradiction_clause,[],[f2434]) ).

fof(f2464,plain,
    ( theorem(or(not(sF0),sF5))
    | ~ spl6_16 ),
    inference(resolution,[],[f876,f772]) ).

fof(f2624,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF5))
      | theorem(or(sF4,sF2))
      | ~ theorem(X0) ),
    inference(resolution,[],[f1440,f15]) ).

fof(f2635,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF5))
      | ~ theorem(X0) ),
    inference(forward_subsumption_resolution,[],[f2624,f219]) ).

fof(f8185,plain,
    ! [X0] :
      ( ~ theorem(or(or(not(X0),sF5),or(not(X0),sF5)))
      | ~ theorem(X0) ),
    inference(resolution,[],[f1193,f2635]) ).

fof(f8357,plain,
    ! [X0] :
      ( ~ theorem(or(or(not(X0),sF5),sF5))
      | ~ theorem(X0) ),
    inference(resolution,[],[f8185,f483]) ).

fof(f8372,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF5))
      | ~ theorem(or(sF5,X0)) ),
    inference(resolution,[],[f8357,f1481]) ).

fof(f8808,plain,
    ( ~ theorem(or(sF5,sF0))
    | ~ spl6_16 ),
    inference(resolution,[],[f8372,f2464]) ).

fof(f8815,plain,
    ( $false
    | ~ spl6_16 ),
    inference(forward_subsumption_resolution,[],[f8808,f957]) ).

fof(f8816,plain,
    ~ spl6_16,
    inference(avatar_contradiction_clause,[],[f8815]) ).

cnf(s28,plain,
    ( ~ spl6_15
    | spl6_16 ),
    inference(sat_conversion,[],[f877]) ).

cnf(s35,plain,
    spl6_15,
    inference(sat_conversion,[],[f2435]) ).

cnf(s645,plain,
    ~ spl6_16,
    inference(sat_conversion,[],[f8816]) ).

cnf(s710,plain,
    $false,
    inference(rat,[],[s28,s645,s35]) ).

fof(f8817,plain,
    $false,
    inference(avatar_sat_refutation,[],[s710]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL192-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.19/0.49  % Computer : n006.cluster.edu
% 0.19/0.49  % Model    : x86_64 x86_64
% 0.19/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.49  % Memory   : 8046.5625MB
% 0.19/0.49  % OS       : Linux 6.8.0-71-generic
% 0.19/0.49  % CPULimit : 300
% 0.19/0.49  % WCLimit  : 300
% 0.19/0.49  % DateTime : Sun Sep 27 15:25:57 UTC 2026
% 0.19/0.49  % CPUTime  : 
% 0.19/0.49  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.54  Running first-order model finding
% 0.26/0.54  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
% 5.16/1.33  % (3096536)Will run a generic schedule for satisfiability detection.
% 5.16/1.33  % (3096546)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3661270710:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.16/1.33  % (3096542)% WARNING: option uhcvi not known.
% 5.16/1.33  % (3096542)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2556436619:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.16/1.33  % (3096545)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=419092582:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.16/1.33  % (3096544)dis+10_1_sil=32000:sp=arity:random_seed=3373489158:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.16/1.33  % (3096543)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4239610345:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.16/1.33  % (3096541)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2621214698_2999 on theBenchmark for (2999ds/0Mi)
% 5.16/1.33  % (3096547)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2600032597:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.16/1.33  % TRYING [1]
% 5.16/1.33  % TRYING [2]
% 5.16/1.33  % TRYING [3]
% 5.16/1.33  % TRYING [4]
% 5.16/1.33  % (3096546)Instruction limit reached! 
% 5.16/1.33  % (3096546)------------------------------
% 5.16/1.33  % (3096546)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096546)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096546)Termination reason: Instruction limit
% 5.16/1.33  % (3096546)Termination phase: Saturation
% 5.16/1.33  % (3096546)Time elapsed: 0.067 s
% 5.16/1.33  % (3096546)Peak memory usage: 14 MB
% 5.16/1.33  % (3096546)Instructions burned: 133 (million)
% 5.16/1.33  % (3096545)Instruction limit reached! 
% 5.16/1.33  % (3096545)------------------------------
% 5.16/1.33  % (3096545)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096545)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096545)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096545)Termination reason: Instruction limit
% 5.16/1.33  % (3096545)Termination phase: Saturation
% 5.16/1.33  % (3096545)Time elapsed: 0.088 s
% 5.16/1.33  % (3096545)Peak memory usage: 11 MB
% 5.16/1.33  % (3096545)Instructions burned: 116 (million)
% 5.16/1.33  % (3096544)Instruction limit reached! 
% 5.16/1.33  % (3096544)------------------------------
% 5.16/1.33  % (3096544)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096544)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096544)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096544)Termination reason: Instruction limit
% 5.16/1.33  % (3096544)Termination phase: Saturation
% 5.16/1.33  % (3096544)Time elapsed: 0.105 s
% 5.16/1.33  % (3096544)Peak memory usage: 12 MB
% 5.16/1.33  % (3096544)Instructions burned: 103 (million)
% 5.16/1.33  % (3096555)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=621910482:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.16/1.33  % TRYING [1]
% 5.16/1.33  % TRYING [2]
% 5.16/1.33  % TRYING [3]
% 5.16/1.33  % (3096556)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3390578420:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.16/1.33  % (3096557)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=2442375560:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.16/1.33  % TRYING [4]
% 5.16/1.33  % (3096547)Instruction limit reached! 
% 5.16/1.33  % (3096547)------------------------------
% 5.16/1.33  % (3096547)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096547)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096547)Termination reason: Instruction limit
% 5.16/1.33  % (3096547)Termination phase: Saturation
% 5.16/1.33  % (3096547)Time elapsed: 0.161 s
% 5.16/1.33  % (3096547)Peak memory usage: 13 MB
% 5.16/1.33  % (3096547)Instructions burned: 159 (million)
% 5.16/1.33  % (3096561)ott-21_1_sil=16000:fs=off:random_seed=684416255:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 5.16/1.33  % (3096556)Instruction limit reached! 
% 5.16/1.33  % (3096556)------------------------------
% 5.16/1.33  % (3096556)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096556)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096556)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096556)Termination reason: Instruction limit
% 5.16/1.33  % (3096556)Termination phase: Saturation
% 5.16/1.33  % (3096556)Time elapsed: 0.124 s
% 5.16/1.33  % (3096556)Peak memory usage: 13 MB
% 5.16/1.33  % (3096556)Instructions burned: 131 (million)
% 5.16/1.33  % (3096563)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1064778625:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 5.16/1.33  % TRYING [5]
% 5.16/1.33  % (3096561)Instruction limit reached! 
% 5.16/1.33  % (3096561)------------------------------
% 5.16/1.33  % (3096561)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096561)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096561)Termination reason: Instruction limit
% 5.16/1.33  % (3096561)Termination phase: Saturation
% 5.16/1.33  % (3096561)Time elapsed: 0.150 s
% 5.16/1.33  % (3096561)Peak memory usage: 13 MB
% 5.16/1.33  % (3096561)Instructions burned: 180 (million)
% 5.16/1.33  % (3096565)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3604519429:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 5.16/1.33  % TRYING [1]
% 5.16/1.33  % TRYING [2]
% 5.16/1.33  % TRYING [3]
% 5.16/1.33  % TRYING [4]
% 5.16/1.33  % (3096555)Instruction limit reached! 
% 5.16/1.33  % (3096555)------------------------------
% 5.16/1.33  % (3096555)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096555)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096555)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096555)Termination reason: Instruction limit
% 5.16/1.33  % (3096555)Termination phase: Finite model building SAT solving
% 5.16/1.33  % (3096555)Time elapsed: 0.377 s
% 5.16/1.33  % (3096555)Peak memory usage: 16 MB
% 5.16/1.33  % (3096555)Instructions burned: 716 (million)
% 5.16/1.33  % (3096567)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3993942897:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 5.16/1.33  % TRYING [5]
% 5.16/1.33  % TRYING [5]
% 5.16/1.33  % (3096567) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3096536-3096567"...
% 5.16/1.33  % (3096567)...printing done.
% 5.16/1.33  % (3096567)Refutation found. Thanks to Tanya!
% 5.16/1.33  % SZS status Unsatisfiable for theBenchmark
% 5.16/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 5.16/1.33  % (3096567)------------------------------
% 5.16/1.33  % (3096567)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.16/1.33  % (3096567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.16/1.33  % (3096567)CaDiCaL version: 2.1.3
% 5.16/1.33  % (3096567)Termination reason: Refutation
% 5.16/1.33  % (3096567)Time elapsed: 0.187 s
% 5.16/1.33  % (3096567)Peak memory usage: 16 MB
% 5.16/1.33  % (3096567)Instructions burned: 317 (million)
% 5.16/1.33  % (3096536)Success in time 0.773 s
% 5.16/1.33  % Vampire exiting
%------------------------------------------------------------------------------