↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : KLE082+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n010.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   : Theorem 1.93s 0.87s
% Output   : Refutation 1.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   22
% Syntax   : Number of formulae    :  114 ( 110 unt;   8 def)
%            Number of atoms       :  122 ( 121 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   14 (   6   ~;   0   |;   6   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;  10 con; 0-2 aty)
%            Number of variables   :  101 (  99   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

fof(f3,axiom,
    ! [X0] : addition(X0,zero) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).

fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).

fof(f6,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

fof(f8,axiom,
    ! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).

fof(f9,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

fof(f11,axiom,
    ! [X0] : multiplication(zero,X0) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).

fof(f13,axiom,
    ! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).

fof(f14,axiom,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).

fof(f15,axiom,
    ! [X0] : addition(domain(X0),one) = one,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).

fof(f16,axiom,
    domain(zero) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).

fof(f18,conjecture,
    ! [X0,X1] :
      ( ! [X2] :
          ( addition(domain(X2),antidomain(X2)) = one
          & multiplication(domain(X2),antidomain(X2)) = zero )
     => addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,domain(X1)))) = antidomain(multiplication(X0,domain(X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f19,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] :
            ( addition(domain(X2),antidomain(X2)) = one
            & multiplication(domain(X2),antidomain(X2)) = zero )
       => addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,domain(X1)))) = antidomain(multiplication(X0,domain(X1))) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f20,plain,
    ? [X0,X1] :
      ( antidomain(multiplication(X0,domain(X1))) != addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,domain(X1))))
      & ! [X2] :
          ( addition(domain(X2),antidomain(X2)) = one
          & multiplication(domain(X2),antidomain(X2)) = zero ) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f21,plain,
    ( antidomain(multiplication(sK0,domain(sK1))) != addition(antidomain(multiplication(sK0,sK1)),antidomain(multiplication(sK0,domain(sK1))))
    & ! [X2] :
        ( addition(domain(X2),antidomain(X2)) = one
        & multiplication(domain(X2),antidomain(X2)) = zero ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f20]) ).

fof(f22,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f23,plain,
    ! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f24,plain,
    ! [X0] : addition(X0,zero) = X0,
    inference(cnf_transformation,[],[f3]) ).

fof(f25,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f4]) ).

fof(f27,plain,
    ! [X0] : multiplication(X0,one) = X0,
    inference(cnf_transformation,[],[f6]) ).

fof(f28,plain,
    ! [X0] : multiplication(one,X0) = X0,
    inference(cnf_transformation,[],[f7]) ).

fof(f29,plain,
    ! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    inference(cnf_transformation,[],[f8]) ).

