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

% Computer : n007.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:51 AM UTC 2026

% Result   : Theorem 2.20s 0.83s
% Output   : Refutation 2.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   20
% Syntax   : Number of formulae    :  124 ( 124 unt;   4 def)
%            Number of atoms       :  124 ( 123 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   10 (  10   ~;   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    :   13 (  13 usr;   7 con; 0-2 aty)
%            Number of variables   :  100 (  99   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

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

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

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

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

fof(f13,axiom,
    ! [X0] : multiplication(antidomain(X0),X0) = zero,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).

fof(f14,axiom,
    ! [X0,X1] : addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1))))) = antidomain(multiplication(X0,antidomain(antidomain(X1)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain2) ).

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

fof(f16,axiom,
    ! [X0] : domain(X0) = antidomain(antidomain(X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).

fof(f17,axiom,
    ! [X0] : multiplication(X0,coantidomain(X0)) = zero,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain1) ).

fof(f19,axiom,
    ! [X0] : addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain3) ).

fof(f20,axiom,
    ! [X0] : codomain(X0) = coantidomain(coantidomain(X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain4) ).

fof(f21,conjecture,
    ! [X0] : domain(codomain(X0)) = codomain(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f22,negated_conjecture,
    ~ ! [X0] : domain(codomain(X0)) = codomain(X0),
    inference(negated_conjecture,[status(cth)],[f21]) ).

fof(f23,plain,
    ? [X0] : codomain(X0) != domain(codomain(X0)),
    inference(ennf_transformation,[],[f22]) ).

fof(f24,plain,
    codomain(sK0) != domain(codomain(sK0)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f23]) ).

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

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

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

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

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

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

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

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

fof(f36,plain,
    ! [X0] : zero = multiplication(antidomain(X0),X0),
    inference(cnf_transformation,[],[f13]) ).

fof(f37,plain,
    ! [X0,X1] : antidomain(multiplication(X0,antidomain(antidomain(X1)))) = addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1))))),
    inference(cnf_transformation,[],[f14]) ).

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

fof(f39,plain,
    ! [X0] : antidomain(antidomain(X0)) = domain(X0),
    inference(cnf_transformation,[],[f16]) ).

fof(f40,plain,
    ! [X0] : zero = multiplication(X0,coantidomain(X0)),
    inference(cnf_transformation,[],[f17]) ).

fof(f42,plain,
    ! [X0] : one = addition(coantidomain(coantidomain(X0)),coantidomain(X0)),
    inference(cnf_transformation,[],[f19]) ).

fof(f43,plain,
    ! [X0] : coantidomain(coantidomain(X0)) = codomain(X0),
    inference(cnf_transformation,[],[f20]) ).

fof(f44,plain,
    codomain(sK0) != domain(codomain(sK0)),
    inference(cnf_transformation,[],[f24]) ).

fof(f45,plain,
    coantidomain(coantidomain(sK0)) != antidomain(antidomain(coantidomain(coantidomain(sK0)))),
    inference(definition_unfolding,[],[f44,f43,f39,f43]) ).

