%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET948+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:42:24 PM UTC 2026
% Result : Theorem 9.01s 2.18s
% Output : Refutation 9.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 19
% Syntax : Number of formulae : 151 ( 34 unt; 11 def)
% Number of atoms : 499 ( 84 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 586 ( 238 ~; 248 |; 81 &)
% ( 14 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-3 aty)
% Number of variables : 237 ( 0 sgn 215 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f7,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f8,axiom,
! [X0,X1] :
( X1 = union(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X2,X3)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f17,conjecture,
! [X0,X1] :
( ! [X2,X3] :
( ( in(X2,set_union2(X0,X1))
& in(X3,set_union2(X0,X1)) )
=> ( X2 = X3
| disjoint(X2,X3) ) )
=> union(set_intersection2(X0,X1)) = set_intersection2(union(X0),union(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t101_zfmisc_1) ).
fof(f18,negated_conjecture,
~ ! [X0,X1] :
( ! [X2,X3] :
( ( in(X2,set_union2(X0,X1))
& in(X3,set_union2(X0,X1)) )
=> ( X2 = X3
| disjoint(X2,X3) ) )
=> union(set_intersection2(X0,X1)) = set_intersection2(union(X0),union(X1)) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f20,axiom,
! [X0,X1] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t97_zfmisc_1) ).
fof(f24,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f30,plain,
? [X0,X1] :
( union(set_intersection2(X0,X1)) != set_intersection2(union(X0),union(X1))
& ! [X2,X3] :
( X2 = X3
| disjoint(X2,X3)
| ~ in(X2,set_union2(X0,X1))
| ~ in(X3,set_union2(X0,X1)) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f31,plain,
? [X0,X1] :
( union(set_intersection2(X0,X1)) != set_intersection2(union(X0),union(X1))
& ! [X2,X3] :
( X2 = X3
| disjoint(X2,X3)
| ~ in(X2,set_union2(X0,X1))
| ~ in(X3,set_union2(X0,X1)) ) ),
inference(flattening,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f33,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f34,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f36]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ( ( ( ~ in(sK0(X0,X1,X2),X0)
& ~ in(sK0(X0,X1,X2),X1) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( in(sK0(X0,X1,X2),X0)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f40,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f42]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f43]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( in(sK2(X0,X1,X2),X0)
& in(sK2(X0,X1,X2),X1) )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) ) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f47,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X2,X4)
& in(X4,X0) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ? [X7] :
( in(X5,X7)
& in(X7,X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f46]) ).
fof(f48,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ( ( ! [X3] :
( ~ in(sK3(X0,X1),X3)
| ~ in(X3,X0) )
| ~ in(sK3(X0,X1),X1) )
& ( ( in(sK3(X0,X1),sK4(X0,X1))
& in(sK4(X0,X1),X0) )
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ( in(X5,sK5(X0,X5))
& in(sK5(X0,X5),X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X2,sK3(X0,X1)),skolemize(X4,sK4(X0,X1)),skolemize(X7,sK5(X0,X5))],[f47]) ).
fof(f51,plain,
( union(set_intersection2(sK8,sK9)) != set_intersection2(union(sK8),union(sK9))
& ! [X2,X3] :
( X2 = X3
| disjoint(X2,X3)
| ~ in(X2,set_union2(sK8,sK9))
| ~ in(X3,set_union2(sK8,sK9)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f31]) ).
fof(f52,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| in(sK10(X0,X1),set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0,X1))],[f32]) ).
fof(f58,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f34]) ).
fof(f60,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f38]) ).
fof(f61,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f38]) ).
fof(f66,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f67,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f68,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f70,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f74,plain,
! [X0,X1,X5] :
( in(sK5(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f48]) ).
fof(f75,plain,
! [X0,X1,X5] :
( in(X5,sK5(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f48]) ).
fof(f76,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(X5,X6)
| ~ in(X6,X0)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f48]) ).
fof(f88,plain,
! [X2,X3] :
( X2 = X3
| disjoint(X2,X3)
| ~ in(X2,set_union2(sK8,sK9))
| ~ in(X3,set_union2(sK8,sK9)) ),
inference(cnf_transformation,[],[f51]) ).
fof(f89,plain,
union(set_intersection2(sK8,sK9)) != set_intersection2(union(sK8),union(sK9)),
inference(cnf_transformation,[],[f51]) ).
fof(f90,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f92,plain,
! [X0,X1] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
inference(cnf_transformation,[],[f20]) ).
fof(f95,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f61]) ).
fof(f96,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f60]) ).
fof(f98,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f70]) ).
fof(f99,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f69]) ).
fof(f100,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f68]) ).
fof(f101,plain,
! [X0,X6,X5] :
( ~ in(X6,X0)
| ~ in(X5,X6)
| in(X5,union(X0)) ),
inference(equality_resolution,[],[f76]) ).
fof(f102,plain,
! [X0,X5] :
( in(X5,sK5(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f75]) ).
fof(f103,plain,
! [X0,X5] :
( in(sK5(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f74]) ).
fof(f104,definition,
sF11 = set_intersection2(sK8,sK9),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f105,plain,
set_intersection2(sK8,sK9) = sF11,
inference(reorient_equations,[],[f104]) ).
fof(f106,definition,
sF12 = union(sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f107,plain,
union(sF11) = sF12,
inference(reorient_equations,[],[f106]) ).
fof(f108,definition,
sF13 = union(sK8),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f109,plain,
union(sK8) = sF13,
inference(reorient_equations,[],[f108]) ).
fof(f110,definition,
sF14 = union(sK9),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f111,plain,
union(sK9) = sF14,
inference(reorient_equations,[],[f110]) ).
fof(f112,definition,
sF15 = set_intersection2(sF13,sF14),
introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).
fof(f113,plain,
set_intersection2(sF13,sF14) = sF15,
inference(reorient_equations,[],[f112]) ).
fof(f114,plain,
sF12 != sF15,
inference(definition_folding,[],[f89,f113,f111,f109,f107,f105]) ).
fof(f115,definition,
sF16 = set_union2(sK8,sK9),
introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).
fof(f116,plain,
set_union2(sK8,sK9) = sF16,
inference(reorient_equations,[],[f115]) ).
fof(f117,plain,
! [X2,X3] :
( ~ in(X3,sF16)
| disjoint(X2,X3)
| ~ in(X2,sF16)
| X2 = X3 ),
inference(definition_folding,[],[f88,f116,f116]) ).
fof(f119,plain,
! [X0] :
( ~ in(X0,sF15)
| in(X0,sF13) ),
inference(superposition,[],[f99,f113]) ).
fof(f121,plain,
! [X0] :
( ~ in(X0,sF15)
| in(X0,sF14) ),
inference(superposition,[],[f100,f113]) ).
fof(f124,plain,
subset(union(sF11),set_intersection2(union(sK8),union(sK9))),
inference(superposition,[],[f92,f105]) ).
fof(f131,plain,
subset(union(sF11),set_intersection2(union(sK8),sF14)),
inference(forward_demodulation,[],[f124,f111]) ).
fof(f132,plain,
subset(union(sF11),set_intersection2(sF13,sF14)),
inference(forward_demodulation,[],[f131,f109]) ).
fof(f133,plain,
subset(union(sF11),sF15),
inference(forward_demodulation,[],[f132,f113]) ).
fof(f134,plain,
subset(sF12,sF15),
inference(forward_demodulation,[],[f133,f107]) ).
fof(f141,plain,
! [X0] :
( in(sK1(sF15,X0),sF14)
| subset(sF15,X0) ),
inference(resolution,[],[f66,f121]) ).
fof(f142,plain,
! [X0] :
( in(sK1(sF15,X0),sF13)
| subset(sF15,X0) ),
inference(resolution,[],[f66,f119]) ).
fof(f151,plain,
( ~ subset(sF15,sF12)
| sF12 = sF15 ),
inference(resolution,[],[f58,f134]) ).
fof(f152,plain,
~ subset(sF15,sF12),
inference(forward_subsumption_resolution,[],[f151,f114]) ).
fof(f155,plain,
! [X0] :
( ~ in(X0,sK8)
| in(X0,sF16) ),
inference(superposition,[],[f95,f116]) ).
fof(f159,plain,
! [X0] :
( ~ in(X0,sK9)
| in(X0,sF16) ),
inference(superposition,[],[f96,f116]) ).
fof(f180,plain,
! [X2,X0,X1] :
( ~ disjoint(X1,X2)
| ~ in(X0,X2)
| ~ in(X0,X1) ),
inference(resolution,[],[f98,f90]) ).
fof(f185,plain,
! [X0] :
( ~ in(X0,sK9)
| ~ in(X0,sK8)
| in(X0,sF11) ),
inference(superposition,[],[f98,f105]) ).
fof(f216,plain,
! [X0] :
( ~ in(X0,union(sK8))
| in(sK5(sK8,X0),sF16) ),
inference(resolution,[],[f103,f155]) ).
fof(f217,plain,
! [X0] :
( ~ in(X0,union(sK9))
| ~ in(sK5(sK9,X0),sK8)
| in(sK5(sK9,X0),sF11) ),
inference(resolution,[],[f103,f185]) ).
fof(f218,plain,
! [X0] :
( ~ in(X0,union(sK9))
| in(sK5(sK9,X0),sF16) ),
inference(resolution,[],[f103,f159]) ).
fof(f225,plain,
! [X0,X1] :
( disjoint(X1,sK5(sF16,X0))
| ~ in(X0,union(sF16))
| ~ in(X1,sF16)
| sK5(sF16,X0) = X1 ),
inference(resolution,[],[f103,f117]) ).
fof(f228,plain,
! [X0] :
( in(sK5(sK9,X0),sF16)
| ~ in(X0,sF14) ),
inference(forward_demodulation,[],[f218,f111]) ).
fof(f229,plain,
! [X0] :
( ~ in(sK5(sK9,X0),sK8)
| ~ in(X0,sF14)
| in(sK5(sK9,X0),sF11) ),
inference(forward_demodulation,[],[f217,f111]) ).
fof(f230,plain,
! [X0] :
( in(sK5(sK8,X0),sF16)
| ~ in(X0,sF13) ),
inference(forward_demodulation,[],[f216,f109]) ).
fof(f389,plain,
! [X2,X0,X1] :
( ~ in(X0,sK5(sF16,X1))
| ~ in(X0,X2)
| ~ in(X1,union(sF16))
| ~ in(X2,sF16)
| sK5(sF16,X1) = X2 ),
inference(resolution,[],[f180,f225]) ).
fof(f814,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X0,union(sF16))
| ~ in(X1,sF16)
| sK5(sF16,X0) = X1
| ~ in(X0,union(sF16)) ),
inference(resolution,[],[f389,f102]) ).
fof(f819,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X0,union(sF16))
| ~ in(X1,sF16)
| sK5(sF16,X0) = X1 ),
inference(duplicate_literal_removal,[],[f814]) ).
fof(f820,plain,
! [X0,X1] :
( ~ in(X1,sF16)
| ~ in(X0,X1)
| sK5(sF16,X0) = X1 ),
inference(forward_subsumption_resolution,[],[f819,f101]) ).
fof(f824,plain,
! [X0,X1] :
( ~ in(X0,sK5(sK8,X1))
| sK5(sF16,X0) = sK5(sK8,X1)
| ~ in(X1,sF13) ),
inference(resolution,[],[f820,f230]) ).
fof(f825,plain,
! [X0,X1] :
( ~ in(X0,sK5(sK9,X1))
| sK5(sF16,X0) = sK5(sK9,X1)
| ~ in(X1,sF14) ),
inference(resolution,[],[f820,f228]) ).
fof(f857,plain,
! [X0] :
( sK5(sK8,X0) = sK5(sF16,X0)
| ~ in(X0,sF13)
| ~ in(X0,union(sK8)) ),
inference(resolution,[],[f824,f102]) ).
fof(f862,plain,
! [X0] :
( ~ in(X0,sF13)
| sK5(sK8,X0) = sK5(sF16,X0)
| ~ in(X0,sF13) ),
inference(forward_demodulation,[],[f857,f109]) ).
fof(f863,plain,
! [X0] :
( ~ in(X0,sF13)
| sK5(sK8,X0) = sK5(sF16,X0) ),
inference(duplicate_literal_removal,[],[f862]) ).
fof(f864,plain,
! [X0] :
( subset(sF15,X0)
| sK5(sK8,sK1(sF15,X0)) = sK5(sF16,sK1(sF15,X0)) ),
inference(resolution,[],[f863,f142]) ).
fof(f873,plain,
sK5(sK8,sK1(sF15,sF12)) = sK5(sF16,sK1(sF15,sF12)),
inference(resolution,[],[f864,f152]) ).
fof(f892,definition,
( spl17_27
<=> in(sK1(sF15,sF12),sK5(sK8,sK1(sF15,sF12))) ),
introduced(definition,[new_symbols(definition,[spl17_27])],[avatar_definition]) ).
fof(f894,plain,
( in(sK1(sF15,sF12),sK5(sK8,sK1(sF15,sF12)))
| ~ spl17_27 ),
inference(avatar_component_clause,[],[f892]) ).
fof(f918,definition,
( spl17_33
<=> in(sK1(sF15,sF12),sF14) ),
introduced(definition,[new_symbols(definition,[spl17_33])],[avatar_definition]) ).
fof(f919,plain,
( ~ in(sK1(sF15,sF12),sF14)
| spl17_33 ),
inference(avatar_component_clause,[],[f918]) ).
fof(f926,definition,
( spl17_35
<=> in(sK5(sK8,sK1(sF15,sF12)),sK8) ),
introduced(definition,[new_symbols(definition,[spl17_35])],[avatar_definition]) ).
fof(f927,plain,
( ~ in(sK5(sK8,sK1(sF15,sF12)),sK8)
| spl17_35 ),
inference(avatar_component_clause,[],[f926]) ).
fof(f943,plain,
! [X0] :
( sK5(sK9,X0) = sK5(sF16,X0)
| ~ in(X0,sF14)
| ~ in(X0,union(sK9)) ),
inference(resolution,[],[f825,f102]) ).
fof(f948,plain,
! [X0] :
( ~ in(X0,sF14)
| sK5(sK9,X0) = sK5(sF16,X0)
| ~ in(X0,sF14) ),
inference(forward_demodulation,[],[f943,f111]) ).
fof(f949,plain,
! [X0] :
( ~ in(X0,sF14)
| sK5(sK9,X0) = sK5(sF16,X0) ),
inference(duplicate_literal_removal,[],[f948]) ).
fof(f950,plain,
! [X0] :
( subset(sF15,X0)
| sK5(sF16,sK1(sF15,X0)) = sK5(sK9,sK1(sF15,X0)) ),
inference(resolution,[],[f949,f141]) ).
fof(f961,plain,
sK5(sF16,sK1(sF15,sF12)) = sK5(sK9,sK1(sF15,sF12)),
inference(resolution,[],[f950,f152]) ).
fof(f964,plain,
sK5(sK8,sK1(sF15,sF12)) = sK5(sK9,sK1(sF15,sF12)),
inference(forward_demodulation,[],[f961,f873]) ).
fof(f969,plain,
( ~ in(sK5(sK8,sK1(sF15,sF12)),sK8)
| ~ in(sK1(sF15,sF12),sF14)
| in(sK5(sK8,sK1(sF15,sF12)),sF11) ),
inference(superposition,[],[f229,f964]) ).
fof(f973,plain,
( in(sK1(sF15,sF12),sK5(sK8,sK1(sF15,sF12)))
| ~ in(sK1(sF15,sF12),union(sK9)) ),
inference(superposition,[],[f102,f964]) ).
fof(f974,plain,
( ~ in(sK1(sF15,sF12),sF14)
| in(sK1(sF15,sF12),sK5(sK8,sK1(sF15,sF12))) ),
inference(forward_demodulation,[],[f973,f111]) ).
fof(f979,definition,
( spl17_39
<=> in(sK5(sK8,sK1(sF15,sF12)),sF11) ),
introduced(definition,[new_symbols(definition,[spl17_39])],[avatar_definition]) ).
fof(f981,plain,
( in(sK5(sK8,sK1(sF15,sF12)),sF11)
| ~ spl17_39 ),
inference(avatar_component_clause,[],[f979]) ).
fof(f982,plain,
( spl17_39
| ~ spl17_33
| ~ spl17_35 ),
inference(avatar_split_clause,[],[f969,f926,f918,f979]) ).
fof(f987,plain,
( spl17_27
| ~ spl17_33 ),
inference(avatar_split_clause,[],[f974,f918,f892]) ).
fof(f991,plain,
( subset(sF15,sF12)
| spl17_33 ),
inference(resolution,[],[f919,f141]) ).
fof(f992,plain,
( $false
| spl17_33 ),
inference(forward_subsumption_resolution,[],[f991,f152]) ).
fof(f993,plain,
spl17_33,
inference(avatar_contradiction_clause,[],[f992]) ).
fof(f1003,definition,
( spl17_41
<=> in(sK1(sF15,sF12),sF13) ),
introduced(definition,[new_symbols(definition,[spl17_41])],[avatar_definition]) ).
fof(f1004,plain,
( in(sK1(sF15,sF12),sF13)
| ~ spl17_41 ),
inference(avatar_component_clause,[],[f1003]) ).
fof(f1005,plain,
( ~ in(sK1(sF15,sF12),sF13)
| spl17_41 ),
inference(avatar_component_clause,[],[f1003]) ).
fof(f1008,plain,
( ~ in(sK1(sF15,sF12),union(sK8))
| spl17_35 ),
inference(resolution,[],[f927,f103]) ).
fof(f1009,plain,
( ~ in(sK1(sF15,sF12),sF13)
| spl17_35 ),
inference(forward_demodulation,[],[f1008,f109]) ).
fof(f1015,plain,
( subset(sF15,sF12)
| spl17_41 ),
inference(resolution,[],[f1005,f142]) ).
fof(f1016,plain,
( $false
| spl17_41 ),
inference(forward_subsumption_resolution,[],[f1015,f152]) ).
fof(f1017,plain,
spl17_41,
inference(avatar_contradiction_clause,[],[f1016]) ).
fof(f1018,plain,
( $false
| spl17_35
| ~ spl17_41 ),
inference(forward_subsumption_resolution,[],[f1009,f1004]) ).
fof(f1019,plain,
( spl17_35
| ~ spl17_41 ),
inference(avatar_contradiction_clause,[],[f1018]) ).
fof(f1028,plain,
( ! [X0] :
( ~ in(X0,sK5(sK8,sK1(sF15,sF12)))
| in(X0,union(sF11)) )
| ~ spl17_39 ),
inference(resolution,[],[f981,f101]) ).
fof(f1029,plain,
( ! [X0] :
( ~ in(X0,sK5(sK8,sK1(sF15,sF12)))
| in(X0,sF12) )
| ~ spl17_39 ),
inference(forward_demodulation,[],[f1028,f107]) ).
fof(f1199,plain,
( in(sK1(sF15,sF12),sF12)
| ~ spl17_27
| ~ spl17_39 ),
inference(resolution,[],[f1029,f894]) ).
fof(f1213,plain,
( subset(sF15,sF12)
| ~ spl17_27
| ~ spl17_39 ),
inference(resolution,[],[f1199,f67]) ).
fof(f1221,plain,
( $false
| ~ spl17_27
| ~ spl17_39 ),
inference(forward_subsumption_resolution,[],[f1213,f152]) ).
fof(f1222,plain,
( ~ spl17_27
| ~ spl17_39 ),
inference(avatar_contradiction_clause,[],[f1221]) ).
cnf(s27,plain,
( ~ spl17_33
| ~ spl17_35
| spl17_39 ),
inference(sat_conversion,[],[f982]) ).
cnf(s32,plain,
( spl17_27
| ~ spl17_33 ),
inference(sat_conversion,[],[f987]) ).
cnf(s35,plain,
spl17_33,
inference(sat_conversion,[],[f993]) ).
cnf(s37,plain,
spl17_41,
inference(sat_conversion,[],[f1017]) ).
cnf(s38,plain,
( spl17_35
| ~ spl17_41 ),
inference(sat_conversion,[],[f1019]) ).
cnf(s44,plain,
( ~ spl17_27
| ~ spl17_39 ),
inference(sat_conversion,[],[f1222]) ).
cnf(s45,plain,
spl17_35,
inference(rat,[],[s38,s37]) ).
cnf(s51,plain,
spl17_27,
inference(rat,[],[s32,s35]) ).
cnf(s52,plain,
~ spl17_39,
inference(rat,[],[s44,s51]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s27,s52,s45,s35]) ).
fof(f1223,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET948+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n019.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 03:16:03 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.01/2.18 % (3627827)Detected formulas, will run a generic FOF schedule.
% 9.01/2.18 % (3627938)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=373451696:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.01/2.18 % (3627939)dis-21_1_sil=8000:lcm=predicate:random_seed=1563640107: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)
% 9.01/2.18 % (3627933)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=2736140341:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.01/2.18 % (3627937)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1881824360:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.01/2.18 % (3627935)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=2535536396:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.01/2.18 % (3627934)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=2632145523:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.01/2.18 % (3627936)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1584794975:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.01/2.18 % (3627936)Refutation not found, incomplete strategy
% 9.01/2.18 % (3627936)------------------------------
% 9.01/2.18 % (3627936)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627936)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627936)Termination reason: Refutation not found, incomplete strategy
% 9.01/2.18 % (3627936)Time elapsed: 0.010 s
% 9.01/2.18 % (3627936)Peak memory usage: 88 MB
% 9.01/2.18 % (3627936)Instructions burned: 13 (million)
% 9.01/2.18 % (3627938)Instruction limit reached!
% 9.01/2.18 % (3627938)------------------------------
% 9.01/2.18 % (3627938)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627938)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627938)Termination reason: Instruction limit
% 9.01/2.18 % (3627938)Termination phase: Saturation
% 9.01/2.18 % (3627938)Time elapsed: 0.044 s
% 9.01/2.18 % (3627938)Peak memory usage: 89 MB
% 9.01/2.18 % (3627938)Instructions burned: 140 (million)
% 9.01/2.18 % (3627937)Instruction limit reached!
% 9.01/2.18 % (3627937)------------------------------
% 9.01/2.18 % (3627937)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627937)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627937)Termination reason: Instruction limit
% 9.01/2.18 % (3627937)Termination phase: Saturation
% 9.01/2.18 % (3627937)Time elapsed: 0.073 s
% 9.01/2.18 % (3627937)Peak memory usage: 88 MB
% 9.01/2.18 % (3627937)Instructions burned: 119 (million)
% 9.01/2.18 % (3627939)Instruction limit reached!
% 9.01/2.18 % (3627939)------------------------------
% 9.01/2.18 % (3627939)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627939)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627939)Termination reason: Instruction limit
% 9.01/2.18 % (3627939)Termination phase: Saturation
% 9.01/2.18 % (3627939)Time elapsed: 0.075 s
% 9.01/2.18 % (3627939)Peak memory usage: 89 MB
% 9.01/2.18 % (3627939)Instructions burned: 131 (million)
% 9.01/2.18 % (3627947)lrs+10_1_sil=8000:sp=occurrence:random_seed=3478818293:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 9.01/2.18 % (3627969)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3081482139:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 9.01/2.18 % (3627968)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3340253387:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 9.01/2.18 % (3627947)Instruction limit reached!
% 9.01/2.18 % (3627947)------------------------------
% 9.01/2.18 % (3627947)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627947)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627947)Termination reason: Instruction limit
% 9.01/2.18 % (3627947)Termination phase: Saturation
% 9.01/2.18 % (3627947)Time elapsed: 0.090 s
% 9.01/2.18 % (3627947)Peak memory usage: 91 MB
% 9.01/2.18 % (3627947)Instructions burned: 288 (million)
% 9.01/2.18 % (3627968)Refutation not found, incomplete strategy
% 9.01/2.18 % (3627968)------------------------------
% 9.01/2.18 % (3627968)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627968)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627968)Termination reason: Refutation not found, incomplete strategy
% 9.01/2.18 % (3627968)Time elapsed: 0.004 s
% 9.01/2.18 % (3627968)Peak memory usage: 88 MB
% 9.01/2.18 % (3627968)Instructions burned: 5 (million)
% 9.01/2.18 % (3627936)------------------------------
% 9.01/2.18 % (3627936)------------------------------
% 9.01/2.18 % (3627983)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1392903871:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 9.01/2.18 % (3627994)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=4236769603:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 9.01/2.18 % (3627994)Refutation not found, incomplete strategy
% 9.01/2.18 % (3627994)------------------------------
% 9.01/2.18 % (3627994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627994)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627994)Termination reason: Refutation not found, incomplete strategy
% 9.01/2.18 % (3627994)Time elapsed: 0.004 s
% 9.01/2.18 % (3627994)Peak memory usage: 88 MB
% 9.01/2.18 % (3627994)Instructions burned: 5 (million)
% 9.01/2.18 % (3627983)Instruction limit reached!
% 9.01/2.18 % (3627983)------------------------------
% 9.01/2.18 % (3627983)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627983)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627983)Termination reason: Instruction limit
% 9.01/2.18 % (3627983)Termination phase: Saturation
% 9.01/2.18 % (3627983)Time elapsed: 0.069 s
% 9.01/2.18 % (3627983)Peak memory usage: 91 MB
% 9.01/2.18 % (3627983)Instructions burned: 252 (million)
% 9.01/2.18 % (3627969)Instruction limit reached!
% 9.01/2.18 % (3627969)------------------------------
% 9.01/2.18 % (3627969)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3627969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3627969)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3627969)Termination reason: Instruction limit
% 9.01/2.18 % (3627969)Termination phase: Saturation
% 9.01/2.18 % (3627969)Time elapsed: 0.214 s
% 9.01/2.18 % (3627969)Peak memory usage: 91 MB
% 9.01/2.18 % (3627969)Instructions burned: 326 (million)
% 9.01/2.18 % (3627968)------------------------------
% 9.01/2.18 % (3627968)------------------------------
% 9.01/2.18 % (3628063)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2337984892:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 9.01/2.18 % (3628074)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3345200425:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 9.01/2.18 % (3628086)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1429904442:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 9.01/2.18 % (3627994)------------------------------
% 9.01/2.18 % (3627994)------------------------------
% 9.01/2.18 % (3628074)Instruction limit reached!
% 9.01/2.18 % (3628074)------------------------------
% 9.01/2.18 % (3628074)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3628074)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3628074)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3628074)Termination reason: Instruction limit
% 9.01/2.18 % (3628074)Termination phase: Saturation
% 9.01/2.18 % (3628074)Time elapsed: 0.067 s
% 9.01/2.18 % (3628074)Peak memory usage: 89 MB
% 9.01/2.18 % (3628074)Instructions burned: 114 (million)
% 9.01/2.18 % (3628086)Instruction limit reached!
% 9.01/2.18 % (3628086)------------------------------
% 9.01/2.18 % (3628086)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3628086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3628086)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3628086)Termination reason: Instruction limit
% 9.01/2.18 % (3628086)Termination phase: Saturation
% 9.01/2.18 % (3628086)Time elapsed: 0.064 s
% 9.01/2.18 % (3628086)Peak memory usage: 89 MB
% 9.01/2.18 % (3628086)Instructions burned: 128 (million)
% 9.01/2.18 % (3628109)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3930824422:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 9.01/2.18 % (3628119)lrs+10_1_sil=8000:sp=occurrence:random_seed=2847564210:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 9.01/2.18 % (3628136)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2377511977:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 9.01/2.18 % (3628136)Refutation not found, incomplete strategy
% 9.01/2.18 % (3628136)------------------------------
% 9.01/2.18 % (3628136)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3628136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3628136)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3628136)Termination reason: Refutation not found, incomplete strategy
% 9.01/2.18 % (3628136)Time elapsed: 0.005 s
% 9.01/2.18 % (3628136)Peak memory usage: 88 MB
% 9.01/2.18 % (3628136)Instructions burned: 7 (million)
% 9.01/2.18 % (3628109)Instruction limit reached!
% 9.01/2.18 % (3628109)------------------------------
% 9.01/2.18 % (3628109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.01/2.18 % (3628109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.01/2.18 % (3628109)CaDiCaL version: 2.1.3
% 9.01/2.18 % (3628109)Termination reason: Instruction limit
% 9.01/2.18 % (3628109)Termination phase: Saturation
% 9.01/2.18 % (3628109)Time elapsed: 0.062 s
% 9.01/2.18 % (3628109)Peak memory usage: 88 MB
% 9.01/2.18 % (3628109)Instructions burned: 114 (million)
% 9.01/2.18 % (3627933)First to succeed.
% 9.01/2.18 % (3627933)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3627827"
% 9.01/2.18 % (3628143)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2579927380:i=5202:ss=axioms:sgt=16_2989 on theBenchmark for (2989ds/5202Mi)
% 9.01/2.18 % (3628136)------------------------------
% 9.01/2.18 % (3628136)------------------------------
% 9.01/2.18 % (3627933)Refutation found. Thanks to Tanya!
% 9.01/2.18 % SZS status Theorem for theBenchmark
% 9.01/2.18 % SZS output start Proof for theBenchmark
% See solution above
% 9.93/2.38 % (3627933)------------------------------
% 9.93/2.38 % (3627933)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.93/2.38 % (3627933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.93/2.38 % (3627933)CaDiCaL version: 2.1.3
% 9.93/2.38 % (3627933)Termination reason: Refutation
% 9.93/2.38 % (3627933)Time elapsed: 0.893 s
% 9.93/2.38 % (3627933)Peak memory usage: 131 MB
% 9.93/2.38 % (3627933)Instructions burned: 1213 (million)
% 9.93/2.38 % (3627933)------------------------------
% 9.93/2.38 % (3627933)------------------------------
% 9.93/2.38 % (3627827)Success in time 1.326 s
% 9.93/2.38 % Vampire exiting
%------------------------------------------------------------------------------