%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET711+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 : n010.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:43 PM UTC 2026
% Result : Theorem 2.59s 1.25s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 86 ( 20 unt; 7 def)
% Number of atoms : 284 ( 12 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 318 ( 120 ~; 116 |; 51 &)
% ( 15 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 7 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 194 ( 0 sgn 178 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
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(f17,axiom,
! [X0,X1,X2] :
( injective(X0,X1,X2)
<=> ! [X3,X4,X5] :
( ( member(X3,X1)
& member(X4,X1)
& member(X5,X2) )
=> ( ( apply(X0,X3,X5)
& apply(X0,X4,X5) )
=> X3 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',injective) ).
fof(f19,axiom,
! [X0,X1,X2] :
( one_to_one(X0,X1,X2)
<=> ( injective(X0,X1,X2)
& surjective(X0,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_to_one) ).
fof(f20,axiom,
! [X0,X1,X2,X3] :
( inverse_predicate(X0,X1,X2,X3)
<=> ! [X4,X5] :
( ( member(X4,X2)
& member(X5,X3) )
=> ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_predicate) ).
fof(f29,conjecture,
! [X0,X1,X2,X3,X4] :
( ( maps(X0,X3,X4)
& one_to_one(X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& inverse_predicate(X2,X0,X3,X4) )
=> equal_maps(X1,X2,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII03a) ).
fof(f30,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( maps(X0,X3,X4)
& one_to_one(X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& inverse_predicate(X2,X0,X3,X4) )
=> equal_maps(X1,X2,X4,X3) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f33,plain,
! [X0,X1,X2] :
( one_to_one(X0,X1,X2)
=> ( injective(X0,X1,X2)
& surjective(X0,X1,X2) ) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f34,plain,
! [X0,X1,X2] :
( injective(X0,X1,X2)
=> ! [X3,X4,X5] :
( ( member(X3,X1)
& member(X4,X1)
& member(X5,X2) )
=> ( ( apply(X0,X3,X5)
& apply(X0,X4,X5) )
=> X3 = X4 ) ) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f36,plain,
! [X0,X1,X2,X3] :
( inverse_predicate(X0,X1,X2,X3)
=> ! [X4,X5] :
( ( member(X4,X2)
& member(X5,X3) )
=> ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) ) ) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f37,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(f38,plain,
? [X0,X1,X2,X3,X4] :
( ~ equal_maps(X1,X2,X4,X3)
& maps(X0,X3,X4)
& one_to_one(X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& inverse_predicate(X2,X0,X3,X4) ),
inference(ennf_transformation,[],[f30]) ).
fof(f39,plain,
? [X0,X1,X2,X3,X4] :
( ~ equal_maps(X1,X2,X4,X3)
& maps(X0,X3,X4)
& one_to_one(X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& inverse_predicate(X2,X0,X3,X4) ),
inference(flattening,[],[f38]) ).
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(ennf_transformation,[],[f37]) ).
fof(f43,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,[],[f42]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( injective(X0,X1,X2)
& surjective(X0,X1,X2) )
| ~ one_to_one(X0,X1,X2) ),
inference(ennf_transformation,[],[f33]) ).
fof(f45,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) )
| ~ member(X4,X2)
| ~ member(X5,X3) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f36]) ).
fof(f46,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) )
| ~ member(X4,X2)
| ~ member(X5,X3) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X3,X5)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X2) )
| ~ injective(X0,X1,X2) ),
inference(ennf_transformation,[],[f34]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X3,X5)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X2) )
| ~ injective(X0,X1,X2) ),
inference(flattening,[],[f47]) ).
fof(f50,plain,
( ~ equal_maps(sK1,sK2,sK4,sK3)
& maps(sK0,sK3,sK4)
& one_to_one(sK0,sK3,sK4)
& inverse_predicate(sK1,sK0,sK3,sK4)
& inverse_predicate(sK2,sK0,sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f39]) ).
fof(f52,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ( sK7(X0,X1,X2,X3) != sK8(X0,X1,X2,X3)
& apply(X0,sK6(X0,X1,X2,X3),sK7(X0,X1,X2,X3))
& apply(X1,sK6(X0,X1,X2,X3),sK8(X0,X1,X2,X3))
& member(sK6(X0,X1,X2,X3),X2)
& member(sK7(X0,X1,X2,X3),X3)
& member(sK8(X0,X1,X2,X3),X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X4,sK6(X0,X1,X2,X3)),skolemize(X5,sK7(X0,X1,X2,X3)),skolemize(X6,sK8(X0,X1,X2,X3))],[f43]) ).
fof(f53,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( ( apply(X1,X4,X5)
| ~ apply(X0,X5,X4) )
& ( apply(X0,X5,X4)
| ~ apply(X1,X4,X5) ) )
| ~ member(X4,X2)
| ~ member(X5,X3) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(nnf_transformation,[],[f46]) ).
fof(f58,plain,
inverse_predicate(sK2,sK0,sK3,sK4),
inference(cnf_transformation,[],[f50]) ).
fof(f59,plain,
inverse_predicate(sK1,sK0,sK3,sK4),
inference(cnf_transformation,[],[f50]) ).
fof(f60,plain,
one_to_one(sK0,sK3,sK4),
inference(cnf_transformation,[],[f50]) ).
fof(f62,plain,
~ equal_maps(sK1,sK2,sK4,sK3),
inference(cnf_transformation,[],[f50]) ).
fof(f66,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK8(X0,X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f67,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK7(X0,X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK6(X0,X1,X2,X3),X2) ),
inference(cnf_transformation,[],[f52]) ).
fof(f69,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| apply(X1,sK6(X0,X1,X2,X3),sK8(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f52]) ).
fof(f70,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| apply(X0,sK6(X0,X1,X2,X3),sK7(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f52]) ).
fof(f71,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| sK7(X0,X1,X2,X3) != sK8(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f73,plain,
! [X2,X0,X1] :
( injective(X0,X1,X2)
| ~ one_to_one(X0,X1,X2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f75,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ inverse_predicate(X0,X1,X2,X3)
| ~ apply(X0,X5,X4)
| ~ member(X4,X2)
| ~ member(X5,X3)
| apply(X1,X4,X5) ),
inference(cnf_transformation,[],[f53]) ).
fof(f76,plain,
! [X2,X3,X0,X1,X4,X5] :
( X3 = X4
| ~ apply(X0,X3,X5)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X2)
| ~ injective(X0,X1,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f87,definition,
! [X0,X1] :
( sQ10_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ10_eqProxy])],[equality_proxy_definition]) ).
fof(f89,plain,
! [X2,X3,X0,X1] :
( ~ sQ10_eqProxy(sK7(X0,X1,X2,X3),sK8(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(equality_proxy_replacement,[],[f71,f87]) ).
fof(f90,plain,
! [X2,X3,X0,X1,X4,X5] :
( sQ10_eqProxy(X3,X4)
| ~ apply(X0,X3,X5)
| ~ apply(X0,X4,X5)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X2)
| ~ injective(X0,X1,X2) ),
inference(equality_proxy_replacement,[],[f76,f87]) ).
fof(f96,plain,
member(sK8(sK1,sK2,sK4,sK3),sK3),
inference(resolution,[],[f66,f62]) ).
fof(f97,plain,
member(sK7(sK1,sK2,sK4,sK3),sK3),
inference(resolution,[],[f67,f62]) ).
fof(f98,plain,
member(sK6(sK1,sK2,sK4,sK3),sK4),
inference(resolution,[],[f68,f62]) ).
fof(f109,plain,
apply(sK2,sK6(sK1,sK2,sK4,sK3),sK8(sK1,sK2,sK4,sK3)),
inference(resolution,[],[f69,f62]) ).
fof(f110,plain,
apply(sK1,sK6(sK1,sK2,sK4,sK3),sK7(sK1,sK2,sK4,sK3)),
inference(resolution,[],[f70,f62]) ).
fof(f113,plain,
! [X0,X1] :
( ~ apply(sK2,X0,X1)
| ~ member(X1,sK3)
| ~ member(X0,sK4)
| apply(sK0,X1,X0) ),
inference(resolution,[],[f75,f58]) ).
fof(f114,plain,
! [X0,X1] :
( ~ apply(sK1,X0,X1)
| ~ member(X1,sK3)
| ~ member(X0,sK4)
| apply(sK0,X1,X0) ),
inference(resolution,[],[f75,f59]) ).
fof(f117,plain,
( ~ member(sK8(sK1,sK2,sK4,sK3),sK3)
| ~ member(sK6(sK1,sK2,sK4,sK3),sK4)
| apply(sK0,sK8(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3)) ),
inference(resolution,[],[f113,f109]) ).
fof(f121,definition,
( spl11_1
<=> apply(sK0,sK8(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3)) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f122,plain,
( apply(sK0,sK8(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3))
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f121]) ).
fof(f124,definition,
( spl11_2
<=> member(sK6(sK1,sK2,sK4,sK3),sK4) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f125,plain,
( ~ member(sK6(sK1,sK2,sK4,sK3),sK4)
| spl11_2 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f127,definition,
( spl11_3
<=> member(sK8(sK1,sK2,sK4,sK3),sK3) ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f128,plain,
( ~ member(sK8(sK1,sK2,sK4,sK3),sK3)
| spl11_3 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f129,plain,
( spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f117,f127,f124,f121]) ).
fof(f130,plain,
( $false
| spl11_2 ),
inference(resolution,[],[f125,f98]) ).
fof(f131,plain,
spl11_2,
inference(avatar_contradiction_clause,[],[f130]) ).
fof(f132,plain,
( $false
| spl11_3 ),
inference(resolution,[],[f128,f96]) ).
fof(f133,plain,
spl11_3,
inference(avatar_contradiction_clause,[],[f132]) ).
fof(f134,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ injective(X0,X6,X7)
| ~ apply(X0,sK8(X1,X2,X3,X4),X5)
| ~ member(sK7(X1,X2,X3,X4),X6)
| ~ member(sK8(X1,X2,X3,X4),X6)
| ~ member(X5,X7)
| ~ apply(X0,sK7(X1,X2,X3,X4),X5)
| equal_maps(X1,X2,X3,X4) ),
inference(resolution,[],[f90,f89]) ).
fof(f136,plain,
( ~ member(sK7(sK1,sK2,sK4,sK3),sK3)
| ~ member(sK6(sK1,sK2,sK4,sK3),sK4)
| apply(sK0,sK7(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3)) ),
inference(resolution,[],[f114,f110]) ).
fof(f140,definition,
( spl11_4
<=> apply(sK0,sK7(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3)) ),
introduced(definition,[new_symbols(definition,[spl11_4])],[avatar_definition]) ).
fof(f143,definition,
( spl11_5
<=> member(sK7(sK1,sK2,sK4,sK3),sK3) ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f144,plain,
( ~ member(sK7(sK1,sK2,sK4,sK3),sK3)
| spl11_5 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f145,plain,
( spl11_4
| ~ spl11_2
| ~ spl11_5 ),
inference(avatar_split_clause,[],[f136,f143,f124,f140]) ).
fof(f146,plain,
( $false
| spl11_5 ),
inference(resolution,[],[f144,f97]) ).
fof(f147,plain,
spl11_5,
inference(avatar_contradiction_clause,[],[f146]) ).
fof(f153,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ one_to_one(X0,X6,X7)
| ~ member(sK7(X1,X2,X3,X4),X6)
| ~ member(sK8(X1,X2,X3,X4),X6)
| ~ member(X5,X7)
| ~ apply(X0,sK7(X1,X2,X3,X4),X5)
| equal_maps(X1,X2,X3,X4)
| ~ apply(X0,sK8(X1,X2,X3,X4),X5) ),
inference(resolution,[],[f134,f73]) ).
fof(f169,plain,
! [X2,X3,X0,X1,X4] :
( equal_maps(X0,X1,X2,X3)
| ~ member(sK8(X0,X1,X2,X3),sK3)
| ~ member(X4,sK4)
| ~ apply(sK0,sK7(X0,X1,X2,X3),X4)
| ~ member(sK7(X0,X1,X2,X3),sK3)
| ~ apply(sK0,sK8(X0,X1,X2,X3),X4) ),
inference(resolution,[],[f153,f60]) ).
fof(f170,plain,
! [X0] :
( ~ member(sK8(sK1,sK2,sK4,sK3),sK3)
| ~ member(X0,sK4)
| ~ apply(sK0,sK7(sK1,sK2,sK4,sK3),X0)
| ~ member(sK7(sK1,sK2,sK4,sK3),sK3)
| ~ apply(sK0,sK8(sK1,sK2,sK4,sK3),X0) ),
inference(resolution,[],[f169,f62]) ).
fof(f172,definition,
( spl11_9
<=> ! [X0] :
( ~ member(X0,sK4)
| ~ apply(sK0,sK8(sK1,sK2,sK4,sK3),X0)
| ~ apply(sK0,sK7(sK1,sK2,sK4,sK3),X0) ) ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
fof(f173,plain,
( ! [X0] :
( ~ apply(sK0,sK8(sK1,sK2,sK4,sK3),X0)
| ~ member(X0,sK4)
| ~ apply(sK0,sK7(sK1,sK2,sK4,sK3),X0) )
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f172]) ).
fof(f174,plain,
( ~ spl11_5
| spl11_9
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f170,f127,f172,f143]) ).
fof(f175,plain,
( ~ member(sK6(sK1,sK2,sK4,sK3),sK4)
| ~ apply(sK0,sK7(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3))
| ~ spl11_1
| ~ spl11_9 ),
inference(resolution,[],[f173,f122]) ).
fof(f185,plain,
( ~ spl11_4
| ~ spl11_2
| ~ spl11_1
| ~ spl11_9 ),
inference(avatar_split_clause,[],[f175,f172,f121,f124,f140]) ).
cnf(s1,plain,
( spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(sat_conversion,[],[f129]) ).
cnf(s2,plain,
spl11_2,
inference(sat_conversion,[],[f131]) ).
cnf(s3,plain,
spl11_3,
inference(sat_conversion,[],[f133]) ).
cnf(s4,plain,
( ~ spl11_2
| spl11_4
| ~ spl11_5 ),
inference(sat_conversion,[],[f145]) ).
cnf(s5,plain,
spl11_5,
inference(sat_conversion,[],[f147]) ).
cnf(s7,plain,
( ~ spl11_3
| ~ spl11_5
| spl11_9 ),
inference(sat_conversion,[],[f174]) ).
cnf(s9,plain,
( ~ spl11_1
| ~ spl11_2
| ~ spl11_4
| ~ spl11_9 ),
inference(sat_conversion,[],[f185]) ).
cnf(s10,plain,
( ~ spl11_2
| spl11_4 ),
inference(rat,[],[s4,s5]) ).
cnf(s11,plain,
spl11_9,
inference(rat,[],[s7,s5,s3]) ).
cnf(s12,plain,
spl11_4,
inference(rat,[],[s10,s2]) ).
cnf(s13,plain,
~ spl11_1,
inference(rat,[],[s9,s11,s2,s12]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s3,s2,s13]) ).
fof(f186,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET711+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 02:36:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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
% 2.59/1.25 % (1509860)Detected formulas, will run a generic FOF schedule.
% 2.59/1.25 % (1509868)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1966649775:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.59/1.25 % (1509868)Refutation not found, incomplete strategy
% 2.59/1.25 % (1509868)------------------------------
% 2.59/1.25 % (1509868)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.25 % (1509868)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.25 % (1509868)CaDiCaL version: 2.1.3
% 2.59/1.25 % (1509868)Termination reason: Refutation not found, incomplete strategy
% 2.59/1.25 % (1509868)Time elapsed: 0.006 s
% 2.59/1.25 % (1509868)Peak memory usage: 88 MB
% 2.59/1.25 % (1509868)Instructions burned: 16 (million)
% 2.59/1.25 % (1509870)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=734771906:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.59/1.25 % (1509869)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1719101833:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.59/1.25 % (1509871)dis-21_1_sil=8000:lcm=predicate:random_seed=1960955521: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)
% 2.59/1.25 % (1509865)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=2921041921:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.59/1.25 % (1509866)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=2765776772:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.59/1.25 % (1509867)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=1176808644:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.59/1.25 % (1509871)First to succeed.
% 2.59/1.25 % (1509871)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1509860"
% 2.59/1.25 % (1509869)Instruction limit reached!
% 2.59/1.25 % (1509869)------------------------------
% 2.59/1.25 % (1509869)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.25 % (1509869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.25 % (1509869)CaDiCaL version: 2.1.3
% 2.59/1.25 % (1509869)Termination reason: Instruction limit
% 2.59/1.25 % (1509869)Termination phase: Saturation
% 2.59/1.25 % (1509869)Time elapsed: 0.068 s
% 2.59/1.25 % (1509869)Peak memory usage: 88 MB
% 2.59/1.25 % (1509869)Instructions burned: 119 (million)
% 2.59/1.25 % (1509870)Instruction limit reached!
% 2.59/1.25 % (1509870)------------------------------
% 2.59/1.25 % (1509870)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.25 % (1509870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.25 % (1509870)CaDiCaL version: 2.1.3
% 2.59/1.25 % (1509870)Termination reason: Instruction limit
% 2.59/1.25 % (1509870)Termination phase: Saturation
% 2.59/1.25 % (1509870)Time elapsed: 0.098 s
% 2.59/1.25 % (1509870)Peak memory usage: 90 MB
% 2.59/1.25 % (1509870)Instructions burned: 140 (million)
% 2.59/1.25 % (1509868)------------------------------
% 2.59/1.25 % (1509868)------------------------------
% 2.59/1.25 % (1509881)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4241173394:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.59/1.25 % (1509879)lrs+10_1_sil=8000:sp=occurrence:random_seed=3510033970:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.59/1.25 % (1509881)Refutation not found, incomplete strategy
% 2.59/1.25 % (1509881)------------------------------
% 2.59/1.25 % (1509881)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.25 % (1509881)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.25 % (1509881)CaDiCaL version: 2.1.3
% 2.59/1.25 % (1509881)Termination reason: Refutation not found, incomplete strategy
% 2.59/1.25 % (1509881)Time elapsed: 0.007 s
% 2.59/1.25 % (1509881)Peak memory usage: 88 MB
% 2.59/1.25 % (1509881)Instructions burned: 16 (million)
% 2.59/1.25 % (1509879)Also succeeded, but the first one will report.
% 2.59/1.25 % (1509880)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2697890762:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.59/1.25 % (1509880)Refutation not found, incomplete strategy
% 2.59/1.25 % (1509880)------------------------------
% 2.59/1.25 % (1509880)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.25 % (1509880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.25 % (1509880)CaDiCaL version: 2.1.3
% 2.59/1.25 % (1509880)Termination reason: Refutation not found, incomplete strategy
% 2.59/1.25 % (1509880)Time elapsed: 0.004 s
% 2.59/1.25 % (1509880)Peak memory usage: 88 MB
% 2.59/1.25 % (1509880)Instructions burned: 5 (million)
% 2.59/1.25 % (1509871)Refutation found. Thanks to Tanya!
% 2.59/1.25 % SZS status Theorem for theBenchmark
% 2.59/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.45 % (1509871)------------------------------
% 3.50/1.45 % (1509871)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.45 % (1509871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.45 % (1509871)CaDiCaL version: 2.1.3
% 3.50/1.45 % (1509871)Termination reason: Refutation
% 3.50/1.45 % (1509871)Time elapsed: 0.006 s
% 3.50/1.45 % (1509871)Peak memory usage: 89 MB
% 3.50/1.45 % (1509871)Instructions burned: 7 (million)
% 3.50/1.45 % (1509871)------------------------------
% 3.50/1.45 % (1509871)------------------------------
% 3.50/1.45 % (1509860)Success in time 0.41 s
% 3.50/1.45 % Vampire exiting
%------------------------------------------------------------------------------