fof(f46,definition,
    sF1 = coantidomain(sK0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f47,plain,
    coantidomain(sK0) = sF1,
    inference(reorient_equations,[],[f46]) ).

fof(f48,definition,
    sF2 = coantidomain(sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f49,plain,
    coantidomain(sF1) = sF2,
    inference(reorient_equations,[],[f48]) ).

fof(f50,definition,
    sF3 = antidomain(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f51,plain,
    antidomain(sF2) = sF3,
    inference(reorient_equations,[],[f50]) ).

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

fof(f53,plain,
    antidomain(sF3) = sF4,
    inference(reorient_equations,[],[f52]) ).

fof(f54,plain,
    sF2 != sF4,
    inference(definition_folding,[],[f45,f53,f51,f49,f47,f49,f47]) ).

fof(f55,plain,
    sF3 = antidomain(coantidomain(sF1)),
    inference(forward_demodulation,[],[f51,f49]) ).

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

fof(f57,plain,
    coantidomain(sF1) != antidomain(sF3),
    inference(forward_demodulation,[],[f56,f49]) ).

fof(f58,plain,
    zero = multiplication(sF3,coantidomain(sF1)),
    inference(superposition,[],[f36,f55]) ).

fof(f60,plain,
    zero = antidomain(one),
    inference(superposition,[],[f30,f36]) ).

fof(f68,plain,
    ! [X0] : addition(zero,X0) = X0,
    inference(superposition,[],[f27,f25]) ).

fof(f70,plain,
    one = addition(antidomain(sF3),sF3),
    inference(superposition,[],[f38,f55]) ).

fof(f71,plain,
    one = addition(antidomain(zero),zero),
    inference(superposition,[],[f38,f60]) ).

fof(f75,plain,
    ! [X0] : one = addition(antidomain(X0),antidomain(antidomain(X0))),
    inference(superposition,[],[f25,f38]) ).

fof(f76,plain,
    one = antidomain(zero),
    inference(forward_demodulation,[],[f71,f27]) ).

fof(f77,plain,
    one = addition(sF3,antidomain(sF3)),
    inference(forward_demodulation,[],[f70,f25]) ).

fof(f82,plain,
    one = addition(coantidomain(sF1),sF1),
    inference(superposition,[],[f42,f47]) ).

fof(f89,plain,
    one = addition(sF1,coantidomain(sF1)),
    inference(forward_demodulation,[],[f82,f25]) ).

fof(f95,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
    inference(superposition,[],[f26,f28]) ).

fof(f108,plain,
    ! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X2,addition(X0,X1)),
    inference(superposition,[],[f25,f26]) ).

fof(f145,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,antidomain(antidomain(X1))),multiplication(X0,antidomain(X1))),
    inference(superposition,[],[f32,f38]) ).

fof(f146,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,coantidomain(coantidomain(X1))),multiplication(X0,coantidomain(X1))),
    inference(superposition,[],[f32,f42]) ).

fof(f163,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,coantidomain(X1)),multiplication(X0,coantidomain(coantidomain(X1)))),
    inference(forward_demodulation,[],[f146,f25]) ).

fof(f164,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,antidomain(X1)),multiplication(X0,antidomain(antidomain(X1)))),
    inference(forward_demodulation,[],[f145,f25]) ).

fof(f173,plain,
    ! [X0,X1] : addition(multiplication(X0,coantidomain(X1)),multiplication(X0,coantidomain(coantidomain(X1)))) = X0,
    inference(forward_demodulation,[],[f163,f30]) ).

fof(f174,plain,
    ! [X0,X1] : addition(multiplication(X0,antidomain(X1)),multiplication(X0,antidomain(antidomain(X1)))) = X0,
    inference(forward_demodulation,[],[f164,f30]) ).

fof(f189,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(antidomain(antidomain(X0)),X1),multiplication(antidomain(X0),X1)),
    inference(superposition,[],[f33,f38]) ).

fof(f190,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(coantidomain(coantidomain(X0)),X1),multiplication(coantidomain(X0),X1)),
    inference(superposition,[],[f33,f42]) ).

fof(f207,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(coantidomain(X0),X1),multiplication(coantidomain(coantidomain(X0)),X1)),
    inference(forward_demodulation,[],[f190,f25]) ).

fof(f208,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(antidomain(X0),X1),multiplication(antidomain(antidomain(X0)),X1)),
    inference(forward_demodulation,[],[f189,f25]) ).

fof(f217,plain,
    ! [X0,X1] : addition(multiplication(coantidomain(X0),X1),multiplication(coantidomain(coantidomain(X0)),X1)) = X1,
    inference(forward_demodulation,[],[f207,f31]) ).

fof(f218,plain,
    ! [X0,X1] : addition(multiplication(antidomain(X0),X1),multiplication(antidomain(antidomain(X0)),X1)) = X1,
    inference(forward_demodulation,[],[f208,f31]) ).