fof(f30,plain,
    ! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

fof(f32,plain,
    ! [X0] : zero = multiplication(zero,X0),
    inference(cnf_transformation,[],[f11]) ).

fof(f33,plain,
    ! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
    inference(cnf_transformation,[],[f13]) ).

fof(f34,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(cnf_transformation,[],[f14]) ).

fof(f35,plain,
    ! [X0] : one = addition(domain(X0),one),
    inference(cnf_transformation,[],[f15]) ).

fof(f36,plain,
    zero = domain(zero),
    inference(cnf_transformation,[],[f16]) ).

fof(f38,plain,
    ! [X2] : zero = multiplication(domain(X2),antidomain(X2)),
    inference(cnf_transformation,[],[f21]) ).

fof(f39,plain,
    ! [X2] : one = addition(domain(X2),antidomain(X2)),
    inference(cnf_transformation,[],[f21]) ).

fof(f40,plain,
    antidomain(multiplication(sK0,domain(sK1))) != addition(antidomain(multiplication(sK0,sK1)),antidomain(multiplication(sK0,domain(sK1)))),
    inference(cnf_transformation,[],[f21]) ).

fof(f41,definition,
    sF2 = domain(sK1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f42,plain,
    domain(sK1) = sF2,
    inference(reorient_equations,[],[f41]) ).

fof(f43,definition,
    sF3 = multiplication(sK0,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f44,plain,
    multiplication(sK0,sF2) = 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(sK0,sK1),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f48,plain,
    multiplication(sK0,sK1) = 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 = addition(sF6,sF4),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

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

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

fof(f54,definition,
    ! [X2] : sF8(X2) = addition(domain(X2),antidomain(X2)),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f55,plain,
    ! [X2] : addition(domain(X2),antidomain(X2)) = sF8(X2),
    inference(reorient_equations,[],[f54]) ).

fof(f56,plain,
    ! [X2] : one = sF8(X2),
    inference(definition_folding,[],[f39,f55]) ).

fof(f57,definition,
    ! [X2] : sF9(X2) = multiplication(domain(X2),antidomain(X2)),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f58,plain,
    ! [X2] : multiplication(domain(X2),antidomain(X2)) = sF9(X2),
    inference(reorient_equations,[],[f57]) ).

fof(f59,plain,
    ! [X2] : zero = sF9(X2),
    inference(definition_folding,[],[f38,f58]) ).

fof(f60,plain,
    ! [X2] : one = addition(domain(X2),antidomain(X2)),
    inference(forward_demodulation,[],[f55,f56]) ).

fof(f61,plain,
    ! [X2] : zero = multiplication(domain(X2),antidomain(X2)),
    inference(forward_demodulation,[],[f58,f59]) ).

fof(f69,plain,
    zero = multiplication(domain(sF5),sF6),
    inference(superposition,[],[f61,f50]) ).

fof(f70,plain,
    one = addition(domain(sF5),sF6),
    inference(superposition,[],[f60,f50]) ).

fof(f71,plain,
    one = addition(sF6,domain(sF5)),
    inference(forward_demodulation,[],[f70,f22]) ).

fof(f80,plain,
    ! [X0] : addition(zero,X0) = X0,
    inference(superposition,[],[f24,f22]) ).

fof(f82,plain,
    ! [X0] : domain(multiplication(X0,sK1)) = domain(multiplication(X0,sF2)),
    inference(superposition,[],[f34,f42]) ).

fof(f87,plain,
    ! [X0,X1] : zero = multiplication(domain(multiplication(X0,X1)),antidomain(multiplication(X0,domain(X1)))),
    inference(superposition,[],[f61,f34]) ).

fof(f98,plain,
    zero = multiplication(domain(sF5),antidomain(multiplication(sK0,domain(sK1)))),
    inference(superposition,[],[f87,f48]) ).

fof(f115,plain,
    zero = multiplication(domain(sF5),antidomain(multiplication(sK0,sF2))),
    inference(forward_demodulation,[],[f98,f42]) ).

fof(f122,plain,
    zero = multiplication(domain(sF5),antidomain(sF3)),
    inference(forward_demodulation,[],[f115,f44]) ).

fof(f123,plain,
    zero = multiplication(domain(sF5),sF4),
    inference(forward_demodulation,[],[f122,f46]) ).

fof(f154,plain,
    ! [X0,X1] : addition(one,X1) = addition(domain(X0),addition(antidomain(X0),X1)),
    inference(superposition,[],[f23,f60]) ).

fof(f157,plain,
    ! [X0] : addition(sF6,addition(sF4,X0)) = addition(sF7,X0),
    inference(superposition,[],[f23,f52]) ).

fof(f217,plain,
    ! [X0,X1] : multiplication(domain(multiplication(X0,X1)),multiplication(X0,domain(X1))) = addition(multiplication(X0,domain(X1)),multiplication(domain(multiplication(X0,X1)),multiplication(X0,domain(X1)))),
    inference(superposition,[],[f33,f34]) ).

fof(f251,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,domain(X1)),multiplication(X0,one)),
    inference(superposition,[],[f29,f35]) ).

fof(f255,plain,
    ! [X0] : multiplication(X0,one) = addition(multiplication(X0,sF6),multiplication(X0,domain(sF5))),
    inference(superposition,[],[f29,f71]) ).

fof(f281,plain,
    ! [X0] : addition(multiplication(X0,sF6),multiplication(X0,domain(sF5))) = X0,
    inference(forward_demodulation,[],[f255,f27]) ).

fof(f285,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,one),multiplication(X0,domain(X1))),
    inference(forward_demodulation,[],[f251,f22]) ).

fof(f297,plain,
    ! [X0,X1] : addition(X0,multiplication(X0,domain(X1))) = X0,
    inference(forward_demodulation,[],[f285,f27]) ).

fof(f320,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(domain(X0),X1),multiplication(one,X1)),
    inference(superposition,[],[f30,f35]) ).

fof(f326,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(domain(X0),X1),multiplication(antidomain(X0),X1)),
    inference(superposition,[],[f30,f60]) ).

