%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP179-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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 10:17:04 AM UTC 2026
% Result : Unsatisfiable 34.97s 5.59s
% Output : Refutation 34.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 23
% Syntax : Number of formulae : 138 ( 138 unt; 4 def)
% Number of atoms : 138 ( 137 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 : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 104 ( 104 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
fof(f8,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
fof(f9,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).
fof(f10,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
fof(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_1) ).
fof(f18,plain,
identity = inverse(identity),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_2) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_3) ).
fof(f21,negated_conjecture,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p18) ).
fof(f22,definition,
sF0 = inverse(a),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f23,plain,
inverse(a) = sF0,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF1 = least_upper_bound(sF0,identity),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f25,plain,
least_upper_bound(sF0,identity) = sF1,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF2 = greatest_lower_bound(a,identity),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f27,plain,
greatest_lower_bound(a,identity) = sF2,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF3 = inverse(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f29,plain,
inverse(sF2) = sF3,
inference(reorient_equations,[],[f28]) ).
fof(f30,plain,
sF1 != sF3,
inference(definition_folding,[],[f21,f29,f27,f25,f23]) ).
fof(f31,plain,
sF1 = least_upper_bound(identity,sF0),
inference(forward_demodulation,[],[f25,f6]) ).
fof(f32,plain,
sF2 = greatest_lower_bound(identity,a),
inference(forward_demodulation,[],[f27,f5]) ).
fof(f34,plain,
a = inverse(sF0),
inference(superposition,[],[f19,f23]) ).
fof(f35,plain,
sF2 = inverse(sF3),
inference(superposition,[],[f19,f29]) ).
fof(f40,plain,
identity = multiply(sF0,a),
inference(superposition,[],[f3,f23]) ).
fof(f41,plain,
identity = multiply(a,sF0),
inference(superposition,[],[f3,f34]) ).
fof(f42,plain,
identity = multiply(sF3,sF2),
inference(superposition,[],[f3,f29]) ).
fof(f43,plain,
identity = multiply(sF2,sF3),
inference(superposition,[],[f3,f35]) ).
fof(f46,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f47,plain,
identity = least_upper_bound(identity,sF2),
inference(superposition,[],[f11,f32]) ).
fof(f50,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f52,plain,
identity = greatest_lower_bound(identity,sF1),
inference(superposition,[],[f12,f31]) ).
fof(f58,plain,
! [X0] : inverse(multiply(X0,a)) = multiply(sF0,inverse(X0)),
inference(superposition,[],[f20,f23]) ).
fof(f62,plain,
! [X0] : inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[],[f20,f18]) ).
fof(f72,plain,
! [X0] : inverse(X0) = multiply(inverse(X0),identity),
inference(forward_demodulation,[],[f62,f1]) ).
fof(f78,plain,
! [X0] : multiply(identity,X0) = multiply(sF0,multiply(a,X0)),
inference(superposition,[],[f4,f40]) ).
fof(f79,plain,
! [X0] : multiply(identity,X0) = multiply(a,multiply(sF0,X0)),
inference(superposition,[],[f4,f41]) ).
fof(f80,plain,
! [X0] : multiply(identity,X0) = multiply(sF3,multiply(sF2,X0)),
inference(superposition,[],[f4,f42]) ).
fof(f81,plain,
! [X0] : multiply(sF3,multiply(sF2,X0)) = X0,
inference(forward_demodulation,[],[f80,f1]) ).
fof(f82,plain,
! [X0] : multiply(a,multiply(sF0,X0)) = X0,
inference(forward_demodulation,[],[f79,f1]) ).
fof(f83,plain,
! [X0] : multiply(sF0,multiply(a,X0)) = X0,
inference(forward_demodulation,[],[f78,f1]) ).
fof(f89,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f7,f10]) ).
fof(f93,plain,
! [X0] : greatest_lower_bound(identity,greatest_lower_bound(a,X0)) = greatest_lower_bound(sF2,X0),
inference(superposition,[],[f7,f32]) ).
fof(f123,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X0,X1)),
inference(superposition,[],[f8,f9]) ).
fof(f127,plain,
! [X0] : least_upper_bound(identity,least_upper_bound(sF0,X0)) = least_upper_bound(sF1,X0),
inference(superposition,[],[f8,f31]) ).
fof(f137,plain,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X0,X1)),
inference(superposition,[],[f6,f8]) ).
fof(f142,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f72,f19]) ).
fof(f144,plain,
a = multiply(a,identity),
inference(superposition,[],[f72,f34]) ).
fof(f145,plain,
sF3 = multiply(sF3,identity),
inference(superposition,[],[f72,f29]) ).
fof(f151,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f3]) ).
fof(f156,plain,
! [X0] : multiply(sF0,least_upper_bound(a,X0)) = least_upper_bound(identity,multiply(sF0,X0)),
inference(superposition,[],[f13,f40]) ).
fof(f159,plain,
! [X0] : multiply(sF2,least_upper_bound(sF3,X0)) = least_upper_bound(identity,multiply(sF2,X0)),
inference(superposition,[],[f13,f43]) ).
fof(f161,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f177,plain,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X2),multiply(X0,X1)),
inference(superposition,[],[f6,f13]) ).
fof(f186,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f161,f6]) ).
fof(f206,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f14,f142]) ).
fof(f214,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = greatest_lower_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f14,f3]) ).
fof(f241,plain,
! [X0,X1] : greatest_lower_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f214,f5]) ).
fof(f256,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f321,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f332,plain,
! [X0] : multiply(greatest_lower_bound(sF3,X0),sF2) = greatest_lower_bound(identity,multiply(X0,sF2)),
inference(superposition,[],[f16,f42]) ).
fof(f356,plain,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X1,X2),multiply(X0,X2)),
inference(superposition,[],[f5,f16]) ).
fof(f2104,plain,
multiply(least_upper_bound(identity,sF0),a) = least_upper_bound(a,identity),
inference(superposition,[],[f256,f40]) ).
fof(f2139,plain,
least_upper_bound(identity,a) = multiply(least_upper_bound(identity,sF0),a),
inference(forward_demodulation,[],[f2104,f6]) ).
fof(f2155,plain,
least_upper_bound(identity,a) = multiply(sF1,a),
inference(forward_demodulation,[],[f2139,f31]) ).
fof(f2329,plain,
multiply(greatest_lower_bound(identity,a),sF0) = greatest_lower_bound(sF0,identity),
inference(superposition,[],[f321,f41]) ).
fof(f2363,plain,
greatest_lower_bound(identity,sF0) = multiply(greatest_lower_bound(identity,a),sF0),
inference(forward_demodulation,[],[f2329,f5]) ).
fof(f2379,plain,
multiply(sF2,sF0) = greatest_lower_bound(identity,sF0),
inference(forward_demodulation,[],[f2363,f32]) ).
fof(f2823,plain,
identity = least_upper_bound(identity,multiply(sF2,sF0)),
inference(superposition,[],[f11,f2379]) ).
fof(f2836,plain,
identity = multiply(sF2,least_upper_bound(sF3,sF0)),
inference(forward_demodulation,[],[f2823,f159]) ).
fof(f2840,plain,
identity = multiply(sF2,least_upper_bound(sF0,sF3)),
inference(forward_demodulation,[],[f2836,f6]) ).
fof(f3150,plain,
multiply(sF3,identity) = least_upper_bound(sF0,sF3),
inference(superposition,[],[f81,f2840]) ).
fof(f3162,plain,
multiply(least_upper_bound(identity,sF2),least_upper_bound(sF0,sF3)) = least_upper_bound(least_upper_bound(sF0,sF3),identity),
inference(superposition,[],[f256,f2840]) ).
fof(f3169,plain,
multiply(least_upper_bound(identity,sF2),least_upper_bound(sF0,sF3)) = least_upper_bound(sF0,least_upper_bound(sF3,identity)),
inference(forward_demodulation,[],[f3162,f8]) ).
fof(f3179,plain,
sF3 = least_upper_bound(sF0,sF3),
inference(forward_demodulation,[],[f3150,f145]) ).
fof(f3183,plain,
multiply(least_upper_bound(identity,sF2),least_upper_bound(sF0,sF3)) = least_upper_bound(identity,least_upper_bound(sF0,sF3)),
inference(forward_demodulation,[],[f3169,f137]) ).
fof(f3191,plain,
multiply(least_upper_bound(identity,sF2),least_upper_bound(sF0,sF3)) = least_upper_bound(sF1,sF3),
inference(forward_demodulation,[],[f3183,f127]) ).
fof(f3197,plain,
multiply(least_upper_bound(identity,sF2),sF3) = least_upper_bound(sF1,sF3),
inference(forward_demodulation,[],[f3191,f3179]) ).
fof(f3200,plain,
multiply(identity,sF3) = least_upper_bound(sF1,sF3),
inference(forward_demodulation,[],[f3197,f47]) ).
fof(f3202,plain,
sF3 = least_upper_bound(sF1,sF3),
inference(forward_demodulation,[],[f3200,f1]) ).
fof(f3476,plain,
sF1 = greatest_lower_bound(sF1,sF3),
inference(superposition,[],[f12,f3202]) ).
fof(f3664,plain,
! [X0,X1] : multiply(inverse(X0),X0) = least_upper_bound(identity,multiply(inverse(X0),greatest_lower_bound(X1,X0))),
inference(superposition,[],[f151,f46]) ).
fof(f3693,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = multiply(inverse(X0),least_upper_bound(X0,identity)),
inference(superposition,[],[f151,f142]) ).
fof(f3763,plain,
! [X0,X1] : identity = least_upper_bound(identity,multiply(inverse(X0),greatest_lower_bound(X1,X0))),
inference(forward_demodulation,[],[f3664,f3]) ).
fof(f3874,plain,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = multiply(X0,least_upper_bound(X2,X1)),
inference(superposition,[],[f13,f177]) ).
fof(f4075,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(least_upper_bound(X0,X1)),X0)) = multiply(inverse(least_upper_bound(X0,X1)),least_upper_bound(X0,X1)),
inference(superposition,[],[f186,f123]) ).
fof(f4154,plain,
! [X0,X1] : identity = least_upper_bound(identity,multiply(inverse(least_upper_bound(X0,X1)),X0)),
inference(forward_demodulation,[],[f4075,f3]) ).
fof(f4939,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(X0,X1)),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X0,X1)),X0)),
inference(superposition,[],[f241,f89]) ).
fof(f5030,plain,
! [X0,X1] : identity = greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X0,X1)),X0)),
inference(forward_demodulation,[],[f4939,f3]) ).
fof(f5613,plain,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = multiply(greatest_lower_bound(X1,X0),X2),
inference(superposition,[],[f16,f356]) ).
fof(f15981,plain,
identity = least_upper_bound(identity,multiply(inverse(sF1),identity)),
inference(superposition,[],[f3763,f52]) ).
fof(f16092,plain,
identity = multiply(inverse(sF1),least_upper_bound(sF1,identity)),
inference(forward_demodulation,[],[f15981,f151]) ).
fof(f16161,plain,
identity = least_upper_bound(identity,inverse(sF1)),
inference(forward_demodulation,[],[f16092,f3693]) ).
fof(f16228,plain,
inverse(sF1) = greatest_lower_bound(inverse(sF1),identity),
inference(superposition,[],[f50,f16161]) ).
fof(f16252,plain,
inverse(sF1) = greatest_lower_bound(identity,inverse(sF1)),
inference(forward_demodulation,[],[f16228,f5]) ).
fof(f17007,plain,
identity = least_upper_bound(identity,multiply(inverse(multiply(sF1,a)),identity)),
inference(superposition,[],[f4154,f2155]) ).
fof(f17139,plain,
identity = multiply(least_upper_bound(identity,inverse(multiply(sF1,a))),identity),
inference(forward_demodulation,[],[f17007,f256]) ).
fof(f17196,plain,
identity = least_upper_bound(identity,inverse(multiply(sF1,a))),
inference(forward_demodulation,[],[f17139,f142]) ).
fof(f17220,plain,
identity = least_upper_bound(identity,multiply(sF0,inverse(sF1))),
inference(forward_demodulation,[],[f17196,f58]) ).
fof(f17232,plain,
identity = multiply(sF0,least_upper_bound(a,inverse(sF1))),
inference(forward_demodulation,[],[f17220,f156]) ).
fof(f19742,plain,
multiply(a,identity) = least_upper_bound(a,inverse(sF1)),
inference(superposition,[],[f82,f17232]) ).
fof(f19832,plain,
a = least_upper_bound(a,inverse(sF1)),
inference(forward_demodulation,[],[f19742,f144]) ).
fof(f19895,plain,
least_upper_bound(identity,sF0) = multiply(sF0,least_upper_bound(a,identity)),
inference(superposition,[],[f156,f142]) ).
fof(f19959,plain,
least_upper_bound(identity,sF0) = multiply(sF0,least_upper_bound(identity,a)),
inference(forward_demodulation,[],[f19895,f3874]) ).
fof(f19978,plain,
least_upper_bound(identity,sF0) = multiply(sF0,multiply(sF1,a)),
inference(forward_demodulation,[],[f19959,f2155]) ).
fof(f19993,plain,
sF1 = multiply(sF0,multiply(sF1,a)),
inference(forward_demodulation,[],[f19978,f31]) ).
fof(f20011,plain,
inverse(sF1) = greatest_lower_bound(inverse(sF1),a),
inference(superposition,[],[f50,f19832]) ).
fof(f20041,plain,
inverse(sF1) = greatest_lower_bound(a,inverse(sF1)),
inference(forward_demodulation,[],[f20011,f5]) ).
fof(f20167,plain,
multiply(sF1,a) = multiply(a,sF1),
inference(superposition,[],[f82,f19993]) ).
fof(f20203,plain,
multiply(greatest_lower_bound(identity,sF0),multiply(sF1,a)) = greatest_lower_bound(multiply(sF1,a),sF1),
inference(superposition,[],[f321,f19993]) ).
fof(f20225,plain,
multiply(greatest_lower_bound(identity,sF0),multiply(sF1,a)) = greatest_lower_bound(sF1,multiply(sF1,a)),
inference(forward_demodulation,[],[f20203,f5]) ).
fof(f20260,plain,
multiply(greatest_lower_bound(identity,sF0),multiply(sF1,a)) = multiply(sF1,greatest_lower_bound(identity,a)),
inference(forward_demodulation,[],[f20225,f206]) ).
fof(f20279,plain,
multiply(greatest_lower_bound(identity,sF0),multiply(sF1,a)) = multiply(sF1,sF2),
inference(forward_demodulation,[],[f20260,f32]) ).
fof(f20289,plain,
multiply(sF1,sF2) = multiply(greatest_lower_bound(identity,sF0),multiply(a,sF1)),
inference(forward_demodulation,[],[f20279,f20167]) ).
fof(f20298,plain,
multiply(sF1,sF2) = multiply(multiply(sF2,sF0),multiply(a,sF1)),
inference(forward_demodulation,[],[f20289,f2379]) ).
fof(f20304,plain,
multiply(sF1,sF2) = multiply(sF2,multiply(sF0,multiply(a,sF1))),
inference(forward_demodulation,[],[f20298,f4]) ).
fof(f20307,plain,
multiply(sF1,sF2) = multiply(sF2,sF1),
inference(forward_demodulation,[],[f20304,f83]) ).
fof(f20645,plain,
sF1 = multiply(sF3,multiply(sF1,sF2)),
inference(superposition,[],[f81,f20307]) ).
fof(f21769,plain,
greatest_lower_bound(identity,inverse(sF1)) = greatest_lower_bound(sF2,inverse(sF1)),
inference(superposition,[],[f93,f20041]) ).
fof(f21804,plain,
inverse(sF1) = greatest_lower_bound(sF2,inverse(sF1)),
inference(forward_demodulation,[],[f21769,f16252]) ).
fof(f25148,plain,
identity = greatest_lower_bound(identity,multiply(inverse(inverse(sF1)),sF2)),
inference(superposition,[],[f5030,f21804]) ).
fof(f25151,plain,
identity = multiply(greatest_lower_bound(sF3,inverse(inverse(sF1))),sF2),
inference(forward_demodulation,[],[f25148,f332]) ).
fof(f25164,plain,
identity = multiply(greatest_lower_bound(sF3,sF1),sF2),
inference(forward_demodulation,[],[f25151,f19]) ).
fof(f25172,plain,
identity = multiply(greatest_lower_bound(sF1,sF3),sF2),
inference(forward_demodulation,[],[f25164,f5613]) ).
fof(f25177,plain,
identity = multiply(sF1,sF2),
inference(forward_demodulation,[],[f25172,f3476]) ).
fof(f25336,plain,
sF1 = multiply(sF3,identity),
inference(superposition,[],[f20645,f25177]) ).
fof(f25431,plain,
sF1 = sF3,
inference(forward_demodulation,[],[f25336,f142]) ).
fof(f25454,plain,
$false,
inference(forward_subsumption_resolution,[],[f25431,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP179-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 09:41:46 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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
% 15.32/2.61 % (3301071)Will run a generic schedule for satisfiability detection.
% 15.32/2.61 % (3301079)dis+10_1_sil=32000:sp=arity:random_seed=1342007990:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 15.32/2.61 % (3301077)% WARNING: option uhcvi not known.
% 15.32/2.61 % (3301078)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2223444802:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 15.32/2.61 % (3301077)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2866602317:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 15.32/2.61 % (3301076)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4246694758_2999 on theBenchmark for (2999ds/0Mi)
% 15.32/2.61 % (3301080)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=832684863:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 15.32/2.61 % (3301081)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=912768411:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 15.32/2.61 % (3301082)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2884272128:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 15.32/2.61 % TRYING [1]
% 15.32/2.61 % TRYING [2]
% 15.32/2.61 % TRYING [3]
% 15.32/2.61 % TRYING [4]
% 15.32/2.61 % (3301079)Instruction limit reached!
% 15.32/2.61 % (3301079)------------------------------
% 15.32/2.61 % (3301079)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.32/2.61 % (3301079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.32/2.61 % (3301079)CaDiCaL version: 2.1.3
% 15.32/2.61 % (3301079)Termination reason: Instruction limit
% 15.32/2.61 % (3301079)Termination phase: Saturation
% 15.32/2.61 % (3301079)Time elapsed: 0.032 s
% 15.32/2.61 % (3301079)Peak memory usage: 12 MB
% 15.32/2.61 % (3301079)Instructions burned: 106 (million)
% 15.32/2.61 % (3301090)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4234856124:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 15.32/2.61 % TRYING [1]
% 15.32/2.61 % TRYING [2]
% 15.32/2.61 % TRYING [3]
% 15.32/2.61 % TRYING [5]
% 15.32/2.61 % TRYING [4]
% 15.32/2.61 % TRYING [5]
% 15.32/2.61 % (3301080)Instruction limit reached!
% 15.32/2.61 % (3301080)------------------------------
% 15.32/2.61 % (3301080)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.32/2.61 % (3301080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.32/2.61 % (3301080)CaDiCaL version: 2.1.3
% 15.32/2.61 % (3301080)Termination reason: Instruction limit
% 15.32/2.61 % (3301080)Termination phase: Saturation
% 15.32/2.61 % (3301080)Time elapsed: 0.068 s
% 15.32/2.61 % (3301080)Peak memory usage: 12 MB
% 15.32/2.61 % (3301080)Instructions burned: 116 (million)
% 15.32/2.61 % (3301081)Instruction limit reached!
% 15.32/2.61 % (3301081)------------------------------
% 15.32/2.61 % (3301081)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.32/2.61 % (3301081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.32/2.61 % (3301081)CaDiCaL version: 2.1.3
% 15.32/2.61 % (3301081)Termination reason: Instruction limit
% 15.32/2.61 % (3301081)Termination phase: Saturation
% 15.32/2.61 % (3301081)Time elapsed: 0.076 s
% 15.32/2.61 % (3301081)Peak memory usage: 12 MB
% 15.32/2.61 % (3301081)Instructions burned: 131 (million)
% 15.32/2.61 % (3301092)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3962225249:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 15.32/2.61 % (3301082)Instruction limit reached!
% 15.32/2.61 % (3301082)------------------------------
% 15.32/2.61 % (3301082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.32/2.61 % (3301082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.32/2.61 % (3301082)CaDiCaL version: 2.1.3
% 15.32/2.61 % (3301082)Termination reason: Instruction limit
% 15.32/2.61 % (3301082)Termination phase: Saturation
% 15.32/2.61 % (3301082)Time elapsed: 0.096 s
% 15.32/2.61 % (3301082)Peak memory usage: 13 MB
% 15.32/2.61 % (3301082)Instructions burned: 159 (million)
% 15.32/2.61 % (3301093)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=198650723:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 15.32/2.61 % (3301095)ott-21_1_sil=16000:fs=off:random_seed=3346511698:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 15.32/2.61 % TRYING [6]
% 15.32/2.61 % TRYING [6]
% 15.32/2.61 % (3301092)Instruction limit reached!
% 15.32/2.61 % (3301092)------------------------------
% 15.32/2.61 % (3301092)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.58 % (3301092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.58 % (3301092)CaDiCaL version: 2.1.3
% 34.97/5.58 % (3301092)Termination reason: Instruction limit
% 34.97/5.58 % (3301092)Termination phase: Saturation
% 34.97/5.58 % (3301092)Time elapsed: 0.085 s
% 34.97/5.58 % (3301092)Peak memory usage: 13 MB
% 34.97/5.58 % (3301092)Instructions burned: 131 (million)
% 34.97/5.58 % (3301090)Instruction limit reached!
% 34.97/5.58 % (3301090)------------------------------
% 34.97/5.58 % (3301090)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.58 % (3301090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.58 % (3301090)CaDiCaL version: 2.1.3
% 34.97/5.58 % (3301090)Termination reason: Instruction limit
% 34.97/5.58 % (3301090)Termination phase: Finite model building constraint generation
% 34.97/5.58 % (3301090)Time elapsed: 0.150 s
% 34.97/5.58 % (3301090)Peak memory usage: 36 MB
% 34.97/5.58 % (3301090)Instructions burned: 714 (million)
% 34.97/5.58 % (3301095)Instruction limit reached!
% 34.97/5.58 % (3301095)------------------------------
% 34.97/5.58 % (3301095)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.58 % (3301095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.58 % (3301095)CaDiCaL version: 2.1.3
% 34.97/5.58 % (3301095)Termination reason: Instruction limit
% 34.97/5.58 % (3301095)Termination phase: Saturation
% 34.97/5.58 % (3301095)Time elapsed: 0.079 s
% 34.97/5.58 % (3301095)Peak memory usage: 11 MB
% 34.97/5.58 % (3301095)Instructions burned: 180 (million)
% 34.97/5.58 % (3301098)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3328057974:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 34.97/5.58 % (3301099)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3233543517:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 34.97/5.58 % TRYING [1]
% 34.97/5.58 % TRYING [2]
% 34.97/5.58 % TRYING [3]
% 34.97/5.58 % TRYING [4]
% 34.97/5.58 % (3301100)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=939996049:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 34.97/5.58 % TRYING [5]
% 34.97/5.58 % TRYING [6]
% 34.97/5.58 % (3301099)Instruction limit reached!
% 34.97/5.58 % (3301099)------------------------------
% 34.97/5.58 % (3301099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.58 % (3301099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.58 % (3301099)CaDiCaL version: 2.1.3
% 34.97/5.58 % (3301099)Termination reason: Instruction limit
% 34.97/5.58 % (3301099)Termination phase: Finite model building constraint generation
% 34.97/5.58 % (3301099)Time elapsed: 0.175 s
% 34.97/5.58 % (3301099)Peak memory usage: 22 MB
% 34.97/5.58 % (3301099)Instructions burned: 866 (million)
% 34.97/5.58 % (3301104)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3547211314:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 34.97/5.58 % (3301098)Instruction limit reached!
% 34.97/5.58 % (3301098)------------------------------
% 34.97/5.58 % (3301098)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.58 % (3301098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.58 % (3301098)CaDiCaL version: 2.1.3
% 34.97/5.58 % (3301098)Termination reason: Instruction limit
% 34.97/5.58 % (3301098)Termination phase: Saturation
% 34.97/5.58 % (3301098)Time elapsed: 0.258 s
% 34.97/5.58 % (3301098)Peak memory usage: 15 MB
% 34.97/5.58 % (3301098)Instructions burned: 477 (million)
% 34.97/5.58 % (3301093)Instruction limit reached!
% 34.97/5.58 % (3301093)------------------------------
% 34.97/5.58 % (3301093)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.58 % (3301093)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.58 % (3301093)CaDiCaL version: 2.1.3
% 34.97/5.58 % (3301093)Termination reason: Instruction limit
% 34.97/5.58 % (3301093)Termination phase: Saturation
% 34.97/5.58 % (3301093)Time elapsed: 0.360 s
% 34.97/5.58 % (3301093)Peak memory usage: 17 MB
% 34.97/5.58 % (3301093)Instructions burned: 684 (million)
% 34.97/5.58 % (3301106)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=2622517164:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 34.97/5.58 % (3301107)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2499523057:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 34.97/5.58 % TRYING [14]
% 34.97/5.59 % TRYING [7]
% 34.97/5.59 % (3301104)Instruction limit reached!
% 34.97/5.59 % (3301104)------------------------------
% 34.97/5.59 % (3301104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301104)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301104)Termination reason: Instruction limit
% 34.97/5.59 % (3301104)Termination phase: Finite model building constraint generation
% 34.97/5.59 % (3301104)Time elapsed: 0.208 s
% 34.97/5.59 % (3301104)Peak memory usage: 92 MB
% 34.97/5.59 % (3301104)Instructions burned: 892 (million)
% 34.97/5.59 % (3301110)fmb+10_1_sil=64000:random_seed=3886637149:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 34.97/5.59 % TRYING [1]
% 34.97/5.59 % TRYING [2]
% 34.97/5.59 % TRYING [3]
% 34.97/5.59 % TRYING [4]
% 34.97/5.59 % TRYING [5]
% 34.97/5.59 % TRYING [6]
% 34.97/5.59 % (3301106)Instruction limit reached!
% 34.97/5.59 % (3301106)------------------------------
% 34.97/5.59 % (3301106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301106)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301106)Termination reason: Instruction limit
% 34.97/5.59 % (3301106)Termination phase: Saturation
% 34.97/5.59 % (3301106)Time elapsed: 0.400 s
% 34.97/5.59 % (3301106)Peak memory usage: 18 MB
% 34.97/5.59 % (3301106)Instructions burned: 692 (million)
% 34.97/5.59 % (3301112)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=342071376:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 34.97/5.59 % TRYING [20]
% 34.97/5.59 % (3301100)Instruction limit reached!
% 34.97/5.59 % (3301100)------------------------------
% 34.97/5.59 % (3301100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301100)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301100)Termination reason: Instruction limit
% 34.97/5.59 % (3301100)Termination phase: Saturation
% 34.97/5.59 % (3301100)Time elapsed: 0.707 s
% 34.97/5.59 % (3301100)Peak memory usage: 25 MB
% 34.97/5.59 % (3301100)Instructions burned: 1180 (million)
% 34.97/5.59 % (3301114)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=860858078:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 34.97/5.59 % TRYING [8]
% 34.97/5.59 % (3301107)Instruction limit reached!
% 34.97/5.59 % (3301107)------------------------------
% 34.97/5.59 % (3301107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301107)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301107)Termination reason: Instruction limit
% 34.97/5.59 % (3301107)Termination phase: Saturation
% 34.97/5.59 % (3301107)Time elapsed: 0.468 s
% 34.97/5.59 % (3301107)Peak memory usage: 19 MB
% 34.97/5.59 % (3301107)Instructions burned: 880 (million)
% 34.97/5.59 % (3301116)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=909060965:i=5131_2990 on theBenchmark for (2990ds/5131Mi)
% 34.97/5.59 % TRYING [7]
% 34.97/5.59 % (3301114)Instruction limit reached!
% 34.97/5.59 % (3301114)------------------------------
% 34.97/5.59 % (3301114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301114)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301114)Termination reason: Instruction limit
% 34.97/5.59 % (3301114)Termination phase: Finite model building constraint generation
% 34.97/5.59 % (3301114)Time elapsed: 0.348 s
% 34.97/5.59 % (3301114)Peak memory usage: 73 MB
% 34.97/5.59 % (3301114)Instructions burned: 920 (million)
% 34.97/5.59 % (3301118)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2872626271:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 34.97/5.59 % TRYING [8]
% 34.97/5.59 % (3301118)Instruction limit reached!
% 34.97/5.59 % (3301118)------------------------------
% 34.97/5.59 % (3301118)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301118)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301118)Termination reason: Instruction limit
% 34.97/5.59 % (3301118)Termination phase: Saturation
% 34.97/5.59 % (3301118)Time elapsed: 0.798 s
% 34.97/5.59 % (3301118)Peak memory usage: 32 MB
% 34.97/5.59 % (3301118)Instructions burned: 1473 (million)
% 34.97/5.59 % (3301120)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=235184714:i=6324_2978 on theBenchmark for (2978ds/6324Mi)
% 34.97/5.59 % TRYING [77]
% 34.97/5.59 % TRYING [8]
% 34.97/5.59 % TRYING [9]
% 34.97/5.59 % (3301116)Instruction limit reached!
% 34.97/5.59 % (3301116)------------------------------
% 34.97/5.59 % (3301116)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301116)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301116)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301116)Termination reason: Instruction limit
% 34.97/5.59 % (3301116)Termination phase: Saturation
% 34.97/5.59 % (3301116)Time elapsed: 2.840 s
% 34.97/5.59 % (3301116)Peak memory usage: 52 MB
% 34.97/5.59 % (3301116)Instructions burned: 5132 (million)
% 34.97/5.59 % (3301122)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3471480869:fmbsr=2.30978:i=2174_2961 on theBenchmark for (2961ds/2174Mi)
% 34.97/5.59 % TRYING [16]
% 34.97/5.59 % (3301112)Instruction limit reached!
% 34.97/5.59 % (3301112)------------------------------
% 34.97/5.59 % (3301112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301112)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301112)Termination reason: Instruction limit
% 34.97/5.59 % (3301112)Termination phase: Finite model building constraint generation
% 34.97/5.59 % (3301112)Time elapsed: 3.512 s
% 34.97/5.59 % (3301112)Peak memory usage: 668 MB
% 34.97/5.59 % (3301112)Instructions burned: 9516 (million)
% 34.97/5.59 % (3301120)Instruction limit reached!
% 34.97/5.59 % (3301120)------------------------------
% 34.97/5.59 % (3301120)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301120)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301120)Termination reason: Instruction limit
% 34.97/5.59 % (3301120)Termination phase: Finite model building constraint generation
% 34.97/5.59 % (3301120)Time elapsed: 2.360 s
% 34.97/5.59 % (3301120)Peak memory usage: 515 MB
% 34.97/5.59 % (3301120)Instructions burned: 6325 (million)
% 34.97/5.59 % (3301124)ott-2_1_sil=16000:newcnf=on:random_seed=1544678553:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2954 on theBenchmark for (2954ds/869Mi)
% 34.97/5.59 % (3301122)Instruction limit reached!
% 34.97/5.59 % (3301122)------------------------------
% 34.97/5.59 % (3301122)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301122)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301122)Termination reason: Instruction limit
% 34.97/5.59 % (3301122)Termination phase: Finite model building constraint generation
% 34.97/5.59 % (3301122)Time elapsed: 0.735 s
% 34.97/5.59 % (3301122)Peak memory usage: 132 MB
% 34.97/5.59 % (3301122)Instructions burned: 2174 (million)
% 34.97/5.59 % (3301126)ott+10_1_sil=32000:tgt=ground:random_seed=2481843218:i=5114:av=off_2953 on theBenchmark for (2953ds/5114Mi)
% 34.97/5.59 % (3301128)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1290265112:i=54282_2953 on theBenchmark for (2953ds/54282Mi)
% 34.97/5.59 % TRYING [1]
% 34.97/5.59 % TRYING [2]
% 34.97/5.59 % TRYING [3]
% 34.97/5.59 % TRYING [4]
% 34.97/5.59 % TRYING [5]
% 34.97/5.59 % TRYING [6]
% 34.97/5.59 % (3301124)Instruction limit reached!
% 34.97/5.59 % (3301124)------------------------------
% 34.97/5.59 % (3301124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301124)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301124)Termination reason: Instruction limit
% 34.97/5.59 % (3301124)Termination phase: Saturation
% 34.97/5.59 % (3301124)Time elapsed: 0.533 s
% 34.97/5.59 % (3301124)Peak memory usage: 21 MB
% 34.97/5.59 % (3301124)Instructions burned: 869 (million)
% 34.97/5.59 % (3301130)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=183927153:i=3512:aac=none_2949 on theBenchmark for (2949ds/3512Mi)
% 34.97/5.59 % (3301126) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3301071-3301126"...
% 34.97/5.59 % (3301126)...printing done.
% 34.97/5.59 % (3301126)Refutation found. Thanks to Tanya!
% 34.97/5.59 % SZS status Unsatisfiable for theBenchmark
% 34.97/5.59 % SZS output start Proof for theBenchmark
% See solution above
% 34.97/5.59 % (3301126)------------------------------
% 34.97/5.59 % (3301126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 34.97/5.59 % (3301126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 34.97/5.59 % (3301126)CaDiCaL version: 2.1.3
% 34.97/5.59 % (3301126)Termination reason: Refutation
% 34.97/5.59 % (3301126)Time elapsed: 0.508 s
% 34.97/5.59 % (3301126)Peak memory usage: 22 MB
% 34.97/5.59 % (3301126)Instructions burned: 850 (million)
% 34.97/5.59 % (3301071)Success in time 5.16 s
% 34.97/5.59 % Vampire exiting
%------------------------------------------------------------------------------