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

% Computer : n004.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:40:50 AM UTC 2026

% Result   : Unsatisfiable 0.17s 5.98s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   99 (  99 unt;   8 def)
%            Number of atoms       :   99 (  98 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;  12 con; 0-2 aty)
%            Number of variables   :   64 (  64   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).

fof(f4,axiom,
    ! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).

fof(f5,axiom,
    ! [X0] : addition(X0,zero) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).

fof(f6,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).

fof(f7,axiom,
    ! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).

fof(f8,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).

fof(f9,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).

fof(f10,axiom,
    ! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_distributivity) ).

fof(f11,axiom,
    ! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).

fof(f14,axiom,
    ! [X0] : multiplication(zero,X0) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).

fof(f15,plain,
    ! [X0] : zero = multiplication(zero,X0),
    inference(reorient_equations,[],[f14]) ).

fof(f19,axiom,
    ! [X0] : multiplication(antidomain(X0),X0) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).

fof(f20,plain,
    ! [X0] : zero = multiplication(antidomain(X0),X0),
    inference(reorient_equations,[],[f19]) ).

fof(f21,axiom,
    ! [X0,X1] : addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1))))) = antidomain(multiplication(X0,antidomain(antidomain(X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain2) ).

fof(f22,plain,
    ! [X0,X1] : antidomain(multiplication(X0,antidomain(antidomain(X1)))) = addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1))))),
    inference(reorient_equations,[],[f21]) ).

fof(f23,axiom,
    ! [X0] : addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).

fof(f24,plain,
    ! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
    inference(reorient_equations,[],[f23]) ).