fof(f246,plain,
    ! [X0] : antidomain(multiplication(X0,antidomain(sF3))) = addition(antidomain(multiplication(X0,coantidomain(sF1))),antidomain(multiplication(X0,antidomain(sF3)))),
    inference(superposition,[],[f37,f55]) ).

fof(f264,plain,
    ! [X0] : antidomain(multiplication(X0,antidomain(sF3))) = addition(antidomain(multiplication(X0,antidomain(sF3))),antidomain(multiplication(X0,coantidomain(sF1)))),
    inference(forward_demodulation,[],[f246,f25]) ).

fof(f446,plain,
    ! [X0] : one = addition(antidomain(X0),one),
    inference(superposition,[],[f95,f75]) ).

fof(f450,plain,
    one = addition(sF1,one),
    inference(superposition,[],[f95,f89]) ).

fof(f451,plain,
    one = addition(sF3,one),
    inference(superposition,[],[f95,f77]) ).

fof(f462,plain,
    one = addition(one,sF3),
    inference(forward_demodulation,[],[f451,f25]) ).

fof(f463,plain,
    one = addition(one,sF1),
    inference(forward_demodulation,[],[f450,f25]) ).

fof(f466,plain,
    ! [X0] : one = addition(one,antidomain(X0)),
    inference(forward_demodulation,[],[f446,f25]) ).

fof(f470,plain,
    ! [X0] : multiplication(one,X0) = addition(multiplication(one,X0),multiplication(sF3,X0)),
    inference(superposition,[],[f33,f462]) ).

fof(f474,plain,
    ! [X0] : addition(X0,multiplication(sF3,X0)) = X0,
    inference(forward_demodulation,[],[f470,f31]) ).

fof(f536,plain,
    ! [X0] : multiplication(one,X0) = addition(multiplication(one,X0),multiplication(sF1,X0)),
    inference(superposition,[],[f33,f463]) ).

fof(f540,plain,
    ! [X0] : addition(X0,multiplication(sF1,X0)) = X0,
    inference(forward_demodulation,[],[f536,f31]) ).

fof(f1237,plain,
    ! [X0] : addition(zero,multiplication(X0,coantidomain(coantidomain(X0)))) = X0,
    inference(superposition,[],[f173,f40]) ).

fof(f1243,plain,
    sF3 = addition(zero,multiplication(sF3,coantidomain(coantidomain(sF1)))),
    inference(superposition,[],[f173,f58]) ).

fof(f1274,plain,
    sF3 = multiplication(sF3,coantidomain(coantidomain(sF1))),
    inference(forward_demodulation,[],[f1243,f68]) ).

fof(f1279,plain,
    ! [X0] : multiplication(X0,coantidomain(coantidomain(X0))) = X0,
    inference(forward_demodulation,[],[f1237,f68]) ).

fof(f1412,plain,
    ! [X0] : coantidomain(coantidomain(coantidomain(X0))) = addition(multiplication(coantidomain(X0),coantidomain(coantidomain(coantidomain(X0)))),zero),
    inference(superposition,[],[f217,f40]) ).

fof(f1428,plain,
    ! [X0] : coantidomain(coantidomain(coantidomain(X0))) = multiplication(coantidomain(X0),coantidomain(coantidomain(coantidomain(X0)))),
    inference(forward_demodulation,[],[f1412,f27]) ).

fof(f1443,plain,
    ! [X0] : coantidomain(X0) = coantidomain(coantidomain(coantidomain(X0))),
    inference(forward_demodulation,[],[f1428,f1279]) ).

fof(f1468,plain,
    ! [X0] : addition(zero,multiplication(antidomain(antidomain(X0)),X0)) = X0,
    inference(superposition,[],[f218,f36]) ).

fof(f1519,plain,
    ! [X0] : multiplication(antidomain(antidomain(X0)),X0) = X0,
    inference(forward_demodulation,[],[f1468,f68]) ).

fof(f1536,plain,
    sF1 = coantidomain(coantidomain(sF1)),
    inference(superposition,[],[f1443,f47]) ).

