%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET970+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 : n016.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:26 PM UTC 2026
% Result : Theorem 9.21s 2.26s
% Output : Refutation 10.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of formulae : 131 ( 38 unt; 11 def)
% Number of atoms : 355 ( 64 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 395 ( 171 ~; 168 |; 43 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 10 con; 0-5 aty)
% Number of variables : 208 ( 0 sgn 188 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
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 = 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(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] : 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,X2,X3,X4] :
~ ( in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))
& ! [X5,X6] :
~ ( X0 = ordered_pair(X5,X6)
& in(X5,set_intersection2(X1,X3))
& in(X6,set_intersection2(X2,X4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t104_zfmisc_1) ).
fof(f14,axiom,
! [X0,X1,X2,X3] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t119_zfmisc_1) ).
fof(f15,conjecture,
! [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f17,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f18,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f22,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f23,plain,
! [X0,X1,X2,X3,X4] :
( ~ in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))
| ? [X5,X6] :
( X0 = ordered_pair(X5,X6)
& in(X5,set_intersection2(X1,X3))
& in(X6,set_intersection2(X2,X4)) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f24,plain,
! [X0,X1,X2,X3] :
( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
| ~ subset(X0,X1)
| ~ subset(X2,X3) ),
inference(ennf_transformation,[],[f14]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
| ~ subset(X0,X1)
| ~ subset(X2,X3) ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
? [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) != set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
inference(ennf_transformation,[],[f16]) ).
fof(f27,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f28,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f30,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f29]) ).
fof(f31,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,[],[f5]) ).
fof(f32,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,[],[f31]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != sK0(X0,X1,X2) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& in(sK2(X0,X1,X2),X1)
& sK0(X0,X1,X2) = ordered_pair(sK1(X0,X1,X2),sK2(X0,X1,X2)) )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8 ) )
& ( ( in(sK3(X0,X1,X8),X0)
& in(sK4(X0,X1,X8),X1)
& ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)) = X8 )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X3,sK0(X0,X1,X2)),skolemize(X6,sK1(X0,X1,X2)),skolemize(X7,sK2(X0,X1,X2)),skolemize(X11,sK3(X0,X1,X8)),skolemize(X12,sK4(X0,X1,X8))],[f32]) ).
fof(f34,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,[],[f22]) ).
fof(f35,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,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f35]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4] :
( ~ in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))
| ( ordered_pair(sK8(X0,X1,X2,X3,X4),sK9(X0,X1,X2,X3,X4)) = X0
& in(sK8(X0,X1,X2,X3,X4),set_intersection2(X1,X3))
& in(sK9(X0,X1,X2,X3,X4),set_intersection2(X2,X4)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X5,sK8(X0,X1,X2,X3,X4)),skolemize(X6,sK9(X0,X1,X2,X3,X4))],[f23]) ).
fof(f40,plain,
cartesian_product2(set_intersection2(sK10,sK11),set_intersection2(sK12,sK13)) != set_intersection2(cartesian_product2(sK10,sK12),cartesian_product2(sK11,sK13)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12),skolemize(X3,sK13)],[f26]) ).
fof(f43,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f46,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f50,plain,
! [X2,X10,X0,X1,X8,X9] :
( in(X8,X2)
| ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f33]) ).
fof(f56,plain,
! [X0,X1] :
( in(sK5(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f57,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f58,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f64,plain,
! [X2,X3,X0,X1,X4] :
( in(sK9(X0,X1,X2,X3,X4),set_intersection2(X2,X4))
| ~ in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
inference(cnf_transformation,[],[f39]) ).
fof(f65,plain,
! [X2,X3,X0,X1,X4] :
( in(sK8(X0,X1,X2,X3,X4),set_intersection2(X1,X3))
| ~ in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
inference(cnf_transformation,[],[f39]) ).
fof(f66,plain,
! [X2,X3,X0,X1,X4] :
( ~ in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))
| ordered_pair(sK8(X0,X1,X2,X3,X4),sK9(X0,X1,X2,X3,X4)) = X0 ),
inference(cnf_transformation,[],[f39]) ).
fof(f67,plain,
! [X2,X3,X0,X1] :
( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
| ~ subset(X0,X1)
| ~ subset(X2,X3) ),
inference(cnf_transformation,[],[f25]) ).
fof(f68,plain,
cartesian_product2(set_intersection2(sK10,sK11),set_intersection2(sK12,sK13)) != set_intersection2(cartesian_product2(sK10,sK12),cartesian_product2(sK11,sK13)),
inference(cnf_transformation,[],[f40]) ).
fof(f69,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f17]) ).
fof(f70,plain,
! [X2,X0,X1] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f28]) ).
fof(f73,plain,
! [X2,X10,X0,X1,X8,X9] :
( in(X8,X2)
| ~ in(X9,X0)
| ~ in(X10,X1)
| unordered_pair(unordered_pair(X9,X10),singleton(X9)) != X8
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f50,f58]) ).
fof(f76,plain,
! [X2,X3,X0,X1,X4] :
( ~ in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))
| unordered_pair(unordered_pair(sK8(X0,X1,X2,X3,X4),sK9(X0,X1,X2,X3,X4)),singleton(sK8(X0,X1,X2,X3,X4))) = X0 ),
inference(definition_unfolding,[],[f66,f58]) ).
fof(f79,plain,
! [X2,X10,X0,X1,X9] :
( in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),X2)
| ~ in(X9,X0)
| ~ in(X10,X1)
| cartesian_product2(X0,X1) != X2 ),
inference(equality_resolution,[],[f73]) ).
fof(f80,plain,
! [X10,X0,X1,X9] :
( in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),cartesian_product2(X0,X1))
| ~ in(X9,X0)
| ~ in(X10,X1) ),
inference(equality_resolution,[],[f79]) ).
fof(f84,definition,
sF14 = set_intersection2(sK10,sK11),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f85,plain,
set_intersection2(sK10,sK11) = sF14,
inference(reorient_equations,[],[f84]) ).
fof(f86,definition,
sF15 = set_intersection2(sK12,sK13),
introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).
fof(f87,plain,
set_intersection2(sK12,sK13) = sF15,
inference(reorient_equations,[],[f86]) ).
fof(f88,definition,
sF16 = cartesian_product2(sF14,sF15),
introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).
fof(f89,plain,
cartesian_product2(sF14,sF15) = sF16,
inference(reorient_equations,[],[f88]) ).
fof(f90,definition,
sF17 = cartesian_product2(sK10,sK12),
introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).
fof(f91,plain,
cartesian_product2(sK10,sK12) = sF17,
inference(reorient_equations,[],[f90]) ).
fof(f92,definition,
sF18 = cartesian_product2(sK11,sK13),
introduced(definition,[new_symbols(definition,[sF18])],[function_definition]) ).
fof(f93,plain,
cartesian_product2(sK11,sK13) = sF18,
inference(reorient_equations,[],[f92]) ).
fof(f94,definition,
sF19 = set_intersection2(sF17,sF18),
introduced(definition,[new_symbols(definition,[sF19])],[function_definition]) ).
fof(f95,plain,
set_intersection2(sF17,sF18) = sF19,
inference(reorient_equations,[],[f94]) ).
fof(f96,plain,
sF16 != sF19,
inference(definition_folding,[],[f68,f95,f93,f91,f89,f87,f85]) ).
fof(f105,plain,
subset(sF14,sK10),
inference(superposition,[],[f69,f85]) ).
fof(f106,plain,
subset(sF15,sK12),
inference(superposition,[],[f69,f87]) ).
fof(f147,plain,
! [X2,X0,X1] :
( ~ in(X0,set_intersection2(cartesian_product2(sK10,X1),cartesian_product2(sK11,X2)))
| in(sK8(X0,sK10,X1,sK11,X2),sF14) ),
inference(superposition,[],[f65,f85]) ).
fof(f160,plain,
! [X0,X1] :
( subset(sF16,cartesian_product2(X0,X1))
| ~ subset(sF14,X0)
| ~ subset(sF15,X1) ),
inference(superposition,[],[f67,f89]) ).
fof(f164,plain,
! [X0,X1] :
( subset(cartesian_product2(X0,X1),sF17)
| ~ subset(X0,sK10)
| ~ subset(X1,sK12) ),
inference(superposition,[],[f67,f91]) ).
fof(f171,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X1),
inference(superposition,[],[f69,f43]) ).
fof(f177,plain,
! [X0] :
( ~ subset(X0,sF18)
| ~ subset(X0,sF17)
| subset(X0,sF19) ),
inference(superposition,[],[f70,f95]) ).
fof(f185,definition,
( spl20_8
<=> subset(sF16,sF19) ),
introduced(definition,[new_symbols(definition,[spl20_8])],[avatar_definition]) ).
fof(f186,plain,
( ~ subset(sF16,sF19)
| spl20_8 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f187,plain,
( subset(sF16,sF19)
| ~ spl20_8 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f189,definition,
( spl20_9
<=> subset(sF16,sF17) ),
introduced(definition,[new_symbols(definition,[spl20_9])],[avatar_definition]) ).
fof(f190,plain,
( subset(sF16,sF17)
| ~ spl20_9 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f191,plain,
( ~ subset(sF16,sF17)
| spl20_9 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f198,plain,
subset(sF14,sK11),
inference(superposition,[],[f171,f85]) ).
fof(f199,plain,
subset(sF15,sK13),
inference(superposition,[],[f171,f87]) ).
fof(f285,plain,
! [X0,X1] :
( in(sK8(X0,sK10,X1,sK11,sK13),sF14)
| ~ in(X0,set_intersection2(cartesian_product2(sK10,X1),sF18)) ),
inference(superposition,[],[f147,f93]) ).
fof(f314,plain,
! [X2,X0,X1] :
( ~ in(X0,set_intersection2(cartesian_product2(X1,X2),sF18))
| unordered_pair(unordered_pair(sK8(X0,X1,X2,sK11,sK13),sK9(X0,X1,X2,sK11,sK13)),singleton(sK8(X0,X1,X2,sK11,sK13))) = X0 ),
inference(superposition,[],[f76,f93]) ).
fof(f394,plain,
! [X0] :
( ~ in(X0,set_intersection2(sF17,sF18))
| unordered_pair(unordered_pair(sK8(X0,sK10,sK12,sK11,sK13),sK9(X0,sK10,sK12,sK11,sK13)),singleton(sK8(X0,sK10,sK12,sK11,sK13))) = X0 ),
inference(superposition,[],[f314,f91]) ).
fof(f399,plain,
! [X0] :
( ~ in(X0,sF19)
| unordered_pair(unordered_pair(sK8(X0,sK10,sK12,sK11,sK13),sK9(X0,sK10,sK12,sK11,sK13)),singleton(sK8(X0,sK10,sK12,sK11,sK13))) = X0 ),
inference(forward_demodulation,[],[f394,f95]) ).
fof(f402,plain,
! [X0] :
( subset(sF19,X0)
| sK5(sF19,X0) = unordered_pair(unordered_pair(sK8(sK5(sF19,X0),sK10,sK12,sK11,sK13),sK9(sK5(sF19,X0),sK10,sK12,sK11,sK13)),singleton(sK8(sK5(sF19,X0),sK10,sK12,sK11,sK13))) ),
inference(resolution,[],[f399,f56]) ).
fof(f578,definition,
( spl20_42
<=> in(sK5(sF19,sF16),sF16) ),
introduced(definition,[new_symbols(definition,[spl20_42])],[avatar_definition]) ).
fof(f580,plain,
( in(sK5(sF19,sF16),sF16)
| ~ spl20_42 ),
inference(avatar_component_clause,[],[f578]) ).
fof(f725,plain,
( ~ subset(sF19,sF16)
| sF16 = sF19
| ~ spl20_8 ),
inference(resolution,[],[f187,f46]) ).
fof(f726,plain,
( ~ subset(sF19,sF16)
| ~ spl20_8 ),
inference(forward_subsumption_resolution,[],[f725,f96]) ).
fof(f890,plain,
( subset(sF16,sF18)
| ~ subset(sF14,sK11)
| ~ subset(sF15,sK13) ),
inference(superposition,[],[f160,f93]) ).
fof(f891,plain,
( subset(sF16,sF18)
| ~ subset(sF15,sK13) ),
inference(forward_subsumption_resolution,[],[f890,f198]) ).
fof(f892,plain,
subset(sF16,sF18),
inference(forward_subsumption_resolution,[],[f891,f199]) ).
fof(f893,plain,
( ~ subset(sF16,sF17)
| subset(sF16,sF19) ),
inference(resolution,[],[f892,f177]) ).
fof(f907,plain,
( subset(sF16,sF17)
| ~ subset(sF14,sK10)
| ~ subset(sF15,sK12) ),
inference(superposition,[],[f164,f89]) ).
fof(f1110,plain,
( sK5(sF19,sF16) = unordered_pair(unordered_pair(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),sK9(sK5(sF19,sF16),sK10,sK12,sK11,sK13)),singleton(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13)))
| ~ spl20_8 ),
inference(resolution,[],[f402,f726]) ).
fof(f1122,plain,
( ! [X0,X1] :
( ~ in(sK9(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X1)
| ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0)
| in(sK5(sF19,sF16),cartesian_product2(X0,X1)) )
| ~ spl20_8 ),
inference(superposition,[],[f80,f1110]) ).
fof(f1206,plain,
( ! [X0] :
( ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0)
| in(sK5(sF19,sF16),cartesian_product2(X0,set_intersection2(sK12,sK13)))
| ~ in(sK5(sF19,sF16),set_intersection2(cartesian_product2(sK10,sK12),cartesian_product2(sK11,sK13))) )
| ~ spl20_8 ),
inference(resolution,[],[f1122,f64]) ).
fof(f1211,plain,
( ! [X0] :
( in(sK5(sF19,sF16),cartesian_product2(X0,sF15))
| ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0)
| ~ in(sK5(sF19,sF16),set_intersection2(cartesian_product2(sK10,sK12),cartesian_product2(sK11,sK13))) )
| ~ spl20_8 ),
inference(forward_demodulation,[],[f1206,f87]) ).
fof(f1214,plain,
( ! [X0] :
( ~ in(sK5(sF19,sF16),set_intersection2(cartesian_product2(sK10,sK12),sF18))
| in(sK5(sF19,sF16),cartesian_product2(X0,sF15))
| ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0) )
| ~ spl20_8 ),
inference(forward_demodulation,[],[f1211,f93]) ).
fof(f1216,definition,
( spl20_129
<=> ! [X0] :
( ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0)
| in(sK5(sF19,sF16),cartesian_product2(X0,sF15)) ) ),
introduced(definition,[new_symbols(definition,[spl20_129])],[avatar_definition]) ).
fof(f1217,plain,
( ! [X0] :
( ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0)
| in(sK5(sF19,sF16),cartesian_product2(X0,sF15)) )
| ~ spl20_129 ),
inference(avatar_component_clause,[],[f1216]) ).
fof(f1219,definition,
( spl20_130
<=> in(sK5(sF19,sF16),sF19) ),
introduced(definition,[new_symbols(definition,[spl20_130])],[avatar_definition]) ).
fof(f1220,plain,
( in(sK5(sF19,sF16),sF19)
| ~ spl20_130 ),
inference(avatar_component_clause,[],[f1219]) ).
fof(f1221,plain,
( ~ in(sK5(sF19,sF16),sF19)
| spl20_130 ),
inference(avatar_component_clause,[],[f1219]) ).
fof(f1224,plain,
( ! [X0] :
( ~ in(sK5(sF19,sF16),set_intersection2(sF17,sF18))
| in(sK5(sF19,sF16),cartesian_product2(X0,sF15))
| ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0) )
| ~ spl20_8 ),
inference(forward_demodulation,[],[f1214,f91]) ).
fof(f1229,plain,
( ! [X0] :
( ~ in(sK5(sF19,sF16),sF19)
| in(sK5(sF19,sF16),cartesian_product2(X0,sF15))
| ~ in(sK8(sK5(sF19,sF16),sK10,sK12,sK11,sK13),X0) )
| ~ spl20_8 ),
inference(forward_demodulation,[],[f1224,f95]) ).
fof(f1230,plain,
( spl20_129
| ~ spl20_130
| ~ spl20_8 ),
inference(avatar_split_clause,[],[f1229,f185,f1219,f1216]) ).
fof(f1231,plain,
( subset(sF19,sF16)
| spl20_130 ),
inference(resolution,[],[f1221,f56]) ).
fof(f1232,plain,
( $false
| ~ spl20_8
| spl20_130 ),
inference(forward_subsumption_resolution,[],[f1231,f726]) ).
fof(f1233,plain,
( ~ spl20_8
| spl20_130 ),
inference(avatar_contradiction_clause,[],[f1232]) ).
fof(f1236,plain,
( ~ subset(sF14,sK10)
| ~ subset(sF15,sK12)
| spl20_9 ),
inference(forward_subsumption_resolution,[],[f907,f191]) ).
fof(f1238,plain,
( ~ subset(sF15,sK12)
| spl20_9 ),
inference(forward_subsumption_resolution,[],[f1236,f105]) ).
fof(f1241,plain,
( $false
| spl20_9 ),
inference(forward_subsumption_resolution,[],[f1238,f106]) ).
fof(f1242,plain,
spl20_9,
inference(avatar_contradiction_clause,[],[f1241]) ).
fof(f1243,plain,
( subset(sF16,sF19)
| ~ spl20_9 ),
inference(forward_subsumption_resolution,[],[f893,f190]) ).
fof(f1244,plain,
( $false
| spl20_8
| ~ spl20_9 ),
inference(forward_subsumption_resolution,[],[f1243,f186]) ).
fof(f1245,plain,
( spl20_8
| ~ spl20_9 ),
inference(avatar_contradiction_clause,[],[f1244]) ).
fof(f1272,plain,
( in(sK5(sF19,sF16),cartesian_product2(sF14,sF15))
| ~ in(sK5(sF19,sF16),set_intersection2(cartesian_product2(sK10,sK12),sF18))
| ~ spl20_129 ),
inference(resolution,[],[f1217,f285]) ).
fof(f1273,plain,
( in(sK5(sF19,sF16),sF16)
| ~ in(sK5(sF19,sF16),set_intersection2(cartesian_product2(sK10,sK12),sF18))
| ~ spl20_129 ),
inference(forward_demodulation,[],[f1272,f89]) ).
fof(f1277,plain,
( ~ in(sK5(sF19,sF16),set_intersection2(sF17,sF18))
| in(sK5(sF19,sF16),sF16)
| ~ spl20_129 ),
inference(forward_demodulation,[],[f1273,f91]) ).
fof(f1281,plain,
( ~ in(sK5(sF19,sF16),sF19)
| in(sK5(sF19,sF16),sF16)
| ~ spl20_129 ),
inference(forward_demodulation,[],[f1277,f95]) ).
fof(f1285,plain,
( in(sK5(sF19,sF16),sF16)
| ~ spl20_129
| ~ spl20_130 ),
inference(forward_subsumption_resolution,[],[f1281,f1220]) ).
fof(f1289,plain,
( spl20_42
| ~ spl20_129
| ~ spl20_130 ),
inference(avatar_split_clause,[],[f1285,f1219,f1216,f578]) ).
fof(f1292,plain,
( subset(sF19,sF16)
| ~ spl20_42 ),
inference(resolution,[],[f580,f57]) ).
fof(f1296,plain,
( $false
| ~ spl20_8
| ~ spl20_42 ),
inference(forward_subsumption_resolution,[],[f1292,f726]) ).
fof(f1297,plain,
( ~ spl20_8
| ~ spl20_42 ),
inference(avatar_contradiction_clause,[],[f1296]) ).
cnf(s60,plain,
( ~ spl20_8
| spl20_129
| ~ spl20_130 ),
inference(sat_conversion,[],[f1230]) ).
cnf(s61,plain,
( ~ spl20_8
| spl20_130 ),
inference(sat_conversion,[],[f1233]) ).
cnf(s63,plain,
spl20_9,
inference(sat_conversion,[],[f1242]) ).
cnf(s64,plain,
( spl20_8
| ~ spl20_9 ),
inference(sat_conversion,[],[f1245]) ).
cnf(s66,plain,
( spl20_42
| ~ spl20_129
| ~ spl20_130 ),
inference(sat_conversion,[],[f1289]) ).
cnf(s70,plain,
( ~ spl20_8
| ~ spl20_42 ),
inference(sat_conversion,[],[f1297]) ).
cnf(s71,plain,
spl20_8,
inference(rat,[],[s64,s63]) ).
cnf(s72,plain,
~ spl20_42,
inference(rat,[],[s70,s71]) ).
cnf(s73,plain,
spl20_130,
inference(rat,[],[s61,s71]) ).
cnf(s74,plain,
~ spl20_129,
inference(rat,[],[s66,s72,s73]) ).
cnf(s75,plain,
$false,
inference(rat,[],[s60,s73,s74,s71]) ).
fof(f1298,plain,
$false,
inference(avatar_sat_refutation,[],[s75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET970+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.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:21:32 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.21/2.26 % (3224652)Detected formulas, will run a generic FOF schedule.
% 9.21/2.26 % (3224760)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=2497614395:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.21/2.26 % (3224763)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3277485886:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.21/2.26 % (3224762)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1475824646:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.21/2.26 % (3224764)dis-21_1_sil=8000:lcm=predicate:random_seed=2958797335: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.21/2.26 % (3224758)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=3595784527:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.21/2.26 % (3224761)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2369644409:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.21/2.26 % (3224759)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=704760586:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.21/2.26 % (3224761)Refutation not found, incomplete strategy
% 9.21/2.26 % (3224761)------------------------------
% 9.21/2.26 % (3224761)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224761)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224761)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.26 % (3224761)Time elapsed: 0.002 s
% 9.21/2.26 % (3224761)Peak memory usage: 88 MB
% 9.21/2.26 % (3224761)Instructions burned: 1 (million)
% 9.21/2.26 % (3224762)Instruction limit reached!
% 9.21/2.26 % (3224762)------------------------------
% 9.21/2.26 % (3224762)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224762)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224762)Termination reason: Instruction limit
% 9.21/2.26 % (3224762)Termination phase: Saturation
% 9.21/2.26 % (3224762)Time elapsed: 0.070 s
% 9.21/2.26 % (3224762)Peak memory usage: 88 MB
% 9.21/2.26 % (3224762)Instructions burned: 120 (million)
% 9.21/2.26 % (3224764)Instruction limit reached!
% 9.21/2.26 % (3224764)------------------------------
% 9.21/2.26 % (3224764)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224764)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224764)Termination reason: Instruction limit
% 9.21/2.26 % (3224764)Termination phase: Saturation
% 9.21/2.26 % (3224764)Time elapsed: 0.079 s
% 9.21/2.26 % (3224764)Peak memory usage: 89 MB
% 9.21/2.26 % (3224764)Instructions burned: 131 (million)
% 9.21/2.26 % (3224763)Instruction limit reached!
% 9.21/2.26 % (3224763)------------------------------
% 9.21/2.26 % (3224763)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224763)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224763)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224763)Termination reason: Instruction limit
% 9.21/2.26 % (3224763)Termination phase: Saturation
% 9.21/2.26 % (3224763)Time elapsed: 0.092 s
% 9.21/2.26 % (3224763)Peak memory usage: 89 MB
% 9.21/2.26 % (3224763)Instructions burned: 140 (million)
% 9.21/2.26 % (3224786)lrs+10_1_sil=32000:urr=on:br=off:random_seed=844409137:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 9.21/2.26 % (3224761)------------------------------
% 9.21/2.26 % (3224761)------------------------------
% 9.21/2.26 % (3224787)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1678178594:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 9.21/2.26 % (3224786)Instruction limit reached!
% 9.21/2.26 % (3224786)------------------------------
% 9.21/2.26 % (3224786)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224786)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224786)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224786)Termination reason: Instruction limit
% 9.21/2.26 % (3224786)Termination phase: Saturation
% 9.21/2.26 % (3224786)Time elapsed: 0.086 s
% 9.21/2.26 % (3224786)Peak memory usage: 89 MB
% 9.21/2.26 % (3224786)Instructions burned: 158 (million)
% 9.21/2.26 % (3224781)lrs+10_1_sil=8000:sp=occurrence:random_seed=3868701731:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 9.21/2.26 % (3224790)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=2895269288:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 9.21/2.26 % (3224787)Instruction limit reached!
% 9.21/2.26 % (3224787)------------------------------
% 9.21/2.26 % (3224787)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224787)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224787)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224787)Termination reason: Instruction limit
% 9.21/2.26 % (3224787)Termination phase: Saturation
% 9.21/2.26 % (3224787)Time elapsed: 0.199 s
% 9.21/2.26 % (3224787)Peak memory usage: 91 MB
% 9.21/2.26 % (3224787)Instructions burned: 326 (million)
% 9.21/2.26 % (3224791)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2708276065:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 9.21/2.26 % (3224791)Refutation not found, incomplete strategy
% 9.21/2.26 % (3224791)------------------------------
% 9.21/2.26 % (3224791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224791)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224791)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.26 % (3224791)Time elapsed: 0.002 s
% 9.21/2.26 % (3224791)Peak memory usage: 88 MB
% 9.21/2.26 % (3224791)Instructions burned: 1 (million)
% 9.21/2.26 % (3224790)Instruction limit reached!
% 9.21/2.26 % (3224790)------------------------------
% 9.21/2.26 % (3224790)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224790)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224790)Termination reason: Instruction limit
% 9.21/2.26 % (3224790)Termination phase: Saturation
% 9.21/2.26 % (3224790)Time elapsed: 0.140 s
% 9.21/2.26 % (3224790)Peak memory usage: 92 MB
% 9.21/2.26 % (3224790)Instructions burned: 250 (million)
% 9.21/2.26 % (3224794)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=149267802:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 9.21/2.26 % (3224781)Instruction limit reached!
% 9.21/2.26 % (3224781)------------------------------
% 9.21/2.26 % (3224781)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224781)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224781)Termination reason: Instruction limit
% 9.21/2.26 % (3224781)Termination phase: Saturation
% 9.21/2.26 % (3224781)Time elapsed: 0.276 s
% 9.21/2.26 % (3224781)Peak memory usage: 92 MB
% 9.21/2.26 % (3224781)Instructions burned: 285 (million)
% 9.21/2.26 % (3224791)------------------------------
% 9.21/2.26 % (3224791)------------------------------
% 9.21/2.26 % (3224796)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1646421363:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 9.21/2.26 % (3224798)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3326933515:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 9.21/2.26 % (3224798)Refutation not found, incomplete strategy
% 9.21/2.26 % (3224798)------------------------------
% 9.21/2.26 % (3224798)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224798)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224798)Termination reason: Refutation not found, incomplete strategy
% 9.21/2.26 % (3224798)Time elapsed: 0.003 s
% 9.21/2.26 % (3224798)Peak memory usage: 88 MB
% 9.21/2.26 % (3224798)Instructions burned: 1 (million)
% 9.21/2.26 % (3224758)First to succeed.
% 9.21/2.26 % (3224758)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3224652"
% 9.21/2.26 % (3224796)Instruction limit reached!
% 9.21/2.26 % (3224796)------------------------------
% 9.21/2.26 % (3224796)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224796)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224796)Termination reason: Instruction limit
% 9.21/2.26 % (3224796)Termination phase: Saturation
% 9.21/2.26 % (3224796)Time elapsed: 0.095 s
% 9.21/2.26 % (3224796)Peak memory usage: 89 MB
% 9.21/2.26 % (3224796)Instructions burned: 114 (million)
% 9.21/2.26 % (3224799)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=159533243:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 9.21/2.26 % (3224799)Instruction limit reached!
% 9.21/2.26 % (3224799)------------------------------
% 9.21/2.26 % (3224799)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.26 % (3224799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.26 % (3224799)CaDiCaL version: 2.1.3
% 9.21/2.26 % (3224799)Termination reason: Instruction limit
% 9.21/2.26 % (3224799)Termination phase: Saturation
% 9.21/2.26 % (3224799)Time elapsed: 0.103 s
% 9.21/2.26 % (3224799)Peak memory usage: 89 MB
% 9.21/2.26 % (3224799)Instructions burned: 114 (million)
% 9.21/2.26 % (3224810)lrs+10_1_sil=8000:sp=occurrence:random_seed=3614913449:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 9.21/2.26 % (3224798)------------------------------
% 9.21/2.26 % (3224798)------------------------------
% 9.21/2.26 % (3224794)Also succeeded, but the first one will report.
% 9.21/2.26 % (3224758)Refutation found. Thanks to Tanya!
% 9.21/2.26 % SZS status Theorem for theBenchmark
% 9.21/2.26 % SZS output start Proof for theBenchmark
% See solution above
% 10.43/2.48 % (3224758)------------------------------
% 10.43/2.48 % (3224758)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.43/2.48 % (3224758)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.43/2.48 % (3224758)CaDiCaL version: 2.1.3
% 10.43/2.48 % (3224758)Termination reason: Refutation
% 10.43/2.48 % (3224758)Time elapsed: 0.814 s
% 10.43/2.48 % (3224758)Peak memory usage: 131 MB
% 10.43/2.48 % (3224758)Instructions burned: 1190 (million)
% 10.43/2.48 % (3224758)------------------------------
% 10.43/2.48 % (3224758)------------------------------
% 10.43/2.48 % (3224652)Success in time 1.41 s
% 10.43/2.48 % Vampire exiting
%------------------------------------------------------------------------------