fof(f329,plain,
    ! [X0] : addition(multiplication(sF6,X0),multiplication(sF4,X0)) = multiplication(sF7,X0),
    inference(superposition,[],[f30,f52]) ).

fof(f352,plain,
    ! [X0,X1] : addition(multiplication(domain(X0),X1),multiplication(antidomain(X0),X1)) = X1,
    inference(forward_demodulation,[],[f326,f28]) ).

fof(f357,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(one,X1),multiplication(domain(X0),X1)),
    inference(forward_demodulation,[],[f320,f22]) ).

fof(f373,plain,
    ! [X0,X1] : addition(X1,multiplication(domain(X0),X1)) = X1,
    inference(forward_demodulation,[],[f357,f28]) ).

fof(f438,plain,
    ! [X0] : addition(domain(X0),antidomain(X0)) = addition(one,antidomain(X0)),
    inference(superposition,[],[f154,f25]) ).

fof(f450,plain,
    ! [X0] : one = addition(one,antidomain(X0)),
    inference(forward_demodulation,[],[f438,f60]) ).

fof(f458,plain,
    one = addition(one,sF4),
    inference(superposition,[],[f450,f46]) ).

fof(f547,plain,
    sF4 = addition(zero,multiplication(antidomain(sF5),sF4)),
    inference(superposition,[],[f352,f123]) ).

fof(f566,plain,
    sF4 = multiplication(antidomain(sF5),sF4),
    inference(forward_demodulation,[],[f547,f80]) ).

fof(f582,plain,
    sF4 = multiplication(sF6,sF4),
    inference(forward_demodulation,[],[f566,f50]) ).

fof(f750,plain,
    ! [X0] : multiplication(X0,one) = addition(multiplication(X0,one),multiplication(X0,sF4)),
    inference(superposition,[],[f29,f458]) ).

fof(f752,plain,
    ! [X0] : addition(X0,multiplication(X0,sF4)) = X0,
    inference(forward_demodulation,[],[f750,f27]) ).

fof(f814,plain,
    ! [X2,X0,X1] : addition(X0,X2) = addition(X0,addition(multiplication(X0,domain(X1)),X2)),
    inference(superposition,[],[f23,f297]) ).

fof(f903,plain,
    domain(sF5) = domain(multiplication(sK0,sF2)),
    inference(superposition,[],[f82,f48]) ).

fof(f939,plain,
    domain(sF3) = domain(sF5),
    inference(forward_demodulation,[],[f903,f44]) ).

fof(f1041,plain,
    sF6 = addition(sF6,sF4),
    inference(superposition,[],[f752,f582]) ).

fof(f1150,plain,
    sF6 = sF7,
    inference(superposition,[],[f52,f1041]) ).

fof(f1153,plain,
    ! [X0] : addition(sF6,addition(sF4,X0)) = addition(sF6,X0),
    inference(superposition,[],[f23,f1041]) ).

fof(f1216,plain,
    sF4 != sF6,
    inference(superposition,[],[f53,f1150]) ).

fof(f1238,plain,
    ! [X0] : sF7 = addition(sF6,addition(sF4,multiplication(sF7,domain(X0)))),
    inference(superposition,[],[f297,f157]) ).

fof(f1243,plain,
    ! [X0] : sF7 = addition(sF6,multiplication(sF7,domain(X0))),
    inference(forward_demodulation,[],[f1238,f1153]) ).

fof(f1266,plain,
    ! [X0] : sF7 = addition(sF6,addition(multiplication(sF6,domain(X0)),multiplication(sF4,domain(X0)))),
    inference(forward_demodulation,[],[f1243,f329]) ).

fof(f1283,plain,
    ! [X0] : sF7 = addition(sF6,multiplication(sF4,domain(X0))),
    inference(forward_demodulation,[],[f1266,f814]) ).

fof(f1293,plain,
    ! [X0] : sF6 = addition(sF6,multiplication(sF4,domain(X0))),
    inference(forward_demodulation,[],[f1283,f1150]) ).

fof(f6033,plain,
    multiplication(domain(zero),multiplication(domain(sF5),domain(sF6))) = addition(multiplication(domain(sF5),domain(sF6)),multiplication(domain(zero),multiplication(domain(sF5),domain(sF6)))),
    inference(superposition,[],[f217,f69]) ).

fof(f6115,plain,
    multiplication(domain(sF5),domain(sF6)) = multiplication(domain(zero),multiplication(domain(sF5),domain(sF6))),
    inference(forward_demodulation,[],[f6033,f373]) ).