fof(f25,axiom,
    ! [X0] : domain(X0) = antidomain(antidomain(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain4) ).

fof(f26,plain,
    ! [X0] : antidomain(antidomain(X0)) = domain(X0),
    inference(reorient_equations,[],[f25]) ).

fof(f35,negated_conjecture,
    domain(multiplication(sK2_goals_X0,sK1_goals_X1)) != domain(multiplication(sK2_goals_X0,domain(sK1_goals_X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f36,plain,
    antidomain(antidomain(multiplication(sK2_goals_X0,sK1_goals_X1))) != antidomain(antidomain(multiplication(sK2_goals_X0,antidomain(antidomain(sK1_goals_X1))))),
    inference(definition_unfolding,[],[f35,f26,f26,f26]) ).

fof(f37,definition,
    sF0 = multiplication(sK2_goals_X0,sK1_goals_X1),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f38,plain,
    multiplication(sK2_goals_X0,sK1_goals_X1) = sF0,
    inference(reorient_equations,[],[f37]) ).

fof(f39,definition,
    sF1 = antidomain(sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f40,plain,
    antidomain(sF0) = sF1,
    inference(reorient_equations,[],[f39]) ).

fof(f41,definition,
    sF2 = antidomain(sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f42,plain,
    antidomain(sF1) = sF2,
    inference(reorient_equations,[],[f41]) ).

fof(f43,definition,
    sF3 = antidomain(sK1_goals_X1),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f44,plain,
    antidomain(sK1_goals_X1) = sF3,
    inference(reorient_equations,[],[f43]) ).

fof(f45,definition,
    sF4 = antidomain(sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f46,plain,
    antidomain(sF3) = sF4,
    inference(reorient_equations,[],[f45]) ).

fof(f47,definition,
    sF5 = multiplication(sK2_goals_X0,sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f48,plain,
    multiplication(sK2_goals_X0,sF4) = sF5,
    inference(reorient_equations,[],[f47]) ).

fof(f49,definition,
    sF6 = antidomain(sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f50,plain,
    antidomain(sF5) = sF6,
    inference(reorient_equations,[],[f49]) ).

fof(f51,definition,
    sF7 = antidomain(sF6),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f52,plain,
    antidomain(sF6) = sF7,
    inference(reorient_equations,[],[f51]) ).

fof(f53,plain,
    sF2 != sF7,
    inference(definition_folding,[],[f36,f52,f50,f48,f46,f44,f42,f40,f38]) ).

fof(f54,plain,
    sF2 != antidomain(sF6),
    inference(superposition,[],[f53,f52]) ).

fof(f55,plain,
    antidomain(sF1) != antidomain(sF6),
    inference(forward_demodulation,[],[f54,f42]) ).

fof(f59,plain,
    zero = multiplication(sF6,sF5),
    inference(superposition,[],[f20,f50]) ).

fof(f61,plain,
    zero = antidomain(one),
    inference(superposition,[],[f8,f20]) ).

fof(f69,plain,
    ! [X0] : addition(zero,X0) = X0,
    inference(superposition,[],[f5,f3]) ).

fof(f70,plain,
    one = addition(antidomain(zero),zero),
    inference(superposition,[],[f24,f61]) ).

fof(f72,plain,
    one = addition(antidomain(sF1),sF1),
    inference(superposition,[],[f24,f40]) ).

fof(f78,plain,
    ! [X0] : one = addition(antidomain(X0),antidomain(antidomain(X0))),
    inference(superposition,[],[f3,f24]) ).

fof(f81,plain,
    one = addition(sF1,antidomain(sF1)),
    inference(forward_demodulation,[],[f72,f3]) ).

fof(f83,plain,
    one = antidomain(zero),
    inference(forward_demodulation,[],[f70,f5]) ).

fof(f100,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
    inference(superposition,[],[f4,f6]) ).

fof(f124,plain,
    ! [X0] : multiplication(sK2_goals_X0,multiplication(sF4,X0)) = multiplication(sF5,X0),
    inference(superposition,[],[f7,f48]) ).

fof(f145,plain,
    ! [X0] : multiplication(zero,X0) = multiplication(sF6,multiplication(sF5,X0)),
    inference(superposition,[],[f7,f59]) ).

fof(f146,plain,
    ! [X0] : zero = multiplication(sF6,multiplication(sF5,X0)),
    inference(forward_demodulation,[],[f145,f15]) ).

fof(f179,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,antidomain(antidomain(X1))),multiplication(X0,antidomain(X1))),
    inference(superposition,[],[f10,f24]) ).

fof(f190,plain,
    ! [X0,X1] : zero = addition(multiplication(antidomain(addition(X0,X1)),X0),multiplication(antidomain(addition(X0,X1)),X1)),
    inference(superposition,[],[f20,f10]) ).

fof(f200,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,antidomain(X1)),multiplication(X0,antidomain(antidomain(X1)))),
    inference(forward_demodulation,[],[f179,f3]) ).

fof(f210,plain,
    ! [X0,X1] : addition(multiplication(X0,antidomain(X1)),multiplication(X0,antidomain(antidomain(X1)))) = X0,
    inference(forward_demodulation,[],[f200,f8]) ).

fof(f227,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(antidomain(antidomain(X0)),X1),multiplication(antidomain(X0),X1)),
    inference(superposition,[],[f11,f24]) ).

fof(f248,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(antidomain(X0),X1),multiplication(antidomain(antidomain(X0)),X1)),
    inference(forward_demodulation,[],[f227,f3]) ).

fof(f258,plain,
    ! [X0,X1] : addition(multiplication(antidomain(X0),X1),multiplication(antidomain(antidomain(X0)),X1)) = X1,
    inference(forward_demodulation,[],[f248,f9]) ).

fof(f283,plain,
    antidomain(multiplication(sK2_goals_X0,antidomain(antidomain(sK1_goals_X1)))) = addition(antidomain(sF0),antidomain(multiplication(sK2_goals_X0,antidomain(antidomain(sK1_goals_X1))))),
    inference(superposition,[],[f22,f38]) ).

fof(f319,plain,
    antidomain(multiplication(sK2_goals_X0,antidomain(sF3))) = addition(antidomain(sF0),antidomain(multiplication(sK2_goals_X0,antidomain(sF3)))),
    inference(forward_demodulation,[],[f283,f44]) ).

fof(f338,plain,
    antidomain(multiplication(sK2_goals_X0,sF4)) = addition(antidomain(sF0),antidomain(multiplication(sK2_goals_X0,sF4))),
    inference(forward_demodulation,[],[f319,f46]) ).

fof(f345,plain,
    antidomain(sF5) = addition(antidomain(sF0),antidomain(sF5)),
    inference(forward_demodulation,[],[f338,f48]) ).

fof(f348,plain,
    sF6 = addition(antidomain(sF0),sF6),
    inference(forward_demodulation,[],[f345,f50]) ).

fof(f350,plain,
    sF6 = addition(sF6,antidomain(sF0)),
    inference(forward_demodulation,[],[f348,f3]) ).

fof(f351,plain,
    sF6 = addition(sF6,sF1),
    inference(forward_demodulation,[],[f350,f40]) ).

fof(f352,plain,
    sF6 = addition(sF1,sF6),
    inference(forward_demodulation,[],[f351,f3]) ).

fof(f431,plain,
    ! [X0] : multiplication(X0,one) = addition(multiplication(X0,sF1),multiplication(X0,antidomain(sF1))),
    inference(superposition,[],[f10,f81]) ).

fof(f436,plain,
    ! [X0] : addition(multiplication(X0,sF1),multiplication(X0,antidomain(sF1))) = X0,
    inference(forward_demodulation,[],[f431,f8]) ).

fof(f604,plain,
    ! [X0] : one = addition(antidomain(X0),one),
    inference(superposition,[],[f100,f78]) ).

fof(f632,plain,
    ! [X0] : one = addition(one,antidomain(X0)),
    inference(forward_demodulation,[],[f604,f3]) ).

fof(f1928,plain,
    ! [X0] : addition(zero,multiplication(antidomain(antidomain(X0)),X0)) = X0,
    inference(superposition,[],[f258,f20]) ).

fof(f1992,plain,
    ! [X0] : multiplication(antidomain(antidomain(X0)),X0) = X0,
    inference(forward_demodulation,[],[f1928,f69]) ).

fof(f2008,plain,
    sK1_goals_X1 = multiplication(antidomain(sF3),sK1_goals_X1),
    inference(superposition,[],[f1992,f44]) ).

fof(f2025,plain,
    ! [X0] : antidomain(antidomain(antidomain(X0))) = addition(antidomain(X0),multiplication(antidomain(antidomain(antidomain(X0))),antidomain(antidomain(X0)))),
    inference(superposition,[],[f210,f1992]) ).

fof(f2029,plain,
    ! [X0] : antidomain(antidomain(antidomain(X0))) = addition(antidomain(X0),zero),
    inference(forward_demodulation,[],[f2025,f20]) ).

fof(f2037,plain,
    sK1_goals_X1 = multiplication(sF4,sK1_goals_X1),
    inference(forward_demodulation,[],[f2008,f46]) ).

fof(f2039,plain,
    ! [X0] : antidomain(X0) = antidomain(antidomain(antidomain(X0))),
    inference(forward_demodulation,[],[f2029,f5]) ).

fof(f2082,plain,
    multiplication(sK2_goals_X0,sK1_goals_X1) = multiplication(sF5,sK1_goals_X1),
    inference(superposition,[],[f124,f2037]) ).

fof(f2090,plain,
    sF0 = multiplication(sF5,sK1_goals_X1),
    inference(forward_demodulation,[],[f2082,f38]) ).

fof(f2130,plain,
    zero = multiplication(sF6,sF0),
    inference(superposition,[],[f146,f2090]) ).

fof(f2153,plain,
    antidomain(multiplication(sF6,antidomain(antidomain(sF0)))) = addition(antidomain(zero),antidomain(multiplication(sF6,antidomain(antidomain(sF0))))),
    inference(superposition,[],[f22,f2130]) ).

fof(f2156,plain,
    antidomain(multiplication(sF6,antidomain(sF1))) = addition(antidomain(zero),antidomain(multiplication(sF6,antidomain(sF1)))),
    inference(forward_demodulation,[],[f2153,f40]) ).

fof(f2159,plain,
    antidomain(multiplication(sF6,antidomain(sF1))) = addition(one,antidomain(multiplication(sF6,antidomain(sF1)))),
    inference(forward_demodulation,[],[f2156,f83]) ).

fof(f2161,plain,
    one = antidomain(multiplication(sF6,antidomain(sF1))),
    inference(forward_demodulation,[],[f2159,f632]) ).

fof(f3662,plain,
    ! [X0,X1] : zero = addition(multiplication(antidomain(addition(X0,X1)),X0),zero),
    inference(superposition,[],[f100,f190]) ).

fof(f3686,plain,
    ! [X0,X1] : zero = multiplication(antidomain(addition(X0,X1)),X0),
    inference(forward_demodulation,[],[f3662,f5]) ).

fof(f8905,plain,
    sF6 = antidomain(antidomain(sF6)),
    inference(superposition,[],[f2039,f50]) ).

fof(f13035,plain,
    zero = multiplication(antidomain(sF6),sF1),
    inference(superposition,[],[f3686,f352]) ).

fof(f13264,plain,
    sF1 = addition(zero,multiplication(antidomain(antidomain(sF6)),sF1)),
    inference(superposition,[],[f258,f13035]) ).

fof(f13325,plain,
    sF1 = multiplication(antidomain(antidomain(sF6)),sF1),
    inference(forward_demodulation,[],[f13264,f69]) ).

fof(f13344,plain,
    sF1 = multiplication(sF6,sF1),
    inference(forward_demodulation,[],[f13325,f8905]) ).

fof(f23509,plain,
    zero = multiplication(one,multiplication(sF6,antidomain(sF1))),
    inference(superposition,[],[f20,f2161]) ).

fof(f23554,plain,
    zero = multiplication(sF6,antidomain(sF1)),
    inference(forward_demodulation,[],[f23509,f9]) ).

fof(f23619,plain,
    sF6 = addition(multiplication(sF6,sF1),zero),
    inference(superposition,[],[f436,f23554]) ).

fof(f23682,plain,
    sF6 = multiplication(sF6,sF1),
    inference(forward_demodulation,[],[f23619,f5]) ).

fof(f23703,plain,
    sF1 = sF6,
    inference(forward_demodulation,[],[f23682,f13344]) ).

fof(f23725,plain,
    antidomain(sF1) != antidomain(sF1),
    inference(superposition,[],[f55,f23703]) ).

fof(f23779,plain,
    $false,
    inference(trivial_inequality_removal,[],[f23725]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE084-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/5.41  % Computer : n004.cluster.edu
% 0.13/5.41  % Model    : x86_64 x86_64
% 0.13/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.41  % Memory   : 8046.5625MB
% 0.13/5.41  % OS       : Linux 6.8.0-71-generic
% 0.13/5.41  % CPULimit : 300
% 0.13/5.41  % WCLimit  : 300
% 0.13/5.41  % DateTime : Sun Sep 27 13:09:29 UTC 2026
% 0.13/5.41  % CPUTime  : 
% 0.13/5.41  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/5.44  Running first-order model finding
% 0.13/5.44  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
% 0.17/5.98  % (3507555)Will run a generic schedule for satisfiability detection.
% 0.17/5.98  % (3507565)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=189364530:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/5.98  % (3507561)% WARNING: option uhcvi not known.
% 0.17/5.98  % (3507560)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3716935419_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/5.98  % (3507561)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2834064339:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/5.98  % (3507562)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4083765899:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/5.98  % (3507563)dis+10_1_sil=32000:sp=arity:random_seed=1055203033:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/5.98  % (3507564)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1184272014:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/5.98  % (3507566)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1241126065:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/5.98  % TRYING [1]
% 0.17/5.98  % TRYING [2]
% 0.17/5.98  % TRYING [3]
% 0.17/5.98  % TRYING [4]
% 0.17/5.98  % (3507565)Instruction limit reached! 
% 0.17/5.98  % (3507565)------------------------------
% 0.17/5.98  % (3507565)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507565)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507565)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507565)Termination reason: Instruction limit
% 0.17/5.98  % (3507565)Termination phase: Saturation
% 0.17/5.98  % (3507565)Time elapsed: 0.041 s
% 0.17/5.98  % (3507565)Peak memory usage: 13 MB
% 0.17/5.98  % (3507565)Instructions burned: 133 (million)
% 0.17/5.98  % (3507574)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=953987778:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/5.98  % TRYING [1]
% 0.17/5.98  % TRYING [2]
% 0.17/5.98  % TRYING [3]
% 0.17/5.98  % TRYING [5]
% 0.17/5.98  % TRYING [4]
% 0.17/5.98  % (3507563)Instruction limit reached! 
% 0.17/5.98  % (3507563)------------------------------
% 0.17/5.98  % (3507563)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507563)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507563)Termination reason: Instruction limit
% 0.17/5.98  % (3507563)Termination phase: Saturation
% 0.17/5.98  % (3507563)Time elapsed: 0.060 s
% 0.17/5.98  % (3507563)Peak memory usage: 12 MB
% 0.17/5.98  % (3507563)Instructions burned: 104 (million)
% 0.17/5.98  % (3507564)Instruction limit reached! 
% 0.17/5.98  % (3507564)------------------------------
% 0.17/5.98  % (3507564)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507564)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507564)Termination reason: Instruction limit
% 0.17/5.98  % (3507564)Termination phase: Saturation
% 0.17/5.98  % (3507564)Time elapsed: 0.070 s
% 0.17/5.98  % (3507564)Peak memory usage: 12 MB
% 0.17/5.98  % (3507564)Instructions burned: 118 (million)
% 0.17/5.98  % TRYING [5]
% 0.17/5.98  % (3507576)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2571569364:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/5.98  % (3507577)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=3876496576:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.17/5.98  % (3507566)Instruction limit reached! 
% 0.17/5.98  % (3507566)------------------------------
% 0.17/5.98  % (3507566)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507566)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507566)Termination reason: Instruction limit
% 0.17/5.98  % (3507566)Termination phase: Saturation
% 0.17/5.98  % (3507566)Time elapsed: 0.093 s
% 0.17/5.98  % (3507566)Peak memory usage: 12 MB
% 0.17/5.98  % (3507566)Instructions burned: 159 (million)
% 0.17/5.98  % (3507580)ott-21_1_sil=16000:fs=off:random_seed=971297397:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.17/5.98  % TRYING [6]
% 0.17/5.98  % (3507576)Instruction limit reached! 
% 0.17/5.98  % (3507576)------------------------------
% 0.17/5.98  % (3507576)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507576)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507576)Termination reason: Instruction limit
% 0.17/5.98  % (3507576)Termination phase: Saturation
% 0.17/5.98  % (3507576)Time elapsed: 0.086 s
% 0.17/5.98  % (3507576)Peak memory usage: 13 MB
% 0.17/5.98  % (3507576)Instructions burned: 131 (million)
% 0.17/5.98  % TRYING [6]
% 0.17/5.98  % (3507582)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=603063432:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.17/5.98  % (3507580)Instruction limit reached! 
% 0.17/5.98  % (3507580)------------------------------
% 0.17/5.98  % (3507580)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507580)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507580)Termination reason: Instruction limit
% 0.17/5.98  % (3507580)Termination phase: Saturation
% 0.17/5.98  % (3507580)Time elapsed: 0.079 s
% 0.17/5.98  % (3507580)Peak memory usage: 12 MB
% 0.17/5.98  % (3507580)Instructions burned: 181 (million)
% 0.17/5.98  % (3507574)Instruction limit reached! 
% 0.17/5.98  % (3507574)------------------------------
% 0.17/5.98  % (3507574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507574)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507574)Termination reason: Instruction limit
% 0.17/5.98  % (3507574)Termination phase: Finite model building constraint generation
% 0.17/5.98  % (3507574)Time elapsed: 0.153 s
% 0.17/5.98  % (3507574)Peak memory usage: 34 MB
% 0.17/5.98  % (3507574)Instructions burned: 718 (million)
% 0.17/5.98  % (3507584)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=7851454:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 0.17/5.98  % (3507585)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1908666028:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 0.17/5.98  % TRYING [1]
% 0.17/5.98  % TRYING [2]
% 0.17/5.98  % TRYING [3]
% 0.17/5.98  % TRYING [4]
% 0.17/5.98  % TRYING [5]
% 0.17/5.98  % (3507582)Instruction limit reached! 
% 0.17/5.98  % (3507582)------------------------------
% 0.17/5.98  % (3507582)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507582)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507582)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507582)Termination reason: Instruction limit
% 0.17/5.98  % (3507582)Termination phase: Saturation
% 0.17/5.98  % (3507582)Time elapsed: 0.259 s
% 0.17/5.98  % (3507582)Peak memory usage: 16 MB
% 0.17/5.98  % (3507582)Instructions burned: 479 (million)
% 0.17/5.98  % (3507577)Instruction limit reached! 
% 0.17/5.98  % (3507577)------------------------------
% 0.17/5.98  % (3507577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.98  % (3507577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.98  % (3507577)CaDiCaL version: 2.1.3
% 0.17/5.98  % (3507577)Termination reason: Instruction limit
% 0.17/5.98  % (3507577)Termination phase: Saturation
% 0.17/5.98  % (3507577)Time elapsed: 0.370 s
% 0.17/5.98  % (3507577)Peak memory usage: 18 MB
% 0.17/5.98  % (3507577)Instructions burned: 684 (million)
% 0.17/5.98  % (3507588)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3439590659:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 0.17/5.98  % (3507589)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=3281037003: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)
% 0.17/5.98  % (3507585) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3507555-3507585"...
% 0.17/5.98  % (3507585)...printing done.
% 0.17/5.98  % TRYING [6]
% 0.17/5.98  % (3507585)Refutation found. Thanks to Tanya!
% 0.17/5.98  % SZS status Unsatisfiable for theBenchmark
% 0.17/5.98  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/5.99  % (3507585)------------------------------
% 0.17/5.99  % (3507585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.99  % (3507585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.99  % (3507585)CaDiCaL version: 2.1.3
% 0.17/5.99  % (3507585)Termination reason: Refutation
% 0.17/5.99  % (3507585)Time elapsed: 0.285 s
% 0.17/5.99  % (3507585)Peak memory usage: 22 MB
% 0.17/5.99  % (3507585)Instructions burned: 965 (million)
% 0.17/5.99  % (3507555)Success in time 0.536 s
% 0.17/5.99  % Vampire exiting
%------------------------------------------------------------------------------