↑ 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  : LCL224-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:58:05 AM UTC 2026

% Result   : Unsatisfiable 11.32s 2.20s
% Output   : Refutation 11.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   98 (  69 unt;  11 def)
%            Number of atoms       :  134 (  19 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   77 (  41   ~;  34   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  12 con; 0-2 aty)
%            Number of variables   :   68 (   0 sgn  68   !;   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(p,implies(q,r)),implies(or(p,q),or(p,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(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
    inference(definition_unfolding,[],[f9,f6,f6,f6]) ).

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

fof(f18,plain,
    not(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 = or(p,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

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

fof(f23,definition,
    sF3 = not(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f24,plain,
    not(sF2) = sF3,
    inference(reorient_equations,[],[f23]) ).

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

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

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

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

fof(f29,definition,
    sF6 = or(p,r),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f30,plain,
    or(p,r) = sF6,
    inference(reorient_equations,[],[f29]) ).

fof(f31,definition,
    sF7 = or(sF5,sF6),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f32,plain,
    or(sF5,sF6) = sF7,
    inference(reorient_equations,[],[f31]) ).

fof(f33,definition,
    sF8 = or(sF3,sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f34,plain,
    or(sF3,sF7) = sF8,
    inference(reorient_equations,[],[f33]) ).

fof(f35,plain,
    ~ theorem(sF8),
    inference(definition_folding,[],[f16,f34,f32,f30,f28,f26,f24,f22,f20,f18]) ).

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

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

fof(f46,plain,
    axiom(or(not(sF6),sF7)),
    inference(superposition,[],[f11,f32]) ).

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

fof(f58,plain,
    axiom(or(not(or(r,sF0)),sF1)),
    inference(superposition,[],[f12,f20]) ).

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

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

fof(f96,plain,
    ! [X0] : axiom(or(not(or(X0,sF8)),or(sF3,or(X0,sF7)))),
    inference(superposition,[],[f13,f34]) ).

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

fof(f109,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF4),or(p,X0)))),
    inference(superposition,[],[f14,f26]) ).

fof(f118,plain,
    ! [X0] : axiom(or(not(or(not(X0),sF7)),or(not(or(sF3,X0)),sF8))),
    inference(superposition,[],[f14,f34]) ).

fof(f120,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(sF5,or(p,X0)))),
    inference(forward_demodulation,[],[f109,f28]) ).

fof(f122,plain,
    ! [X0] : axiom(or(not(or(sF0,X0)),or(sF5,or(p,X0)))),
    inference(forward_demodulation,[],[f120,f18]) ).

fof(f127,plain,
    theorem(or(not(sF6),sF7)),
    inference(resolution,[],[f46,f7]) ).

fof(f172,plain,
    theorem(or(not(or(r,sF0)),sF1)),
    inference(resolution,[],[f58,f7]) ).

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

fof(f215,plain,
    axiom(or(not(or(p,sF1)),or(sF0,sF6))),
    inference(superposition,[],[f95,f30]) ).

fof(f217,plain,
    axiom(or(not(sF2),or(sF0,sF6))),
    inference(forward_demodulation,[],[f215,f22]) ).

fof(f219,plain,
    axiom(or(sF3,or(sF0,sF6))),
    inference(forward_demodulation,[],[f217,f24]) ).

fof(f222,plain,
    ! [X0] : theorem(or(not(or(X0,sF8)),or(sF3,or(X0,sF7)))),
    inference(resolution,[],[f96,f7]) ).

fof(f227,plain,
    theorem(or(sF3,or(sF0,sF6))),
    inference(resolution,[],[f219,f7]) ).

fof(f261,plain,
    axiom(or(not(or(sF0,r)),or(sF5,sF6))),
    inference(superposition,[],[f122,f30]) ).

fof(f262,plain,
    axiom(or(not(or(sF0,r)),sF7)),
    inference(forward_demodulation,[],[f261,f32]) ).

fof(f264,plain,
    axiom(or(not(sF1),sF7)),
    inference(forward_demodulation,[],[f262,f20]) ).

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

fof(f284,plain,
    theorem(or(not(sF1),sF7)),
    inference(resolution,[],[f264,f7]) ).

fof(f349,plain,
    ! [X0] : theorem(or(not(or(not(X0),sF7)),or(not(or(sF3,X0)),sF8))),
    inference(resolution,[],[f118,f7]) ).

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

fof(f586,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF8))
      | theorem(or(sF3,or(X0,sF7))) ),
    inference(resolution,[],[f222,f15]) ).