fof(f6181,plain,
    multiplication(domain(sF3),domain(sF6)) = multiplication(domain(zero),multiplication(domain(sF3),domain(sF6))),
    inference(forward_demodulation,[],[f6115,f939]) ).

fof(f6228,plain,
    multiplication(domain(sF3),domain(sF6)) = multiplication(zero,multiplication(domain(sF3),domain(sF6))),
    inference(forward_demodulation,[],[f6181,f36]) ).

fof(f6267,plain,
    zero = multiplication(domain(sF3),domain(sF6)),
    inference(forward_demodulation,[],[f6228,f32]) ).

fof(f9092,plain,
    domain(zero) = domain(multiplication(domain(sF3),sF6)),
    inference(superposition,[],[f34,f6267]) ).

fof(f9128,plain,
    zero = domain(multiplication(domain(sF3),sF6)),
    inference(forward_demodulation,[],[f9092,f36]) ).

fof(f10986,plain,
    multiplication(zero,multiplication(domain(sF3),sF6)) = addition(multiplication(domain(sF3),sF6),multiplication(zero,multiplication(domain(sF3),sF6))),
    inference(superposition,[],[f33,f9128]) ).

fof(f11048,plain,
    zero = addition(multiplication(domain(sF3),sF6),zero),
    inference(forward_demodulation,[],[f10986,f32]) ).

fof(f11063,plain,
    zero = multiplication(domain(sF3),sF6),
    inference(forward_demodulation,[],[f11048,f24]) ).

fof(f11205,plain,
    sF6 = addition(zero,multiplication(antidomain(sF3),sF6)),
    inference(superposition,[],[f352,f11063]) ).

fof(f11224,plain,
    sF6 = multiplication(antidomain(sF3),sF6),
    inference(forward_demodulation,[],[f11205,f80]) ).

fof(f11227,plain,
    sF6 = multiplication(sF4,sF6),
    inference(forward_demodulation,[],[f11224,f46]) ).

fof(f11376,plain,
    sF4 = addition(sF6,multiplication(sF4,domain(sF5))),
    inference(superposition,[],[f281,f11227]) ).

fof(f11400,plain,
    sF4 = sF6,
    inference(forward_demodulation,[],[f11376,f1293]) ).

