TSTP Solution File: PUZ133+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PUZ133+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:50:38 EDT 2024
% Result : Theorem 1.27s 0.53s
% Output : Refutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 13
% Syntax : Number of formulae : 104 ( 51 unt; 0 def)
% Number of atoms : 279 ( 106 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 290 ( 115 ~; 86 |; 71 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 120 ( 110 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10838,plain,
$false,
inference(subsumption_resolution,[],[f10837,f10745]) ).
fof(f10745,plain,
plus(sK4,q(sK4)) != plus(sK3,q(sK3)),
inference(forward_demodulation,[],[f10744,f7658]) ).
fof(f7658,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(equality_resolution,[],[f63]) ).
fof(f63,plain,
! [X2,X3,X0,X1] :
( minus(X0,X2) != minus(X3,X1)
| plus(X0,X1) = plus(X2,X3) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,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,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( plus(X0,X1) = plus(X2,X3)
<=> minus(X0,X2) = minus(X3,X1) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X0,X1,X5,X6] :
( plus(X0,X1) = plus(X5,X6)
<=> minus(X0,X5) = minus(X6,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1) ).
fof(f10744,plain,
plus(q(sK3),sK3) != plus(sK4,q(sK4)),
inference(forward_demodulation,[],[f10743,f7658]) ).
fof(f10743,plain,
plus(q(sK3),sK3) != plus(q(sK4),sK4),
inference(unit_resulting_resolution,[],[f10734,f62]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( plus(X0,X1) != plus(X2,X3)
| minus(X0,X2) = minus(X3,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f10734,plain,
minus(sK4,sK3) != minus(q(sK3),q(sK4)),
inference(superposition,[],[f10576,f60]) ).
fof(f60,plain,
! [X0,X1] : minus(X1,X0) = minus(perm(X0),perm(X1)),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] : minus(X1,X0) = minus(perm(X0),perm(X1)),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] : minus(X0,X1) = minus(perm(X1),perm(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permutation_another_one) ).
fof(f10576,plain,
minus(sK4,sK3) != minus(perm(q(sK4)),perm(q(sK3))),
inference(unit_resulting_resolution,[],[f10479,f65]) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( minus(X0,X2) != minus(X1,X3)
| minus(X0,X1) = minus(X2,X3) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,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,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2,X3] :
( minus(X0,X1) = minus(X2,X3)
<=> minus(X0,X2) = minus(X1,X3) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X0,X1,X5,X6] :
( minus(X0,X1) = minus(X5,X6)
<=> minus(X0,X5) = minus(X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minus1) ).
fof(f10479,plain,
minus(sK4,perm(q(sK4))) != minus(sK3,perm(q(sK3))),
inference(forward_demodulation,[],[f10478,f7697]) ).
fof(f7697,plain,
! [X0,X1] : minus(X0,perm(X1)) = minus(X1,perm(X0)),
inference(unit_resulting_resolution,[],[f7683,f62]) ).
fof(f7683,plain,
! [X0,X1] : plus(X0,perm(X0)) = plus(perm(X1),X1),
inference(superposition,[],[f7646,f7658]) ).
fof(f7646,plain,
! [X0,X1] : plus(perm(X0),X0) = plus(perm(X1),X1),
inference(unit_resulting_resolution,[],[f60,f63]) ).
fof(f10478,plain,
minus(sK4,perm(q(sK4))) != minus(q(sK3),perm(sK3)),
inference(forward_demodulation,[],[f10477,f41]) ).
fof(f41,plain,
! [X0] : q(X0) = p(perm(X0)),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ~ queens_q
& ! [X0] : q(X0) = p(perm(X0))
& queens_p ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
( ~ queens_q
& ! [X0] : q(X0) = p(perm(X0))
& queens_p ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,negated_conjecture,
~ ( ( ! [X0] : q(X0) = p(perm(X0))
& queens_p )
=> queens_q ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
( ( ! [X0] : q(X0) = p(perm(X0))
& queens_p )
=> queens_q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',queens_sym) ).
fof(f10477,plain,
minus(p(perm(sK3)),perm(sK3)) != minus(sK4,perm(q(sK4))),
inference(forward_demodulation,[],[f10476,f41]) ).
fof(f10476,plain,
minus(p(perm(sK3)),perm(sK3)) != minus(sK4,perm(p(perm(sK4)))),
inference(forward_demodulation,[],[f10464,f7697]) ).
fof(f10464,plain,
minus(p(perm(sK3)),perm(sK3)) != minus(p(perm(sK4)),perm(sK4)),
inference(unit_resulting_resolution,[],[f10075,f45]) ).
fof(f45,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| minus(p(X0),X0) != minus(p(X1),X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X1,X0] :
( ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) )
| ~ sP0(X1,X0) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) )
| ~ sP0(X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f10075,plain,
sP0(perm(sK3),perm(sK4)),
inference(unit_resulting_resolution,[],[f344,f4573,f345,f3190,f66]) ).
fof(f66,plain,
! [X0,X1] :
( ~ le(s(X0),X1)
| ~ le(X1,n)
| sP0(X1,X0)
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(subsumption_resolution,[],[f46,f40]) ).
fof(f40,plain,
queens_p,
inference(cnf_transformation,[],[f18]) ).
fof(f46,plain,
! [X0,X1] :
( sP0(X1,X0)
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0)
| ~ queens_p ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ! [X0,X1] :
( sP0(X1,X0)
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0) )
| ~ queens_p ),
inference(definition_folding,[],[f20,f27]) ).
fof(f20,plain,
( ! [X0,X1] :
( ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) )
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0) )
| ~ queens_p ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
( ! [X0,X1] :
( ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) )
| ~ le(X1,n)
| ~ le(s(X0),X1)
| ~ le(X0,n)
| ~ le(s(n0),X0) )
| ~ queens_p ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
( queens_p
=> ! [X0,X1] :
( ( le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
=> ( minus(p(X0),X0) != minus(p(X1),X1)
& plus(p(X0),X0) != plus(p(X1),X1)
& p(X0) != p(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',queens_p) ).
fof(f3190,plain,
le(s(n0),perm(sK4)),
inference(unit_resulting_resolution,[],[f70,f97,f58]) ).
fof(f58,plain,
! [X0] :
( ~ le(s(n0),X0)
| ~ le(X0,n)
| le(s(n0),perm(X0)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0] :
( ( le(perm(X0),n)
& le(s(n0),perm(X0)) )
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0] :
( ( le(perm(X0),n)
& le(s(n0),perm(X0)) )
| ~ le(X0,n)
| ~ le(s(n0),X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ( le(X0,n)
& le(s(n0),X0) )
=> ( le(perm(X0),n)
& le(s(n0),perm(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permutation_range) ).
fof(f97,plain,
le(s(n0),sK4),
inference(unit_resulting_resolution,[],[f74,f86,f61]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ le(X1,X2)
| le(X0,X2)
| ~ le(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( le(X0,X2)
| ~ le(X1,X2)
| ~ le(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( le(X0,X2)
| ~ le(X1,X2)
| ~ le(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( le(X1,X2)
& le(X0,X1) )
=> le(X0,X2) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X2,X3,X4] :
( ( le(X3,X4)
& le(X2,X3) )
=> le(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',le_trans) ).
fof(f86,plain,
le(sK3,sK4),
inference(unit_resulting_resolution,[],[f56,f76,f61]) ).
fof(f76,plain,
le(s(sK3),sK4),
inference(unit_resulting_resolution,[],[f67,f49]) ).
fof(f49,plain,
( ~ sP2
| le(s(sK3),sK4) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
( ( ( minus(q(sK3),sK3) = minus(q(sK4),sK4)
| plus(q(sK3),sK3) = plus(q(sK4),sK4)
| q(sK3) = q(sK4) )
& sP1(sK3,sK4)
& le(sK4,n)
& le(s(sK3),sK4)
& le(sK3,n)
& le(s(n0),sK3) )
| ~ sP2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f34,f35]) ).
fof(f35,plain,
( ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& sP1(X0,X1)
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
=> ( ( minus(q(sK3),sK3) = minus(q(sK4),sK4)
| plus(q(sK3),sK3) = plus(q(sK4),sK4)
| q(sK3) = q(sK4) )
& sP1(sK3,sK4)
& le(sK4,n)
& le(s(sK3),sK4)
& le(sK3,n)
& le(s(n0),sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
( ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& sP1(X0,X1)
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
| ~ sP2 ),
inference(nnf_transformation,[],[f30]) ).
fof(f30,plain,
( ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& sP1(X0,X1)
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
| ~ sP2 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f67,plain,
sP2,
inference(subsumption_resolution,[],[f55,f42]) ).
fof(f42,plain,
~ queens_q,
inference(cnf_transformation,[],[f18]) ).
fof(f55,plain,
( queens_q
| sP2 ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( queens_q
| sP2 ),
inference(definition_folding,[],[f22,f30,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( le(s(X0),X1)
<=> le(s(perm(X1)),perm(X0)) )
| ~ sP1(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f22,plain,
( queens_q
| ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& ( le(s(X0),X1)
<=> le(s(perm(X1)),perm(X0)) )
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
( queens_q
| ? [X0,X1] :
( ( minus(q(X0),X0) = minus(q(X1),X1)
| plus(q(X0),X0) = plus(q(X1),X1)
| q(X0) = q(X1) )
& ( le(s(X0),X1)
<=> le(s(perm(X1)),perm(X0)) )
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
( ! [X0,X1] :
( ( ( le(s(X0),X1)
<=> le(s(perm(X1)),perm(X0)) )
& le(X1,n)
& le(s(X0),X1)
& le(X0,n)
& le(s(n0),X0) )
=> ( minus(q(X0),X0) != minus(q(X1),X1)
& plus(q(X0),X0) != plus(q(X1),X1)
& q(X0) != q(X1) ) )
=> queens_q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',queens_q) ).
fof(f56,plain,
! [X0] : le(X0,s(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0] : le(X0,s(X0)),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X2] : le(X2,s(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_le) ).
fof(f74,plain,
le(s(n0),sK3),
inference(unit_resulting_resolution,[],[f67,f47]) ).
fof(f47,plain,
( ~ sP2
| le(s(n0),sK3) ),
inference(cnf_transformation,[],[f36]) ).
fof(f70,plain,
le(sK4,n),
inference(unit_resulting_resolution,[],[f67,f50]) ).
fof(f50,plain,
( ~ sP2
| le(sK4,n) ),
inference(cnf_transformation,[],[f36]) ).
fof(f345,plain,
le(perm(sK4),n),
inference(unit_resulting_resolution,[],[f70,f97,f59]) ).
fof(f59,plain,
! [X0] :
( ~ le(s(n0),X0)
| ~ le(X0,n)
| le(perm(X0),n) ),
inference(cnf_transformation,[],[f24]) ).
fof(f4573,plain,
le(s(perm(sK4)),perm(sK3)),
inference(unit_resulting_resolution,[],[f72,f76,f53]) ).
fof(f53,plain,
! [X0,X1] :
( ~ sP1(X0,X1)
| ~ le(s(X0),X1)
| le(s(perm(X1)),perm(X0)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ( ( le(s(X0),X1)
| ~ le(s(perm(X1)),perm(X0)) )
& ( le(s(perm(X1)),perm(X0))
| ~ le(s(X0),X1) ) )
| ~ sP1(X0,X1) ),
inference(nnf_transformation,[],[f29]) ).
fof(f72,plain,
sP1(sK3,sK4),
inference(unit_resulting_resolution,[],[f67,f51]) ).
fof(f51,plain,
( ~ sP2
| sP1(sK3,sK4) ),
inference(cnf_transformation,[],[f36]) ).
fof(f344,plain,
le(perm(sK3),n),
inference(unit_resulting_resolution,[],[f68,f74,f59]) ).
fof(f68,plain,
le(sK3,n),
inference(unit_resulting_resolution,[],[f67,f48]) ).
fof(f48,plain,
( ~ sP2
| le(sK3,n) ),
inference(cnf_transformation,[],[f36]) ).
fof(f10837,plain,
plus(sK4,q(sK4)) = plus(sK3,q(sK3)),
inference(forward_demodulation,[],[f10836,f7658]) ).
fof(f10836,plain,
plus(q(sK3),sK3) = plus(sK4,q(sK4)),
inference(forward_demodulation,[],[f10834,f7658]) ).
fof(f10834,plain,
plus(q(sK3),sK3) = plus(q(sK4),sK4),
inference(unit_resulting_resolution,[],[f67,f10471,f10550,f52]) ).
fof(f52,plain,
( ~ sP2
| plus(q(sK3),sK3) = plus(q(sK4),sK4)
| q(sK3) = q(sK4)
| minus(q(sK3),sK3) = minus(q(sK4),sK4) ),
inference(cnf_transformation,[],[f36]) ).
fof(f10550,plain,
minus(q(sK3),sK3) != minus(q(sK4),sK4),
inference(unit_resulting_resolution,[],[f10546,f65]) ).
fof(f10546,plain,
minus(sK4,sK3) != minus(q(sK4),q(sK3)),
inference(forward_demodulation,[],[f10545,f60]) ).
fof(f10545,plain,
minus(perm(sK3),perm(sK4)) != minus(q(sK4),q(sK3)),
inference(unit_resulting_resolution,[],[f10475,f63]) ).
fof(f10475,plain,
plus(perm(sK4),q(sK4)) != plus(perm(sK3),q(sK3)),
inference(forward_demodulation,[],[f10474,f7658]) ).
fof(f10474,plain,
plus(perm(sK4),q(sK4)) != plus(q(sK3),perm(sK3)),
inference(forward_demodulation,[],[f10473,f41]) ).
fof(f10473,plain,
plus(p(perm(sK3)),perm(sK3)) != plus(perm(sK4),q(sK4)),
inference(forward_demodulation,[],[f10472,f41]) ).
fof(f10472,plain,
plus(p(perm(sK3)),perm(sK3)) != plus(perm(sK4),p(perm(sK4))),
inference(forward_demodulation,[],[f10465,f7658]) ).
fof(f10465,plain,
plus(p(perm(sK3)),perm(sK3)) != plus(p(perm(sK4)),perm(sK4)),
inference(unit_resulting_resolution,[],[f10075,f44]) ).
fof(f44,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| plus(p(X0),X0) != plus(p(X1),X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f10471,plain,
q(sK3) != q(sK4),
inference(forward_demodulation,[],[f10470,f41]) ).
fof(f10470,plain,
q(sK4) != p(perm(sK3)),
inference(forward_demodulation,[],[f10466,f41]) ).
fof(f10466,plain,
p(perm(sK3)) != p(perm(sK4)),
inference(unit_resulting_resolution,[],[f10075,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| p(X0) != p(X1) ),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ133+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 18:02:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (25615)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (25624)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % (25620)WARNING: value z3 for option sas not known
% 0.15/0.38 % (25618)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (25619)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (25622)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (25620)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (25623)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (25621)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [3]
% 0.22/0.40 TRYING [4]
% 0.22/0.41 TRYING [4]
% 0.22/0.46 TRYING [5]
% 0.22/0.47 TRYING [5]
% 1.27/0.52 % (25624)First to succeed.
% 1.27/0.53 % (25624)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25615"
% 1.27/0.53 % (25624)Refutation found. Thanks to Tanya!
% 1.27/0.53 % SZS status Theorem for theBenchmark
% 1.27/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.27/0.53 % (25624)------------------------------
% 1.27/0.53 % (25624)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.27/0.53 % (25624)Termination reason: Refutation
% 1.27/0.53
% 1.27/0.53 % (25624)Memory used [KB]: 2244
% 1.27/0.53 % (25624)Time elapsed: 0.152 s
% 1.27/0.53 % (25624)Instructions burned: 360 (million)
% 1.27/0.53 % (25615)Success in time 0.151 s
%------------------------------------------------------------------------------