%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET708+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:41:42 PM UTC 2026
% Result : Theorem 1.76s 1.31s
% Output : Refutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 60 ( 25 unt; 0 def)
% Number of atoms : 246 ( 16 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 268 ( 82 ~; 79 |; 79 &)
% ( 8 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-6 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-5 aty)
% Number of variables : 234 ( 203 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0,X1,X2] :
( maps(X0,X1,X2)
<=> ( ! [X3] :
( member(X3,X1)
=> ? [X4] :
( member(X4,X2)
& apply(X0,X3,X4) ) )
& ! [X3,X5,X6] :
( ( member(X3,X1)
& member(X5,X2)
& member(X6,X2) )
=> ( ( apply(X0,X3,X5)
& apply(X0,X3,X6) )
=> X5 = X6 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maps) ).
fof(f13,axiom,
! [X0,X1,X2,X3,X4,X5] :
( compose_predicate(X0,X1,X2,X3,X4,X5)
<=> ! [X6,X7] :
( ( member(X6,X3)
& member(X7,X5) )
=> ( apply(X0,X6,X7)
<=> ? [X8] :
( member(X8,X4)
& apply(X2,X6,X8)
& apply(X1,X8,X7) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_predicate) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
<=> ! [X4,X5,X6] :
( ( member(X4,X2)
& member(X5,X3)
& member(X6,X3) )
=> ( ( apply(X0,X4,X5)
& apply(X1,X4,X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_maps) ).
fof(f29,conjecture,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( maps(X0,X4,X5)
& maps(X1,X5,X6)
& compose_predicate(X2,X1,X0,X4,X5,X6)
& compose_predicate(X3,X1,X0,X4,X5,X6) )
=> equal_maps(X2,X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII01a) ).
fof(f30,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6] :
( ( maps(X0,X4,X5)
& maps(X1,X5,X6)
& compose_predicate(X2,X1,X0,X4,X5,X6)
& compose_predicate(X3,X1,X0,X4,X5,X6) )
=> equal_maps(X2,X3,X4,X6) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( maps(X0,X1,X2)
<=> ( ! [X3] :
( member(X3,X1)
=> ? [X4] :
( member(X4,X2)
& apply(X0,X3,X4) ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X2)
& member(X7,X2) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X5,X7) )
=> X6 = X7 ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f32,plain,
! [X0,X1,X2] :
( maps(X0,X1,X2)
=> ( ! [X3] :
( member(X3,X1)
=> ? [X4] :
( member(X4,X2)
& apply(X0,X3,X4) ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X2)
& member(X7,X2) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X5,X7) )
=> X6 = X7 ) ) ) ),
inference(unused_predicate_definition_removal,[],[f31]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5,X6] :
( ( member(X4,X2)
& member(X5,X3)
& member(X6,X3) )
=> ( ( apply(X0,X4,X5)
& apply(X1,X4,X6) )
=> X5 = X6 ) )
=> equal_maps(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f34,plain,
! [X0,X1,X2,X3,X4,X5] :
( compose_predicate(X0,X1,X2,X3,X4,X5)
=> ! [X6,X7] :
( ( member(X6,X3)
& member(X7,X5) )
=> ( apply(X0,X6,X7)
<=> ? [X8] :
( member(X8,X4)
& apply(X2,X6,X8)
& apply(X1,X8,X7) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f35,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( ~ equal_maps(X2,X3,X4,X6)
& maps(X0,X4,X5)
& maps(X1,X5,X6)
& compose_predicate(X2,X1,X0,X4,X5,X6)
& compose_predicate(X3,X1,X0,X4,X5,X6) ),
inference(ennf_transformation,[],[f30]) ).
fof(f36,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( ~ equal_maps(X2,X3,X4,X6)
& maps(X0,X4,X5)
& maps(X1,X5,X6)
& compose_predicate(X2,X1,X0,X4,X5,X6)
& compose_predicate(X3,X1,X0,X4,X5,X6) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ? [X4] :
( member(X4,X2)
& apply(X0,X3,X4) )
| ~ member(X3,X1) )
& ! [X5,X6,X7] :
( X6 = X7
| ~ apply(X0,X5,X6)
| ~ apply(X0,X5,X7)
| ~ member(X5,X1)
| ~ member(X6,X2)
| ~ member(X7,X2) ) )
| ~ maps(X0,X1,X2) ),
inference(ennf_transformation,[],[f32]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ? [X4] :
( member(X4,X2)
& apply(X0,X3,X4) )
| ~ member(X3,X1) )
& ! [X5,X6,X7] :
( X6 = X7
| ~ apply(X0,X5,X6)
| ~ apply(X0,X5,X7)
| ~ member(X5,X1)
| ~ member(X6,X2)
| ~ member(X7,X2) ) )
| ~ maps(X0,X1,X2) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4,X5] :
( ! [X6,X7] :
( ( apply(X0,X6,X7)
<=> ? [X8] :
( member(X8,X4)
& apply(X2,X6,X8)
& apply(X1,X8,X7) ) )
| ~ member(X6,X3)
| ~ member(X7,X5) )
| ~ compose_predicate(X0,X1,X2,X3,X4,X5) ),
inference(ennf_transformation,[],[f34]) ).
fof(f40,plain,
! [X0,X1,X2,X3,X4,X5] :
( ! [X6,X7] :
( ( apply(X0,X6,X7)
<=> ? [X8] :
( member(X8,X4)
& apply(X2,X6,X8)
& apply(X1,X8,X7) ) )
| ~ member(X6,X3)
| ~ member(X7,X5) )
| ~ compose_predicate(X0,X1,X2,X3,X4,X5) ),
inference(flattening,[],[f39]) ).
fof(f41,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X0,X4,X5)
& apply(X1,X4,X6)
& member(X4,X2)
& member(X5,X3)
& member(X6,X3) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f42,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X0,X4,X5)
& apply(X1,X4,X6)
& member(X4,X2)
& member(X5,X3)
& member(X6,X3) ) ),
inference(flattening,[],[f41]) ).
fof(f43,plain,
( ~ equal_maps(sK2,sK3,sK4,sK6)
& maps(sK0,sK4,sK5)
& maps(sK1,sK5,sK6)
& compose_predicate(sK2,sK1,sK0,sK4,sK5,sK6)
& compose_predicate(sK3,sK1,sK0,sK4,sK5,sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f36]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( member(sK7(X0,X2,X3),X2)
& apply(X0,X3,sK7(X0,X2,X3)) )
| ~ member(X3,X1) )
& ! [X5,X6,X7] :
( X6 = X7
| ~ apply(X0,X5,X6)
| ~ apply(X0,X5,X7)
| ~ member(X5,X1)
| ~ member(X6,X2)
| ~ member(X7,X2) ) )
| ~ maps(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X4,sK7(X0,X2,X3))],[f38]) ).
fof(f45,plain,
! [X0,X1,X2,X3,X4,X5] :
( ! [X6,X7] :
( ( ( apply(X0,X6,X7)
| ! [X8] :
( ~ member(X8,X4)
| ~ apply(X2,X6,X8)
| ~ apply(X1,X8,X7) ) )
& ( ? [X8] :
( member(X8,X4)
& apply(X2,X6,X8)
& apply(X1,X8,X7) )
| ~ apply(X0,X6,X7) ) )
| ~ member(X6,X3)
| ~ member(X7,X5) )
| ~ compose_predicate(X0,X1,X2,X3,X4,X5) ),
inference(nnf_transformation,[],[f40]) ).
fof(f46,plain,
! [X0,X1,X2,X3,X4,X5] :
( ! [X6,X7] :
( ( ( apply(X0,X6,X7)
| ! [X8] :
( ~ member(X8,X4)
| ~ apply(X2,X6,X8)
| ~ apply(X1,X8,X7) ) )
& ( ? [X9] :
( member(X9,X4)
& apply(X2,X6,X9)
& apply(X1,X9,X7) )
| ~ apply(X0,X6,X7) ) )
| ~ member(X6,X3)
| ~ member(X7,X5) )
| ~ compose_predicate(X0,X1,X2,X3,X4,X5) ),
inference(rectify,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2,X3,X4,X5] :
( ! [X6,X7] :
( ( ( apply(X0,X6,X7)
| ! [X8] :
( ~ member(X8,X4)
| ~ apply(X2,X6,X8)
| ~ apply(X1,X8,X7) ) )
& ( ( member(sK8(X1,X2,X4,X6,X7),X4)
& apply(X2,X6,sK8(X1,X2,X4,X6,X7))
& apply(X1,sK8(X1,X2,X4,X6,X7),X7) )
| ~ apply(X0,X6,X7) ) )
| ~ member(X6,X3)
| ~ member(X7,X5) )
| ~ compose_predicate(X0,X1,X2,X3,X4,X5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X9,sK8(X1,X2,X4,X6,X7))],[f46]) ).
fof(f48,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ( sK10(X0,X1,X2,X3) != sK11(X0,X1,X2,X3)
& apply(X0,sK9(X0,X1,X2,X3),sK10(X0,X1,X2,X3))
& apply(X1,sK9(X0,X1,X2,X3),sK11(X0,X1,X2,X3))
& member(sK9(X0,X1,X2,X3),X2)
& member(sK10(X0,X1,X2,X3),X3)
& member(sK11(X0,X1,X2,X3),X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11]),skolemize(X4,sK9(X0,X1,X2,X3)),skolemize(X5,sK10(X0,X1,X2,X3)),skolemize(X6,sK11(X0,X1,X2,X3))],[f42]) ).
fof(f49,plain,
compose_predicate(sK3,sK1,sK0,sK4,sK5,sK6),
inference(cnf_transformation,[],[f43]) ).
fof(f50,plain,
compose_predicate(sK2,sK1,sK0,sK4,sK5,sK6),
inference(cnf_transformation,[],[f43]) ).
fof(f51,plain,
maps(sK1,sK5,sK6),
inference(cnf_transformation,[],[f43]) ).
fof(f52,plain,
maps(sK0,sK4,sK5),
inference(cnf_transformation,[],[f43]) ).
fof(f53,plain,
~ equal_maps(sK2,sK3,sK4,sK6),
inference(cnf_transformation,[],[f43]) ).
fof(f54,plain,
! [X2,X0,X1,X6,X7,X5] :
( ~ apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| X6 = X7
| ~ member(X5,X1)
| ~ member(X6,X2)
| ~ member(X7,X2)
| ~ maps(X0,X1,X2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f55,plain,
! [X2,X3,X0,X1] :
( ~ maps(X0,X1,X2)
| ~ member(X3,X1)
| apply(X0,X3,sK7(X0,X2,X3)) ),
inference(cnf_transformation,[],[f44]) ).
fof(f56,plain,
! [X2,X3,X0,X1] :
( ~ maps(X0,X1,X2)
| ~ member(X3,X1)
| member(sK7(X0,X2,X3),X2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f57,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ compose_predicate(X0,X1,X2,X3,X4,X5)
| ~ apply(X0,X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5)
| apply(X1,sK8(X1,X2,X4,X6,X7),X7) ),
inference(cnf_transformation,[],[f47]) ).
fof(f58,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ compose_predicate(X0,X1,X2,X3,X4,X5)
| ~ apply(X0,X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5)
| apply(X2,X6,sK8(X1,X2,X4,X6,X7)) ),
inference(cnf_transformation,[],[f47]) ).
fof(f59,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ compose_predicate(X0,X1,X2,X3,X4,X5)
| ~ apply(X0,X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5)
| member(sK8(X1,X2,X4,X6,X7),X4) ),
inference(cnf_transformation,[],[f47]) ).
fof(f61,plain,
! [X2,X3,X0,X1] :
( member(sK11(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f48]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( member(sK10(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f48]) ).
fof(f63,plain,
! [X2,X3,X0,X1] :
( member(sK9(X0,X1,X2,X3),X2)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f48]) ).
fof(f64,plain,
! [X2,X3,X0,X1] :
( apply(X1,sK9(X0,X1,X2,X3),sK11(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f48]) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( apply(X0,sK9(X0,X1,X2,X3),sK10(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f48]) ).
fof(f66,plain,
! [X2,X3,X0,X1] :
( sK10(X0,X1,X2,X3) != sK11(X0,X1,X2,X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f48]) ).
fof(f67,plain,
member(sK11(sK2,sK3,sK4,sK6),sK6),
inference(unit_resulting_resolution,[],[f61,f53]) ).
fof(f68,plain,
member(sK10(sK2,sK3,sK4,sK6),sK6),
inference(unit_resulting_resolution,[],[f62,f53]) ).
fof(f69,plain,
member(sK9(sK2,sK3,sK4,sK6),sK4),
inference(unit_resulting_resolution,[],[f63,f53]) ).
fof(f70,plain,
member(sK7(sK0,sK5,sK9(sK2,sK3,sK4,sK6)),sK5),
inference(unit_resulting_resolution,[],[f56,f52,f69]) ).
fof(f72,plain,
apply(sK0,sK9(sK2,sK3,sK4,sK6),sK7(sK0,sK5,sK9(sK2,sK3,sK4,sK6))),
inference(unit_resulting_resolution,[],[f55,f52,f69]) ).
fof(f74,plain,
sK11(sK2,sK3,sK4,sK6) != sK10(sK2,sK3,sK4,sK6),
inference(unit_resulting_resolution,[],[f66,f53]) ).
fof(f75,plain,
apply(sK3,sK9(sK2,sK3,sK4,sK6),sK11(sK2,sK3,sK4,sK6)),
inference(unit_resulting_resolution,[],[f64,f53]) ).
fof(f76,plain,
apply(sK2,sK9(sK2,sK3,sK4,sK6),sK10(sK2,sK3,sK4,sK6)),
inference(unit_resulting_resolution,[],[f65,f53]) ).
fof(f79,plain,
member(sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK11(sK2,sK3,sK4,sK6)),sK5),
inference(unit_resulting_resolution,[],[f59,f49,f67,f69,f75]) ).
fof(f80,plain,
member(sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK10(sK2,sK3,sK4,sK6)),sK5),
inference(unit_resulting_resolution,[],[f59,f50,f68,f69,f76]) ).
fof(f83,plain,
apply(sK1,sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK11(sK2,sK3,sK4,sK6)),sK11(sK2,sK3,sK4,sK6)),
inference(unit_resulting_resolution,[],[f57,f49,f67,f69,f75]) ).
fof(f84,plain,
apply(sK1,sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK10(sK2,sK3,sK4,sK6)),sK10(sK2,sK3,sK4,sK6)),
inference(unit_resulting_resolution,[],[f57,f50,f68,f69,f76]) ).
fof(f87,plain,
apply(sK0,sK9(sK2,sK3,sK4,sK6),sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK11(sK2,sK3,sK4,sK6))),
inference(unit_resulting_resolution,[],[f58,f49,f67,f69,f75]) ).
fof(f88,plain,
apply(sK0,sK9(sK2,sK3,sK4,sK6),sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK10(sK2,sK3,sK4,sK6))),
inference(unit_resulting_resolution,[],[f58,f50,f68,f69,f76]) ).
fof(f89,plain,
~ apply(sK1,sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK11(sK2,sK3,sK4,sK6)),sK10(sK2,sK3,sK4,sK6)),
inference(unit_resulting_resolution,[],[f54,f51,f67,f68,f74,f79,f83]) ).
fof(f97,plain,
sK7(sK0,sK5,sK9(sK2,sK3,sK4,sK6)) = sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK11(sK2,sK3,sK4,sK6)),
inference(unit_resulting_resolution,[],[f54,f52,f69,f70,f72,f79,f87]) ).
fof(f108,plain,
sK7(sK0,sK5,sK9(sK2,sK3,sK4,sK6)) = sK8(sK1,sK0,sK5,sK9(sK2,sK3,sK4,sK6),sK10(sK2,sK3,sK4,sK6)),
inference(unit_resulting_resolution,[],[f54,f52,f69,f70,f72,f80,f88]) ).
fof(f135,plain,
~ apply(sK1,sK7(sK0,sK5,sK9(sK2,sK3,sK4,sK6)),sK10(sK2,sK3,sK4,sK6)),
inference(superposition,[],[f89,f97]) ).
fof(f142,plain,
apply(sK1,sK7(sK0,sK5,sK9(sK2,sK3,sK4,sK6)),sK10(sK2,sK3,sK4,sK6)),
inference(superposition,[],[f84,f108]) ).
fof(f145,plain,
$false,
inference(forward_subsumption_resolution,[],[f142,f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET708+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 02:37:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.76/1.31 % (3422216)Detected formulas, will run a generic FOF schedule.
% 1.76/1.31 % (3422224)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3701532574:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.76/1.31 % (3422224)Instruction limit reached!
% 1.76/1.31 % (3422224)------------------------------
% 1.76/1.31 % (3422224)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.76/1.31 % (3422224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/1.31 % (3422224)CaDiCaL version: 2.1.3
% 1.76/1.31 % (3422224)Termination reason: Instruction limit
% 1.76/1.31 % (3422224)Termination phase: Saturation
% 1.76/1.31 % (3422224)Time elapsed: 0.038 s
% 1.76/1.31 % (3422224)Peak memory usage: 89 MB
% 1.76/1.31 % (3422224)Instructions burned: 110 (million)
% 1.76/1.31 % (3422227)dis-21_1_sil=8000:lcm=predicate:random_seed=4219816513:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.76/1.31 % (3422225)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2894730113:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.76/1.31 % (3422223)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=210640881:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.76/1.31 % (3422222)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2917112552:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.76/1.31 % (3422226)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1787107615:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.76/1.31 % (3422221)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3480188125:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.76/1.31 % (3422227)Refutation not found, incomplete strategy
% 1.76/1.31 % (3422227)------------------------------
% 1.76/1.31 % (3422227)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.76/1.31 % (3422227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/1.31 % (3422227)CaDiCaL version: 2.1.3
% 1.76/1.31 % (3422227)Termination reason: Refutation not found, incomplete strategy
% 1.76/1.31 % (3422227)Time elapsed: 0.004 s
% 1.76/1.31 % (3422227)Peak memory usage: 88 MB
% 1.76/1.31 % (3422227)Instructions burned: 4 (million)
% 1.76/1.31 % (3422226)Instruction limit reached!
% 1.76/1.31 % (3422226)------------------------------
% 1.76/1.31 % (3422226)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.76/1.31 % (3422226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/1.31 % (3422226)CaDiCaL version: 2.1.3
% 1.76/1.31 % (3422226)Termination reason: Instruction limit
% 1.76/1.31 % (3422226)Termination phase: Saturation
% 1.76/1.31 % (3422226)Time elapsed: 0.058 s
% 1.76/1.31 % (3422226)Peak memory usage: 89 MB
% 1.76/1.31 % (3422226)Instructions burned: 140 (million)
% 1.76/1.31 % (3422225)Instruction limit reached!
% 1.76/1.31 % (3422225)------------------------------
% 1.76/1.31 % (3422225)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.76/1.31 % (3422225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/1.31 % (3422225)CaDiCaL version: 2.1.3
% 1.76/1.31 % (3422225)Termination reason: Instruction limit
% 1.76/1.31 % (3422225)Termination phase: Saturation
% 1.76/1.31 % (3422225)Time elapsed: 0.069 s
% 1.76/1.31 % (3422225)Peak memory usage: 88 MB
% 1.76/1.31 % (3422225)Instructions burned: 119 (million)
% 1.76/1.31 % (3422235)lrs+10_1_sil=8000:sp=occurrence:random_seed=1239864734:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 1.76/1.31 % (3422236)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1739292306:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 1.76/1.31 % (3422236)First to succeed.
% 1.76/1.31 % (3422236)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3422216"
% 1.76/1.31 % (3422237)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3273607807:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 1.76/1.31 % (3422227)------------------------------
% 1.76/1.31 % (3422227)------------------------------
% 1.76/1.31 % (3422235)Also succeeded, but the first one will report.
% 1.76/1.31 % (3422237)Also succeeded, but the first one will report.
% 1.76/1.31 % (3422236)Refutation found. Thanks to Tanya!
% 1.76/1.31 % SZS status Theorem for theBenchmark
% 1.76/1.31 % SZS output start Proof for theBenchmark
% See solution above
% 3.79/1.45 % (3422236)------------------------------
% 3.79/1.45 % (3422236)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.79/1.45 % (3422236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.45 % (3422236)CaDiCaL version: 2.1.3
% 3.79/1.45 % (3422236)Termination reason: Refutation
% 3.79/1.45 % (3422236)Time elapsed: 0.006 s
% 3.79/1.45 % (3422236)Peak memory usage: 89 MB
% 3.79/1.45 % (3422236)Instructions burned: 17 (million)
% 3.79/1.45 % (3422236)------------------------------
% 3.79/1.45 % (3422236)------------------------------
% 3.79/1.45 % (3422216)Success in time 0.465 s
% 3.79/1.45 % Vampire exiting
%------------------------------------------------------------------------------