fof(f1579,plain,
    sF3 = multiplication(sF3,sF1),
    inference(superposition,[],[f1274,f1536]) ).

fof(f1634,plain,
    sF1 = addition(sF1,sF3),
    inference(superposition,[],[f474,f1579]) ).

fof(f2074,plain,
    ! [X0] : addition(sF1,X0) = addition(sF1,addition(sF3,X0)),
    inference(superposition,[],[f26,f1634]) ).

fof(f2080,plain,
    ! [X0] : addition(X0,sF1) = addition(sF1,addition(sF3,X0)),
    inference(superposition,[],[f108,f1634]) ).

fof(f2711,plain,
    antidomain(multiplication(sF1,antidomain(sF3))) = addition(antidomain(multiplication(sF1,antidomain(sF3))),antidomain(zero)),
    inference(superposition,[],[f264,f40]) ).

fof(f2749,plain,
    antidomain(multiplication(sF1,antidomain(sF3))) = addition(antidomain(zero),antidomain(multiplication(sF1,antidomain(sF3)))),
    inference(forward_demodulation,[],[f2711,f25]) ).

fof(f2765,plain,
    antidomain(multiplication(sF1,antidomain(sF3))) = addition(one,antidomain(multiplication(sF1,antidomain(sF3)))),
    inference(forward_demodulation,[],[f2749,f76]) ).

fof(f2771,plain,
    one = antidomain(multiplication(sF1,antidomain(sF3))),
    inference(forward_demodulation,[],[f2765,f466]) ).

fof(f2995,plain,
    coantidomain(sF1) = multiplication(antidomain(sF3),coantidomain(sF1)),
    inference(superposition,[],[f1519,f55]) ).

fof(f3011,plain,
    ! [X0] : antidomain(antidomain(antidomain(X0))) = addition(antidomain(X0),multiplication(antidomain(antidomain(antidomain(X0))),antidomain(antidomain(X0)))),
    inference(superposition,[],[f174,f1519]) ).

fof(f3022,plain,
    ! [X0] : antidomain(antidomain(antidomain(X0))) = addition(antidomain(X0),zero),
    inference(forward_demodulation,[],[f3011,f36]) ).

fof(f3035,plain,
    ! [X0] : antidomain(X0) = antidomain(antidomain(antidomain(X0))),
    inference(forward_demodulation,[],[f3022,f27]) ).

fof(f3126,plain,
    zero = multiplication(one,multiplication(sF1,antidomain(sF3))),
    inference(superposition,[],[f36,f2771]) ).

fof(f3150,plain,
    zero = multiplication(sF1,antidomain(sF3)),
    inference(forward_demodulation,[],[f3126,f31]) ).

fof(f3251,plain,
    sF1 = addition(zero,multiplication(sF1,antidomain(antidomain(sF3)))),
    inference(superposition,[],[f174,f3150]) ).

fof(f3260,plain,
    sF1 = multiplication(sF1,antidomain(antidomain(sF3))),
    inference(forward_demodulation,[],[f3251,f68]) ).

fof(f3457,plain,
    sF3 = antidomain(antidomain(sF3)),
    inference(superposition,[],[f3035,f55]) ).

fof(f4393,plain,
    antidomain(antidomain(sF3)) = addition(antidomain(antidomain(sF3)),sF1),
    inference(superposition,[],[f540,f3260]) ).

fof(f4427,plain,
    antidomain(antidomain(sF3)) = addition(sF1,addition(sF3,antidomain(antidomain(sF3)))),
    inference(forward_demodulation,[],[f4393,f2080]) ).

fof(f4442,plain,
    antidomain(antidomain(sF3)) = addition(sF1,antidomain(antidomain(sF3))),
    inference(forward_demodulation,[],[f4427,f2074]) ).

fof(f4445,plain,
    sF3 = addition(sF1,sF3),
    inference(forward_demodulation,[],[f4442,f3457]) ).

