%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP179-2 : 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 : n015.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 18.04s 8.05s
% Output : Refutation 18.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 19
% Syntax : Number of formulae : 123 ( 123 unt; 4 def)
% Number of atoms : 123 ( 122 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 : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 113 ( 113 !; 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(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,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p18) ).
fof(f18,definition,
sF0 = inverse(a),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f19,plain,
inverse(a) = sF0,
inference(reorient_equations,[],[f18]) ).
fof(f20,definition,
sF1 = least_upper_bound(sF0,identity),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f21,plain,
least_upper_bound(sF0,identity) = sF1,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF2 = greatest_lower_bound(a,identity),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f23,plain,
greatest_lower_bound(a,identity) = sF2,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF3 = inverse(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f25,plain,
inverse(sF2) = sF3,
inference(reorient_equations,[],[f24]) ).
fof(f26,plain,
sF1 != sF3,
inference(definition_folding,[],[f17,f25,f23,f21,f19]) ).
fof(f27,plain,
sF1 = least_upper_bound(identity,sF0),
inference(forward_demodulation,[],[f21,f6]) ).
fof(f28,plain,
sF2 = greatest_lower_bound(identity,a),
inference(forward_demodulation,[],[f23,f5]) ).
fof(f29,plain,
identity = multiply(sF0,a),
inference(superposition,[],[f3,f19]) ).
fof(f30,plain,
identity = multiply(sF3,sF2),
inference(superposition,[],[f3,f25]) ).
fof(f33,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f34,plain,
identity = least_upper_bound(identity,sF2),
inference(superposition,[],[f11,f28]) ).
fof(f37,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f39,plain,
identity = greatest_lower_bound(identity,sF1),
inference(superposition,[],[f12,f27]) ).
fof(f44,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f51,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f44,f1]) ).
fof(f57,plain,
a = least_upper_bound(a,sF2),
inference(superposition,[],[f33,f28]) ).
fof(f66,plain,
! [X0] : greatest_lower_bound(identity,greatest_lower_bound(a,X0)) = greatest_lower_bound(sF2,X0),
inference(superposition,[],[f7,f28]) ).
fof(f87,plain,
! [X0] : least_upper_bound(identity,least_upper_bound(sF0,X0)) = least_upper_bound(sF1,X0),
inference(superposition,[],[f8,f27]) ).
fof(f96,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(f109,plain,
! [X0] : multiply(sF0,least_upper_bound(a,X0)) = least_upper_bound(identity,multiply(sF0,X0)),
inference(superposition,[],[f13,f29]) ).
fof(f112,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f123,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(f128,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f112,f6]) ).
fof(f141,plain,
sF0 = greatest_lower_bound(sF0,sF1),
inference(superposition,[],[f37,f27]) ).
fof(f149,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(least_upper_bound(X1,X0),X0),
inference(superposition,[],[f33,f37]) ).
fof(f152,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f149,f6]) ).
fof(f191,plain,
sF1 = least_upper_bound(sF1,sF0),
inference(superposition,[],[f33,f141]) ).
fof(f193,plain,
sF1 = least_upper_bound(sF0,sF1),
inference(forward_demodulation,[],[f191,f6]) ).
fof(f194,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f195,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f198,plain,
! [X0] : multiply(least_upper_bound(sF3,X0),sF2) = least_upper_bound(identity,multiply(X0,sF2)),
inference(superposition,[],[f15,f30]) ).
fof(f201,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(f214,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(f226,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f232,plain,
! [X0,X1] : multiply(greatest_lower_bound(X0,inverse(X1)),X1) = greatest_lower_bound(multiply(X0,X1),identity),
inference(superposition,[],[f16,f3]) ).
fof(f253,plain,
! [X0,X1] : multiply(greatest_lower_bound(X0,inverse(X1)),X1) = greatest_lower_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[],[f232,f5]) ).
fof(f261,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f51,f3]) ).
fof(f263,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f51,f51]) ).
fof(f264,plain,
a = multiply(inverse(sF0),identity),
inference(superposition,[],[f51,f29]) ).
fof(f278,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f261,f263]) ).
fof(f285,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f14,f278]) ).
fof(f460,plain,
a = inverse(sF0),
inference(superposition,[],[f278,f264]) ).
fof(f538,plain,
identity = multiply(a,sF0),
inference(superposition,[],[f3,f460]) ).
fof(f1256,plain,
multiply(least_upper_bound(identity,sF0),a) = least_upper_bound(a,identity),
inference(superposition,[],[f194,f29]) ).
fof(f1287,plain,
least_upper_bound(identity,a) = multiply(least_upper_bound(identity,sF0),a),
inference(forward_demodulation,[],[f1256,f6]) ).
fof(f1302,plain,
least_upper_bound(identity,a) = multiply(sF1,a),
inference(forward_demodulation,[],[f1287,f27]) ).
fof(f1440,plain,
multiply(greatest_lower_bound(identity,a),sF0) = greatest_lower_bound(sF0,identity),
inference(superposition,[],[f226,f538]) ).
fof(f1471,plain,
greatest_lower_bound(identity,sF0) = multiply(greatest_lower_bound(identity,a),sF0),
inference(forward_demodulation,[],[f1440,f5]) ).
fof(f1486,plain,
greatest_lower_bound(identity,sF0) = multiply(sF2,sF0),
inference(forward_demodulation,[],[f1471,f28]) ).
fof(f1672,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X1),X0)),least_upper_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f51,f195]) ).
fof(f1914,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(X0,inverse(X1))),greatest_lower_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f51,f253]) ).
fof(f2719,plain,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = multiply(X0,least_upper_bound(X2,X1)),
inference(superposition,[],[f13,f123]) ).
fof(f2873,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,[],[f128,f96]) ).
fof(f2943,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,[],[f2873,f152]) ).
fof(f2968,plain,
! [X0,X1] : identity = least_upper_bound(identity,multiply(inverse(least_upper_bound(X0,X1)),X0)),
inference(forward_demodulation,[],[f2943,f3]) ).
fof(f3621,plain,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = multiply(least_upper_bound(X1,X0),X2),
inference(superposition,[],[f15,f214]) ).
fof(f4913,plain,
! [X0,X1] : least_upper_bound(multiply(X0,a),multiply(X1,identity)) = multiply(least_upper_bound(X0,multiply(X1,sF0)),a),
inference(superposition,[],[f201,f29]) ).
fof(f4991,plain,
! [X0,X1] : least_upper_bound(multiply(X0,a),X1) = multiply(least_upper_bound(X0,multiply(X1,sF0)),a),
inference(forward_demodulation,[],[f4913,f278]) ).
fof(f6893,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f278,f263]) ).
fof(f6911,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f6893,f278]) ).
fof(f11719,plain,
least_upper_bound(identity,sF0) = multiply(sF0,least_upper_bound(a,identity)),
inference(superposition,[],[f109,f278]) ).
fof(f11768,plain,
least_upper_bound(identity,sF0) = multiply(sF0,least_upper_bound(identity,a)),
inference(forward_demodulation,[],[f11719,f2719]) ).
fof(f11782,plain,
least_upper_bound(identity,sF0) = multiply(sF0,multiply(sF1,a)),
inference(forward_demodulation,[],[f11768,f1302]) ).
fof(f11791,plain,
sF1 = multiply(sF0,multiply(sF1,a)),
inference(forward_demodulation,[],[f11782,f27]) ).
fof(f11834,plain,
greatest_lower_bound(multiply(sF1,a),sF1) = multiply(greatest_lower_bound(identity,sF0),multiply(sF1,a)),
inference(superposition,[],[f226,f11791]) ).
fof(f11848,plain,
greatest_lower_bound(multiply(sF1,a),sF1) = multiply(multiply(sF2,sF0),multiply(sF1,a)),
inference(forward_demodulation,[],[f11834,f1486]) ).
fof(f11872,plain,
greatest_lower_bound(multiply(sF1,a),sF1) = multiply(sF2,multiply(sF0,multiply(sF1,a))),
inference(forward_demodulation,[],[f11848,f4]) ).
fof(f11883,plain,
greatest_lower_bound(multiply(sF1,a),sF1) = multiply(sF2,sF1),
inference(forward_demodulation,[],[f11872,f11791]) ).
fof(f11890,plain,
greatest_lower_bound(sF1,multiply(sF1,a)) = multiply(sF2,sF1),
inference(forward_demodulation,[],[f11883,f5]) ).
fof(f11895,plain,
multiply(sF2,sF1) = multiply(sF1,greatest_lower_bound(identity,a)),
inference(forward_demodulation,[],[f11890,f285]) ).
fof(f11899,plain,
multiply(sF2,sF1) = multiply(sF1,sF2),
inference(forward_demodulation,[],[f11895,f28]) ).
fof(f13562,plain,
multiply(sF0,least_upper_bound(a,sF2)) = multiply(least_upper_bound(sF3,sF0),sF2),
inference(superposition,[],[f109,f198]) ).
fof(f13604,plain,
multiply(sF0,least_upper_bound(a,sF2)) = multiply(least_upper_bound(sF0,sF3),sF2),
inference(forward_demodulation,[],[f13562,f3621]) ).
fof(f13628,plain,
multiply(sF0,a) = multiply(least_upper_bound(sF0,sF3),sF2),
inference(forward_demodulation,[],[f13604,f57]) ).
fof(f13643,plain,
identity = multiply(least_upper_bound(sF0,sF3),sF2),
inference(forward_demodulation,[],[f13628,f29]) ).
fof(f13678,plain,
least_upper_bound(sF2,identity) = multiply(least_upper_bound(identity,least_upper_bound(sF0,sF3)),sF2),
inference(superposition,[],[f194,f13643]) ).
fof(f13716,plain,
least_upper_bound(sF2,identity) = multiply(least_upper_bound(sF1,sF3),sF2),
inference(forward_demodulation,[],[f13678,f87]) ).
fof(f13740,plain,
least_upper_bound(identity,sF2) = multiply(least_upper_bound(sF1,sF3),sF2),
inference(forward_demodulation,[],[f13716,f6]) ).
fof(f13750,plain,
identity = multiply(least_upper_bound(sF1,sF3),sF2),
inference(forward_demodulation,[],[f13740,f34]) ).
fof(f24824,plain,
! [X2,X3,X0,X1] : multiply(X0,multiply(least_upper_bound(X2,X1),X3)) = multiply(multiply(X0,least_upper_bound(X1,X2)),X3),
inference(superposition,[],[f4,f2719]) ).
fof(f24894,plain,
! [X2,X3,X0,X1] : multiply(X0,multiply(least_upper_bound(X2,X1),X3)) = multiply(X0,multiply(least_upper_bound(X1,X2),X3)),
inference(forward_demodulation,[],[f24824,f4]) ).
fof(f52909,plain,
sF1 = multiply(inverse(least_upper_bound(inverse(sF1),sF2)),least_upper_bound(identity,multiply(sF1,sF2))),
inference(superposition,[],[f1672,f11899]) ).
fof(f53021,plain,
sF1 = multiply(inverse(least_upper_bound(inverse(sF1),sF2)),multiply(least_upper_bound(sF3,sF1),sF2)),
inference(forward_demodulation,[],[f52909,f198]) ).
fof(f53158,plain,
sF1 = multiply(inverse(least_upper_bound(inverse(sF1),sF2)),multiply(least_upper_bound(sF1,sF3),sF2)),
inference(forward_demodulation,[],[f53021,f24894]) ).
fof(f53244,plain,
sF1 = multiply(inverse(least_upper_bound(inverse(sF1),sF2)),identity),
inference(forward_demodulation,[],[f53158,f13750]) ).
fof(f53313,plain,
sF1 = inverse(least_upper_bound(inverse(sF1),sF2)),
inference(forward_demodulation,[],[f53244,f278]) ).
fof(f53362,plain,
sF1 = inverse(least_upper_bound(sF2,inverse(sF1))),
inference(forward_demodulation,[],[f53313,f6]) ).
fof(f53477,plain,
inverse(sF1) = least_upper_bound(sF2,inverse(sF1)),
inference(superposition,[],[f6911,f53362]) ).
fof(f54115,plain,
sF2 = greatest_lower_bound(sF2,inverse(sF1)),
inference(superposition,[],[f12,f53477]) ).
fof(f60193,plain,
! [X0] : multiply(identity,a) = least_upper_bound(multiply(identity,a),inverse(least_upper_bound(sF0,X0))),
inference(superposition,[],[f4991,f2968]) ).
fof(f60311,plain,
! [X0] : a = least_upper_bound(a,inverse(least_upper_bound(sF0,X0))),
inference(forward_demodulation,[],[f60193,f1]) ).
fof(f60446,plain,
a = least_upper_bound(a,inverse(sF1)),
inference(superposition,[],[f60311,f193]) ).
fof(f60899,plain,
inverse(sF1) = greatest_lower_bound(inverse(sF1),a),
inference(superposition,[],[f37,f60446]) ).
fof(f60965,plain,
inverse(sF1) = greatest_lower_bound(a,inverse(sF1)),
inference(forward_demodulation,[],[f60899,f5]) ).
fof(f61302,plain,
greatest_lower_bound(identity,inverse(sF1)) = greatest_lower_bound(sF2,inverse(sF1)),
inference(superposition,[],[f66,f60965]) ).
fof(f61373,plain,
sF2 = greatest_lower_bound(identity,inverse(sF1)),
inference(forward_demodulation,[],[f61302,f54115]) ).
fof(f61670,plain,
sF1 = multiply(inverse(sF2),greatest_lower_bound(identity,multiply(identity,sF1))),
inference(superposition,[],[f1914,f61373]) ).
fof(f61753,plain,
sF1 = multiply(inverse(sF2),multiply(identity,greatest_lower_bound(identity,sF1))),
inference(forward_demodulation,[],[f61670,f285]) ).
fof(f61777,plain,
sF1 = multiply(inverse(sF2),greatest_lower_bound(identity,sF1)),
inference(forward_demodulation,[],[f61753,f1]) ).
fof(f61792,plain,
sF1 = multiply(inverse(sF2),identity),
inference(forward_demodulation,[],[f61777,f39]) ).
fof(f61795,plain,
sF1 = inverse(sF2),
inference(forward_demodulation,[],[f61792,f278]) ).
fof(f62899,plain,
sF1 = sF3,
inference(superposition,[],[f25,f61795]) ).
fof(f62928,plain,
$false,
inference(forward_subsumption_resolution,[],[f62899,f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP179-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 09:39:15 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.15/0.41 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
% 19.72/3.28 % (1406309)Will run a generic schedule for satisfiability detection.
% 19.72/3.28 % (1406316)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2527331400:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 19.72/3.28 % (1406315)% WARNING: option uhcvi not known.
% 19.72/3.28 % (1406318)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2658333204:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 19.72/3.28 % (1406314)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=243350121_2999 on theBenchmark for (2999ds/0Mi)
% 19.72/3.28 % (1406319)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2334719246:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 19.72/3.28 % (1406315)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2082351968:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 19.72/3.28 % (1406317)dis+10_1_sil=32000:sp=arity:random_seed=3919937517:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 19.72/3.28 % (1406320)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=175390349:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 19.72/3.28 % TRYING [1]
% 19.72/3.28 % TRYING [2]
% 19.72/3.28 % TRYING [3]
% 19.72/3.28 % TRYING [4]
% 19.72/3.28 % TRYING [5]
% 19.72/3.28 % (1406317)Instruction limit reached!
% 19.72/3.28 % (1406317)------------------------------
% 19.72/3.28 % (1406317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.72/3.28 % (1406317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.72/3.28 % (1406317)CaDiCaL version: 2.1.3
% 19.72/3.28 % (1406317)Termination reason: Instruction limit
% 19.72/3.28 % (1406317)Termination phase: Saturation
% 19.72/3.28 % (1406317)Time elapsed: 0.057 s
% 19.72/3.28 % (1406317)Peak memory usage: 12 MB
% 19.72/3.28 % (1406317)Instructions burned: 103 (million)
% 19.72/3.28 % (1406318)Instruction limit reached!
% 19.72/3.28 % (1406318)------------------------------
% 19.72/3.28 % (1406318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.72/3.28 % (1406318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.72/3.28 % (1406318)CaDiCaL version: 2.1.3
% 19.72/3.28 % (1406318)Termination reason: Instruction limit
% 19.72/3.28 % (1406318)Termination phase: Saturation
% 19.72/3.28 % (1406318)Time elapsed: 0.075 s
% 19.72/3.28 % (1406318)Peak memory usage: 12 MB
% 19.72/3.28 % (1406318)Instructions burned: 116 (million)
% 19.72/3.28 % (1406319)Instruction limit reached!
% 19.72/3.28 % (1406319)------------------------------
% 19.72/3.28 % (1406319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.72/3.28 % (1406319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.72/3.28 % (1406319)CaDiCaL version: 2.1.3
% 19.72/3.28 % (1406319)Termination reason: Instruction limit
% 19.72/3.28 % (1406319)Termination phase: Saturation
% 19.72/3.28 % (1406319)Time elapsed: 0.077 s
% 19.72/3.28 % (1406319)Peak memory usage: 13 MB
% 19.72/3.28 % (1406319)Instructions burned: 132 (million)
% 19.72/3.28 % (1406328)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1346990822:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 19.72/3.28 % TRYING [1]
% 19.72/3.28 % TRYING [2]
% 19.72/3.28 % TRYING [3]
% 19.72/3.28 % TRYING [4]
% 19.72/3.28 % (1406329)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4194964966:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 19.72/3.28 % (1406320)Instruction limit reached!
% 19.72/3.28 % (1406320)------------------------------
% 19.72/3.28 % (1406320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.72/3.28 % (1406320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.72/3.28 % (1406320)CaDiCaL version: 2.1.3
% 19.72/3.28 % (1406320)Termination reason: Instruction limit
% 19.72/3.28 % (1406320)Termination phase: Saturation
% 19.72/3.28 % (1406320)Time elapsed: 0.095 s
% 19.72/3.28 % (1406320)Peak memory usage: 12 MB
% 19.72/3.28 % (1406320)Instructions burned: 160 (million)
% 19.72/3.28 % (1406331)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=1539196874:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 19.72/3.28 % TRYING [6]
% 19.72/3.28 % (1406334)ott-21_1_sil=16000:fs=off:random_seed=947226887:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 19.72/3.28 % TRYING [5]
% 19.72/3.28 % (1406329)Instruction limit reached!
% 19.72/3.28 % (1406329)------------------------------
% 19.72/3.28 % (1406329)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406329)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406329)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406329)Termination reason: Instruction limit
% 18.04/8.05 % (1406329)Termination phase: Saturation
% 18.04/8.05 % (1406329)Time elapsed: 0.085 s
% 18.04/8.05 % (1406329)Peak memory usage: 13 MB
% 18.04/8.05 % (1406329)Instructions burned: 131 (million)
% 18.04/8.05 % (1406334)Instruction limit reached!
% 18.04/8.05 % (1406334)------------------------------
% 18.04/8.05 % (1406334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406334)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406334)Termination reason: Instruction limit
% 18.04/8.05 % (1406334)Termination phase: Saturation
% 18.04/8.05 % (1406334)Time elapsed: 0.076 s
% 18.04/8.05 % (1406334)Peak memory usage: 11 MB
% 18.04/8.05 % (1406334)Instructions burned: 183 (million)
% 18.04/8.05 % (1406336)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=524803888:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 18.04/8.05 % (1406337)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3464969217:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 18.04/8.05 % TRYING [1]
% 18.04/8.05 % TRYING [2]
% 18.04/8.05 % TRYING [3]
% 18.04/8.05 % TRYING [4]
% 18.04/8.05 % TRYING [6]
% 18.04/8.05 % TRYING [5]
% 18.04/8.05 % (1406328)Instruction limit reached!
% 18.04/8.05 % (1406328)------------------------------
% 18.04/8.05 % (1406328)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406328)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406328)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406328)Termination reason: Instruction limit
% 18.04/8.05 % (1406328)Termination phase: Finite model building constraint generation
% 18.04/8.05 % (1406328)Time elapsed: 0.305 s
% 18.04/8.05 % (1406328)Peak memory usage: 33 MB
% 18.04/8.05 % (1406328)Instructions burned: 714 (million)
% 18.04/8.05 % (1406348)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2899545999:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 18.04/8.05 % TRYING [7]
% 18.04/8.05 % (1406331)Instruction limit reached!
% 18.04/8.05 % (1406331)------------------------------
% 18.04/8.05 % (1406331)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406331)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406331)Termination reason: Instruction limit
% 18.04/8.05 % (1406331)Termination phase: Saturation
% 18.04/8.05 % (1406331)Time elapsed: 0.472 s
% 18.04/8.05 % (1406331)Peak memory usage: 17 MB
% 18.04/8.05 % (1406331)Instructions burned: 684 (million)
% 18.04/8.05 % (1406336)Instruction limit reached!
% 18.04/8.05 % (1406336)------------------------------
% 18.04/8.05 % (1406336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406336)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406336)Termination reason: Instruction limit
% 18.04/8.05 % (1406336)Termination phase: Saturation
% 18.04/8.05 % (1406336)Time elapsed: 0.370 s
% 18.04/8.05 % (1406336)Peak memory usage: 15 MB
% 18.04/8.05 % (1406336)Instructions burned: 477 (million)
% 18.04/8.05 % (1406358)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2689636245:i=889:ins=1_2993 on theBenchmark for (2993ds/889Mi)
% 18.04/8.05 % (1406359)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=3097433332:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2993 on theBenchmark for (2993ds/692Mi)
% 18.04/8.05 % TRYING [6]
% 18.04/8.05 % (1406337)Instruction limit reached!
% 18.04/8.05 % (1406337)------------------------------
% 18.04/8.05 % (1406337)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406337)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406337)Termination reason: Instruction limit
% 18.04/8.05 % (1406337)Termination phase: Finite model building constraint generation
% 18.04/8.05 % (1406337)Time elapsed: 0.519 s
% 18.04/8.05 % (1406337)Peak memory usage: 23 MB
% 18.04/8.05 % (1406337)Instructions burned: 866 (million)
% 18.04/8.05 % (1406364)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=261711535:i=879:kws=inv_precedence:fsr=off_2992 on theBenchmark for (2992ds/879Mi)
% 18.04/8.05 % TRYING [14]
% 18.04/8.05 % (1406359)Instruction limit reached!
% 18.04/8.05 % (1406359)------------------------------
% 18.04/8.05 % (1406359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406359)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406359)Termination reason: Instruction limit
% 18.04/8.05 % (1406359)Termination phase: Saturation
% 18.04/8.05 % (1406359)Time elapsed: 0.684 s
% 18.04/8.05 % (1406359)Peak memory usage: 18 MB
% 18.04/8.05 % (1406359)Instructions burned: 692 (million)
% 18.04/8.05 % (1406358)Instruction limit reached!
% 18.04/8.05 % (1406358)------------------------------
% 18.04/8.05 % (1406358)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406358)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406358)Termination reason: Instruction limit
% 18.04/8.05 % (1406358)Termination phase: Finite model building constraint generation
% 18.04/8.05 % (1406358)Time elapsed: 0.717 s
% 18.04/8.05 % (1406358)Peak memory usage: 91 MB
% 18.04/8.05 % (1406358)Instructions burned: 890 (million)
% 18.04/8.05 % (1406370)fmb+10_1_sil=64000:random_seed=4249488463:i=22061:nm=2:gsp=on_2986 on theBenchmark for (2986ds/22061Mi)
% 18.04/8.05 % TRYING [1]
% 18.04/8.05 % TRYING [2]
% 18.04/8.05 % TRYING [3]
% 18.04/8.05 % (1406373)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3948993360:i=9515:nm=5_2986 on theBenchmark for (2986ds/9515Mi)
% 18.04/8.05 % TRYING [20]
% 18.04/8.05 % TRYING [4]
% 18.04/8.05 % TRYING [5]
% 18.04/8.05 % (1406348)Instruction limit reached!
% 18.04/8.05 % (1406348)------------------------------
% 18.04/8.05 % (1406348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406348)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406348)Termination reason: Instruction limit
% 18.04/8.05 % (1406348)Termination phase: Saturation
% 18.04/8.05 % (1406348)Time elapsed: 1.137 s
% 18.04/8.05 % (1406348)Peak memory usage: 26 MB
% 18.04/8.05 % (1406348)Instructions burned: 1179 (million)
% 18.04/8.05 % (1406364)Instruction limit reached!
% 18.04/8.05 % (1406364)------------------------------
% 18.04/8.05 % (1406364)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406364)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406364)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406364)Termination reason: Instruction limit
% 18.04/8.05 % (1406364)Termination phase: Saturation
% 18.04/8.05 % (1406364)Time elapsed: 0.780 s
% 18.04/8.05 % (1406364)Peak memory usage: 19 MB
% 18.04/8.05 % (1406364)Instructions burned: 879 (million)
% 18.04/8.05 % (1406376)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1075589041:fmbsr=1.7:i=920_2984 on theBenchmark for (2984ds/920Mi)
% 18.04/8.05 % TRYING [8]
% 18.04/8.05 % (1406377)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1017893569:i=5131_2984 on theBenchmark for (2984ds/5131Mi)
% 18.04/8.05 % TRYING [6]
% 18.04/8.05 % (1406376)Instruction limit reached!
% 18.04/8.05 % (1406376)------------------------------
% 18.04/8.05 % (1406376)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406376)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406376)Termination reason: Instruction limit
% 18.04/8.05 % (1406376)Termination phase: Finite model building constraint generation
% 18.04/8.05 % (1406376)Time elapsed: 0.325 s
% 18.04/8.05 % (1406376)Peak memory usage: 73 MB
% 18.04/8.05 % (1406376)Instructions burned: 921 (million)
% 18.04/8.05 % (1406383)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=709533144:i=1472:ins=7:fdi=8:gsp=on_2980 on theBenchmark for (2980ds/1472Mi)
% 18.04/8.05 % (1406383)Instruction limit reached!
% 18.04/8.05 % (1406383)------------------------------
% 18.04/8.05 % (1406383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406383)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406383)Termination reason: Instruction limit
% 18.04/8.05 % (1406383)Termination phase: Saturation
% 18.04/8.05 % (1406383)Time elapsed: 0.859 s
% 18.04/8.05 % (1406383)Peak memory usage: 35 MB
% 18.04/8.05 % (1406383)Instructions burned: 1472 (million)
% 18.04/8.05 % (1406387)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2862137601:i=6324_2971 on theBenchmark for (2971ds/6324Mi)
% 18.04/8.05 % TRYING [77]
% 18.04/8.05 % TRYING [7]
% 18.04/8.05 % TRYING [8]
% 18.04/8.05 % TRYING [8]
% 18.04/8.05 % (1406387)Instruction limit reached!
% 18.04/8.05 % (1406387)------------------------------
% 18.04/8.05 % (1406387)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406387)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406387)Termination reason: Instruction limit
% 18.04/8.05 % (1406387)Termination phase: Finite model building constraint generation
% 18.04/8.05 % (1406387)Time elapsed: 2.433 s
% 18.04/8.05 % (1406387)Peak memory usage: 420 MB
% 18.04/8.05 % (1406387)Instructions burned: 6327 (million)
% 18.04/8.05 % (1406391)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3407458404:fmbsr=2.30978:i=2174_2946 on theBenchmark for (2946ds/2174Mi)
% 18.04/8.05 % TRYING [16]
% 18.04/8.05 % (1406391)Instruction limit reached!
% 18.04/8.05 % (1406391)------------------------------
% 18.04/8.05 % (1406391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406391)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406391)Termination reason: Instruction limit
% 18.04/8.05 % (1406391)Termination phase: Finite model building constraint generation
% 18.04/8.05 % (1406391)Time elapsed: 0.782 s
% 18.04/8.05 % (1406391)Peak memory usage: 132 MB
% 18.04/8.05 % (1406391)Instructions burned: 2175 (million)
% 18.04/8.05 % (1406395)ott-2_1_sil=16000:newcnf=on:random_seed=734898833:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2938 on theBenchmark for (2938ds/869Mi)
% 18.04/8.05 % (1406377)Instruction limit reached!
% 18.04/8.05 % (1406377)------------------------------
% 18.04/8.05 % (1406377)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406377)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406377)Termination reason: Instruction limit
% 18.04/8.05 % (1406377)Termination phase: Saturation
% 18.04/8.05 % (1406377)Time elapsed: 4.702 s
% 18.04/8.05 % (1406377)Peak memory usage: 50 MB
% 18.04/8.05 % (1406377)Instructions burned: 5131 (million)
% 18.04/8.05 % (1406397)ott+10_1_sil=32000:tgt=ground:random_seed=1196325193:i=5114:av=off_2936 on theBenchmark for (2936ds/5114Mi)
% 18.04/8.05 % (1406395)Instruction limit reached!
% 18.04/8.05 % (1406395)------------------------------
% 18.04/8.05 % (1406395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406395)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406395)Termination reason: Instruction limit
% 18.04/8.05 % (1406395)Termination phase: Saturation
% 18.04/8.05 % (1406395)Time elapsed: 0.821 s
% 18.04/8.05 % (1406395)Peak memory usage: 21 MB
% 18.04/8.05 % (1406395)Instructions burned: 869 (million)
% 18.04/8.05 % (1406399)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=23136805:i=54282_2929 on theBenchmark for (2929ds/54282Mi)
% 18.04/8.05 % TRYING [1]
% 18.04/8.05 % TRYING [2]
% 18.04/8.05 % TRYING [3]
% 18.04/8.05 % TRYING [4]
% 18.04/8.05 % TRYING [5]
% 18.04/8.05 % TRYING [6]
% 18.04/8.05 % (1406397) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1406309-1406397"...
% 18.04/8.05 % (1406397)...printing done.
% 18.04/8.05 % (1406397)Refutation found. Thanks to Tanya!
% 18.04/8.05 % SZS status Unsatisfiable for theBenchmark
% 18.04/8.05 % SZS output start Proof for theBenchmark
% See solution above
% 18.04/8.05 % (1406397)------------------------------
% 18.04/8.05 % (1406397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.04/8.05 % (1406397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.04/8.05 % (1406397)CaDiCaL version: 2.1.3
% 18.04/8.05 % (1406397)Termination reason: Refutation
% 18.04/8.05 % (1406397)Time elapsed: 1.114 s
% 18.04/8.05 % (1406397)Peak memory usage: 33 MB
% 18.04/8.05 % (1406397)Instructions burned: 2101 (million)
% 18.04/8.05 % (1406309)Success in time 7.628 s
% 18.04/8.05 % Vampire exiting
%------------------------------------------------------------------------------