%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET952+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 : n003.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 4.98s 1.62s
% Output : Refutation 5.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 14
% Syntax : Number of formulae : 107 ( 23 unt; 3 def)
% Number of atoms : 369 ( 60 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 429 ( 167 ~; 184 |; 64 &)
% ( 13 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 2 con; 0-3 aty)
% Number of variables : 241 ( 1 sgn 220 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f6,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(f7,axiom,
! [X0,X1,X2] :
( X2 = cartesian_product2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( in(X4,X0)
& in(X5,X1)
& X3 = ordered_pair(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,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(f13,axiom,
! [X0,X1] : set_union2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
fof(f14,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f18,conjecture,
! [X0,X1] : subset(cartesian_product2(X0,X1),powerset(powerset(set_union2(X0,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t105_zfmisc_1) ).
fof(f19,negated_conjecture,
~ ! [X0,X1] : subset(cartesian_product2(X0,X1),powerset(powerset(set_union2(X0,X1)))),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f21,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f23,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(rectify,[],[f13]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f29,plain,
? [X0,X1] : ~ subset(cartesian_product2(X0,X1),powerset(powerset(set_union2(X0,X1)))),
inference(ennf_transformation,[],[f19]) ).
fof(f32,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f33,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f33]) ).
fof(f39,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,[],[f6]) ).
fof(f40,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,[],[f39]) ).
fof(f41,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,[],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(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_union2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f41]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ? [X3] :
( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != X3 )
| ~ in(X3,X2) )
& ( ? [X4,X5] :
( in(X4,X0)
& in(X5,X1)
& X3 = ordered_pair(X4,X5) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != X3 ) )
& ( ? [X4,X5] :
( in(X4,X0)
& in(X5,X1)
& X3 = ordered_pair(X4,X5) )
| ~ in(X3,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ? [X3] :
( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != X3 )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( in(X6,X0)
& in(X7,X1)
& ordered_pair(X6,X7) = X3 )
| in(X3,X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8 ) )
& ( ? [X11,X12] :
( in(X11,X0)
& in(X12,X1)
& ordered_pair(X11,X12) = X8 )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(rectify,[],[f43]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != sK3(X0,X1,X2) )
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X0)
& in(sK5(X0,X1,X2),X1)
& sK3(X0,X1,X2) = ordered_pair(sK4(X0,X1,X2),sK5(X0,X1,X2)) )
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8 ) )
& ( ( in(sK6(X0,X1,X8),X0)
& in(sK7(X0,X1,X8),X1)
& ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8 )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7]),skolemize(X3,sK3(X0,X1,X2)),skolemize(X6,sK4(X0,X1,X2)),skolemize(X7,sK5(X0,X1,X2)),skolemize(X11,sK6(X0,X1,X8)),skolemize(X12,sK7(X0,X1,X8))],[f44]) ).
fof(f46,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(f47,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,[],[f46]) ).
fof(f48,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f47]) ).
fof(f49,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f52,plain,
~ subset(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X0,sK11),skolemize(X1,sK12)],[f29]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f53]) ).
fof(f56,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f57,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f58,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f34]) ).
fof(f59,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f34]) ).
fof(f68,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f70,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f74,plain,
! [X2,X0,X1,X8] :
( ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f75,plain,
! [X2,X0,X1,X8] :
( in(sK7(X0,X1,X8),X1)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f76,plain,
! [X2,X0,X1,X8] :
( in(sK6(X0,X1,X8),X0)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f83,plain,
! [X0,X1] :
( in(sK8(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f84,plain,
! [X0,X1] :
( ~ in(sK8(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f85,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f89,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(cnf_transformation,[],[f23]) ).
fof(f91,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f95,plain,
~ subset(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),
inference(cnf_transformation,[],[f52]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X0,X1),X2)
| in(X1,X2) ),
inference(cnf_transformation,[],[f54]) ).
fof(f98,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X0,X1),X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f54]) ).
fof(f99,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) ),
inference(cnf_transformation,[],[f54]) ).
fof(f104,plain,
! [X2,X0,X1,X8] :
( unordered_pair(unordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)),singleton(sK6(X0,X1,X8))) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f74,f85]) ).
fof(f106,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f59]) ).
fof(f107,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f58]) ).
fof(f113,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f70]) ).
fof(f114,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f69]) ).
fof(f115,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X1)
| in(X4,X0) ),
inference(equality_resolution,[],[f68]) ).
fof(f118,plain,
! [X0,X1,X8] :
( in(sK6(X0,X1,X8),X0)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f76]) ).
fof(f119,plain,
! [X0,X1,X8] :
( in(sK7(X0,X1,X8),X1)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f75]) ).
fof(f120,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| unordered_pair(unordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)),singleton(sK6(X0,X1,X8))) = X8 ),
inference(equality_resolution,[],[f104]) ).
fof(f124,plain,
! [X0,X1] :
( ~ subset(sK8(X0,powerset(X1)),X1)
| subset(X0,powerset(X1)) ),
inference(resolution,[],[f106,f84]) ).
fof(f138,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,cartesian_product2(set_union2(X0,X1),X2))
| in(sK6(set_union2(X0,X1),X2,X3),X0)
| in(sK6(set_union2(X0,X1),X2,X3),X1) ),
inference(resolution,[],[f115,f118]) ).
fof(f146,plain,
! [X2,X0,X1] :
( sK8(cartesian_product2(X0,X1),X2) = unordered_pair(unordered_pair(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2)),sK7(X0,X1,sK8(cartesian_product2(X0,X1),X2))),singleton(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2))))
| subset(cartesian_product2(X0,X1),X2) ),
inference(resolution,[],[f120,f83]) ).
fof(f147,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X0,X1),X2)
| sK8(cartesian_product2(X0,X1),X2) = unordered_pair(singleton(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2))),unordered_pair(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2)),sK7(X0,X1,sK8(cartesian_product2(X0,X1),X2)))) ),
inference(forward_demodulation,[],[f146,f56]) ).
fof(f152,plain,
sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))) = unordered_pair(singleton(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))))),
inference(resolution,[],[f147,f95]) ).
fof(f166,definition,
( spl13_1
<=> in(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),cartesian_product2(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f167,plain,
( ~ in(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),cartesian_product2(sK11,sK12))
| spl13_1 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f173,plain,
( subset(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))
| spl13_1 ),
inference(resolution,[],[f167,f83]) ).
fof(f175,plain,
( $false
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f173,f95]) ).
fof(f176,plain,
spl13_1,
inference(avatar_contradiction_clause,[],[f175]) ).
fof(f224,plain,
! [X0] :
( ~ in(singleton(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0)
| subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),X0)
| ~ in(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0) ),
inference(superposition,[],[f99,f152]) ).
fof(f225,plain,
! [X0] :
( ~ in(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),powerset(X0))
| subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(X0))
| ~ subset(singleton(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0) ),
inference(resolution,[],[f224,f106]) ).
fof(f228,plain,
! [X0] :
( ~ subset(singleton(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0)
| subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(X0))
| ~ subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0) ),
inference(resolution,[],[f225,f106]) ).
fof(f229,plain,
! [X0] :
( subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(X0))
| ~ subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0)
| ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0) ),
inference(resolution,[],[f228,f91]) ).
fof(f240,plain,
! [X0] :
( ~ subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0)
| subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(X0)) ),
inference(forward_subsumption_resolution,[],[f229,f98]) ).
fof(f241,plain,
! [X0] :
( ~ in(sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0)
| ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0)
| subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(X0)) ),
inference(resolution,[],[f240,f99]) ).
fof(f247,plain,
! [X0,X1] :
( ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),set_union2(X0,X1))
| subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(set_union2(X0,X1)))
| ~ in(sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0) ),
inference(resolution,[],[f241,f113]) ).
fof(f270,plain,
! [X0,X1] :
( ~ in(sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0)
| subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(set_union2(X0,X1)))
| ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X1) ),
inference(resolution,[],[f247,f114]) ).
fof(f284,plain,
! [X0] :
( subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(set_union2(sK12,X0)))
| ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0)
| ~ in(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),cartesian_product2(sK11,sK12)) ),
inference(resolution,[],[f270,f119]) ).
fof(f289,definition,
( spl13_9
<=> ! [X0] :
( subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(set_union2(sK12,X0)))
| ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0) ) ),
introduced(definition,[new_symbols(definition,[spl13_9])],[avatar_definition]) ).
fof(f290,plain,
( ! [X0] :
( subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(set_union2(sK12,X0)))
| ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0) )
| ~ spl13_9 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f291,plain,
( ~ spl13_1
| spl13_9 ),
inference(avatar_split_clause,[],[f284,f289,f166]) ).
fof(f421,plain,
! [X2,X3,X0,X1] :
( in(sK6(set_union2(X0,X1),X2,sK8(cartesian_product2(set_union2(X0,X1),X2),X3)),X0)
| in(sK6(set_union2(X0,X1),X2,sK8(cartesian_product2(set_union2(X0,X1),X2),X3)),X1)
| subset(cartesian_product2(set_union2(X0,X1),X2),X3) ),
inference(resolution,[],[f138,f83]) ).
fof(f436,plain,
! [X2,X0,X1] :
( in(sK6(set_union2(X0,X0),X1,sK8(cartesian_product2(set_union2(X0,X0),X1),X2)),X0)
| subset(cartesian_product2(set_union2(X0,X0),X1),X2) ),
inference(factoring,[],[f421]) ).
fof(f441,plain,
! [X2,X0,X1] :
( in(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2)),X0)
| subset(cartesian_product2(set_union2(X0,X0),X1),X2) ),
inference(forward_demodulation,[],[f436,f89]) ).
fof(f444,plain,
! [X2,X0,X1] :
( in(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2)),X0)
| subset(cartesian_product2(X0,X1),X2) ),
inference(forward_demodulation,[],[f441,f89]) ).
fof(f833,plain,
! [X0] :
( ~ subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),X0)
| in(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),X0) ),
inference(superposition,[],[f97,f152]) ).
fof(f836,plain,
( ! [X0] :
( in(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),powerset(set_union2(sK12,X0)))
| ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0) )
| ~ spl13_9 ),
inference(resolution,[],[f833,f290]) ).
fof(f1041,plain,
( ! [X0] :
( ~ in(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),X0)
| subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),set_union2(sK12,X0)) )
| ~ spl13_9 ),
inference(resolution,[],[f836,f107]) ).
fof(f1045,plain,
( subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),set_union2(sK12,sK11))
| subset(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))
| ~ spl13_9 ),
inference(resolution,[],[f1041,f444]) ).
fof(f1057,plain,
( subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),set_union2(sK12,sK11))
| ~ spl13_9 ),
inference(forward_subsumption_resolution,[],[f1045,f95]) ).
fof(f1059,definition,
( spl13_26
<=> subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),set_union2(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_26])],[avatar_definition]) ).
fof(f1060,plain,
( subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),set_union2(sK11,sK12))
| ~ spl13_26 ),
inference(avatar_component_clause,[],[f1059]) ).
fof(f1062,plain,
( subset(unordered_pair(sK6(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))),sK7(sK11,sK12,sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))))),set_union2(sK11,sK12))
| ~ spl13_9 ),
inference(forward_demodulation,[],[f1057,f57]) ).
fof(f1063,plain,
( spl13_26
| ~ spl13_9 ),
inference(avatar_split_clause,[],[f1062,f289,f1059]) ).
fof(f1065,plain,
( subset(sK8(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12)))),powerset(set_union2(sK11,sK12)))
| ~ spl13_26 ),
inference(resolution,[],[f1060,f240]) ).
fof(f1074,plain,
( subset(cartesian_product2(sK11,sK12),powerset(powerset(set_union2(sK11,sK12))))
| ~ spl13_26 ),
inference(resolution,[],[f1065,f124]) ).
fof(f1082,plain,
( $false
| ~ spl13_26 ),
inference(forward_subsumption_resolution,[],[f1074,f95]) ).
fof(f1083,plain,
~ spl13_26,
inference(avatar_contradiction_clause,[],[f1082]) ).
cnf(s3,plain,
spl13_1,
inference(sat_conversion,[],[f176]) ).
cnf(s7,plain,
( ~ spl13_1
| spl13_9 ),
inference(sat_conversion,[],[f291]) ).
cnf(s21,plain,
( ~ spl13_9
| spl13_26 ),
inference(sat_conversion,[],[f1063]) ).
cnf(s23,plain,
~ spl13_26,
inference(sat_conversion,[],[f1083]) ).
cnf(s24,plain,
~ spl13_9,
inference(rat,[],[s21,s23]) ).
cnf(s25,plain,
~ spl13_1,
inference(rat,[],[s7,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s3,s25]) ).
fof(f1084,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET952+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % 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 03:17:42 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.98/1.62 % (1151587)Detected formulas, will run a generic FOF schedule.
% 4.98/1.62 % (1151593)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=2828484292:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.98/1.62 % (1151594)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=1722444809:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.98/1.62 % (1151597)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2378390109:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.98/1.62 % (1151592)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=3321868907:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.98/1.62 % (1151595)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3005678670:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.98/1.62 % (1151596)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=240470279:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.98/1.62 % (1151598)dis-21_1_sil=8000:lcm=predicate:random_seed=734270109: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.98/1.62 % (1151595)Refutation not found, incomplete strategy
% 4.98/1.62 % (1151595)------------------------------
% 4.98/1.62 % (1151595)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151595)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151595)Termination reason: Refutation not found, incomplete strategy
% 4.98/1.62 % (1151595)Time elapsed: 0.002 s
% 4.98/1.62 % (1151595)Peak memory usage: 88 MB
% 4.98/1.62 % (1151595)Instructions burned: 2 (million)
% 4.98/1.62 % (1151596)Instruction limit reached!
% 4.98/1.62 % (1151596)------------------------------
% 4.98/1.62 % (1151596)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151596)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151596)Termination reason: Instruction limit
% 4.98/1.62 % (1151596)Termination phase: Saturation
% 4.98/1.62 % (1151596)Time elapsed: 0.067 s
% 4.98/1.62 % (1151596)Peak memory usage: 88 MB
% 4.98/1.62 % (1151596)Instructions burned: 119 (million)
% 4.98/1.62 % (1151598)Instruction limit reached!
% 4.98/1.62 % (1151598)------------------------------
% 4.98/1.62 % (1151598)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151598)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151598)Termination reason: Instruction limit
% 4.98/1.62 % (1151598)Termination phase: Saturation
% 4.98/1.62 % (1151598)Time elapsed: 0.079 s
% 4.98/1.62 % (1151598)Peak memory usage: 89 MB
% 4.98/1.62 % (1151598)Instructions burned: 129 (million)
% 4.98/1.62 % (1151597)Instruction limit reached!
% 4.98/1.62 % (1151597)------------------------------
% 4.98/1.62 % (1151597)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151597)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151597)Termination reason: Instruction limit
% 4.98/1.62 % (1151597)Termination phase: Saturation
% 4.98/1.62 % (1151597)Time elapsed: 0.099 s
% 4.98/1.62 % (1151597)Peak memory usage: 89 MB
% 4.98/1.62 % (1151597)Instructions burned: 140 (million)
% 4.98/1.62 % (1151606)lrs+10_1_sil=8000:sp=occurrence:random_seed=307525053:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.98/1.62 % (1151607)lrs+10_1_sil=32000:urr=on:br=off:random_seed=516921330:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.98/1.62 % (1151608)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3403195565:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.98/1.62 % (1151595)------------------------------
% 4.98/1.62 % (1151595)------------------------------
% 4.98/1.62 % (1151607)Instruction limit reached!
% 4.98/1.62 % (1151607)------------------------------
% 4.98/1.62 % (1151607)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151607)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151607)Termination reason: Instruction limit
% 4.98/1.62 % (1151607)Termination phase: Saturation
% 4.98/1.62 % (1151607)Time elapsed: 0.086 s
% 4.98/1.62 % (1151607)Peak memory usage: 90 MB
% 4.98/1.62 % (1151607)Instructions burned: 157 (million)
% 4.98/1.62 % (1151606)Instruction limit reached!
% 4.98/1.62 % (1151606)------------------------------
% 4.98/1.62 % (1151606)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151606)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151606)Termination reason: Instruction limit
% 4.98/1.62 % (1151606)Termination phase: Saturation
% 4.98/1.62 % (1151606)Time elapsed: 0.165 s
% 4.98/1.62 % (1151606)Peak memory usage: 92 MB
% 4.98/1.62 % (1151606)Instructions burned: 285 (million)
% 4.98/1.62 % (1151612)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=1936752490:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.98/1.62 % (1151613)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=4025370503:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.98/1.62 % (1151608)Instruction limit reached!
% 4.98/1.62 % (1151608)------------------------------
% 4.98/1.62 % (1151608)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151608)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151608)Termination reason: Instruction limit
% 4.98/1.62 % (1151608)Termination phase: Saturation
% 4.98/1.62 % (1151608)Time elapsed: 0.211 s
% 4.98/1.62 % (1151608)Peak memory usage: 91 MB
% 4.98/1.62 % (1151608)Instructions burned: 326 (million)
% 4.98/1.62 % (1151593)First to succeed.
% 4.98/1.62 % (1151593)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1151587"
% 4.98/1.62 % (1151614)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=888115218:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 4.98/1.62 % (1151612)Instruction limit reached!
% 4.98/1.62 % (1151612)------------------------------
% 4.98/1.62 % (1151612)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151612)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151612)Termination reason: Instruction limit
% 4.98/1.62 % (1151612)Termination phase: Saturation
% 4.98/1.62 % (1151612)Time elapsed: 0.137 s
% 4.98/1.62 % (1151612)Peak memory usage: 91 MB
% 4.98/1.62 % (1151612)Instructions burned: 249 (million)
% 4.98/1.62 % (1151617)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2177923184:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 4.98/1.62 % (1151613)Instruction limit reached!
% 4.98/1.62 % (1151613)------------------------------
% 4.98/1.62 % (1151613)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.62 % (1151613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.62 % (1151613)CaDiCaL version: 2.1.3
% 4.98/1.62 % (1151613)Termination reason: Instruction limit
% 4.98/1.62 % (1151613)Termination phase: Saturation
% 4.98/1.62 % (1151613)Time elapsed: 0.174 s
% 4.98/1.62 % (1151613)Peak memory usage: 89 MB
% 4.98/1.62 % (1151613)Instructions burned: 295 (million)
% 4.98/1.62 % (1151593)Refutation found. Thanks to Tanya!
% 4.98/1.62 % SZS status Theorem for theBenchmark
% 4.98/1.62 % SZS output start Proof for theBenchmark
% See solution above
% 5.98/1.71 % (1151593)------------------------------
% 5.98/1.71 % (1151593)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.98/1.71 % (1151593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.98/1.71 % (1151593)CaDiCaL version: 2.1.3
% 5.98/1.71 % (1151593)Termination reason: Refutation
% 5.98/1.71 % (1151593)Time elapsed: 0.492 s
% 5.98/1.71 % (1151593)Peak memory usage: 133 MB
% 5.98/1.71 % (1151593)Instructions burned: 1260 (million)
% 5.98/1.71 % (1151593)------------------------------
% 5.98/1.71 % (1151593)------------------------------
% 5.98/1.71 % (1151587)Success in time 0.773 s
% 5.98/1.71 % Vampire exiting
%------------------------------------------------------------------------------