fof(f715,plain,
    theorem(or(sF0,or(sF3,sF6))),
    inference(resolution,[],[f271,f227]) ).

fof(f779,plain,
    theorem(or(or(sF3,sF6),sF0)),
    inference(resolution,[],[f715,f184]) ).

fof(f906,plain,
    ! [X0] :
      ( theorem(or(not(or(sF3,X0)),sF8))
      | ~ theorem(or(not(X0),sF7)) ),
    inference(resolution,[],[f349,f15]) ).

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

fof(f1754,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF7))
      | theorem(sF8)
      | ~ theorem(or(sF3,X0)) ),
    inference(resolution,[],[f906,f15]) ).

fof(f1758,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),sF7))
      | ~ theorem(or(sF3,X0)) ),
    inference(forward_subsumption_resolution,[],[f1754,f35]) ).

fof(f1763,plain,
    ~ theorem(or(sF3,or(sF7,sF7))),
    inference(resolution,[],[f1758,f36]) ).

fof(f2194,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(r,sF0)))
      | theorem(or(X0,sF1)) ),
    inference(resolution,[],[f972,f172]) ).

fof(f2213,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF1))
      | theorem(or(X0,sF7)) ),
    inference(resolution,[],[f972,f284]) ).

fof(f2220,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(sF3,X1)))
      | theorem(or(X0,sF8))
      | ~ theorem(or(not(X1),sF7)) ),
    inference(resolution,[],[f972,f906]) ).

fof(f3750,plain,
    theorem(or(not(sF0),sF1)),
    inference(resolution,[],[f2194,f37]) ).

fof(f18282,definition,
    ( spl9_493
  <=> theorem(or(sF7,sF8)) ),
    introduced(definition,[new_symbols(definition,[spl9_493])],[avatar_definition]) ).

fof(f18284,plain,
    ( theorem(or(sF7,sF8))
    | ~ spl9_493 ),
    inference(avatar_component_clause,[],[f18282]) ).

fof(f19944,definition,
    ( spl9_568
  <=> theorem(or(not(sF0),sF7)) ),
    introduced(definition,[new_symbols(definition,[spl9_568])],[avatar_definition]) ).

fof(f19945,plain,
    ( theorem(or(not(sF0),sF7))
    | ~ spl9_568 ),
    inference(avatar_component_clause,[],[f19944]) ).

fof(f19946,plain,
    ( ~ theorem(or(not(sF0),sF7))
    | spl9_568 ),
    inference(avatar_component_clause,[],[f19944]) ).

fof(f20172,plain,
    theorem(or(not(sF0),sF7)),
    inference(resolution,[],[f3750,f2213]) ).

fof(f20178,plain,
    ( $false
    | spl9_568 ),
    inference(forward_subsumption_resolution,[],[f20172,f19946]) ).

fof(f20179,plain,
    spl9_568,
    inference(avatar_contradiction_clause,[],[f20178]) ).

fof(f20186,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,sF0))
        | theorem(or(X0,sF7)) )
    | ~ spl9_568 ),
    inference(resolution,[],[f19945,f972]) ).

fof(f22828,plain,
    ( theorem(or(or(sF3,sF6),sF7))
    | ~ spl9_568 ),
    inference(resolution,[],[f20186,f779]) ).

fof(f22892,plain,
    ( theorem(or(sF7,or(sF3,sF6)))
    | ~ spl9_568 ),
    inference(resolution,[],[f22828,f184]) ).

fof(f23091,plain,
    ( theorem(or(sF7,sF8))
    | ~ theorem(or(not(sF6),sF7))
    | ~ spl9_568 ),
    inference(resolution,[],[f22892,f2220]) ).

fof(f23100,plain,
    ( theorem(or(sF7,sF8))
    | ~ spl9_568 ),
    inference(forward_subsumption_resolution,[],[f23091,f127]) ).

