%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP179-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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 17.08s 6.42s
% Output : Refutation 17.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 21
% Syntax : Number of formulae : 129 ( 129 unt; 5 def)
% Number of atoms : 129 ( 128 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 121 ( 121 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
fof(f9,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).
fof(f10,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,negated_conjecture,
inverse(least_upper_bound(a,b)) != greatest_lower_bound(inverse(a),inverse(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p10) ).
fof(f18,definition,
sF0 = least_upper_bound(a,b),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f19,plain,
least_upper_bound(a,b) = sF0,
inference(reorient_equations,[],[f18]) ).
fof(f20,definition,
sF1 = inverse(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f21,plain,
inverse(sF0) = sF1,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF2 = inverse(a),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f23,plain,
inverse(a) = sF2,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF3 = inverse(b),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f25,plain,
inverse(b) = sF3,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF4 = greatest_lower_bound(sF2,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f27,plain,
greatest_lower_bound(sF2,sF3) = sF4,
inference(reorient_equations,[],[f26]) ).
fof(f28,plain,
sF1 != sF4,
inference(definition_folding,[],[f17,f27,f25,f23,f21,f19]) ).
fof(f29,plain,
identity = multiply(sF1,sF0),
inference(superposition,[],[f3,f21]) ).
fof(f30,plain,
identity = multiply(sF2,a),
inference(superposition,[],[f3,f23]) ).
fof(f31,plain,
identity = multiply(sF3,b),
inference(superposition,[],[f3,f25]) ).
fof(f34,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f35,plain,
sF2 = least_upper_bound(sF2,sF4),
inference(superposition,[],[f11,f27]) ).
fof(f38,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f40,plain,
a = greatest_lower_bound(a,sF0),
inference(superposition,[],[f12,f19]) ).
fof(f45,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f54,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f45,f1]) ).
fof(f59,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(least_upper_bound(X0,X1),X0),
inference(superposition,[],[f34,f12]) ).
fof(f60,plain,
sF3 = least_upper_bound(sF3,sF4),
inference(superposition,[],[f34,f27]) ).
fof(f61,plain,
sF0 = least_upper_bound(sF0,a),
inference(superposition,[],[f34,f40]) ).
fof(f63,plain,
sF0 = least_upper_bound(a,sF0),
inference(forward_demodulation,[],[f61,f6]) ).
fof(f64,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X0,X1)),
inference(forward_demodulation,[],[f59,f6]) ).
fof(f65,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f7,f10]) ).
fof(f71,plain,
! [X0] : greatest_lower_bound(sF2,greatest_lower_bound(sF3,X0)) = greatest_lower_bound(sF4,X0),
inference(superposition,[],[f7,f27]) ).
fof(f87,plain,
! [X2,X0,X1] : least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[],[f8,f6]) ).
fof(f91,plain,
! [X0] : least_upper_bound(a,least_upper_bound(b,X0)) = least_upper_bound(sF0,X0),
inference(superposition,[],[f8,f19]) ).
fof(f99,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X1))),
inference(superposition,[],[f9,f8]) ).
fof(f116,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f120,plain,
! [X0] : multiply(sF1,least_upper_bound(X0,sF0)) = least_upper_bound(multiply(sF1,X0),identity),
inference(superposition,[],[f13,f29]) ).
fof(f130,plain,
! [X0] : least_upper_bound(identity,multiply(sF1,X0)) = multiply(sF1,least_upper_bound(X0,sF0)),
inference(forward_demodulation,[],[f120,f6]) ).
fof(f134,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f116,f6]) ).
fof(f149,plain,
b = greatest_lower_bound(b,sF0),
inference(superposition,[],[f38,f19]) ).
fof(f152,plain,
sF4 = greatest_lower_bound(sF4,sF3),
inference(superposition,[],[f38,f60]) ).
fof(f159,plain,
sF4 = greatest_lower_bound(sF3,sF4),
inference(forward_demodulation,[],[f152,f5]) ).
fof(f171,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = greatest_lower_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f14,f3]) ).
fof(f191,plain,
! [X0,X1] : greatest_lower_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f171,f5]) ).
fof(f200,plain,
sF0 = least_upper_bound(sF0,b),
inference(superposition,[],[f34,f149]) ).
fof(f202,plain,
sF0 = least_upper_bound(b,sF0),
inference(forward_demodulation,[],[f200,f6]) ).
fof(f206,plain,
! [X0] : multiply(least_upper_bound(sF2,X0),a) = least_upper_bound(identity,multiply(X0,a)),
inference(superposition,[],[f15,f30]) ).
fof(f207,plain,
! [X0] : multiply(least_upper_bound(sF3,X0),b) = least_upper_bound(identity,multiply(X0,b)),
inference(superposition,[],[f15,f31]) ).
fof(f210,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(multiply(X0,X1),identity),
inference(superposition,[],[f15,f3]) ).
fof(f211,plain,
! [X2,X3,X0,X1] : multiply(least_upper_bound(X3,multiply(X0,X1)),X2) = least_upper_bound(multiply(X3,X2),multiply(X0,multiply(X1,X2))),
inference(superposition,[],[f15,f4]) ).
fof(f225,plain,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X1,X2),multiply(X0,X2)),
inference(superposition,[],[f6,f15]) ).
fof(f233,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[],[f210,f6]) ).
fof(f246,plain,
! [X2,X3,X0,X1] : multiply(greatest_lower_bound(X3,multiply(X0,X1)),X2) = greatest_lower_bound(multiply(X3,X2),multiply(X0,multiply(X1,X2))),
inference(superposition,[],[f16,f4]) ).
fof(f277,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f54,f3]) ).
fof(f279,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f54,f54]) ).
fof(f280,plain,
a = multiply(inverse(sF2),identity),
inference(superposition,[],[f54,f30]) ).
fof(f295,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f277,f279]) ).
fof(f347,plain,
! [X0] : greatest_lower_bound(sF4,X0) = greatest_lower_bound(sF2,greatest_lower_bound(X0,sF3)),
inference(superposition,[],[f71,f5]) ).
fof(f472,plain,
a = inverse(sF2),
inference(superposition,[],[f295,f280]) ).
fof(f550,plain,
identity = multiply(a,sF2),
inference(superposition,[],[f3,f472]) ).
fof(f655,plain,
! [X0] : multiply(a,least_upper_bound(sF2,X0)) = least_upper_bound(identity,multiply(a,X0)),
inference(superposition,[],[f13,f550]) ).
fof(f878,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,least_upper_bound(X1,X0))),
inference(superposition,[],[f9,f87]) ).
fof(f888,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f878,f64]) ).
fof(f1765,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(X0,inverse(X1))),least_upper_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f54,f233]) ).
fof(f2878,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(least_upper_bound(X1,least_upper_bound(X0,X1))),X0)) = multiply(inverse(least_upper_bound(X1,least_upper_bound(X0,X1))),least_upper_bound(X0,X1)),
inference(superposition,[],[f134,f99]) ).
fof(f2950,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(forward_demodulation,[],[f2878,f888]) ).
fof(f2973,plain,
! [X0,X1] : identity = least_upper_bound(identity,multiply(inverse(least_upper_bound(X0,X1)),X0)),
inference(forward_demodulation,[],[f2950,f3]) ).
fof(f3466,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,[],[f191,f65]) ).
fof(f3550,plain,
! [X0,X1] : identity = greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X0,X1)),X0)),
inference(forward_demodulation,[],[f3466,f3]) ).
fof(f3752,plain,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = multiply(least_upper_bound(X1,X0),X2),
inference(superposition,[],[f15,f225]) ).
fof(f4978,plain,
! [X0,X1] : least_upper_bound(multiply(X0,sF0),multiply(X1,identity)) = multiply(least_upper_bound(X0,multiply(X1,sF1)),sF0),
inference(superposition,[],[f211,f29]) ).
fof(f5055,plain,
! [X0,X1] : least_upper_bound(multiply(X0,sF0),X1) = multiply(least_upper_bound(X0,multiply(X1,sF1)),sF0),
inference(forward_demodulation,[],[f4978,f295]) ).
fof(f5831,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,b),multiply(X1,identity)) = multiply(greatest_lower_bound(X0,multiply(X1,sF3)),b),
inference(superposition,[],[f246,f31]) ).
fof(f5911,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,b),X1) = multiply(greatest_lower_bound(X0,multiply(X1,sF3)),b),
inference(forward_demodulation,[],[f5831,f295]) ).
fof(f6563,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f295,f279]) ).
fof(f6581,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f6563,f295]) ).
fof(f14144,plain,
multiply(sF1,least_upper_bound(a,sF0)) = multiply(least_upper_bound(sF2,sF1),a),
inference(superposition,[],[f130,f206]) ).
fof(f14191,plain,
multiply(sF1,least_upper_bound(a,sF0)) = multiply(least_upper_bound(sF1,sF2),a),
inference(forward_demodulation,[],[f14144,f3752]) ).
fof(f14218,plain,
multiply(sF1,sF0) = multiply(least_upper_bound(sF1,sF2),a),
inference(forward_demodulation,[],[f14191,f63]) ).
fof(f14234,plain,
identity = multiply(least_upper_bound(sF1,sF2),a),
inference(forward_demodulation,[],[f14218,f29]) ).
fof(f14258,plain,
a = multiply(inverse(least_upper_bound(sF1,sF2)),identity),
inference(superposition,[],[f54,f14234]) ).
fof(f14310,plain,
a = inverse(least_upper_bound(sF1,sF2)),
inference(forward_demodulation,[],[f14258,f295]) ).
fof(f14370,plain,
multiply(sF1,least_upper_bound(b,sF0)) = multiply(least_upper_bound(sF3,sF1),b),
inference(superposition,[],[f130,f207]) ).
fof(f14417,plain,
multiply(sF1,least_upper_bound(b,sF0)) = multiply(least_upper_bound(sF1,sF3),b),
inference(forward_demodulation,[],[f14370,f3752]) ).
fof(f14445,plain,
multiply(sF1,sF0) = multiply(least_upper_bound(sF1,sF3),b),
inference(forward_demodulation,[],[f14417,f202]) ).
fof(f14463,plain,
identity = multiply(least_upper_bound(sF1,sF3),b),
inference(forward_demodulation,[],[f14445,f29]) ).
fof(f14496,plain,
inverse(a) = least_upper_bound(sF1,sF2),
inference(superposition,[],[f6581,f14310]) ).
fof(f14497,plain,
sF2 = least_upper_bound(sF1,sF2),
inference(forward_demodulation,[],[f14496,f23]) ).
fof(f14643,plain,
sF1 = greatest_lower_bound(sF1,sF2),
inference(superposition,[],[f12,f14497]) ).
fof(f15012,plain,
b = multiply(inverse(least_upper_bound(sF1,sF3)),identity),
inference(superposition,[],[f54,f14463]) ).
fof(f15064,plain,
b = inverse(least_upper_bound(sF1,sF3)),
inference(forward_demodulation,[],[f15012,f295]) ).
fof(f15273,plain,
inverse(b) = least_upper_bound(sF1,sF3),
inference(superposition,[],[f6581,f15064]) ).
fof(f15274,plain,
sF3 = least_upper_bound(sF1,sF3),
inference(forward_demodulation,[],[f15273,f25]) ).
fof(f15431,plain,
sF1 = greatest_lower_bound(sF1,sF3),
inference(superposition,[],[f12,f15274]) ).
fof(f15599,plain,
greatest_lower_bound(sF2,sF1) = greatest_lower_bound(sF4,sF1),
inference(superposition,[],[f347,f15431]) ).
fof(f15631,plain,
greatest_lower_bound(sF2,sF1) = greatest_lower_bound(sF1,sF4),
inference(forward_demodulation,[],[f15599,f5]) ).
fof(f15636,plain,
greatest_lower_bound(sF1,sF2) = greatest_lower_bound(sF1,sF4),
inference(forward_demodulation,[],[f15631,f5]) ).
fof(f15638,plain,
sF1 = greatest_lower_bound(sF1,sF4),
inference(forward_demodulation,[],[f15636,f14643]) ).
fof(f15784,plain,
sF4 = least_upper_bound(sF4,sF1),
inference(superposition,[],[f34,f15638]) ).
fof(f15812,plain,
sF4 = least_upper_bound(sF1,sF4),
inference(forward_demodulation,[],[f15784,f6]) ).
fof(f61642,plain,
! [X0] : multiply(identity,sF0) = least_upper_bound(multiply(identity,sF0),inverse(least_upper_bound(sF1,X0))),
inference(superposition,[],[f5055,f2973]) ).
fof(f61762,plain,
! [X0] : sF0 = least_upper_bound(sF0,inverse(least_upper_bound(sF1,X0))),
inference(forward_demodulation,[],[f61642,f1]) ).
fof(f61888,plain,
sF0 = least_upper_bound(sF0,inverse(sF4)),
inference(superposition,[],[f61762,f15812]) ).
fof(f64571,plain,
! [X0] : multiply(identity,b) = greatest_lower_bound(multiply(identity,b),inverse(greatest_lower_bound(sF3,X0))),
inference(superposition,[],[f5911,f3550]) ).
fof(f64697,plain,
! [X0] : b = greatest_lower_bound(b,inverse(greatest_lower_bound(sF3,X0))),
inference(forward_demodulation,[],[f64571,f1]) ).
fof(f64823,plain,
b = greatest_lower_bound(b,inverse(sF4)),
inference(superposition,[],[f64697,f159]) ).
fof(f65244,plain,
inverse(sF4) = least_upper_bound(inverse(sF4),b),
inference(superposition,[],[f34,f64823]) ).
fof(f65312,plain,
inverse(sF4) = least_upper_bound(b,inverse(sF4)),
inference(forward_demodulation,[],[f65244,f6]) ).
fof(f65951,plain,
least_upper_bound(sF0,inverse(sF4)) = least_upper_bound(a,inverse(sF4)),
inference(superposition,[],[f91,f65312]) ).
fof(f66018,plain,
sF0 = least_upper_bound(a,inverse(sF4)),
inference(forward_demodulation,[],[f65951,f61888]) ).
fof(f66668,plain,
sF4 = multiply(inverse(sF0),least_upper_bound(identity,multiply(a,sF4))),
inference(superposition,[],[f1765,f66018]) ).
fof(f66745,plain,
sF4 = multiply(inverse(sF0),multiply(a,least_upper_bound(sF2,sF4))),
inference(forward_demodulation,[],[f66668,f655]) ).
fof(f66760,plain,
sF4 = multiply(inverse(sF0),multiply(a,sF2)),
inference(forward_demodulation,[],[f66745,f35]) ).
fof(f66768,plain,
sF4 = multiply(inverse(sF0),identity),
inference(forward_demodulation,[],[f66760,f550]) ).
fof(f66770,plain,
inverse(sF0) = sF4,
inference(forward_demodulation,[],[f66768,f295]) ).
fof(f66771,plain,
sF1 = sF4,
inference(forward_demodulation,[],[f66770,f21]) ).
fof(f66772,plain,
$false,
inference(forward_subsumption_resolution,[],[f66771,f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP179-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n017.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:31:20 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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
% 16.23/2.78 % (2286631)Will run a generic schedule for satisfiability detection.
% 16.23/2.78 % (2286641)% WARNING: option uhcvi not known.
% 16.23/2.78 % (2286640)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1308979260_3000 on theBenchmark for (3000ds/0Mi)
% 16.23/2.78 % (2286642)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1876312032:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 16.23/2.78 % (2286643)dis+10_1_sil=32000:sp=arity:random_seed=1370659771:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 16.23/2.78 % TRYING [1]
% 16.23/2.78 % (2286645)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=772622945:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 16.23/2.78 % TRYING [2]
% 16.23/2.78 % (2286646)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3771283571:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 16.23/2.78 % (2286641)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1420514924:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 16.23/2.78 % (2286644)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2032120239:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 16.23/2.78 % TRYING [3]
% 16.23/2.78 % TRYING [4]
% 16.23/2.78 % TRYING [5]
% 16.23/2.78 % (2286643)Instruction limit reached!
% 16.23/2.78 % (2286643)------------------------------
% 16.23/2.78 % (2286643)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.23/2.78 % (2286643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.23/2.78 % (2286643)CaDiCaL version: 2.1.3
% 16.23/2.78 % (2286643)Termination reason: Instruction limit
% 16.23/2.78 % (2286643)Termination phase: Saturation
% 16.23/2.78 % (2286643)Time elapsed: 0.061 s
% 16.23/2.78 % (2286643)Peak memory usage: 12 MB
% 16.23/2.78 % (2286643)Instructions burned: 105 (million)
% 16.23/2.78 % (2286644)Instruction limit reached!
% 16.23/2.78 % (2286644)------------------------------
% 16.23/2.78 % (2286644)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.23/2.78 % (2286644)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.23/2.78 % (2286644)CaDiCaL version: 2.1.3
% 16.23/2.78 % (2286644)Termination reason: Instruction limit
% 16.23/2.78 % (2286644)Termination phase: Saturation
% 16.23/2.78 % (2286644)Time elapsed: 0.070 s
% 16.23/2.78 % (2286644)Peak memory usage: 12 MB
% 16.23/2.78 % (2286644)Instructions burned: 117 (million)
% 16.23/2.78 % TRYING [6]
% 16.23/2.78 % (2286669)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2147265223:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 16.23/2.78 % (2286645)Instruction limit reached!
% 16.23/2.78 % (2286645)------------------------------
% 16.23/2.78 % (2286645)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.23/2.78 % (2286645)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.23/2.78 % (2286645)CaDiCaL version: 2.1.3
% 16.23/2.78 % (2286645)Termination reason: Instruction limit
% 16.23/2.78 % (2286645)Termination phase: Saturation
% 16.23/2.78 % (2286645)Time elapsed: 0.082 s
% 16.23/2.78 % (2286645)Peak memory usage: 12 MB
% 16.23/2.78 % (2286645)Instructions burned: 131 (million)
% 16.23/2.78 % TRYING [1]
% 16.23/2.78 % TRYING [2]
% 16.23/2.78 % TRYING [3]
% 16.23/2.78 % (2286670)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1763861353:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 16.23/2.78 % TRYING [4]
% 16.23/2.78 % (2286646)Instruction limit reached!
% 16.23/2.78 % (2286646)------------------------------
% 16.23/2.78 % (2286646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.23/2.78 % (2286646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.23/2.78 % (2286646)CaDiCaL version: 2.1.3
% 16.23/2.78 % (2286646)Termination reason: Instruction limit
% 16.23/2.78 % (2286646)Termination phase: Saturation
% 16.23/2.78 % (2286646)Time elapsed: 0.098 s
% 16.23/2.78 % (2286646)Peak memory usage: 12 MB
% 16.23/2.78 % (2286646)Instructions burned: 159 (million)
% 16.23/2.78 % (2286672)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=2918053093:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 16.23/2.78 % (2286674)ott-21_1_sil=16000:fs=off:random_seed=2095276676:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 16.23/2.78 % TRYING [5]
% 16.23/2.78 % (2286670)Instruction limit reached!
% 16.23/2.78 % (2286670)------------------------------
% 16.23/2.78 % (2286670)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286670)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286670)Termination reason: Instruction limit
% 17.08/6.42 % (2286670)Termination phase: Saturation
% 17.08/6.42 % (2286670)Time elapsed: 0.088 s
% 17.08/6.42 % (2286670)Peak memory usage: 12 MB
% 17.08/6.42 % (2286670)Instructions burned: 132 (million)
% 17.08/6.42 % (2286674)Instruction limit reached!
% 17.08/6.42 % (2286674)------------------------------
% 17.08/6.42 % (2286674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286674)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286674)Termination reason: Instruction limit
% 17.08/6.42 % (2286674)Termination phase: Saturation
% 17.08/6.42 % (2286674)Time elapsed: 0.076 s
% 17.08/6.42 % (2286674)Peak memory usage: 11 MB
% 17.08/6.42 % (2286674)Instructions burned: 182 (million)
% 17.08/6.42 % (2286677)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1061848083:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 17.08/6.42 % (2286678)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2663462211:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 17.08/6.42 % TRYING [1]
% 17.08/6.42 % TRYING [2]
% 17.08/6.42 % TRYING [3]
% 17.08/6.42 % TRYING [4]
% 17.08/6.42 % TRYING [6]
% 17.08/6.42 % TRYING [5]
% 17.08/6.42 % (2286669)Instruction limit reached!
% 17.08/6.42 % (2286669)------------------------------
% 17.08/6.42 % (2286669)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286669)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286669)Termination reason: Instruction limit
% 17.08/6.42 % (2286669)Termination phase: Finite model building constraint generation
% 17.08/6.42 % (2286669)Time elapsed: 0.286 s
% 17.08/6.42 % (2286669)Peak memory usage: 31 MB
% 17.08/6.42 % (2286669)Instructions burned: 717 (million)
% 17.08/6.42 % (2286681)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1499220951:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 17.08/6.42 % TRYING [7]
% 17.08/6.42 % (2286677)Instruction limit reached!
% 17.08/6.42 % (2286677)------------------------------
% 17.08/6.42 % (2286677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286677)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286677)Termination reason: Instruction limit
% 17.08/6.42 % (2286677)Termination phase: Saturation
% 17.08/6.42 % (2286677)Time elapsed: 0.257 s
% 17.08/6.42 % (2286677)Peak memory usage: 15 MB
% 17.08/6.42 % (2286677)Instructions burned: 478 (million)
% 17.08/6.42 % (2286672)Instruction limit reached!
% 17.08/6.42 % (2286672)------------------------------
% 17.08/6.42 % (2286672)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286672)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286672)Termination reason: Instruction limit
% 17.08/6.42 % (2286672)Termination phase: Saturation
% 17.08/6.42 % (2286672)Time elapsed: 0.362 s
% 17.08/6.42 % (2286672)Peak memory usage: 17 MB
% 17.08/6.42 % (2286672)Instructions burned: 685 (million)
% 17.08/6.42 % (2286683)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=832073061:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 17.08/6.42 % (2286684)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=2892226239:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 17.08/6.42 % TRYING [6]
% 17.08/6.42 % (2286678)Instruction limit reached!
% 17.08/6.42 % (2286678)------------------------------
% 17.08/6.42 % (2286678)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286678)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286678)Termination reason: Instruction limit
% 17.08/6.42 % (2286678)Termination phase: Finite model building constraint generation
% 17.08/6.42 % (2286678)Time elapsed: 0.327 s
% 17.08/6.42 % (2286678)Peak memory usage: 21 MB
% 17.08/6.42 % (2286678)Instructions burned: 866 (million)
% 17.08/6.42 % (2286687)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1093264268:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 17.08/6.42 % TRYING [14]
% 17.08/6.42 % (2286683)Instruction limit reached!
% 17.08/6.42 % (2286683)------------------------------
% 17.08/6.42 % (2286683)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286683)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286683)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286683)Termination reason: Instruction limit
% 17.08/6.42 % (2286683)Termination phase: Finite model building constraint generation
% 17.08/6.42 % (2286683)Time elapsed: 0.378 s
% 17.08/6.42 % (2286683)Peak memory usage: 93 MB
% 17.08/6.42 % (2286683)Instructions burned: 892 (million)
% 17.08/6.42 % (2286689)fmb+10_1_sil=64000:random_seed=4150892564:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 17.08/6.42 % TRYING [1]
% 17.08/6.42 % TRYING [2]
% 17.08/6.42 % (2286684)Instruction limit reached!
% 17.08/6.42 % (2286684)------------------------------
% 17.08/6.42 % (2286684)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286684)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286684)Termination reason: Instruction limit
% 17.08/6.42 % (2286684)Termination phase: Saturation
% 17.08/6.42 % (2286684)Time elapsed: 0.408 s
% 17.08/6.42 % (2286684)Peak memory usage: 18 MB
% 17.08/6.42 % (2286684)Instructions burned: 692 (million)
% 17.08/6.42 % TRYING [3]
% 17.08/6.42 % (2286691)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3854117514:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 17.08/6.42 % TRYING [20]
% 17.08/6.42 % TRYING [4]
% 17.08/6.42 % TRYING [5]
% 17.08/6.42 % (2286687)Instruction limit reached!
% 17.08/6.42 % (2286687)------------------------------
% 17.08/6.42 % (2286687)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286687)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286687)Termination reason: Instruction limit
% 17.08/6.42 % (2286687)Termination phase: Saturation
% 17.08/6.42 % (2286687)Time elapsed: 0.470 s
% 17.08/6.42 % (2286687)Peak memory usage: 19 MB
% 17.08/6.42 % (2286687)Instructions burned: 880 (million)
% 17.08/6.42 % (2286693)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2183330899:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 17.08/6.42 % TRYING [8]
% 17.08/6.42 % (2286681)Instruction limit reached!
% 17.08/6.42 % (2286681)------------------------------
% 17.08/6.42 % (2286681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286681)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286681)Termination reason: Instruction limit
% 17.08/6.42 % (2286681)Termination phase: Saturation
% 17.08/6.42 % (2286681)Time elapsed: 0.669 s
% 17.08/6.42 % (2286681)Peak memory usage: 24 MB
% 17.08/6.42 % (2286681)Instructions burned: 1180 (million)
% 17.08/6.42 % (2286695)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=165333967:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 17.08/6.42 % TRYING [6]
% 17.08/6.42 % (2286693)Instruction limit reached!
% 17.08/6.42 % (2286693)------------------------------
% 17.08/6.42 % (2286693)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286693)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286693)Termination reason: Instruction limit
% 17.08/6.42 % (2286693)Termination phase: Finite model building constraint generation
% 17.08/6.42 % (2286693)Time elapsed: 0.347 s
% 17.08/6.42 % (2286693)Peak memory usage: 73 MB
% 17.08/6.42 % (2286693)Instructions burned: 922 (million)
% 17.08/6.42 % (2286697)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3359541245:i=1472:ins=7:fdi=8:gsp=on_2985 on theBenchmark for (2985ds/1472Mi)
% 17.08/6.42 % TRYING [7]
% 17.08/6.42 % TRYING [8]
% 17.08/6.42 % (2286697)Instruction limit reached!
% 17.08/6.42 % (2286697)------------------------------
% 17.08/6.42 % (2286697)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286697)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286697)Termination reason: Instruction limit
% 17.08/6.42 % (2286697)Termination phase: Saturation
% 17.08/6.42 % (2286697)Time elapsed: 0.890 s
% 17.08/6.42 % (2286697)Peak memory usage: 34 MB
% 17.08/6.42 % (2286697)Instructions burned: 1473 (million)
% 17.08/6.42 % (2286699)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2465808974:i=6324_2976 on theBenchmark for (2976ds/6324Mi)
% 17.08/6.42 % TRYING [77]
% 17.08/6.42 % (2286695)Instruction limit reached!
% 17.08/6.42 % (2286695)------------------------------
% 17.08/6.42 % (2286695)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286695)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286695)Termination reason: Instruction limit
% 17.08/6.42 % (2286695)Termination phase: Saturation
% 17.08/6.42 % (2286695)Time elapsed: 2.750 s
% 17.08/6.42 % (2286695)Peak memory usage: 50 MB
% 17.08/6.42 % (2286695)Instructions burned: 5131 (million)
% 17.08/6.42 % (2286701)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2486711718:fmbsr=2.30978:i=2174_2961 on theBenchmark for (2961ds/2174Mi)
% 17.08/6.42 % TRYING [16]
% 17.08/6.42 % TRYING [8]
% 17.08/6.42 % (2286691)Instruction limit reached!
% 17.08/6.42 % (2286691)------------------------------
% 17.08/6.42 % (2286691)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286691)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286691)Termination reason: Instruction limit
% 17.08/6.42 % (2286691)Termination phase: Finite model building constraint generation
% 17.08/6.42 % (2286691)Time elapsed: 3.482 s
% 17.08/6.42 % (2286691)Peak memory usage: 667 MB
% 17.08/6.42 % (2286691)Instructions burned: 9515 (million)
% 17.08/6.42 % (2286703)ott-2_1_sil=16000:newcnf=on:random_seed=3391162264:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2954 on theBenchmark for (2954ds/869Mi)
% 17.08/6.42 % (2286701)Instruction limit reached!
% 17.08/6.42 % (2286701)------------------------------
% 17.08/6.42 % (2286701)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286701)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286701)Termination reason: Instruction limit
% 17.08/6.42 % (2286701)Termination phase: Finite model building constraint generation
% 17.08/6.42 % (2286701)Time elapsed: 0.732 s
% 17.08/6.42 % (2286701)Peak memory usage: 132 MB
% 17.08/6.42 % (2286701)Instructions burned: 2175 (million)
% 17.08/6.42 % (2286705)ott+10_1_sil=32000:tgt=ground:random_seed=2640350621:i=5114:av=off_2953 on theBenchmark for (2953ds/5114Mi)
% 17.08/6.42 % (2286699)Instruction limit reached!
% 17.08/6.42 % (2286699)------------------------------
% 17.08/6.42 % (2286699)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286699)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286699)Termination reason: Instruction limit
% 17.08/6.42 % (2286699)Termination phase: Finite model building constraint generation
% 17.08/6.42 % (2286699)Time elapsed: 2.329 s
% 17.08/6.42 % (2286699)Peak memory usage: 420 MB
% 17.08/6.42 % (2286699)Instructions burned: 6325 (million)
% 17.08/6.42 % (2286707)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3159782496:i=54282_2952 on theBenchmark for (2952ds/54282Mi)
% 17.08/6.42 % TRYING [1]
% 17.08/6.42 % TRYING [2]
% 17.08/6.42 % TRYING [3]
% 17.08/6.42 % TRYING [4]
% 17.08/6.42 % TRYING [5]
% 17.08/6.42 % TRYING [6]
% 17.08/6.42 % (2286703)Instruction limit reached!
% 17.08/6.42 % (2286703)------------------------------
% 17.08/6.42 % (2286703)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286703)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286703)Termination reason: Instruction limit
% 17.08/6.42 % (2286703)Termination phase: Saturation
% 17.08/6.42 % (2286703)Time elapsed: 0.536 s
% 17.08/6.42 % (2286703)Peak memory usage: 21 MB
% 17.08/6.42 % (2286703)Instructions burned: 870 (million)
% 17.08/6.42 % (2286709)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1666864176:i=3512:aac=none_2949 on theBenchmark for (2949ds/3512Mi)
% 17.08/6.42 % TRYING [7]
% 17.08/6.42 % (2286705) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2286631-2286705"...
% 17.08/6.42 % (2286705)...printing done.
% 17.08/6.42 % (2286705)Refutation found. Thanks to Tanya!
% 17.08/6.42 % SZS status Unsatisfiable for theBenchmark
% 17.08/6.42 % SZS output start Proof for theBenchmark
% See solution above
% 17.08/6.42 % (2286705)------------------------------
% 17.08/6.42 % (2286705)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.08/6.42 % (2286705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/6.42 % (2286705)CaDiCaL version: 2.1.3
% 17.08/6.42 % (2286705)Termination reason: Refutation
% 17.08/6.42 % (2286705)Time elapsed: 1.325 s
% 17.08/6.42 % (2286705)Peak memory usage: 37 MB
% 17.08/6.42 % (2286705)Instructions burned: 2241 (million)
% 17.08/6.42 % (2286631)Success in time 5.998 s
% 17.08/6.42 % Vampire exiting
%------------------------------------------------------------------------------