%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ133+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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 12:32:33 PM UTC 2026
% Result : Theorem 20.37s 8.62s
% Output : Refutation 20.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 18
% Syntax : Number of formulae : 154 ( 55 unt; 8 def)
% Number of atoms : 424 ( 172 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 467 ( 197 ~; 199 |; 57 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 12 con; 0-2 aty)
% Number of variables : 120 ( 112 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( queens_p
=> ! [X0,X1] :
( ( le(s(n0),X0)
& le(X0,n)
& le(s(X0),X1)
& le(X1,n) )
=> ( p(X0) != p(X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& minus(p(X0),X0) != minus(p(X1),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p) ).
fof(f2,axiom,
! [X0] :
( ( le(s(n0),X0)
& le(X0,n) )
=> perm(X0) = minus(s(n),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation) ).
fof(f3,axiom,
( ! [X0,X1] :
( ( le(s(n0),X0)
& le(X0,n)
& le(s(X0),X1)
& le(X1,n)
& ( le(s(X0),X1)
<=> le(s(perm(X1)),perm(X0)) ) )
=> ( q(X0) != q(X1)
& plus(q(X0),X0) != plus(q(X1),X1)
& minus(q(X0),X0) != minus(q(X1),X1) ) )
=> queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
fof(f4,conjecture,
( ( queens_p
& ! [X0] : q(X0) = p(perm(X0)) )
=> queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym) ).
fof(f5,negated_conjecture,
~ ( ( queens_p
& ! [X0] : q(X0) = p(perm(X0)) )
=> queens_q ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,axiom,
! [X0] :
( ( le(s(n0),X0)
& le(X0,n) )
=> ( le(s(n0),perm(X0))
& le(perm(X0),n) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_range) ).
fof(f7,axiom,
! [X0,X1] : minus(X1,X0) = minus(perm(X0),perm(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_another_one) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( le(X0,X1)
& le(X1,X2) )
=> le(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',le_trans) ).
fof(f9,axiom,
! [X0] : le(X0,s(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_le) ).
fof(f10,axiom,
! [X0,X1,X2,X3] :
( plus(X0,X1) = plus(X2,X3)
<=> minus(X0,X2) = minus(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1) ).
fof(f11,axiom,
! [X0,X1,X2,X3] :
( minus(X0,X1) = minus(X2,X3)
<=> minus(X0,X2) = minus(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',minus1) ).
fof(f12,plain,
( ! [X0,X1] :
( ( p(X0) != p(X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& minus(p(X0),X0) != minus(p(X1),X1) )
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n) )
| ~ queens_p ),
inference(ennf_transformation,[],[f1]) ).
fof(f13,plain,
( ! [X0,X1] :
( ( p(X0) != p(X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& minus(p(X0),X0) != minus(p(X1),X1) )
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n) )
| ~ queens_p ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X0] :
( perm(X0) = minus(s(n),X0)
| ~ le(s(n0),X0)
| ~ le(X0,n) ),
inference(ennf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0] :
( perm(X0) = minus(s(n),X0)
| ~ le(s(n0),X0)
| ~ le(X0,n) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
( queens_q
| ? [X0,X1] :
( ( q(X0) = q(X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| minus(q(X0),X0) = minus(q(X1),X1) )
& le(s(n0),X0)
& le(X0,n)
& le(s(X0),X1)
& le(X1,n)
& ( le(s(X0),X1)
<=> le(s(perm(X1)),perm(X0)) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f17,plain,
( queens_q
| ? [X0,X1] :
( ( q(X0) = q(X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| minus(q(X0),X0) = minus(q(X1),X1) )
& le(s(n0),X0)
& le(X0,n)
& le(s(X0),X1)
& le(X1,n)
& ( le(s(X0),X1)
<=> le(s(perm(X1)),perm(X0)) ) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
( ~ queens_q
& queens_p
& ! [X0] : q(X0) = p(perm(X0)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f19,plain,
( ~ queens_q
& queens_p
& ! [X0] : q(X0) = p(perm(X0)) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0] :
( ( le(s(n0),perm(X0))
& le(perm(X0),n) )
| ~ le(s(n0),X0)
| ~ le(X0,n) ),
inference(ennf_transformation,[],[f6]) ).
fof(f21,plain,
! [X0] :
( ( le(s(n0),perm(X0))
& le(perm(X0),n) )
| ~ le(s(n0),X0)
| ~ le(X0,n) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( le(X0,X2)
| ~ le(X0,X1)
| ~ le(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f23,plain,
! [X0,X1,X2] :
( le(X0,X2)
| ~ le(X0,X1)
| ~ le(X1,X2) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
( queens_q
| ? [X0,X1] :
( ( q(X0) = q(X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| minus(q(X0),X0) = minus(q(X1),X1) )
& le(s(n0),X0)
& le(X0,n)
& le(s(X0),X1)
& le(X1,n)
& ( le(s(X0),X1)
| ~ le(s(perm(X1)),perm(X0)) )
& ( le(s(perm(X1)),perm(X0))
| ~ le(s(X0),X1) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f25,plain,
( queens_q
| ? [X0,X1] :
( ( q(X0) = q(X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| minus(q(X0),X0) = minus(q(X1),X1) )
& le(s(n0),X0)
& le(X0,n)
& le(s(X0),X1)
& le(X1,n)
& ( le(s(X0),X1)
| ~ le(s(perm(X1)),perm(X0)) )
& ( le(s(perm(X1)),perm(X0))
| ~ le(s(X0),X1) ) ) ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
( queens_q
| ( ( q(sK0) = q(sK1)
| plus(q(sK0),sK0) = plus(q(sK1),sK1)
| minus(q(sK0),sK0) = minus(q(sK1),sK1) )
& le(s(n0),sK0)
& le(sK0,n)
& le(s(sK0),sK1)
& le(sK1,n)
& ( le(s(sK0),sK1)
| ~ le(s(perm(sK1)),perm(sK0)) )
& ( le(s(perm(sK1)),perm(sK0))
| ~ le(s(sK0),sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f25]) ).
fof(f27,plain,
! [X0,X1,X2,X3] :
( ( plus(X0,X1) = plus(X2,X3)
| minus(X0,X2) != minus(X3,X1) )
& ( minus(X0,X2) = minus(X3,X1)
| plus(X0,X1) != plus(X2,X3) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f28,plain,
! [X0,X1,X2,X3] :
( ( minus(X0,X1) = minus(X2,X3)
| minus(X0,X2) != minus(X1,X3) )
& ( minus(X0,X2) = minus(X1,X3)
| minus(X0,X1) != minus(X2,X3) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f29,plain,
! [X0,X1] :
( minus(p(X0),X0) != minus(p(X1),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n)
| ~ queens_p ),
inference(cnf_transformation,[],[f13]) ).
fof(f30,plain,
! [X0,X1] :
( plus(p(X0),X0) != plus(p(X1),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n)
| ~ queens_p ),
inference(cnf_transformation,[],[f13]) ).
fof(f31,plain,
! [X0,X1] :
( p(X0) != p(X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n)
| ~ queens_p ),
inference(cnf_transformation,[],[f13]) ).
fof(f32,plain,
! [X0] :
( ~ le(s(n0),X0)
| perm(X0) = minus(s(n),X0)
| ~ le(X0,n) ),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
( queens_q
| le(s(perm(sK1)),perm(sK0))
| ~ le(s(sK0),sK1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f35,plain,
( queens_q
| le(sK1,n) ),
inference(cnf_transformation,[],[f26]) ).
fof(f36,plain,
( queens_q
| le(s(sK0),sK1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f37,plain,
( queens_q
| le(sK0,n) ),
inference(cnf_transformation,[],[f26]) ).
fof(f38,plain,
( queens_q
| le(s(n0),sK0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f39,plain,
( queens_q
| q(sK0) = q(sK1)
| plus(q(sK0),sK0) = plus(q(sK1),sK1)
| minus(q(sK0),sK0) = minus(q(sK1),sK1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f40,plain,
! [X0] : q(X0) = p(perm(X0)),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
queens_p,
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
~ queens_q,
inference(cnf_transformation,[],[f19]) ).
fof(f43,plain,
! [X0] :
( ~ le(s(n0),X0)
| le(perm(X0),n)
| ~ le(X0,n) ),
inference(cnf_transformation,[],[f21]) ).
fof(f44,plain,
! [X0] :
( le(s(n0),perm(X0))
| ~ le(s(n0),X0)
| ~ le(X0,n) ),
inference(cnf_transformation,[],[f21]) ).
fof(f45,plain,
! [X0,X1] : minus(X1,X0) = minus(perm(X0),perm(X1)),
inference(cnf_transformation,[],[f7]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ le(X1,X2)
| ~ le(X0,X1)
| le(X0,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f47,plain,
! [X0] : le(X0,s(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( plus(X0,X1) != plus(X2,X3)
| minus(X0,X2) = minus(X3,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( minus(X0,X2) != minus(X3,X1)
| plus(X0,X1) = plus(X2,X3) ),
inference(cnf_transformation,[],[f27]) ).
fof(f50,plain,
! [X2,X3,X0,X1] :
( minus(X0,X1) != minus(X2,X3)
| minus(X0,X2) = minus(X1,X3) ),
inference(cnf_transformation,[],[f28]) ).
fof(f52,plain,
( queens_q
| p(perm(sK0)) = p(perm(sK1))
| plus(p(perm(sK0)),sK0) = plus(p(perm(sK1)),sK1)
| minus(p(perm(sK0)),sK0) = minus(p(perm(sK1)),sK1) ),
inference(definition_unfolding,[],[f39,f40,f40,f40,f40,f40,f40]) ).
fof(f53,definition,
sF2 = perm(sK0),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f54,plain,
perm(sK0) = sF2,
inference(reorient_equations,[],[f53]) ).
fof(f55,definition,
sF3 = p(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f56,plain,
p(sF2) = sF3,
inference(reorient_equations,[],[f55]) ).
fof(f57,definition,
sF4 = perm(sK1),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f58,plain,
perm(sK1) = sF4,
inference(reorient_equations,[],[f57]) ).
fof(f59,definition,
sF5 = p(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f60,plain,
p(sF4) = sF5,
inference(reorient_equations,[],[f59]) ).
fof(f61,definition,
sF6 = plus(sF3,sK0),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f62,plain,
plus(sF3,sK0) = sF6,
inference(reorient_equations,[],[f61]) ).
fof(f63,definition,
sF7 = plus(sF5,sK1),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f64,plain,
plus(sF5,sK1) = sF7,
inference(reorient_equations,[],[f63]) ).
fof(f65,definition,
sF8 = minus(sF3,sK0),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f66,plain,
minus(sF3,sK0) = sF8,
inference(reorient_equations,[],[f65]) ).
fof(f67,definition,
sF9 = minus(sF5,sK1),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f68,plain,
minus(sF5,sK1) = sF9,
inference(reorient_equations,[],[f67]) ).
fof(f69,plain,
( queens_q
| sF3 = sF5
| sF6 = sF7
| sF8 = sF9 ),
inference(definition_folding,[],[f52,f68,f60,f58,f66,f56,f54,f64,f60,f58,f62,f56,f54,f60,f58,f56,f54]) ).
fof(f70,plain,
( le(s(perm(sK1)),perm(sK0))
| ~ le(s(sK0),sK1) ),
inference(forward_subsumption_resolution,[],[f33,f42]) ).
fof(f72,plain,
le(sK1,n),
inference(forward_subsumption_resolution,[],[f35,f42]) ).
fof(f73,plain,
le(s(sK0),sK1),
inference(forward_subsumption_resolution,[],[f36,f42]) ).
fof(f74,plain,
le(sK0,n),
inference(forward_subsumption_resolution,[],[f37,f42]) ).
fof(f75,plain,
le(s(n0),sK0),
inference(forward_subsumption_resolution,[],[f38,f42]) ).
fof(f76,plain,
( sF8 = sF9
| sF6 = sF7
| sF3 = sF5 ),
inference(forward_subsumption_resolution,[],[f69,f42]) ).
fof(f77,plain,
! [X0,X1] :
( minus(p(X0),X0) != minus(p(X1),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n) ),
inference(forward_subsumption_resolution,[],[f29,f41]) ).
fof(f78,plain,
! [X0,X1] :
( plus(p(X0),X0) != plus(p(X1),X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n) ),
inference(forward_subsumption_resolution,[],[f30,f41]) ).
fof(f79,plain,
! [X0,X1] :
( p(X0) != p(X1)
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),X1)
| ~ le(X1,n) ),
inference(forward_subsumption_resolution,[],[f31,f41]) ).
fof(f80,plain,
( le(s(perm(sK1)),sF2)
| ~ le(s(sK0),sK1) ),
inference(forward_demodulation,[],[f70,f54]) ).
fof(f82,plain,
le(s(perm(sK1)),sF2),
inference(forward_subsumption_resolution,[],[f80,f73]) ).
fof(f83,plain,
le(s(sF4),sF2),
inference(forward_demodulation,[],[f82,f58]) ).
fof(f97,plain,
! [X0] :
( p(X0) != sF3
| ~ le(s(n0),X0)
| ~ le(X0,n)
| ~ le(s(X0),sF2)
| ~ le(sF2,n) ),
inference(superposition,[],[f79,f56]) ).
fof(f102,plain,
! [X0] :
( minus(p(X0),X0) != minus(sF5,sF4)
| ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(s(sF4),X0)
| ~ le(X0,n) ),
inference(superposition,[],[f77,f60]) ).
fof(f104,plain,
! [X0] :
( plus(p(X0),X0) != plus(sF5,sF4)
| ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(s(sF4),X0)
| ~ le(X0,n) ),
inference(superposition,[],[f78,f60]) ).
fof(f108,plain,
( sF3 != sF5
| ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(s(sF4),sF2)
| ~ le(sF2,n) ),
inference(superposition,[],[f97,f60]) ).
fof(f109,plain,
( sF3 != sF5
| ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(sF2,n) ),
inference(forward_subsumption_resolution,[],[f108,f83]) ).
fof(f122,plain,
! [X0] : minus(X0,sK0) = minus(sF2,perm(X0)),
inference(superposition,[],[f45,f54]) ).
fof(f135,plain,
! [X0] :
( ~ le(X0,s(sK0))
| le(X0,sK1) ),
inference(resolution,[],[f46,f73]) ).
fof(f136,plain,
! [X0] :
( ~ le(X0,s(sF4))
| le(X0,sF2) ),
inference(resolution,[],[f46,f83]) ).
fof(f139,plain,
( le(perm(sK0),n)
| ~ le(sK0,n) ),
inference(resolution,[],[f43,f75]) ).
fof(f140,plain,
le(perm(sK0),n),
inference(forward_subsumption_resolution,[],[f139,f74]) ).
fof(f141,plain,
le(sF2,n),
inference(forward_demodulation,[],[f140,f54]) ).
fof(f142,plain,
! [X0] :
( ~ le(X0,sF2)
| le(X0,n) ),
inference(resolution,[],[f141,f46]) ).
fof(f146,plain,
( le(s(n0),sF2)
| ~ le(s(n0),sK0)
| ~ le(sK0,n) ),
inference(superposition,[],[f44,f54]) ).
fof(f147,plain,
( le(s(n0),sF4)
| ~ le(s(n0),sK1)
| ~ le(sK1,n) ),
inference(superposition,[],[f44,f58]) ).
fof(f148,plain,
( ~ le(s(n0),sK1)
| le(s(n0),sF4) ),
inference(forward_subsumption_resolution,[],[f147,f72]) ).
fof(f149,plain,
( le(s(n0),sF2)
| ~ le(sK0,n) ),
inference(forward_subsumption_resolution,[],[f146,f75]) ).
fof(f152,plain,
le(s(n0),sF2),
inference(forward_subsumption_resolution,[],[f149,f74]) ).
fof(f159,plain,
! [X0] :
( perm(perm(X0)) = minus(s(n),perm(X0))
| ~ le(perm(X0),n)
| ~ le(s(n0),X0)
| ~ le(X0,n) ),
inference(resolution,[],[f32,f44]) ).
fof(f160,plain,
( perm(sK0) = minus(s(n),sK0)
| ~ le(sK0,n) ),
inference(resolution,[],[f32,f75]) ).
fof(f163,plain,
perm(sK0) = minus(s(n),sK0),
inference(forward_subsumption_resolution,[],[f160,f74]) ).
fof(f164,plain,
! [X0] :
( ~ le(s(n0),X0)
| perm(perm(X0)) = minus(s(n),perm(X0))
| ~ le(X0,n) ),
inference(forward_subsumption_resolution,[],[f159,f43]) ).
fof(f165,plain,
sF2 = minus(s(n),sK0),
inference(forward_demodulation,[],[f163,f54]) ).
fof(f167,plain,
! [X0,X1] :
( plus(X0,X1) != sF6
| minus(sF3,X0) = minus(X1,sK0) ),
inference(superposition,[],[f48,f62]) ).
fof(f178,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(equality_resolution,[],[f49]) ).
fof(f181,plain,
! [X0,X1] :
( minus(X0,X1) != sF9
| minus(sF5,X0) = minus(sK1,X1) ),
inference(superposition,[],[f50,f68]) ).
fof(f185,plain,
! [X2,X3,X0,X1] :
( minus(X0,X1) != minus(X2,X3)
| minus(X2,perm(X1)) = minus(X3,perm(X0)) ),
inference(superposition,[],[f50,f45]) ).
fof(f199,plain,
le(sK0,sK1),
inference(resolution,[],[f135,f47]) ).
fof(f201,plain,
! [X0] :
( ~ le(X0,sK0)
| le(X0,sK1) ),
inference(resolution,[],[f199,f46]) ).
fof(f202,plain,
le(sF4,sF2),
inference(resolution,[],[f136,f47]) ).
fof(f213,plain,
le(sF4,n),
inference(resolution,[],[f142,f202]) ).
fof(f238,plain,
le(s(n0),sK1),
inference(resolution,[],[f201,f75]) ).
fof(f250,plain,
le(s(n0),sF4),
inference(resolution,[],[f238,f148]) ).
fof(f309,plain,
! [X0] :
( plus(sF5,sF4) != plus(X0,p(X0))
| ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(s(sF4),X0)
| ~ le(X0,n) ),
inference(superposition,[],[f104,f178]) ).
fof(f320,plain,
! [X0] :
( plus(sF5,sF4) != plus(X0,p(X0))
| ~ le(sF4,n)
| ~ le(s(sF4),X0)
| ~ le(X0,n) ),
inference(forward_subsumption_resolution,[],[f309,f250]) ).
fof(f329,plain,
! [X0] :
( plus(sF5,sF4) != plus(X0,p(X0))
| ~ le(s(sF4),X0)
| ~ le(X0,n) ),
inference(forward_subsumption_resolution,[],[f320,f213]) ).
fof(f333,plain,
minus(sK1,sK0) = minus(sF2,sF4),
inference(superposition,[],[f122,f58]) ).
fof(f368,plain,
( sF6 != sF7
| minus(sK1,sK0) = minus(sF3,sF5) ),
inference(superposition,[],[f167,f64]) ).
fof(f513,plain,
( sF8 != sF9
| minus(sK1,sK0) = minus(sF5,sF3) ),
inference(superposition,[],[f181,f66]) ).
fof(f573,plain,
( perm(perm(sF2)) = minus(s(n),perm(sF2))
| ~ le(sF2,n) ),
inference(resolution,[],[f164,f152]) ).
fof(f576,plain,
perm(perm(sF2)) = minus(s(n),perm(sF2)),
inference(forward_subsumption_resolution,[],[f573,f141]) ).
fof(f752,plain,
! [X0,X1] : minus(X1,perm(X0)) = minus(X0,perm(X1)),
inference(equality_resolution,[],[f185]) ).
fof(f1205,plain,
( plus(sF5,sF4) != plus(sF2,sF3)
| ~ le(s(sF4),sF2)
| ~ le(sF2,n) ),
inference(superposition,[],[f329,f56]) ).
fof(f1207,plain,
( plus(sF5,sF4) != plus(sF2,sF3)
| ~ le(sF2,n) ),
inference(forward_subsumption_resolution,[],[f1205,f83]) ).
fof(f1208,plain,
plus(sF5,sF4) != plus(sF2,sF3),
inference(forward_subsumption_resolution,[],[f1207,f141]) ).
fof(f1209,plain,
plus(sF3,sF2) != plus(sF5,sF4),
inference(forward_demodulation,[],[f1208,f178]) ).
fof(f1421,plain,
! [X0,X1] :
( minus(X0,X1) != minus(sK1,sK0)
| plus(sF2,X1) = plus(sF4,X0) ),
inference(superposition,[],[f49,f333]) ).
fof(f1424,plain,
! [X0,X1] :
( minus(X0,X1) != minus(sK1,sK0)
| minus(X1,sF4) = minus(X0,sF2) ),
inference(superposition,[],[f50,f333]) ).
fof(f1760,plain,
perm(perm(sF2)) = minus(sF2,perm(s(n))),
inference(superposition,[],[f576,f752]) ).
fof(f1763,plain,
! [X0] :
( minus(sF5,sF4) != minus(X0,perm(p(perm(X0))))
| ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(s(sF4),perm(X0))
| ~ le(perm(X0),n) ),
inference(superposition,[],[f102,f752]) ).
fof(f1777,plain,
! [X0] :
( minus(sF5,sF4) != minus(X0,perm(p(perm(X0))))
| ~ le(sF4,n)
| ~ le(s(sF4),perm(X0))
| ~ le(perm(X0),n) ),
inference(forward_subsumption_resolution,[],[f1763,f250]) ).
fof(f1780,plain,
minus(s(n),sK0) = perm(perm(sF2)),
inference(forward_demodulation,[],[f1760,f122]) ).
fof(f1836,plain,
! [X0] :
( minus(sF5,sF4) != minus(X0,perm(p(perm(X0))))
| ~ le(s(sF4),perm(X0))
| ~ le(perm(X0),n) ),
inference(forward_subsumption_resolution,[],[f1777,f213]) ).
fof(f1838,plain,
sF2 = perm(perm(sF2)),
inference(forward_demodulation,[],[f1780,f165]) ).
fof(f1967,plain,
( sF8 != sF8
| minus(sK1,sK0) = minus(sF5,sF3)
| sF6 = sF7
| sF3 = sF5 ),
inference(superposition,[],[f513,f76]) ).
fof(f1968,plain,
( minus(sK1,sK0) = minus(sF5,sF3)
| sF6 = sF7
| sF3 = sF5 ),
inference(trivial_inequality_removal,[],[f1967]) ).
fof(f16955,plain,
( minus(sF5,sF4) != minus(perm(sF2),perm(p(sF2)))
| ~ le(s(sF4),sF2)
| ~ le(sF2,n) ),
inference(superposition,[],[f1836,f1838]) ).
fof(f16962,plain,
( minus(sF5,sF4) != minus(perm(sF2),perm(p(sF2)))
| ~ le(sF2,n) ),
inference(forward_subsumption_resolution,[],[f16955,f83]) ).
fof(f16964,plain,
minus(sF5,sF4) != minus(perm(sF2),perm(p(sF2))),
inference(forward_subsumption_resolution,[],[f16962,f141]) ).
fof(f16966,plain,
minus(p(sF2),sF2) != minus(sF5,sF4),
inference(forward_demodulation,[],[f16964,f45]) ).
fof(f16968,plain,
minus(sF3,sF2) != minus(sF5,sF4),
inference(forward_demodulation,[],[f16966,f56]) ).
fof(f25938,plain,
( minus(sK1,sK0) != minus(sK1,sK0)
| plus(sF2,sF3) = plus(sF4,sF5)
| sF6 = sF7
| sF3 = sF5 ),
inference(superposition,[],[f1421,f1968]) ).
fof(f25940,plain,
( plus(sF2,sF3) = plus(sF4,sF5)
| sF6 = sF7
| sF3 = sF5 ),
inference(trivial_inequality_removal,[],[f25938]) ).
fof(f25943,plain,
( plus(sF5,sF4) = plus(sF2,sF3)
| sF6 = sF7
| sF3 = sF5 ),
inference(forward_demodulation,[],[f25940,f178]) ).
fof(f25964,plain,
( plus(sF3,sF2) = plus(sF5,sF4)
| sF6 = sF7
| sF3 = sF5 ),
inference(forward_demodulation,[],[f25943,f178]) ).
fof(f25973,plain,
( sF6 = sF7
| sF3 = sF5 ),
inference(forward_subsumption_resolution,[],[f25964,f1209]) ).
fof(f25978,plain,
( sF6 != sF6
| minus(sK1,sK0) = minus(sF3,sF5)
| sF3 = sF5 ),
inference(superposition,[],[f368,f25973]) ).
fof(f25979,plain,
( minus(sK1,sK0) = minus(sF3,sF5)
| sF3 = sF5 ),
inference(trivial_inequality_removal,[],[f25978]) ).
fof(f31823,plain,
( minus(sK1,sK0) != minus(sK1,sK0)
| minus(sF3,sF2) = minus(sF5,sF4)
| sF3 = sF5 ),
inference(superposition,[],[f1424,f25979]) ).
fof(f31846,plain,
( minus(sF3,sF2) = minus(sF5,sF4)
| sF3 = sF5 ),
inference(trivial_inequality_removal,[],[f31823]) ).
fof(f31863,plain,
sF3 = sF5,
inference(forward_subsumption_resolution,[],[f31846,f16968]) ).
fof(f31939,plain,
( sF3 != sF3
| ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(sF2,n) ),
inference(superposition,[],[f109,f31863]) ).
fof(f31950,plain,
( ~ le(s(n0),sF4)
| ~ le(sF4,n)
| ~ le(sF2,n) ),
inference(trivial_inequality_removal,[],[f31939]) ).
fof(f31952,plain,
( ~ le(sF4,n)
| ~ le(sF2,n) ),
inference(forward_subsumption_resolution,[],[f31950,f250]) ).
fof(f31955,plain,
~ le(sF2,n),
inference(forward_subsumption_resolution,[],[f31952,f213]) ).
fof(f31957,plain,
$false,
inference(forward_subsumption_resolution,[],[f31955,f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PUZ133+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/0.45 % Computer : n016.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Sun Sep 27 22:49:47 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 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
% 36.96/5.75 % (3065920)Will run a generic schedule for satisfiability detection.
% 36.96/5.75 % (3065926)% WARNING: option uhcvi not known.
% 36.96/5.75 % (3065927)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=736654843:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 36.96/5.75 % (3065926)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3166300701:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 36.96/5.75 % (3065930)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1656052868:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 36.96/5.75 % (3065925)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2817641950_2999 on theBenchmark for (2999ds/0Mi)
% 36.96/5.75 % (3065931)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1273306375:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 36.96/5.75 % (3065928)dis+10_1_sil=32000:sp=arity:random_seed=3881036206:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 36.96/5.75 % (3065929)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1444623978:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 36.96/5.75 % TRYING [1]
% 36.96/5.75 % TRYING [2]
% 36.96/5.75 % TRYING [3]
% 36.96/5.75 % TRYING [4]
% 36.96/5.75 % (3065928)Instruction limit reached!
% 36.96/5.75 % (3065928)------------------------------
% 36.96/5.75 % (3065928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 36.96/5.75 % (3065928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 36.96/5.75 % (3065928)CaDiCaL version: 2.1.3
% 36.96/5.75 % (3065928)Termination reason: Instruction limit
% 36.96/5.75 % (3065928)Termination phase: Saturation
% 36.96/5.75 % (3065928)Time elapsed: 0.105 s
% 36.96/5.75 % (3065928)Peak memory usage: 12 MB
% 36.96/5.75 % (3065928)Instructions burned: 103 (million)
% 36.96/5.75 % (3065929)Instruction limit reached!
% 36.96/5.75 % (3065929)------------------------------
% 36.96/5.75 % (3065929)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 36.96/5.75 % (3065929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 36.96/5.75 % (3065929)CaDiCaL version: 2.1.3
% 36.96/5.75 % (3065929)Termination reason: Instruction limit
% 36.96/5.75 % (3065929)Termination phase: Saturation
% 36.96/5.75 % (3065929)Time elapsed: 0.112 s
% 36.96/5.75 % (3065929)Peak memory usage: 12 MB
% 36.96/5.75 % (3065929)Instructions burned: 116 (million)
% 36.96/5.75 % (3065930)Instruction limit reached!
% 36.96/5.75 % (3065930)------------------------------
% 36.96/5.75 % (3065930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 36.96/5.75 % (3065930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 36.96/5.75 % (3065930)CaDiCaL version: 2.1.3
% 36.96/5.75 % (3065930)Termination reason: Instruction limit
% 36.96/5.75 % (3065930)Termination phase: Saturation
% 36.96/5.75 % (3065930)Time elapsed: 0.129 s
% 36.96/5.75 % (3065930)Peak memory usage: 12 MB
% 36.96/5.75 % (3065930)Instructions burned: 132 (million)
% 36.96/5.75 % (3065939)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2238489398:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 36.96/5.75 % TRYING [1]
% 36.96/5.75 % TRYING [2]
% 36.96/5.75 % TRYING [3]
% 36.96/5.75 % TRYING [4]
% 36.96/5.75 % (3065940)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1018670872:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 36.96/5.75 % TRYING [5]
% 36.96/5.75 % (3065931)Instruction limit reached!
% 36.96/5.75 % (3065931)------------------------------
% 36.96/5.75 % (3065931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 36.96/5.75 % (3065931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 36.96/5.75 % (3065931)CaDiCaL version: 2.1.3
% 36.96/5.75 % (3065931)Termination reason: Instruction limit
% 36.96/5.75 % (3065931)Termination phase: Saturation
% 36.96/5.75 % (3065931)Time elapsed: 0.161 s
% 36.96/5.75 % (3065931)Peak memory usage: 13 MB
% 36.96/5.75 % (3065931)Instructions burned: 159 (million)
% 36.96/5.75 % (3065942)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=1069012179:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 36.96/5.75 % (3065944)ott-21_1_sil=16000:fs=off:random_seed=2580550118:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 36.96/5.75 % (3065940)Instruction limit reached!
% 36.96/5.75 % (3065940)------------------------------
% 36.96/5.75 % (3065940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065940)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065940)Termination reason: Instruction limit
% 20.37/8.62 % (3065940)Termination phase: Saturation
% 20.37/8.62 % (3065940)Time elapsed: 0.130 s
% 20.37/8.62 % (3065940)Peak memory usage: 13 MB
% 20.37/8.62 % (3065940)Instructions burned: 131 (million)
% 20.37/8.62 % (3065947)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1961695540:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 20.37/8.62 % TRYING [5]
% 20.37/8.62 % (3065944)Instruction limit reached!
% 20.37/8.62 % (3065944)------------------------------
% 20.37/8.62 % (3065944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065944)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065944)Termination reason: Instruction limit
% 20.37/8.62 % (3065944)Termination phase: Saturation
% 20.37/8.62 % (3065944)Time elapsed: 0.145 s
% 20.37/8.62 % (3065944)Peak memory usage: 12 MB
% 20.37/8.62 % (3065944)Instructions burned: 181 (million)
% 20.37/8.62 % (3065949)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3262722767:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 20.37/8.62 % TRYING [1]
% 20.37/8.62 % TRYING [2]
% 20.37/8.62 % TRYING [3]
% 20.37/8.62 % TRYING [4]
% 20.37/8.62 % TRYING [5]
% 20.37/8.62 % (3065939)Instruction limit reached!
% 20.37/8.62 % (3065939)------------------------------
% 20.37/8.62 % (3065939)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065939)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065939)Termination reason: Instruction limit
% 20.37/8.62 % (3065939)Termination phase: Finite model building SAT solving
% 20.37/8.62 % (3065939)Time elapsed: 0.617 s
% 20.37/8.62 % (3065939)Peak memory usage: 19 MB
% 20.37/8.62 % (3065939)Instructions burned: 715 (million)
% 20.37/8.62 % (3065947)Instruction limit reached!
% 20.37/8.62 % (3065947)------------------------------
% 20.37/8.62 % (3065947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065947)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065947)Termination reason: Instruction limit
% 20.37/8.62 % (3065947)Termination phase: Saturation
% 20.37/8.62 % (3065947)Time elapsed: 0.451 s
% 20.37/8.62 % (3065947)Peak memory usage: 14 MB
% 20.37/8.62 % (3065947)Instructions burned: 477 (million)
% 20.37/8.62 % (3065942)Instruction limit reached!
% 20.37/8.62 % (3065942)------------------------------
% 20.37/8.62 % (3065942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065942)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065942)Termination reason: Instruction limit
% 20.37/8.62 % (3065942)Termination phase: Saturation
% 20.37/8.62 % (3065942)Time elapsed: 0.602 s
% 20.37/8.62 % (3065942)Peak memory usage: 15 MB
% 20.37/8.62 % (3065942)Instructions burned: 684 (million)
% 20.37/8.62 % (3065952)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2383867103:i=1179_2992 on theBenchmark for (2992ds/1179Mi)
% 20.37/8.62 % (3065954)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=1272432994:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2992 on theBenchmark for (2992ds/692Mi)
% 20.37/8.62 % (3065953)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2487071453:i=889:ins=1_2992 on theBenchmark for (2992ds/889Mi)
% 20.37/8.62 % TRYING [14]
% 20.37/8.62 % (3065949)Instruction limit reached!
% 20.37/8.62 % (3065949)------------------------------
% 20.37/8.62 % (3065949)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065949)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065949)Termination reason: Instruction limit
% 20.37/8.62 % (3065949)Termination phase: Finite model building SAT solving
% 20.37/8.62 % (3065949)Time elapsed: 0.658 s
% 20.37/8.62 % (3065949)Peak memory usage: 16 MB
% 20.37/8.62 % (3065949)Instructions burned: 865 (million)
% 20.37/8.62 % (3065958)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1172155924:i=879:kws=inv_precedence:fsr=off_2989 on theBenchmark for (2989ds/879Mi)
% 20.37/8.62 % (3065954)Instruction limit reached!
% 20.37/8.62 % (3065954)------------------------------
% 20.37/8.62 % (3065954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065954)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065954)Termination reason: Instruction limit
% 20.37/8.62 % (3065954)Termination phase: Saturation
% 20.37/8.62 % (3065954)Time elapsed: 0.544 s
% 20.37/8.62 % (3065954)Peak memory usage: 14 MB
% 20.37/8.62 % (3065954)Instructions burned: 692 (million)
% 20.37/8.62 % (3065960)fmb+10_1_sil=64000:random_seed=3886508596:i=22061:nm=2:gsp=on_2986 on theBenchmark for (2986ds/22061Mi)
% 20.37/8.62 % TRYING [1]
% 20.37/8.62 % TRYING [2]
% 20.37/8.62 % TRYING [3]
% 20.37/8.62 % TRYING [4]
% 20.37/8.62 % (3065953)Instruction limit reached!
% 20.37/8.62 % (3065953)------------------------------
% 20.37/8.62 % (3065953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065953)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065953)Termination reason: Instruction limit
% 20.37/8.62 % (3065953)Termination phase: Finite model building constraint generation
% 20.37/8.62 % (3065953)Time elapsed: 0.680 s
% 20.37/8.62 % (3065953)Peak memory usage: 78 MB
% 20.37/8.62 % (3065953)Instructions burned: 890 (million)
% 20.37/8.62 % (3065966)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2794822460:i=9515:nm=5_2984 on theBenchmark for (2984ds/9515Mi)
% 20.37/8.62 % TRYING [20]
% 20.37/8.62 % TRYING [5]
% 20.37/8.62 % (3065952)Instruction limit reached!
% 20.37/8.62 % (3065952)------------------------------
% 20.37/8.62 % (3065952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065952)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065952)Termination reason: Instruction limit
% 20.37/8.62 % (3065952)Termination phase: Saturation
% 20.37/8.62 % (3065952)Time elapsed: 1.014 s
% 20.37/8.62 % (3065952)Peak memory usage: 17 MB
% 20.37/8.62 % (3065952)Instructions burned: 1179 (million)
% 20.37/8.62 % (3065968)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3925034192:fmbsr=1.7:i=920_2981 on theBenchmark for (2981ds/920Mi)
% 20.37/8.62 % TRYING [8]
% 20.37/8.62 % (3065958)Instruction limit reached!
% 20.37/8.62 % (3065958)------------------------------
% 20.37/8.62 % (3065958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065958)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065958)Termination reason: Instruction limit
% 20.37/8.62 % (3065958)Termination phase: Saturation
% 20.37/8.62 % (3065958)Time elapsed: 0.846 s
% 20.37/8.62 % (3065958)Peak memory usage: 17 MB
% 20.37/8.62 % (3065958)Instructions burned: 879 (million)
% 20.37/8.62 % (3065970)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2710196894:i=5131_2980 on theBenchmark for (2980ds/5131Mi)
% 20.37/8.62 % (3065968)Instruction limit reached!
% 20.37/8.62 % (3065968)------------------------------
% 20.37/8.62 % (3065968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065968)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065968)Termination reason: Instruction limit
% 20.37/8.62 % (3065968)Termination phase: Finite model building SAT solving
% 20.37/8.62 % (3065968)Time elapsed: 0.390 s
% 20.37/8.62 % (3065968)Peak memory usage: 66 MB
% 20.37/8.62 % (3065968)Instructions burned: 920 (million)
% 20.37/8.62 % (3065972)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2796962709:i=1472:ins=7:fdi=8:gsp=on_2977 on theBenchmark for (2977ds/1472Mi)
% 20.37/8.62 % (3065972)Instruction limit reached!
% 20.37/8.62 % (3065972)------------------------------
% 20.37/8.62 % (3065972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065972)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065972)Termination reason: Instruction limit
% 20.37/8.62 % (3065972)Termination phase: Saturation
% 20.37/8.62 % (3065972)Time elapsed: 1.455 s
% 20.37/8.62 % (3065972)Peak memory usage: 28 MB
% 20.37/8.62 % (3065972)Instructions burned: 1472 (million)
% 20.37/8.62 % (3065982)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1959837704:i=6324_2962 on theBenchmark for (2962ds/6324Mi)
% 20.37/8.62 % TRYING [77]
% 20.37/8.62 % (3065966)Instruction limit reached!
% 20.37/8.62 % (3065966)------------------------------
% 20.37/8.62 % (3065966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065966)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065966)Termination reason: Instruction limit
% 20.37/8.62 % (3065966)Termination phase: Finite model building constraint generation
% 20.37/8.62 % (3065966)Time elapsed: 3.693 s
% 20.37/8.62 % (3065966)Peak memory usage: 671 MB
% 20.37/8.62 % (3065966)Instructions burned: 9516 (million)
% 20.37/8.62 % (3065984)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1822549337:fmbsr=2.30978:i=2174_2946 on theBenchmark for (2946ds/2174Mi)
% 20.37/8.62 % TRYING [16]
% 20.37/8.62 % TRYING [6]
% 20.37/8.62 % (3065984)Instruction limit reached!
% 20.37/8.62 % (3065984)------------------------------
% 20.37/8.62 % (3065984)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065984)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065984)Termination reason: Instruction limit
% 20.37/8.62 % (3065984)Termination phase: Finite model building constraint generation
% 20.37/8.62 % (3065984)Time elapsed: 0.833 s
% 20.37/8.62 % (3065984)Peak memory usage: 133 MB
% 20.37/8.62 % (3065984)Instructions burned: 2174 (million)
% 20.37/8.62 % (3065986)ott-2_1_sil=16000:newcnf=on:random_seed=2612667478:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2938 on theBenchmark for (2938ds/869Mi)
% 20.37/8.62 % (3065970)Instruction limit reached!
% 20.37/8.62 % (3065970)------------------------------
% 20.37/8.62 % (3065970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065970)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065970)Termination reason: Instruction limit
% 20.37/8.62 % (3065970)Termination phase: Saturation
% 20.37/8.62 % (3065970)Time elapsed: 4.611 s
% 20.37/8.62 % (3065970)Peak memory usage: 29 MB
% 20.37/8.62 % (3065970)Instructions burned: 5131 (million)
% 20.37/8.62 % (3065988)ott+10_1_sil=32000:tgt=ground:random_seed=3660297785:i=5114:av=off_2934 on theBenchmark for (2934ds/5114Mi)
% 20.37/8.62 % (3065986)Instruction limit reached!
% 20.37/8.62 % (3065986)------------------------------
% 20.37/8.62 % (3065986)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.62 % (3065986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.62 % (3065986)CaDiCaL version: 2.1.3
% 20.37/8.62 % (3065986)Termination reason: Instruction limit
% 20.37/8.62 % (3065986)Termination phase: Saturation
% 20.37/8.62 % (3065986)Time elapsed: 0.500 s
% 20.37/8.62 % (3065986)Peak memory usage: 17 MB
% 20.37/8.62 % (3065986)Instructions burned: 870 (million)
% 20.37/8.62 % (3065990)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1458044791:i=54282_2932 on theBenchmark for (2932ds/54282Mi)
% 20.37/8.62 % TRYING [1]
% 20.37/8.62 % TRYING [2]
% 20.37/8.62 % TRYING [3]
% 20.37/8.62 % TRYING [4]
% 20.37/8.62 % TRYING [5]
% 20.37/8.62 % TRYING [6]
% 20.37/8.62 % (3065988) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3065920-3065988"...
% 20.37/8.62 % (3065988)...printing done.
% 20.37/8.62 % (3065988)Refutation found. Thanks to Tanya!
% 20.37/8.62 % SZS status Theorem for theBenchmark
% 20.37/8.62 % SZS output start Proof for theBenchmark
% See solution above
% 20.37/8.63 % (3065988)------------------------------
% 20.37/8.63 % (3065988)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.37/8.63 % (3065988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.37/8.63 % (3065988)CaDiCaL version: 2.1.3
% 20.37/8.63 % (3065988)Termination reason: Refutation
% 20.37/8.63 % (3065988)Time elapsed: 1.422 s
% 20.37/8.63 % (3065988)Peak memory usage: 18 MB
% 20.37/8.63 % (3065988)Instructions burned: 1560 (million)
% 20.37/8.63 % (3065920)Success in time 8.113 s
% 20.37/8.63 % Vampire exiting
%------------------------------------------------------------------------------