fof(f4446,plain,
    sF1 = sF3,
    inference(forward_demodulation,[],[f4445,f1634]) ).

fof(f10812,plain,
    antidomain(sF3) = addition(coantidomain(sF1),multiplication(antidomain(sF3),coantidomain(coantidomain(sF1)))),
    inference(superposition,[],[f173,f2995]) ).

fof(f10865,plain,
    antidomain(sF3) = addition(coantidomain(sF1),multiplication(antidomain(sF3),sF1)),
    inference(forward_demodulation,[],[f10812,f1536]) ).

fof(f10884,plain,
    antidomain(sF1) = addition(coantidomain(sF1),multiplication(antidomain(sF1),sF1)),
    inference(forward_demodulation,[],[f10865,f4446]) ).

fof(f10893,plain,
    antidomain(sF1) = addition(coantidomain(sF1),zero),
    inference(forward_demodulation,[],[f10884,f36]) ).

fof(f10898,plain,
    coantidomain(sF1) = antidomain(sF1),
    inference(forward_demodulation,[],[f10893,f27]) ).

fof(f11078,plain,
    antidomain(sF3) != antidomain(sF1),
    inference(superposition,[],[f57,f10898]) ).

fof(f11122,plain,
    antidomain(sF1) != antidomain(sF1),
    inference(forward_demodulation,[],[f11078,f4446]) ).

