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

% Computer : n020.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:47:44 AM UTC 2026

% Result   : Unsatisfiable 2.62s 0.95s
% Output   : Refutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :   18
% Syntax   : Number of formulae    :  113 ( 113 unt;   5 def)
%            Number of atoms       :  113 ( 112 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   9 con; 0-2 aty)
%            Number of variables   :   61 (  61   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : meet(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).

fof(f2,axiom,
    ! [X0] : join(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).

fof(f3,axiom,
    ! [X0,X1] : meet(X0,join(X0,X1)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).

fof(f4,axiom,
    ! [X0,X1] : join(X0,meet(X0,X1)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).

fof(f5,axiom,
    ! [X0,X1] : meet(X0,X1) = meet(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).

fof(f6,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).

fof(f7,axiom,
    ! [X2,X0,X1] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).

fof(f8,axiom,
    ! [X2,X0,X1] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).

fof(f9,axiom,
    ! [X2,X0,X1] : meet(X0,join(X1,X2)) = join(meet(X0,X1),meet(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity) ).

fof(f10,axiom,
    ! [X0] : join(complement(X0),X0) = n1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability1) ).

fof(f11,axiom,
    ! [X0] : meet(complement(X0),X0) = n0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability2) ).

fof(f12,axiom,
    ! [X0] : complement(complement(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability3) ).

fof(f13,negated_conjecture,
    complement(join(c,d)) != meet(complement(c),complement(d)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_compatability_law) ).

fof(f14,definition,
    sF0 = join(c,d),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f15,plain,
    join(c,d) = sF0,
    inference(reorient_equations,[],[f14]) ).

fof(f16,definition,
    sF1 = complement(sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f17,plain,
    complement(sF0) = sF1,
    inference(reorient_equations,[],[f16]) ).

fof(f18,definition,
    sF2 = complement(c),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f19,plain,
    complement(c) = sF2,
    inference(reorient_equations,[],[f18]) ).

fof(f20,definition,
    sF3 = complement(d),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f21,plain,
    complement(d) = sF3,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF4 = meet(sF2,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f23,plain,
    meet(sF2,sF3) = sF4,
    inference(reorient_equations,[],[f22]) ).

fof(f24,plain,
    sF1 != sF4,
    inference(definition_folding,[],[f13,f23,f21,f19,f17,f15]) ).

fof(f25,plain,
    c = complement(sF2),
    inference(superposition,[],[f12,f19]) ).

fof(f26,plain,
    d = complement(sF3),
    inference(superposition,[],[f12,f21]) ).

fof(f27,plain,
    sF0 = complement(sF1),
    inference(superposition,[],[f12,f17]) ).

fof(f30,plain,
    ! [X0] : n1 = join(X0,complement(X0)),
    inference(superposition,[],[f10,f12]) ).

fof(f43,plain,
    n0 = meet(sF3,d),
    inference(superposition,[],[f11,f21]) ).

fof(f52,plain,
    ! [X0] : complement(X0) = meet(complement(X0),n1),
    inference(superposition,[],[f3,f10]) ).

fof(f57,plain,
    ! [X0] : complement(X0) = meet(n1,complement(X0)),
    inference(forward_demodulation,[],[f52,f5]) ).

fof(f63,plain,
    ! [X0] : complement(X0) = join(complement(X0),n0),
    inference(superposition,[],[f4,f11]) ).

fof(f65,plain,
    ! [X0] : complement(X0) = join(n0,complement(X0)),
    inference(forward_demodulation,[],[f63,f6]) ).

fof(f72,plain,
    ! [X0,X1] : join(X1,meet(X0,X1)) = X1,
    inference(superposition,[],[f4,f5]) ).

fof(f84,plain,
    ! [X0,X1] : meet(X0,X1) = meet(X0,meet(X0,X1)),
    inference(superposition,[],[f7,f1]) ).

fof(f107,plain,
    ! [X0,X1] : join(X0,X1) = join(X0,join(X0,X1)),
    inference(superposition,[],[f8,f2]) ).

fof(f108,plain,
    ! [X2,X0,X1] : join(X0,join(meet(X0,X1),X2)) = join(X0,X2),
    inference(superposition,[],[f8,f4]) ).

fof(f112,plain,
    ! [X0,X1] : join(complement(X0),join(X0,X1)) = join(n1,X1),
    inference(superposition,[],[f8,f10]) ).

fof(f113,plain,
    ! [X0] : join(c,join(d,X0)) = join(sF0,X0),
    inference(superposition,[],[f8,f15]) ).

fof(f133,plain,
    ! [X2,X0,X1] : meet(X1,join(X0,X2)) = join(meet(X0,X1),meet(X1,X2)),
    inference(superposition,[],[f9,f5]) ).

fof(f135,plain,
    ! [X0,X1] : meet(complement(X0),join(X0,X1)) = join(n0,meet(complement(X0),X1)),
    inference(superposition,[],[f9,f11]) ).

fof(f137,plain,
    ! [X0] : meet(sF2,join(sF3,X0)) = join(sF4,meet(sF2,X0)),
    inference(superposition,[],[f9,f23]) ).

fof(f145,plain,
    ! [X0,X1] : meet(complement(X0),join(X1,X0)) = join(meet(complement(X0),X1),n0),
    inference(superposition,[],[f9,f11]) ).

fof(f163,plain,
    ! [X0,X1] : join(n0,meet(complement(X0),X1)) = meet(complement(X0),join(X1,X0)),
    inference(forward_demodulation,[],[f145,f6]) ).

fof(f192,plain,
    ! [X0] : meet(X0,n1) = X0,
    inference(superposition,[],[f3,f30]) ).

fof(f227,plain,
    sF1 = meet(n1,sF1),
    inference(superposition,[],[f57,f17]) ).

fof(f229,plain,
    c = meet(n1,c),
    inference(superposition,[],[f57,f25]) ).

fof(f230,plain,
    d = meet(n1,d),
    inference(superposition,[],[f57,f26]) ).

fof(f244,plain,
    ! [X0] : join(n0,X0) = X0,
    inference(superposition,[],[f65,f12]) ).

fof(f346,plain,
    sF4 = meet(sF2,sF4),
    inference(superposition,[],[f84,f23]) ).

fof(f418,plain,
    ! [X0] : n1 = join(X0,n1),
    inference(superposition,[],[f107,f30]) ).

fof(f457,plain,
    ! [X0] : n1 = join(n1,X0),
    inference(superposition,[],[f72,f192]) ).

fof(f475,plain,
    join(sF0,complement(d)) = join(c,n1),
    inference(superposition,[],[f113,f30]) ).

fof(f482,plain,
    join(sF0,complement(d)) = join(n1,c),
    inference(forward_demodulation,[],[f475,f6]) ).

fof(f488,plain,
    n1 = join(sF0,complement(d)),
    inference(forward_demodulation,[],[f482,f457]) ).

fof(f489,plain,
    n1 = join(sF0,sF3),
    inference(forward_demodulation,[],[f488,f21]) ).

fof(f704,plain,
    join(n1,d) = join(complement(c),sF0),
    inference(superposition,[],[f112,f15]) ).

fof(f729,plain,
    join(n1,d) = join(sF0,complement(c)),
    inference(forward_demodulation,[],[f704,f6]) ).

fof(f753,plain,
    join(n1,d) = join(sF0,sF2),
    inference(forward_demodulation,[],[f729,f19]) ).

fof(f759,plain,
    n1 = join(sF0,sF2),
    inference(forward_demodulation,[],[f753,f457]) ).

fof(f1429,plain,
    ! [X0,X1] : join(X0,n1) = join(X0,complement(meet(X0,X1))),
    inference(superposition,[],[f108,f30]) ).

fof(f1452,plain,
    ! [X0,X1] : n1 = join(X0,complement(meet(X0,X1))),
    inference(forward_demodulation,[],[f1429,f418]) ).

fof(f2918,plain,
    ! [X0] : meet(d,join(sF3,X0)) = join(n0,meet(d,X0)),
    inference(superposition,[],[f133,f43]) ).

fof(f3031,plain,
    ! [X0] : meet(d,X0) = meet(d,join(sF3,X0)),
    inference(forward_demodulation,[],[f2918,f244]) ).

fof(f3195,plain,
    meet(complement(sF0),n1) = join(n0,meet(complement(sF0),sF3)),
    inference(superposition,[],[f135,f489]) ).

fof(f3327,plain,
    meet(complement(sF0),n1) = meet(complement(sF0),sF3),
    inference(forward_demodulation,[],[f3195,f244]) ).

fof(f3393,plain,
    meet(complement(sF0),n1) = meet(sF3,complement(sF0)),
    inference(forward_demodulation,[],[f3327,f5]) ).

fof(f3432,plain,
    meet(sF1,n1) = meet(sF3,sF1),
    inference(forward_demodulation,[],[f3393,f17]) ).

fof(f3456,plain,
    meet(n1,sF1) = meet(sF3,sF1),
    inference(forward_demodulation,[],[f3432,f5]) ).

fof(f3468,plain,
    sF1 = meet(sF3,sF1),
    inference(forward_demodulation,[],[f3456,f227]) ).

fof(f3493,plain,
    meet(complement(sF0),n1) = join(n0,meet(complement(sF0),sF2)),
    inference(superposition,[],[f135,f759]) ).

fof(f3496,plain,
    meet(complement(sF0),n1) = meet(complement(sF0),sF2),
    inference(forward_demodulation,[],[f3493,f244]) ).

fof(f3507,plain,
    meet(complement(sF0),n1) = meet(sF2,complement(sF0)),
    inference(forward_demodulation,[],[f3496,f5]) ).

fof(f3512,plain,
    meet(sF1,n1) = meet(sF2,sF1),
    inference(forward_demodulation,[],[f3507,f17]) ).

fof(f3513,plain,
    meet(n1,sF1) = meet(sF2,sF1),
    inference(forward_demodulation,[],[f3512,f5]) ).

fof(f3514,plain,
    sF1 = meet(sF2,sF1),
    inference(forward_demodulation,[],[f3513,f227]) ).

fof(f5715,plain,
    sF3 = join(sF3,sF1),
    inference(superposition,[],[f4,f3468]) ).

fof(f5810,plain,
    join(sF4,sF1) = meet(sF2,join(sF3,sF1)),
    inference(superposition,[],[f137,f3514]) ).

fof(f5840,plain,
    meet(sF2,sF3) = join(sF4,sF1),
    inference(forward_demodulation,[],[f5810,f5715]) ).

fof(f5844,plain,
    meet(sF2,sF3) = join(sF1,sF4),
    inference(forward_demodulation,[],[f5840,f6]) ).

fof(f5847,plain,
    sF4 = join(sF1,sF4),
    inference(forward_demodulation,[],[f5844,f23]) ).

fof(f6228,plain,
    join(n1,sF4) = join(complement(sF1),sF4),
    inference(superposition,[],[f112,f5847]) ).

fof(f6245,plain,
    join(n1,sF4) = join(sF4,complement(sF1)),
    inference(forward_demodulation,[],[f6228,f6]) ).

fof(f6251,plain,
    join(n1,sF4) = join(sF4,sF0),
    inference(forward_demodulation,[],[f6245,f27]) ).

fof(f6256,plain,
    join(n1,sF4) = join(sF0,sF4),
    inference(forward_demodulation,[],[f6251,f6]) ).

fof(f6258,plain,
    n1 = join(sF0,sF4),
    inference(forward_demodulation,[],[f6256,f457]) ).

fof(f6394,plain,
    join(n0,meet(complement(sF4),sF0)) = meet(complement(sF4),n1),
    inference(superposition,[],[f163,f6258]) ).

fof(f6397,plain,
    join(n0,meet(complement(sF4),sF0)) = meet(n1,complement(sF4)),
    inference(forward_demodulation,[],[f6394,f5]) ).

fof(f6411,plain,
    complement(sF4) = join(n0,meet(complement(sF4),sF0)),
    inference(forward_demodulation,[],[f6397,f57]) ).

fof(f6418,plain,
    complement(sF4) = meet(complement(sF4),sF0),
    inference(forward_demodulation,[],[f6411,f244]) ).

fof(f6421,plain,
    complement(sF4) = meet(sF0,complement(sF4)),
    inference(forward_demodulation,[],[f6418,f5]) ).

fof(f9040,plain,
    ! [X0,X1] : n1 = join(X1,complement(meet(X0,X1))),
    inference(superposition,[],[f1452,f5]) ).

fof(f9104,plain,
    n1 = join(sF2,complement(sF4)),
    inference(superposition,[],[f1452,f346]) ).

fof(f9240,plain,
    meet(complement(sF2),n1) = join(n0,meet(complement(sF2),complement(sF4))),
    inference(superposition,[],[f135,f9104]) ).

fof(f9252,plain,
    meet(complement(sF2),n1) = meet(complement(sF2),complement(sF4)),
    inference(forward_demodulation,[],[f9240,f244]) ).

fof(f9265,plain,
    meet(c,n1) = meet(c,complement(sF4)),
    inference(forward_demodulation,[],[f9252,f25]) ).

fof(f9272,plain,
    meet(n1,c) = meet(c,complement(sF4)),
    inference(forward_demodulation,[],[f9265,f5]) ).

fof(f9275,plain,
    c = meet(c,complement(sF4)),
    inference(forward_demodulation,[],[f9272,f229]) ).

fof(f9406,plain,
    complement(sF4) = join(complement(sF4),c),
    inference(superposition,[],[f72,f9275]) ).

fof(f9433,plain,
    complement(sF4) = join(c,complement(sF4)),
    inference(forward_demodulation,[],[f9406,f6]) ).

fof(f16262,plain,
    sF0 = join(sF0,complement(sF4)),
    inference(superposition,[],[f4,f6421]) ).

fof(f19317,plain,
    n1 = join(sF3,complement(sF4)),
    inference(superposition,[],[f9040,f23]) ).

fof(f19771,plain,
    meet(d,n1) = meet(d,complement(sF4)),
    inference(superposition,[],[f3031,f19317]) ).

fof(f19819,plain,
    meet(n1,d) = meet(d,complement(sF4)),
    inference(forward_demodulation,[],[f19771,f5]) ).

fof(f19829,plain,
    d = meet(d,complement(sF4)),
    inference(forward_demodulation,[],[f19819,f230]) ).

fof(f19951,plain,
    complement(sF4) = join(complement(sF4),d),
    inference(superposition,[],[f72,f19829]) ).

fof(f19984,plain,
    complement(sF4) = join(d,complement(sF4)),
    inference(forward_demodulation,[],[f19951,f6]) ).

fof(f20110,plain,
    join(c,complement(sF4)) = join(sF0,complement(sF4)),
    inference(superposition,[],[f113,f19984]) ).

fof(f20146,plain,
    sF0 = join(c,complement(sF4)),
    inference(forward_demodulation,[],[f20110,f16262]) ).

fof(f20431,plain,
    sF0 = complement(sF4),
    inference(superposition,[],[f9433,f20146]) ).

fof(f20822,plain,
    complement(sF0) = sF4,
    inference(superposition,[],[f12,f20431]) ).

fof(f20852,plain,
    sF1 = sF4,
    inference(forward_demodulation,[],[f20822,f17]) ).

fof(f20868,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f20852,f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT043-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n020.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 13:58:49 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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
% 2.62/0.95  % (3400211)Will run a generic schedule for satisfiability detection.
% 2.62/0.95  % (3400219)dis+10_1_sil=32000:sp=arity:random_seed=585903963:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.62/0.95  % (3400217)% WARNING: option uhcvi not known.
% 2.62/0.95  % (3400218)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4192218396:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.62/0.95  % (3400220)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3966592224:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.62/0.95  % (3400217)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3562019442:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.62/0.95  % (3400221)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2906544304:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.62/0.95  % (3400222)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1274219178:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.62/0.95  % (3400216)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2916555689_2999 on theBenchmark for (2999ds/0Mi)
% 2.62/0.95  % TRYING [1]
% 2.62/0.95  % TRYING [2]
% 2.62/0.95  % TRYING [3]
% 2.62/0.95  % TRYING [4]
% 2.62/0.95  % TRYING [5]
% 2.62/0.95  % (3400219)Instruction limit reached! 
% 2.62/0.95  % (3400219)------------------------------
% 2.62/0.95  % (3400219)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400219)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400219)Termination reason: Instruction limit
% 2.62/0.95  % (3400219)Termination phase: Saturation
% 2.62/0.95  % (3400219)Time elapsed: 0.030 s
% 2.62/0.95  % (3400219)Peak memory usage: 12 MB
% 2.62/0.95  % (3400219)Instructions burned: 104 (million)
% 2.62/0.95  % (3400230)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3870900782:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.62/0.95  % TRYING [1]
% 2.62/0.95  % TRYING [2]
% 2.62/0.95  % TRYING [3]
% 2.62/0.95  % TRYING [4]
% 2.62/0.95  % TRYING [5]
% 2.62/0.95  % TRYING [6]
% 2.62/0.95  % TRYING [6]
% 2.62/0.95  % (3400220)Instruction limit reached! 
% 2.62/0.95  % (3400220)------------------------------
% 2.62/0.95  % (3400220)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400220)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400220)Termination reason: Instruction limit
% 2.62/0.95  % (3400220)Termination phase: Saturation
% 2.62/0.95  % (3400220)Time elapsed: 0.067 s
% 2.62/0.95  % (3400220)Peak memory usage: 12 MB
% 2.62/0.95  % (3400220)Instructions burned: 117 (million)
% 2.62/0.95  % (3400221)Instruction limit reached! 
% 2.62/0.95  % (3400221)------------------------------
% 2.62/0.95  % (3400221)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400221)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400221)Termination reason: Instruction limit
% 2.62/0.95  % (3400221)Termination phase: Saturation
% 2.62/0.95  % (3400221)Time elapsed: 0.075 s
% 2.62/0.95  % (3400221)Peak memory usage: 12 MB
% 2.62/0.95  % (3400221)Instructions burned: 132 (million)
% 2.62/0.95  % (3400232)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=927543004:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.62/0.95  % (3400222)Instruction limit reached! 
% 2.62/0.95  % (3400222)------------------------------
% 2.62/0.95  % (3400222)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400222)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400222)Termination reason: Instruction limit
% 2.62/0.95  % (3400222)Termination phase: Saturation
% 2.62/0.95  % (3400222)Time elapsed: 0.089 s
% 2.62/0.95  % (3400222)Peak memory usage: 12 MB
% 2.62/0.95  % (3400222)Instructions burned: 160 (million)
% 2.62/0.95  % (3400233)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=2693374843:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.62/0.95  % (3400235)ott-21_1_sil=16000:fs=off:random_seed=3292741570:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.62/0.95  % TRYING [7]
% 2.62/0.95  % TRYING [7]
% 2.62/0.95  % (3400232)Instruction limit reached! 
% 2.62/0.95  % (3400232)------------------------------
% 2.62/0.95  % (3400232)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400232)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400232)Termination reason: Instruction limit
% 2.62/0.95  % (3400232)Termination phase: Saturation
% 2.62/0.95  % (3400232)Time elapsed: 0.081 s
% 2.62/0.95  % (3400232)Peak memory usage: 12 MB
% 2.62/0.95  % (3400232)Instructions burned: 131 (million)
% 2.62/0.95  % (3400230)Instruction limit reached! 
% 2.62/0.95  % (3400230)------------------------------
% 2.62/0.95  % (3400230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400230)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400230)Termination reason: Instruction limit
% 2.62/0.95  % (3400230)Termination phase: Finite model building constraint generation
% 2.62/0.95  % (3400230)Time elapsed: 0.153 s
% 2.62/0.95  % (3400230)Peak memory usage: 28 MB
% 2.62/0.95  % (3400230)Instructions burned: 719 (million)
% 2.62/0.95  % (3400235)Instruction limit reached! 
% 2.62/0.95  % (3400235)------------------------------
% 2.62/0.95  % (3400235)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400235)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400235)Termination reason: Instruction limit
% 2.62/0.95  % (3400235)Termination phase: Saturation
% 2.62/0.95  % (3400235)Time elapsed: 0.084 s
% 2.62/0.95  % (3400235)Peak memory usage: 11 MB
% 2.62/0.95  % (3400235)Instructions burned: 182 (million)
% 2.62/0.95  % (3400241)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1790879278:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.62/0.95  % (3400243)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3357697148:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.62/0.95  % TRYING [1]
% 2.62/0.95  % TRYING [2]
% 2.62/0.95  % TRYING [3]
% 2.62/0.95  % (3400245)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2358032469:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.62/0.95  % TRYING [4]
% 2.62/0.95  % TRYING [5]
% 2.62/0.95  % TRYING [6]
% 2.62/0.95  % TRYING [8]
% 2.62/0.95  % (3400241)Instruction limit reached! 
% 2.62/0.95  % (3400241)------------------------------
% 2.62/0.95  % (3400241)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400241)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400241)Termination reason: Instruction limit
% 2.62/0.95  % (3400241)Termination phase: Saturation
% 2.62/0.95  % (3400241)Time elapsed: 0.253 s
% 2.62/0.95  % (3400241)Peak memory usage: 15 MB
% 2.62/0.95  % (3400241)Instructions burned: 478 (million)
% 2.62/0.95  % (3400233)Instruction limit reached! 
% 2.62/0.95  % (3400233)------------------------------
% 2.62/0.95  % (3400233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400233)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400233)Termination reason: Instruction limit
% 2.62/0.95  % (3400233)Termination phase: Saturation
% 2.62/0.95  % (3400233)Time elapsed: 0.356 s
% 2.62/0.95  % (3400233)Peak memory usage: 17 MB
% 2.62/0.95  % (3400233)Instructions burned: 684 (million)
% 2.62/0.95  % (3400257)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=963045759:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.62/0.95  % (3400258)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=1078434385:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 2.62/0.95  % (3400245) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3400211-3400245"...
% 2.62/0.95  % (3400245)...printing done.
% 2.62/0.95  % (3400245)Refutation found. Thanks to Tanya!
% 2.62/0.95  % SZS status Unsatisfiable for theBenchmark
% 2.62/0.95  % SZS output start Proof for theBenchmark
% See solution above
% 2.62/0.95  % (3400245)------------------------------
% 2.62/0.95  % (3400245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.62/0.95  % (3400245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/0.95  % (3400245)CaDiCaL version: 2.1.3
% 2.62/0.95  % (3400245)Termination reason: Refutation
% 2.62/0.95  % (3400245)Time elapsed: 0.286 s
% 2.62/0.95  % (3400245)Peak memory usage: 17 MB
% 2.62/0.95  % (3400245)Instructions burned: 615 (million)
% 2.62/0.95  % (3400211)Success in time 0.531 s
% 2.62/0.95  % Vampire exiting
%------------------------------------------------------------------------------