fof(f11403,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f11400,f1216]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE082+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n010.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 27 13:09:47 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43  Running first-order model finding
% 0.11/0.43  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
% 1.93/0.87  % (951726)Will run a generic schedule for satisfiability detection.
% 1.93/0.87  % (951739)dis+10_1_sil=32000:sp=arity:random_seed=78766156:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.93/0.87  % (951737)% WARNING: option uhcvi not known.
% 1.93/0.87  % (951736)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2795451989_2999 on theBenchmark for (2999ds/0Mi)
% 1.93/0.87  % (951740)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1608555916:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.93/0.87  % (951737)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1694692116:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.93/0.87  % (951738)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2965430044:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.93/0.87  % (951741)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=578152629:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.93/0.87  % (951742)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2750216722:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.93/0.87  % TRYING [1]
% 1.93/0.87  % TRYING [2]
% 1.93/0.87  % TRYING [3]
% 1.93/0.87  % TRYING [4]
% 1.93/0.87  % (951739)Instruction limit reached! 
% 1.93/0.87  % (951739)------------------------------
% 1.93/0.87  % (951739)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951739)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951739)Termination reason: Instruction limit
% 1.93/0.87  % (951739)Termination phase: Saturation
% 1.93/0.87  % (951739)Time elapsed: 0.031 s
% 1.93/0.87  % (951739)Peak memory usage: 12 MB
% 1.93/0.87  % (951739)Instructions burned: 106 (million)
% 1.93/0.87  % TRYING [5]
% 1.93/0.87  % (951750)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=795251343:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.93/0.87  % TRYING [1]
% 1.93/0.87  % TRYING [2]
% 1.93/0.87  % TRYING [3]
% 1.93/0.87  % TRYING [4]
% 1.93/0.87  % TRYING [5]
% 1.93/0.87  % (951740)Instruction limit reached! 
% 1.93/0.87  % (951740)------------------------------
% 1.93/0.87  % (951740)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951740)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951740)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951740)Termination reason: Instruction limit
% 1.93/0.87  % (951740)Termination phase: Saturation
% 1.93/0.87  % (951740)Time elapsed: 0.066 s
% 1.93/0.87  % (951740)Peak memory usage: 13 MB
% 1.93/0.87  % (951740)Instructions burned: 116 (million)
% 1.93/0.87  % (951741)Instruction limit reached! 
% 1.93/0.87  % (951741)------------------------------
% 1.93/0.87  % (951741)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951741)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951741)Termination reason: Instruction limit
% 1.93/0.87  % (951741)Termination phase: Saturation
% 1.93/0.87  % (951741)Time elapsed: 0.075 s
% 1.93/0.87  % (951741)Peak memory usage: 13 MB
% 1.93/0.87  % (951741)Instructions burned: 133 (million)
% 1.93/0.87  % (951752)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3682952801:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.93/0.87  % TRYING [6]
% 1.93/0.87  % TRYING [6]
% 1.93/0.87  % (951753)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=2416037373:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.93/0.87  % (951742)Instruction limit reached! 
% 1.93/0.87  % (951742)------------------------------
% 1.93/0.87  % (951742)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951742)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951742)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951742)Termination reason: Instruction limit
% 1.93/0.87  % (951742)Termination phase: Saturation
% 1.93/0.87  % (951742)Time elapsed: 0.097 s
% 1.93/0.87  % (951742)Peak memory usage: 13 MB
% 1.93/0.87  % (951742)Instructions burned: 161 (million)
% 1.93/0.87  % (951756)ott-21_1_sil=16000:fs=off:random_seed=1476114081:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.93/0.87  % (951752)Instruction limit reached! 
% 1.93/0.87  % (951752)------------------------------
% 1.93/0.87  % (951752)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951752)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951752)Termination reason: Instruction limit
% 1.93/0.87  % (951752)Termination phase: Saturation
% 1.93/0.87  % (951752)Time elapsed: 0.084 s
% 1.93/0.87  % (951752)Peak memory usage: 13 MB
% 1.93/0.87  % (951752)Instructions burned: 132 (million)
% 1.93/0.87  % (951758)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=310764333:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.93/0.87  % (951756)Instruction limit reached! 
% 1.93/0.87  % (951756)------------------------------
% 1.93/0.87  % (951756)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951756)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951756)Termination reason: Instruction limit
% 1.93/0.87  % (951756)Termination phase: Saturation
% 1.93/0.87  % (951756)Time elapsed: 0.083 s
% 1.93/0.87  % (951756)Peak memory usage: 12 MB
% 1.93/0.87  % (951756)Instructions burned: 182 (million)
% 1.93/0.87  % (951750)Instruction limit reached! 
% 1.93/0.87  % (951750)------------------------------
% 1.93/0.87  % (951750)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951750)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951750)Termination reason: Instruction limit
% 1.93/0.87  % (951750)Termination phase: Finite model building SAT solving
% 1.93/0.87  % (951750)Time elapsed: 0.174 s
% 1.93/0.87  % (951750)Peak memory usage: 31 MB
% 1.93/0.87  % (951750)Instructions burned: 714 (million)
% 1.93/0.87  % (951765)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2179015394:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.93/0.87  % (951764)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1850070032:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.93/0.87  % TRYING [1]
% 1.93/0.87  % TRYING [2]
% 1.93/0.87  % TRYING [3]
% 1.93/0.87  % TRYING [4]
% 1.93/0.87  % TRYING [5]
% 1.93/0.87  % TRYING [7]
% 1.93/0.87  % (951765) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-951726-951765"...
% 1.93/0.87  % (951765)...printing done.
% 1.93/0.87  % (951765)Refutation found. Thanks to Tanya!
% 1.93/0.87  % SZS status Theorem for theBenchmark
% 1.93/0.87  % SZS output start Proof for theBenchmark
% See solution above
% 1.93/0.87  % (951765)------------------------------
% 1.93/0.87  % (951765)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.93/0.87  % (951765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.93/0.87  % (951765)CaDiCaL version: 2.1.3
% 1.93/0.87  % (951765)Termination reason: Refutation
% 1.93/0.87  % (951765)Time elapsed: 0.175 s
% 1.93/0.87  % (951765)Peak memory usage: 17 MB
% 1.93/0.87  % (951765)Instructions burned: 548 (million)
% 1.93/0.87  % (951726)Success in time 0.434 s
% 1.93/0.87  % Vampire exiting
%------------------------------------------------------------------------------