fof(f11123,plain,
    $false,
    inference(trivial_inequality_removal,[],[f11122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE091+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n007.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 13:07:40 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.20/0.83  % (1402960)Will run a generic schedule for satisfiability detection.
% 2.20/0.83  % (1402971)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3787861741:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.20/0.83  % (1402968)dis+10_1_sil=32000:sp=arity:random_seed=1148239161:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.20/0.83  % (1402967)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=882897335:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.20/0.83  % (1402965)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1251492990_2999 on theBenchmark for (2999ds/0Mi)
% 2.20/0.83  % (1402969)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3993714446:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.20/0.83  % (1402970)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2955543020:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.20/0.83  % TRYING [1]
% 2.20/0.83  % TRYING [2]
% 2.20/0.83  % TRYING [3]
% 2.20/0.83  % (1402966)% WARNING: option uhcvi not known.
% 2.20/0.83  % (1402966)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3857145803:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.20/0.83  % TRYING [4]
% 2.20/0.83  % TRYING [5]
% 2.20/0.83  % (1402971)Instruction limit reached! 
% 2.20/0.83  % (1402971)------------------------------
% 2.20/0.83  % (1402971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402971)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402971)Termination reason: Instruction limit
% 2.20/0.83  % (1402971)Termination phase: Saturation
% 2.20/0.83  % (1402971)Time elapsed: 0.051 s
% 2.20/0.83  % (1402971)Peak memory usage: 12 MB
% 2.20/0.83  % (1402971)Instructions burned: 160 (million)
% 2.20/0.83  % (1402979)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4205674552:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.20/0.83  % TRYING [1]
% 2.20/0.83  % TRYING [2]
% 2.20/0.83  % (1402968)Instruction limit reached! 
% 2.20/0.83  % (1402968)------------------------------
% 2.20/0.83  % (1402968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402968)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402968)Termination reason: Instruction limit
% 2.20/0.83  % (1402968)Termination phase: Saturation
% 2.20/0.83  % (1402968)Time elapsed: 0.059 s
% 2.20/0.83  % (1402968)Peak memory usage: 12 MB
% 2.20/0.83  % (1402968)Instructions burned: 104 (million)
% 2.20/0.83  % TRYING [3]
% 2.20/0.83  % TRYING [4]
% 2.20/0.83  % (1402969)Instruction limit reached! 
% 2.20/0.83  % (1402969)------------------------------
% 2.20/0.83  % (1402969)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402969)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402969)Termination reason: Instruction limit
% 2.20/0.83  % (1402969)Termination phase: Saturation
% 2.20/0.83  % (1402969)Time elapsed: 0.068 s
% 2.20/0.83  % (1402969)Peak memory usage: 13 MB
% 2.20/0.83  % (1402969)Instructions burned: 117 (million)
% 2.20/0.83  % TRYING [5]
% 2.20/0.83  % (1402970)Instruction limit reached! 
% 2.20/0.83  % (1402970)------------------------------
% 2.20/0.83  % (1402970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402970)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402970)Termination reason: Instruction limit
% 2.20/0.83  % (1402970)Termination phase: Saturation
% 2.20/0.83  % (1402970)Time elapsed: 0.076 s
% 2.20/0.83  % (1402970)Peak memory usage: 13 MB
% 2.20/0.83  % (1402970)Instructions burned: 132 (million)
% 2.20/0.83  % (1402981)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1087040615:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.20/0.83  % (1402982)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=3458787897:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.20/0.83  % TRYING [6]
% 2.20/0.83  % (1402983)ott-21_1_sil=16000:fs=off:random_seed=3622824836:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.20/0.83  % TRYING [6]
% 2.20/0.83  % (1402981)Instruction limit reached! 
% 2.20/0.83  % (1402981)------------------------------
% 2.20/0.83  % (1402981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402981)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402981)Termination reason: Instruction limit
% 2.20/0.83  % (1402981)Termination phase: Saturation
% 2.20/0.83  % (1402981)Time elapsed: 0.088 s
% 2.20/0.83  % (1402981)Peak memory usage: 13 MB
% 2.20/0.83  % (1402981)Instructions burned: 132 (million)
% 2.20/0.83  % (1402983)Instruction limit reached! 
% 2.20/0.83  % (1402983)------------------------------
% 2.20/0.83  % (1402983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402983)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402983)Termination reason: Instruction limit
% 2.20/0.83  % (1402983)Termination phase: Saturation
% 2.20/0.83  % (1402983)Time elapsed: 0.080 s
% 2.20/0.83  % (1402983)Peak memory usage: 12 MB
% 2.20/0.83  % (1402983)Instructions burned: 183 (million)
% 2.20/0.83  % (1402987)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2896566946:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.20/0.83  % (1402988)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=844155834:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.20/0.83  % TRYING [1]
% 2.20/0.83  % TRYING [2]
% 2.20/0.83  % TRYING [3]
% 2.20/0.83  % TRYING [4]
% 2.20/0.83  % (1402979)Instruction limit reached! 
% 2.20/0.83  % (1402979)------------------------------
% 2.20/0.83  % (1402979)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402979)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402979)Termination reason: Instruction limit
% 2.20/0.83  % (1402979)Termination phase: Finite model building constraint generation
% 2.20/0.83  % (1402979)Time elapsed: 0.163 s
% 2.20/0.83  % (1402979)Peak memory usage: 35 MB
% 2.20/0.83  % (1402979)Instructions burned: 716 (million)
% 2.20/0.83  % (1402991)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=859414192:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.20/0.83  % TRYING [7]
% 2.20/0.83  % TRYING [5]
% 2.20/0.83  % (1402991) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1402960-1402991"...
% 2.20/0.83  % (1402991)...printing done.
% 2.20/0.83  % (1402991)Refutation found. Thanks to Tanya!
% 2.20/0.83  % SZS status Theorem for theBenchmark
% 2.20/0.83  % SZS output start Proof for theBenchmark
% See solution above
% 2.20/0.83  % (1402991)------------------------------
% 2.20/0.83  % (1402991)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.83  % (1402991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.83  % (1402991)CaDiCaL version: 2.1.3
% 2.20/0.83  % (1402991)Termination reason: Refutation
% 2.20/0.83  % (1402991)Time elapsed: 0.137 s
% 2.20/0.83  % (1402991)Peak memory usage: 16 MB
% 2.20/0.83  % (1402991)Instructions burned: 462 (million)
% 2.20/0.83  % (1402960)Success in time 0.406 s
% 2.20/0.83  % Vampire exiting
%------------------------------------------------------------------------------