%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU201+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:47:42 PM UTC 2026
% Result : Theorem 4.49s 1.91s
% Output : Refutation 8.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 12
% Syntax : Number of formulae : 112 ( 18 unt; 4 def)
% Number of atoms : 440 ( 64 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 554 ( 226 ~; 243 |; 65 &)
% ( 13 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 265 ( 244 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f6,axiom,
! [X0,X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( X2 = relation_rng_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_1) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,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(f9,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X3,X2),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_relat_1) ).
fof(f10,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f18,axiom,
! [X0,X1] :
( relation(X1)
=> relation(relation_rng_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_relat_1) ).
fof(f40,conjecture,
! [X0,X1] :
( relation(X1)
=> relation_rng(relation_rng_restriction(X0,X1)) = set_intersection2(relation_rng(X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t119_relat_1) ).
fof(f41,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> relation_rng(relation_rng_restriction(X0,X1)) = set_intersection2(relation_rng(X1),X0) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f56,plain,
! [X0,X1] :
( ! [X2] :
( ( X2 = relation_rng_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) ) ) )
| ~ relation(X2) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X3,X2),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f59,plain,
! [X0,X1] :
( relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f68,plain,
? [X0,X1] :
( relation_rng(relation_rng_restriction(X0,X1)) != set_intersection2(relation_rng(X1),X0)
& relation(X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f80,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f81,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = relation_rng_restriction(X0,X1)
| ? [X3,X4] :
( ( ~ in(X4,X0)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ~ in(X4,X0)
| ~ in(ordered_pair(X3,X4),X1) )
& ( ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) )
| ~ in(ordered_pair(X3,X4),X2) ) )
| relation_rng_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X1) ),
inference(nnf_transformation,[],[f56]) ).
fof(f83,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = relation_rng_restriction(X0,X1)
| ? [X3,X4] :
( ( ~ in(X4,X0)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ~ in(X4,X0)
| ~ in(ordered_pair(X3,X4),X1) )
& ( ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) )
| ~ in(ordered_pair(X3,X4),X2) ) )
| relation_rng_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X1) ),
inference(flattening,[],[f82]) ).
fof(f84,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = relation_rng_restriction(X0,X1)
| ? [X3,X4] :
( ( ~ in(X4,X0)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X3,X4),X2) )
& ( ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) )
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X2)
| ~ in(X6,X0)
| ~ in(ordered_pair(X5,X6),X1) )
& ( ( in(X6,X0)
& in(ordered_pair(X5,X6),X1) )
| ~ in(ordered_pair(X5,X6),X2) ) )
| relation_rng_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X1) ),
inference(rectify,[],[f83]) ).
fof(f85,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = relation_rng_restriction(X0,X1)
| ( ( ~ in(sK1(X0,X1,X2),X0)
| ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X1)
| ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X1) )
| in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2) ) ) )
& ( ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X2)
| ~ in(X6,X0)
| ~ in(ordered_pair(X5,X6),X1) )
& ( ( in(X6,X0)
& in(ordered_pair(X5,X6),X1) )
| ~ in(ordered_pair(X5,X6),X2) ) )
| relation_rng_restriction(X0,X1) != X2 ) )
| ~ relation(X2) )
| ~ relation(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X3,sK0(X0,X1,X2)),skolemize(X4,sK1(X0,X1,X2))],[f84]) ).
fof(f86,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,[],[f57]) ).
fof(f87,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,[],[f86]) ).
fof(f88,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f87]) ).
fof(f89,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,[],[f8]) ).
fof(f90,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,[],[f89]) ).
fof(f91,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,[],[f90]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK3(X0,X1,X2),X0)
& in(sK3(X0,X1,X2),X1) )
| in(sK3(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,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f91]) ).
fof(f93,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_rng(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X3,X2),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X3,X2),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X3,X2),X0) )
& ( ? [X3] : in(ordered_pair(X3,X2),X0)
| ~ in(X2,X1) ) )
| relation_rng(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f58]) ).
fof(f94,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_rng(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X3,X2),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X4,X2),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X6,X5),X0) )
& ( ? [X7] : in(ordered_pair(X7,X5),X0)
| ~ in(X5,X1) ) )
| relation_rng(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f93]) ).
fof(f95,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_rng(X0)
| ( ( ! [X3] : ~ in(ordered_pair(X3,sK4(X0,X1)),X0)
| ~ in(sK4(X0,X1),X1) )
& ( in(ordered_pair(sK5(X0,X1),sK4(X0,X1)),X0)
| in(sK4(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X6,X5),X0) )
& ( in(ordered_pair(sK6(X0,X5),X5),X0)
| ~ in(X5,X1) ) )
| relation_rng(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X2,sK4(X0,X1)),skolemize(X4,sK5(X0,X1)),skolemize(X7,sK6(X0,X5))],[f94]) ).
fof(f103,plain,
( relation_rng(relation_rng_restriction(sK14,sK15)) != set_intersection2(relation_rng(sK15),sK14)
& relation(sK15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X0,sK14),skolemize(X1,sK15)],[f68]) ).
fof(f111,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f81]) ).
fof(f112,plain,
! [X2,X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),X1)
| ~ in(ordered_pair(X5,X6),X2)
| relation_rng_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f113,plain,
! [X2,X0,X1,X6,X5] :
( in(X6,X0)
| ~ in(ordered_pair(X5,X6),X2)
| relation_rng_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f114,plain,
! [X2,X0,X1,X6,X5] :
( in(ordered_pair(X5,X6),X2)
| ~ in(X6,X0)
| ~ in(ordered_pair(X5,X6),X1)
| relation_rng_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f119,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f120,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f121,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f92]) ).
fof(f122,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f92]) ).
fof(f123,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f92]) ).
fof(f127,plain,
! [X0,X1,X5] :
( in(ordered_pair(sK6(X0,X5),X5),X0)
| ~ in(X5,X1)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f128,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X6,X5),X0)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f131,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f132,plain,
! [X0,X1] :
( relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f159,plain,
relation(sK15),
inference(cnf_transformation,[],[f103]) ).
fof(f160,plain,
relation_rng(relation_rng_restriction(sK14,sK15)) != set_intersection2(relation_rng(sK15),sK14),
inference(cnf_transformation,[],[f103]) ).
fof(f175,plain,
! [X2,X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X2)
| ~ in(X6,X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
| relation_rng_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X1) ),
inference(definition_unfolding,[],[f114,f131,f131]) ).
fof(f176,plain,
! [X2,X0,X1,X6,X5] :
( in(X6,X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X2)
| relation_rng_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X1) ),
inference(definition_unfolding,[],[f113,f131]) ).
fof(f177,plain,
! [X2,X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X2)
| relation_rng_restriction(X0,X1) != X2
| ~ relation(X2)
| ~ relation(X1) ),
inference(definition_unfolding,[],[f112,f131,f131]) ).
fof(f180,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),X0)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f128,f131]) ).
fof(f181,plain,
! [X0,X1,X5] :
( in(unordered_pair(unordered_pair(sK6(X0,X5),X5),singleton(sK6(X0,X5))),X0)
| ~ in(X5,X1)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f127,f131]) ).
fof(f185,plain,
! [X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_rng_restriction(X0,X1))
| ~ in(X6,X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
| ~ relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(equality_resolution,[],[f175]) ).
fof(f186,plain,
! [X0,X1,X6,X5] :
( in(X6,X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_rng_restriction(X0,X1))
| ~ relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(equality_resolution,[],[f176]) ).
fof(f187,plain,
! [X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_rng_restriction(X0,X1))
| ~ relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(equality_resolution,[],[f177]) ).
fof(f188,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f123]) ).
fof(f189,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f122]) ).
fof(f190,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f121]) ).
fof(f191,plain,
! [X0,X6,X5] :
( ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),X0)
| in(X5,relation_rng(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f180]) ).
fof(f192,plain,
! [X0,X5] :
( in(unordered_pair(unordered_pair(sK6(X0,X5),X5),singleton(sK6(X0,X5))),X0)
| ~ in(X5,relation_rng(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f181]) ).
fof(f193,definition,
sF16 = relation_rng_restriction(sK14,sK15),
introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).
fof(f194,plain,
relation_rng_restriction(sK14,sK15) = sF16,
inference(reorient_equations,[],[f193]) ).
fof(f195,definition,
sF17 = relation_rng(sF16),
introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).
fof(f196,plain,
relation_rng(sF16) = sF17,
inference(reorient_equations,[],[f195]) ).
fof(f197,definition,
sF18 = relation_rng(sK15),
introduced(definition,[new_symbols(definition,[sF18])],[function_definition]) ).
fof(f198,plain,
relation_rng(sK15) = sF18,
inference(reorient_equations,[],[f197]) ).
fof(f199,definition,
sF19 = set_intersection2(sF18,sK14),
introduced(definition,[new_symbols(definition,[sF19])],[function_definition]) ).
fof(f200,plain,
set_intersection2(sF18,sK14) = sF19,
inference(reorient_equations,[],[f199]) ).
fof(f201,plain,
sF17 != sF19,
inference(definition_folding,[],[f160,f200,f198,f196,f194]) ).
fof(f202,plain,
! [X0,X1,X6,X5] :
( ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_rng_restriction(X0,X1))
| in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
| ~ relation(X1) ),
inference(forward_subsumption_resolution,[],[f187,f132]) ).
fof(f203,plain,
! [X0,X1,X6,X5] :
( ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_rng_restriction(X0,X1))
| in(X6,X0)
| ~ relation(X1) ),
inference(forward_subsumption_resolution,[],[f186,f132]) ).
fof(f204,plain,
! [X0,X1,X6,X5] :
( in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_rng_restriction(X0,X1))
| ~ in(X6,X0)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
| ~ relation(X1) ),
inference(forward_subsumption_resolution,[],[f185,f132]) ).
fof(f205,plain,
! [X0] :
( ~ in(X0,sF19)
| in(X0,sF18) ),
inference(superposition,[],[f189,f200]) ).
fof(f206,plain,
! [X0] :
( ~ in(X0,sF19)
| in(X0,sK14) ),
inference(superposition,[],[f190,f200]) ).
fof(f207,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF16)
| in(X1,sK14)
| ~ relation(sK15) ),
inference(superposition,[],[f203,f194]) ).
fof(f208,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF16)
| in(X1,sK14) ),
inference(forward_subsumption_resolution,[],[f207,f159]) ).
fof(f227,plain,
( relation(sF16)
| ~ relation(sK15) ),
inference(superposition,[],[f132,f194]) ).
fof(f228,plain,
relation(sF16),
inference(forward_subsumption_resolution,[],[f227,f159]) ).
fof(f230,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF16)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK15)
| ~ relation(sK15) ),
inference(superposition,[],[f202,f194]) ).
fof(f231,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF16)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK15) ),
inference(forward_subsumption_resolution,[],[f230,f159]) ).
fof(f233,plain,
! [X0] :
( in(X0,sK14)
| ~ in(X0,relation_rng(sF16))
| ~ relation(sF16) ),
inference(resolution,[],[f208,f192]) ).
fof(f234,plain,
! [X0] :
( in(X0,sK14)
| ~ in(X0,relation_rng(sF16)) ),
inference(forward_subsumption_resolution,[],[f233,f228]) ).
fof(f235,plain,
! [X0] :
( ~ in(X0,sF17)
| in(X0,sK14) ),
inference(forward_demodulation,[],[f234,f196]) ).
fof(f247,plain,
! [X0] :
( ~ in(X0,sF18)
| in(X0,sF19)
| ~ in(X0,sK14) ),
inference(superposition,[],[f188,f200]) ).
fof(f262,plain,
! [X0] :
( in(sK2(sF17,X0),sK14)
| subset(sF17,X0) ),
inference(resolution,[],[f119,f235]) ).
fof(f264,plain,
! [X0] :
( in(sK2(sF19,X0),sK14)
| subset(sF19,X0) ),
inference(resolution,[],[f119,f206]) ).
fof(f265,plain,
! [X0] :
( in(sK2(sF19,X0),sF18)
| subset(sF19,X0) ),
inference(resolution,[],[f119,f205]) ).
fof(f270,plain,
! [X0,X1] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF16)
| ~ in(X1,sK14)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK15)
| ~ relation(sK15) ),
inference(superposition,[],[f204,f194]) ).
fof(f273,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK15)
| ~ in(X1,sK14)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF16) ),
inference(forward_subsumption_resolution,[],[f270,f159]) ).
fof(f275,plain,
! [X0] :
( in(unordered_pair(unordered_pair(sK6(sF16,X0),X0),singleton(sK6(sF16,X0))),sK15)
| ~ in(X0,relation_rng(sF16))
| ~ relation(sF16) ),
inference(resolution,[],[f231,f192]) ).
fof(f276,plain,
! [X0] :
( in(unordered_pair(unordered_pair(sK6(sF16,X0),X0),singleton(sK6(sF16,X0))),sK15)
| ~ in(X0,relation_rng(sF16)) ),
inference(forward_subsumption_resolution,[],[f275,f228]) ).
fof(f277,plain,
! [X0] :
( in(unordered_pair(unordered_pair(sK6(sF16,X0),X0),singleton(sK6(sF16,X0))),sK15)
| ~ in(X0,sF17) ),
inference(forward_demodulation,[],[f276,f196]) ).
fof(f278,plain,
! [X0] :
( ~ in(X0,sF17)
| in(X0,relation_rng(sK15))
| ~ relation(sK15) ),
inference(resolution,[],[f277,f191]) ).
fof(f279,plain,
! [X0] :
( ~ in(X0,sF17)
| in(X0,relation_rng(sK15)) ),
inference(forward_subsumption_resolution,[],[f278,f159]) ).
fof(f280,plain,
! [X0] :
( ~ in(X0,sF17)
| in(X0,sF18) ),
inference(forward_demodulation,[],[f279,f198]) ).
fof(f282,plain,
! [X0] :
( in(sK2(sF17,X0),sF18)
| subset(sF17,X0) ),
inference(resolution,[],[f280,f119]) ).
fof(f283,plain,
! [X0] :
( subset(sF17,X0)
| in(sK2(sF17,X0),sF19)
| ~ in(sK2(sF17,X0),sK14) ),
inference(resolution,[],[f282,f247]) ).
fof(f284,plain,
! [X0] :
( in(sK2(sF17,X0),sF19)
| subset(sF17,X0) ),
inference(forward_subsumption_resolution,[],[f283,f262]) ).
fof(f287,plain,
! [X0] :
( ~ in(X0,sK14)
| in(unordered_pair(unordered_pair(sK6(sK15,X0),X0),singleton(sK6(sK15,X0))),sF16)
| ~ in(X0,relation_rng(sK15))
| ~ relation(sK15) ),
inference(resolution,[],[f273,f192]) ).
fof(f290,plain,
! [X0] :
( ~ in(X0,sK14)
| in(unordered_pair(unordered_pair(sK6(sK15,X0),X0),singleton(sK6(sK15,X0))),sF16)
| ~ in(X0,relation_rng(sK15)) ),
inference(forward_subsumption_resolution,[],[f287,f159]) ).
fof(f291,plain,
! [X0] :
( in(unordered_pair(unordered_pair(sK6(sK15,X0),X0),singleton(sK6(sK15,X0))),sF16)
| ~ in(X0,sK14)
| ~ in(X0,sF18) ),
inference(forward_demodulation,[],[f290,f198]) ).
fof(f294,plain,
! [X0] :
( ~ in(X0,sK14)
| ~ in(X0,sF18)
| in(X0,relation_rng(sF16))
| ~ relation(sF16) ),
inference(resolution,[],[f291,f191]) ).
fof(f295,plain,
! [X0] :
( ~ in(X0,sK14)
| ~ in(X0,sF18)
| in(X0,relation_rng(sF16)) ),
inference(forward_subsumption_resolution,[],[f294,f228]) ).
fof(f296,plain,
! [X0] :
( ~ in(X0,sF18)
| ~ in(X0,sK14)
| in(X0,sF17) ),
inference(forward_demodulation,[],[f295,f196]) ).
fof(f298,plain,
! [X0] :
( ~ in(sK2(sF19,X0),sK14)
| in(sK2(sF19,X0),sF17)
| subset(sF19,X0) ),
inference(resolution,[],[f296,f265]) ).
fof(f301,plain,
! [X0] :
( in(sK2(sF19,X0),sF17)
| subset(sF19,X0) ),
inference(forward_subsumption_resolution,[],[f298,f264]) ).
fof(f317,plain,
( subset(sF19,sF17)
| subset(sF19,sF17) ),
inference(resolution,[],[f120,f301]) ).
fof(f320,plain,
( subset(sF17,sF19)
| subset(sF17,sF19) ),
inference(resolution,[],[f120,f284]) ).
fof(f322,plain,
subset(sF17,sF19),
inference(duplicate_literal_removal,[],[f320]) ).
fof(f325,plain,
subset(sF19,sF17),
inference(duplicate_literal_removal,[],[f317]) ).
fof(f339,plain,
( ~ subset(sF17,sF19)
| sF17 = sF19 ),
inference(resolution,[],[f111,f325]) ).
fof(f341,plain,
sF17 = sF19,
inference(forward_subsumption_resolution,[],[f339,f322]) ).
fof(f343,plain,
$false,
inference(forward_subsumption_resolution,[],[f341,f201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU201+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n006.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 04:00:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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
% 4.49/1.90 % (3565312)Detected formulas, will run a generic FOF schedule.
% 4.49/1.90 % (3565323)dis-21_1_sil=8000:lcm=predicate:random_seed=704554119: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)
% 4.49/1.90 % (3565317)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=810237920:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.49/1.90 % (3565321)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=766874533:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.49/1.90 % (3565320)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3715264051:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.49/1.90 % (3565322)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3849017921:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.49/1.90 % (3565319)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=3194721339:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.49/1.90 % (3565318)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=3245835299:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.49/1.90 % (3565320)Refutation not found, incomplete strategy
% 4.49/1.90 % (3565320)------------------------------
% 4.49/1.90 % (3565320)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.90 % (3565320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.90 % (3565320)CaDiCaL version: 2.1.3
% 4.49/1.90 % (3565320)Termination reason: Refutation not found, incomplete strategy
% 4.49/1.90 % (3565320)Time elapsed: 0.002 s
% 4.49/1.90 % (3565320)Peak memory usage: 88 MB
% 4.49/1.90 % (3565320)Instructions burned: 1 (million)
% 4.49/1.90 % (3565323)Instruction limit reached!
% 4.49/1.90 % (3565323)------------------------------
% 4.49/1.90 % (3565323)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.90 % (3565323)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.90 % (3565323)CaDiCaL version: 2.1.3
% 4.49/1.90 % (3565323)Termination reason: Instruction limit
% 4.49/1.90 % (3565323)Termination phase: Saturation
% 4.49/1.90 % (3565323)Time elapsed: 0.042 s
% 4.49/1.90 % (3565323)Peak memory usage: 89 MB
% 4.49/1.90 % (3565323)Instructions burned: 129 (million)
% 4.49/1.90 % (3565321)Instruction limit reached!
% 4.49/1.90 % (3565321)------------------------------
% 4.49/1.90 % (3565321)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.90 % (3565321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.90 % (3565321)CaDiCaL version: 2.1.3
% 4.49/1.90 % (3565321)Termination reason: Instruction limit
% 4.49/1.90 % (3565321)Termination phase: Saturation
% 4.49/1.90 % (3565321)Time elapsed: 0.071 s
% 4.49/1.90 % (3565321)Peak memory usage: 88 MB
% 4.49/1.90 % (3565321)Instructions burned: 121 (million)
% 4.49/1.90 % (3565322)Instruction limit reached!
% 4.49/1.90 % (3565322)------------------------------
% 4.49/1.90 % (3565322)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565322)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565322)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565322)Termination reason: Instruction limit
% 4.49/1.91 % (3565322)Termination phase: Saturation
% 4.49/1.91 % (3565322)Time elapsed: 0.103 s
% 4.49/1.91 % (3565322)Peak memory usage: 90 MB
% 4.49/1.91 % (3565322)Instructions burned: 139 (million)
% 4.49/1.91 % (3565331)lrs+10_1_sil=8000:sp=occurrence:random_seed=830975736:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.49/1.91 % (3565331)Instruction limit reached!
% 4.49/1.91 % (3565331)------------------------------
% 4.49/1.91 % (3565331)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565331)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565331)Termination reason: Instruction limit
% 4.49/1.91 % (3565331)Termination phase: Saturation
% 4.49/1.91 % (3565331)Time elapsed: 0.091 s
% 4.49/1.91 % (3565331)Peak memory usage: 91 MB
% 4.49/1.91 % (3565331)Instructions burned: 285 (million)
% 4.49/1.91 % (3565332)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1702597389:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.49/1.91 % (3565320)------------------------------
% 4.49/1.91 % (3565320)------------------------------
% 4.49/1.91 % (3565333)lrs+1011_1_sil=32000:sp=occurrence:random_seed=773192801:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.49/1.91 % (3565332)Instruction limit reached!
% 4.49/1.91 % (3565332)------------------------------
% 4.49/1.91 % (3565332)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565332)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565332)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565332)Termination reason: Instruction limit
% 4.49/1.91 % (3565332)Termination phase: Saturation
% 4.49/1.91 % (3565332)Time elapsed: 0.084 s
% 4.49/1.91 % (3565332)Peak memory usage: 90 MB
% 4.49/1.91 % (3565332)Instructions burned: 157 (million)
% 4.49/1.91 % (3565336)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=3431003529:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.49/1.91 % (3565338)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3237868336:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 4.49/1.91 % (3565338)Refutation not found, incomplete strategy
% 4.49/1.91 % (3565338)------------------------------
% 4.49/1.91 % (3565338)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565338)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565338)Termination reason: Refutation not found, incomplete strategy
% 4.49/1.91 % (3565338)Time elapsed: 0.003 s
% 4.49/1.91 % (3565338)Peak memory usage: 88 MB
% 4.49/1.91 % (3565338)Instructions burned: 3 (million)
% 4.49/1.91 % (3565336)Instruction limit reached!
% 4.49/1.91 % (3565336)------------------------------
% 4.49/1.91 % (3565336)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565336)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565336)Termination reason: Instruction limit
% 4.49/1.91 % (3565336)Termination phase: Saturation
% 4.49/1.91 % (3565336)Time elapsed: 0.075 s
% 4.49/1.91 % (3565336)Peak memory usage: 94 MB
% 4.49/1.91 % (3565336)Instructions burned: 250 (million)
% 4.49/1.91 % (3565339)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2990387562:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.49/1.91 % (3565333)Instruction limit reached!
% 4.49/1.91 % (3565333)------------------------------
% 4.49/1.91 % (3565333)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565333)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565333)Termination reason: Instruction limit
% 4.49/1.91 % (3565333)Termination phase: Saturation
% 4.49/1.91 % (3565333)Time elapsed: 0.211 s
% 4.49/1.91 % (3565333)Peak memory usage: 91 MB
% 4.49/1.91 % (3565333)Instructions burned: 326 (million)
% 4.49/1.91 % (3565342)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1285400016:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 4.49/1.91 % (3565342)Instruction limit reached!
% 4.49/1.91 % (3565342)------------------------------
% 4.49/1.91 % (3565342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565342)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565342)Termination reason: Instruction limit
% 4.49/1.91 % (3565342)Termination phase: Saturation
% 4.49/1.91 % (3565342)Time elapsed: 0.051 s
% 4.49/1.91 % (3565342)Peak memory usage: 90 MB
% 4.49/1.91 % (3565342)Instructions burned: 113 (million)
% 4.49/1.91 % (3565344)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=285507779:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 4.49/1.91 % (3565338)------------------------------
% 4.49/1.91 % (3565338)------------------------------
% 4.49/1.91 % (3565317)First to succeed.
% 4.49/1.91 % (3565317)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3565312"
% 4.49/1.91 % (3565344)Instruction limit reached!
% 4.49/1.91 % (3565344)------------------------------
% 4.49/1.91 % (3565344)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565344)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565344)Termination reason: Instruction limit
% 4.49/1.91 % (3565344)Termination phase: Saturation
% 4.49/1.91 % (3565344)Time elapsed: 0.067 s
% 4.49/1.91 % (3565344)Peak memory usage: 89 MB
% 4.49/1.91 % (3565344)Instructions burned: 129 (million)
% 4.49/1.91 % (3565346)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1046300122:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 4.49/1.91 % (3565346)Instruction limit reached!
% 4.49/1.91 % (3565346)------------------------------
% 4.49/1.91 % (3565346)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565346)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565346)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565346)Termination reason: Instruction limit
% 4.49/1.91 % (3565346)Termination phase: Saturation
% 4.49/1.91 % (3565346)Time elapsed: 0.066 s
% 4.49/1.91 % (3565346)Peak memory usage: 89 MB
% 4.49/1.91 % (3565346)Instructions burned: 116 (million)
% 4.49/1.91 % (3565348)lrs+10_1_sil=8000:sp=occurrence:random_seed=4090281834:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 4.49/1.91 % (3565349)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2311519500:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 4.49/1.91 % (3565349)Refutation not found, incomplete strategy
% 4.49/1.91 % (3565349)------------------------------
% 4.49/1.91 % (3565349)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.91 % (3565349)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.91 % (3565349)CaDiCaL version: 2.1.3
% 4.49/1.91 % (3565349)Termination reason: Refutation not found, incomplete strategy
% 4.49/1.91 % (3565349)Time elapsed: 0.003 s
% 4.49/1.91 % (3565349)Peak memory usage: 88 MB
% 4.49/1.91 % (3565349)Instructions burned: 3 (million)
% 4.49/1.91 % (3565351)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1354777716:i=5202:ss=axioms:sgt=16_2991 on theBenchmark for (2991ds/5202Mi)
% 4.49/1.91 % (3565317)Refutation found. Thanks to Tanya!
% 4.49/1.91 % SZS status Theorem for theBenchmark
% 4.49/1.91 % SZS output start Proof for theBenchmark
% See solution above
% 8.02/2.10 % (3565317)------------------------------
% 8.02/2.10 % (3565317)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.02/2.10 % (3565317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.02/2.10 % (3565317)CaDiCaL version: 2.1.3
% 8.02/2.10 % (3565317)Termination reason: Refutation
% 8.02/2.10 % (3565317)Time elapsed: 0.649 s
% 8.02/2.10 % (3565317)Peak memory usage: 128 MB
% 8.02/2.10 % (3565317)Instructions burned: 953 (million)
% 8.02/2.10 % (3565317)------------------------------
% 8.02/2.10 % (3565317)------------------------------
% 8.02/2.10 % (3565312)Success in time 1.06 s
% 8.02/2.10 % Vampire exiting
%------------------------------------------------------------------------------