fof(f23101,plain,
    ( spl9_493
    | ~ spl9_568 ),
    inference(avatar_split_clause,[],[f23100,f19944,f18282]) ).

fof(f23104,plain,
    ( theorem(or(sF3,or(sF7,sF7)))
    | ~ spl9_493 ),
    inference(resolution,[],[f18284,f586]) ).

fof(f23111,plain,
    ( $false
    | ~ spl9_493 ),
    inference(forward_subsumption_resolution,[],[f23104,f1763]) ).

fof(f23112,plain,
    ~ spl9_493,
    inference(avatar_contradiction_clause,[],[f23111]) ).

cnf(s881,plain,
    spl9_568,
    inference(sat_conversion,[],[f20179]) ).

cnf(s943,plain,
    ( spl9_493
    | ~ spl9_568 ),
    inference(sat_conversion,[],[f23101]) ).

cnf(s945,plain,
    ~ spl9_493,
    inference(sat_conversion,[],[f23112]) ).

cnf(s946,plain,
    ~ spl9_568,
    inference(rat,[],[s943,s945]) ).

cnf(s947,plain,
    $false,
    inference(rat,[],[s881,s946]) ).

fof(f23113,plain,
    $false,
    inference(avatar_sat_refutation,[],[s947]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL224-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.47  % Computer : n006.cluster.edu
% 0.22/0.47  % Model    : x86_64 x86_64
% 0.22/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47  % Memory   : 8046.5625MB
% 0.22/0.47  % OS       : Linux 6.8.0-71-generic
% 0.22/0.47  % CPULimit : 300
% 0.22/0.47  % WCLimit  : 300
% 0.22/0.47  % DateTime : Sun Sep 27 15:27:40 UTC 2026
% 0.22/0.48  % CPUTime  : 
% 0.22/0.48  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.53  Running first-order model finding
% 0.25/0.53  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
% 11.32/2.20  % (3099891)Will run a generic schedule for satisfiability detection.
% 11.32/2.20  % (3099901)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=610120748:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 11.32/2.20  % (3099897)% WARNING: option uhcvi not known.
% 11.32/2.20  % (3099902)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=228273488:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 11.32/2.20  % (3099896)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2468443118_2999 on theBenchmark for (2999ds/0Mi)
% 11.32/2.20  % (3099900)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4287929390:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 11.32/2.20  % (3099899)dis+10_1_sil=32000:sp=arity:random_seed=446835432:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 11.32/2.20  % (3099897)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=751262567:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 11.32/2.20  % (3099898)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1312230462:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 11.32/2.20  % TRYING [1]
% 11.32/2.20  % TRYING [2]
% 11.32/2.20  % TRYING [3]
% 11.32/2.20  % TRYING [4]
% 11.32/2.20  % (3099901)Instruction limit reached! 
% 11.32/2.20  % (3099901)------------------------------
% 11.32/2.20  % (3099901)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099901)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099901)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099901)Termination reason: Instruction limit
% 11.32/2.20  % (3099901)Termination phase: Saturation
% 11.32/2.20  % (3099901)Time elapsed: 0.067 s
% 11.32/2.20  % (3099901)Peak memory usage: 13 MB
% 11.32/2.20  % (3099901)Instructions burned: 132 (million)
% 11.32/2.20  % (3099900)Instruction limit reached! 
% 11.32/2.20  % (3099900)------------------------------
% 11.32/2.20  % (3099900)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099900)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099900)Termination reason: Instruction limit
% 11.32/2.20  % (3099900)Termination phase: Saturation
% 11.32/2.20  % (3099900)Time elapsed: 0.084 s
% 11.32/2.20  % (3099900)Peak memory usage: 11 MB
% 11.32/2.20  % (3099900)Instructions burned: 116 (million)
% 11.32/2.20  % (3099910)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1353170175:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 11.32/2.20  % TRYING [1]
% 11.32/2.20  % TRYING [2]
% 11.32/2.20  % TRYING [3]
% 11.32/2.20  % (3099899)Instruction limit reached! 
% 11.32/2.20  % (3099899)------------------------------
% 11.32/2.20  % (3099899)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099899)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099899)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099899)Termination reason: Instruction limit
% 11.32/2.20  % (3099899)Termination phase: Saturation
% 11.32/2.20  % (3099899)Time elapsed: 0.111 s
% 11.32/2.20  % (3099899)Peak memory usage: 12 MB
% 11.32/2.20  % (3099899)Instructions burned: 104 (million)
% 11.32/2.20  % (3099911)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4063300606:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 11.32/2.20  % (3099902)Instruction limit reached! 
% 11.32/2.20  % (3099902)------------------------------
% 11.32/2.20  % (3099902)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099902)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099902)Termination reason: Instruction limit
% 11.32/2.20  % (3099902)Termination phase: Saturation
% 11.32/2.20  % (3099902)Time elapsed: 0.132 s
% 11.32/2.20  % (3099902)Peak memory usage: 12 MB
% 11.32/2.20  % (3099902)Instructions burned: 160 (million)
% 11.32/2.20  % TRYING [4]
% 11.32/2.20  % (3099913)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=3863906313:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 11.32/2.20  % (3099915)ott-21_1_sil=16000:fs=off:random_seed=89742982:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 11.32/2.20  % (3099911)Instruction limit reached! 
% 11.32/2.20  % (3099911)------------------------------
% 11.32/2.20  % (3099911)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099911)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099911)Termination reason: Instruction limit
% 11.32/2.20  % (3099911)Termination phase: Saturation
% 11.32/2.20  % (3099911)Time elapsed: 0.120 s
% 11.32/2.20  % (3099911)Peak memory usage: 12 MB
% 11.32/2.20  % (3099911)Instructions burned: 131 (million)
% 11.32/2.20  % (3099918)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2907350790:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 11.32/2.20  % (3099915)Instruction limit reached! 
% 11.32/2.20  % (3099915)------------------------------
% 11.32/2.20  % (3099915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099915)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099915)Termination reason: Instruction limit
% 11.32/2.20  % (3099915)Termination phase: Saturation
% 11.32/2.20  % (3099915)Time elapsed: 0.149 s
% 11.32/2.20  % (3099915)Peak memory usage: 12 MB
% 11.32/2.20  % (3099915)Instructions burned: 180 (million)
% 11.32/2.20  % (3099920)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4136123530:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 11.32/2.20  % TRYING [1]
% 11.32/2.20  % TRYING [2]
% 11.32/2.20  % TRYING [3]
% 11.32/2.20  % TRYING [4]
% 11.32/2.20  % (3099910)Instruction limit reached! 
% 11.32/2.20  % (3099910)------------------------------
% 11.32/2.20  % (3099910)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099910)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099910)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099910)Termination reason: Instruction limit
% 11.32/2.20  % (3099910)Termination phase: Finite model building SAT solving
% 11.32/2.20  % (3099910)Time elapsed: 0.417 s
% 11.32/2.20  % (3099910)Peak memory usage: 13 MB
% 11.32/2.20  % (3099910)Instructions burned: 715 (million)
% 11.32/2.20  % TRYING [5]
% 11.32/2.20  % (3099922)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1336541030:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 11.32/2.20  % TRYING [5]
% 11.32/2.20  % (3099918)Instruction limit reached! 
% 11.32/2.20  % (3099918)------------------------------
% 11.32/2.20  % (3099918)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099918)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099918)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099918)Termination reason: Instruction limit
% 11.32/2.20  % (3099918)Termination phase: Saturation
% 11.32/2.20  % (3099918)Time elapsed: 0.441 s
% 11.32/2.20  % (3099918)Peak memory usage: 13 MB
% 11.32/2.20  % (3099918)Instructions burned: 478 (million)
% 11.32/2.20  % (3099924)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=176203588:i=889:ins=1_2992 on theBenchmark for (2992ds/889Mi)
% 11.32/2.20  % (3099913)Instruction limit reached! 
% 11.32/2.20  % (3099913)------------------------------
% 11.32/2.20  % (3099913)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099913)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099913)Termination reason: Instruction limit
% 11.32/2.20  % (3099913)Termination phase: Saturation
% 11.32/2.20  % (3099913)Time elapsed: 0.646 s
% 11.32/2.20  % (3099913)Peak memory usage: 16 MB
% 11.32/2.20  % (3099913)Instructions burned: 684 (million)
% 11.32/2.20  % (3099920)Instruction limit reached! 
% 11.32/2.20  % (3099920)------------------------------
% 11.32/2.20  % (3099920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099920)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099920)Termination reason: Instruction limit
% 11.32/2.20  % (3099920)Termination phase: Finite model building SAT solving
% 11.32/2.20  % (3099920)Time elapsed: 0.469 s
% 11.32/2.20  % (3099920)Peak memory usage: 13 MB
% 11.32/2.20  % (3099920)Instructions burned: 867 (million)
% 11.32/2.20  % (3099926)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=80506041:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2991 on theBenchmark for (2991ds/692Mi)
% 11.32/2.20  % TRYING [14]
% 11.32/2.20  % (3099927)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2283492962:i=879:kws=inv_precedence:fsr=off_2991 on theBenchmark for (2991ds/879Mi)
% 11.32/2.20  % (3099927)Instruction limit reached! 
% 11.32/2.20  % (3099927)------------------------------
% 11.32/2.20  % (3099927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099927)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099927)Termination reason: Instruction limit
% 11.32/2.20  % (3099927)Termination phase: Saturation
% 11.32/2.20  % (3099927)Time elapsed: 0.337 s
% 11.32/2.20  % (3099927)Peak memory usage: 17 MB
% 11.32/2.20  % (3099927)Instructions burned: 880 (million)
% 11.32/2.20  % (3099930)fmb+10_1_sil=64000:random_seed=4196493832:i=22061:nm=2:gsp=on_2987 on theBenchmark for (2987ds/22061Mi)
% 11.32/2.20  % TRYING [1]
% 11.32/2.20  % TRYING [2]
% 11.32/2.20  % TRYING [3]
% 11.32/2.20  % TRYING [4]
% 11.32/2.20  % TRYING [5]
% 11.32/2.20  % (3099924)Instruction limit reached! 
% 11.32/2.20  % (3099924)------------------------------
% 11.32/2.20  % (3099924)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099924)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099924)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099924)Termination reason: Instruction limit
% 11.32/2.20  % (3099924)Termination phase: Finite model building constraint generation
% 11.32/2.20  % (3099924)Time elapsed: 0.615 s
% 11.32/2.20  % (3099924)Peak memory usage: 69 MB
% 11.32/2.20  % (3099924)Instructions burned: 889 (million)
% 11.32/2.20  % (3099932)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1365426246:i=9515:nm=5_2985 on theBenchmark for (2985ds/9515Mi)
% 11.32/2.20  % TRYING [20]
% 11.32/2.20  % (3099926)Instruction limit reached! 
% 11.32/2.20  % (3099926)------------------------------
% 11.32/2.20  % (3099926)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.32/2.20  % (3099926)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.32/2.20  % (3099926)CaDiCaL version: 2.1.3
% 11.32/2.20  % (3099926)Termination reason: Instruction limit
% 11.32/2.20  % (3099926)Termination phase: Saturation
% 11.32/2.20  % (3099926)Time elapsed: 0.725 s
% 11.32/2.20  % (3099926)Peak memory usage: 24 MB
% 11.32/2.20  % (3099926)Instructions burned: 693 (million)
% 11.32/2.20  % (3099922) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3099891-3099922"...
% 11.32/2.20  % (3099922)...printing done.
% 11.32/2.20  % (3099922)Refutation found. Thanks to Tanya!
% 11.32/2.20  % SZS status Unsatisfiable for theBenchmark
% 11.32/2.20  % SZS output start Proof for theBenchmark
% See solution above
% 11.79/2.20  % (3099922)------------------------------
% 11.79/2.20  % (3099922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.79/2.20  % (3099922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.79/2.20  % (3099922)CaDiCaL version: 2.1.3
% 11.79/2.20  % (3099922)Termination reason: Refutation
% 11.79/2.20  % (3099922)Time elapsed: 1.015 s
% 11.79/2.20  % (3099922)Peak memory usage: 24 MB
% 11.79/2.20  % (3099922)Instructions burned: 1010 (million)
% 11.79/2.20  % (3099891)Success in time 1.654 s
% 11.79/2.20  % Vampire exiting
%------------------------------------------------------------------------------