%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU138+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:52:03 PM UTC 2026
% Result : Theorem 46.77s 12.13s
% Output : Refutation 46.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 25
% Syntax : Number of formulae : 137 ( 71 unt; 3 def)
% Number of atoms : 344 ( 96 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 341 ( 134 ~; 129 |; 65 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 245 ( 234 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
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(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,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f10,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f19,axiom,
! [X0,X1] : set_intersection2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(f25,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f26,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f27,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(f29,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f30,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f31,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f35,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_difference(X0,X2),set_difference(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_xboole_1) ).
fof(f36,axiom,
! [X0,X1] : subset(set_difference(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(f37,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f38,axiom,
! [X0,X1] : set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(f39,axiom,
! [X0] : set_difference(X0,empty_set) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_boole) ).
fof(f40,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f42,axiom,
! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t40_xboole_1) ).
fof(f44,conjecture,
! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f50,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f54,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(rectify,[],[f19]) ).
fof(f56,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X3] :
( in(X3,X0)
& in(X3,X1) )
& disjoint(X0,X1) ) ),
inference(rectify,[],[f40]) ).
fof(f63,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f64,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f27]) ).
fof(f65,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f67,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f66]) ).
fof(f68,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f69,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f31]) ).
fof(f71,plain,
! [X0,X1,X2] :
( subset(set_difference(X0,X2),set_difference(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f35]) ).
fof(f72,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] :
( in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f56]) ).
fof(f75,plain,
? [X0,X1] : set_intersection2(X0,X1) != set_difference(X0,set_difference(X0,X1)),
inference(ennf_transformation,[],[f45]) ).
fof(f82,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f83,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f82]) ).
fof(f94,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(f95,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,[],[f94]) ).
fof(f96,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,[],[f95]) ).
fof(f97,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))],[f96]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(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_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(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_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(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_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f99]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X0)
& ~ in(sK4(X0,X1,X2),X1) )
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f100]) ).
fof(f102,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f108,plain,
! [X0,X1] :
( ( set_difference(X0,X1) = empty_set
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f37]) ).
fof(f109,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ( in(sK8(X0,X1),X0)
& in(sK8(X0,X1),X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f72]) ).
fof(f110,plain,
set_intersection2(sK9,sK10) != set_difference(sK9,set_difference(sK9,sK10)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X0,sK9),skolemize(X1,sK10)],[f75]) ).
fof(f113,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f114,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f117,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f83]) ).
fof(f129,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f97]) ).
fof(f135,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f101]) ).
fof(f141,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f102]) ).
fof(f147,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(cnf_transformation,[],[f54]) ).
fof(f154,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f63]) ).
fof(f155,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f26]) ).
fof(f156,plain,
! [X2,X0,X1] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f158,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f67]) ).
fof(f159,plain,
! [X2,X0,X1] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f160,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f69]) ).
fof(f165,plain,
! [X2,X0,X1] :
( subset(set_difference(X0,X2),set_difference(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f166,plain,
! [X0,X1] : subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f36]) ).
fof(f167,plain,
! [X0,X1] :
( empty_set != set_difference(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f168,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| empty_set = set_difference(X0,X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f169,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
inference(cnf_transformation,[],[f38]) ).
fof(f170,plain,
! [X0] : set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f39]) ).
fof(f172,plain,
! [X0,X1] :
( in(sK8(X0,X1),X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f173,plain,
! [X0,X1] :
( in(sK8(X0,X1),X0)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f175,plain,
! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
inference(cnf_transformation,[],[f42]) ).
fof(f177,plain,
set_intersection2(sK9,sK10) != set_difference(sK9,set_difference(sK9,sK10)),
inference(cnf_transformation,[],[f110]) ).
fof(f183,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f50]) ).
fof(f194,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f129]) ).
fof(f197,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f135]) ).
fof(f198,definition,
sF12 = set_intersection2(sK9,sK10),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f199,plain,
set_intersection2(sK9,sK10) = sF12,
inference(reorient_equations,[],[f198]) ).
fof(f200,definition,
sF13 = set_difference(sK9,sK10),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f201,plain,
set_difference(sK9,sK10) = sF13,
inference(reorient_equations,[],[f200]) ).
fof(f202,definition,
sF14 = set_difference(sK9,sF13),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f203,plain,
set_difference(sK9,sF13) = sF14,
inference(reorient_equations,[],[f202]) ).
fof(f204,plain,
sF12 != sF14,
inference(definition_folding,[],[f177,f203,f201,f199]) ).
fof(f214,plain,
subset(sF12,sK9),
inference(superposition,[],[f155,f199]) ).
fof(f215,plain,
subset(sF13,sK9),
inference(superposition,[],[f166,f201]) ).
fof(f216,plain,
subset(sF14,sK9),
inference(superposition,[],[f166,f203]) ).
fof(f247,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X1),
inference(superposition,[],[f155,f114]) ).
fof(f279,plain,
sK9 = set_union2(sF13,sK9),
inference(resolution,[],[f154,f215]) ).
fof(f284,plain,
sK9 = set_union2(sK9,sF13),
inference(forward_demodulation,[],[f279,f113]) ).
fof(f297,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(set_intersection2(X0,X1),X1),
inference(resolution,[],[f160,f247]) ).
fof(f308,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,set_intersection2(X0,X1)),
inference(forward_demodulation,[],[f297,f114]) ).
fof(f424,plain,
! [X2,X0,X1] :
( in(sK8(set_intersection2(X0,X1),X2),X1)
| disjoint(set_intersection2(X0,X1),X2) ),
inference(resolution,[],[f194,f173]) ).
fof(f454,plain,
! [X2,X0,X1] :
( ~ in(sK8(X0,set_difference(X1,X2)),X2)
| disjoint(X0,set_difference(X1,X2)) ),
inference(resolution,[],[f197,f172]) ).
fof(f470,plain,
! [X2,X0,X1] :
( ~ subset(X0,set_difference(X1,X2))
| subset(X0,X1) ),
inference(resolution,[],[f158,f166]) ).
fof(f485,plain,
set_union2(sK10,sK9) = set_union2(sK10,sF13),
inference(superposition,[],[f169,f201]) ).
fof(f486,plain,
set_union2(sF13,sK9) = set_union2(sF13,sF14),
inference(superposition,[],[f169,f203]) ).
fof(f503,plain,
set_union2(sK9,sF13) = set_union2(sF13,sF14),
inference(forward_demodulation,[],[f486,f113]) ).
fof(f504,plain,
set_union2(sK10,sF13) = set_union2(sK9,sK10),
inference(forward_demodulation,[],[f485,f113]) ).
fof(f506,plain,
sK9 = set_union2(sF13,sF14),
inference(forward_demodulation,[],[f503,f284]) ).
fof(f524,plain,
! [X0,X1] : set_difference(X1,X0) = set_difference(set_union2(X0,X1),X0),
inference(superposition,[],[f175,f113]) ).
fof(f527,plain,
set_difference(sK9,sF14) = set_difference(sF13,sF14),
inference(superposition,[],[f175,f506]) ).
fof(f579,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| empty_set = set_difference(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(resolution,[],[f159,f168]) ).
fof(f582,plain,
! [X0,X1] :
( subset(X0,set_intersection2(X1,X0))
| ~ subset(X0,X1) ),
inference(superposition,[],[f159,f147]) ).
fof(f607,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| set_difference(X0,X2) = set_intersection2(set_difference(X0,X2),set_difference(X1,X2)) ),
inference(resolution,[],[f165,f160]) ).
fof(f614,plain,
! [X0] :
( subset(sF14,set_difference(X0,sF13))
| ~ subset(sK9,X0) ),
inference(superposition,[],[f165,f203]) ).
fof(f696,plain,
! [X0] :
( ~ subset(X0,sK10)
| ~ subset(X0,sK9)
| subset(X0,sF12) ),
inference(superposition,[],[f156,f199]) ).
fof(f1295,plain,
set_difference(sK10,sF13) = set_difference(set_union2(sK9,sK10),sF13),
inference(superposition,[],[f175,f504]) ).
fof(f1590,plain,
! [X2,X0,X1] : subset(set_intersection2(set_difference(X0,X1),X2),X0),
inference(resolution,[],[f470,f155]) ).
fof(f1694,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,set_intersection2(X1,X0)) = X0 ),
inference(resolution,[],[f582,f160]) ).
fof(f1709,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X1,X0) = X0 ),
inference(forward_demodulation,[],[f1694,f308]) ).
fof(f2238,plain,
set_difference(sF13,sK10) = set_difference(set_union2(sK9,sK10),sK10),
inference(superposition,[],[f524,f504]) ).
fof(f2268,plain,
set_difference(sK9,sK10) = set_difference(sF13,sK10),
inference(forward_demodulation,[],[f2238,f175]) ).
fof(f2278,plain,
sF13 = set_difference(sF13,sK10),
inference(forward_demodulation,[],[f2268,f201]) ).
fof(f3777,plain,
! [X2,X0,X1] :
( disjoint(set_intersection2(X0,X1),set_difference(X2,X1))
| disjoint(set_intersection2(X0,X1),set_difference(X2,X1)) ),
inference(resolution,[],[f454,f424]) ).
fof(f3800,plain,
! [X2,X0,X1] : disjoint(set_intersection2(X0,X1),set_difference(X2,X1)),
inference(duplicate_literal_removal,[],[f3777]) ).
fof(f3861,plain,
! [X2,X0,X1] : empty_set = set_difference(set_intersection2(set_difference(X0,X1),X2),set_intersection2(X0,X2)),
inference(resolution,[],[f579,f166]) ).
fof(f5881,plain,
! [X0] : set_difference(sF12,X0) = set_intersection2(set_difference(sF12,X0),set_difference(sK9,X0)),
inference(resolution,[],[f607,f214]) ).
fof(f5900,plain,
! [X0] : set_difference(sF12,X0) = set_intersection2(set_difference(sK9,X0),set_difference(sF12,X0)),
inference(forward_demodulation,[],[f5881,f114]) ).
fof(f7705,plain,
! [X0] : subset(set_intersection2(set_difference(sK9,sF14),X0),sF13),
inference(superposition,[],[f1590,f527]) ).
fof(f9382,plain,
! [X0] : disjoint(sF12,set_difference(X0,sK10)),
inference(superposition,[],[f3800,f199]) ).
fof(f9448,plain,
disjoint(sF12,sF13),
inference(superposition,[],[f9382,f2278]) ).
fof(f9563,plain,
empty_set = set_intersection2(sF12,sF13),
inference(resolution,[],[f9448,f141]) ).
fof(f27252,plain,
( subset(sF14,set_difference(sK10,sF13))
| ~ subset(sK9,set_union2(sK9,sK10)) ),
inference(superposition,[],[f614,f1295]) ).
fof(f27373,plain,
subset(sF14,set_difference(sK10,sF13)),
inference(forward_subsumption_resolution,[],[f27252,f183]) ).
fof(f27386,plain,
subset(sF14,sK10),
inference(resolution,[],[f27373,f470]) ).
fof(f27492,plain,
( ~ subset(sF14,sK9)
| subset(sF14,sF12) ),
inference(resolution,[],[f27386,f696]) ).
fof(f27527,plain,
subset(sF14,sF12),
inference(forward_subsumption_resolution,[],[f27492,f216]) ).
fof(f27770,plain,
( ~ subset(sF12,sF14)
| sF12 = sF14 ),
inference(resolution,[],[f27527,f117]) ).
fof(f27805,plain,
~ subset(sF12,sF14),
inference(forward_subsumption_resolution,[],[f27770,f204]) ).
fof(f56660,plain,
! [X0] : empty_set = set_difference(set_intersection2(set_difference(sF12,X0),sF13),empty_set),
inference(superposition,[],[f3861,f9563]) ).
fof(f56862,plain,
! [X0] : empty_set = set_intersection2(set_difference(sF12,X0),sF13),
inference(forward_demodulation,[],[f56660,f170]) ).
fof(f56921,plain,
! [X0] : empty_set = set_intersection2(sF13,set_difference(sF12,X0)),
inference(forward_demodulation,[],[f56862,f114]) ).
fof(f65631,plain,
subset(set_difference(sF12,sF14),sF13),
inference(superposition,[],[f7705,f5900]) ).
fof(f65882,plain,
set_difference(sF12,sF14) = set_intersection2(sF13,set_difference(sF12,sF14)),
inference(resolution,[],[f65631,f1709]) ).
fof(f65885,plain,
empty_set = set_difference(sF12,sF14),
inference(forward_demodulation,[],[f65882,f56921]) ).
fof(f66134,plain,
( empty_set != empty_set
| subset(sF12,sF14) ),
inference(superposition,[],[f167,f65885]) ).
fof(f66276,plain,
subset(sF12,sF14),
inference(trivial_inequality_removal,[],[f66134]) ).
fof(f66317,plain,
$false,
inference(forward_subsumption_resolution,[],[f66276,f27805]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU138+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/5.40 % Computer : n026.cluster.edu
% 0.13/5.40 % Model : x86_64 x86_64
% 0.13/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.40 % Memory : 8046.5625MB
% 0.13/5.40 % OS : Linux 6.8.0-71-generic
% 0.13/5.40 % CPULimit : 300
% 0.13/5.40 % WCLimit : 300
% 0.13/5.40 % DateTime : Mon Sep 28 03:44:47 UTC 2026
% 0.15/5.40 % CPUTime :
% 0.15/5.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/5.42 Running first-order model finding
% 0.15/5.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.46/7.92 % (3439283)Will run a generic schedule for satisfiability detection.
% 17.46/7.92 % (3439290)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1540946861:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 17.46/7.92 % (3439289)% WARNING: option uhcvi not known.
% 17.46/7.92 % (3439288)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1181653384_2999 on theBenchmark for (2999ds/0Mi)
% 17.46/7.92 % (3439289)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2597876438:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 17.46/7.92 % (3439291)dis+10_1_sil=32000:sp=arity:random_seed=2076545076:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 17.46/7.92 % (3439292)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=411174315:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 17.46/7.92 % (3439294)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3490682355:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 17.46/7.92 % (3439293)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3389192262:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 17.46/7.92 % TRYING [1]
% 17.46/7.92 % TRYING [2]
% 17.46/7.92 % TRYING [3]
% 17.46/7.92 % TRYING [4]
% 17.46/7.92 % TRYING [5]
% 17.46/7.92 % (3439291)Instruction limit reached!
% 17.46/7.92 % (3439291)------------------------------
% 17.46/7.92 % (3439291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.46/7.92 % (3439291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.46/7.92 % (3439291)CaDiCaL version: 2.1.3
% 17.46/7.92 % (3439291)Termination reason: Instruction limit
% 17.46/7.92 % (3439291)Termination phase: Saturation
% 17.46/7.92 % (3439291)Time elapsed: 0.065 s
% 17.46/7.92 % (3439291)Peak memory usage: 12 MB
% 17.46/7.92 % (3439291)Instructions burned: 104 (million)
% 17.46/7.92 % (3439292)Instruction limit reached!
% 17.46/7.92 % (3439292)------------------------------
% 17.46/7.92 % (3439292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.46/7.92 % (3439292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.46/7.92 % (3439292)CaDiCaL version: 2.1.3
% 17.46/7.92 % (3439292)Termination reason: Instruction limit
% 17.46/7.92 % (3439292)Termination phase: Saturation
% 17.46/7.92 % (3439292)Time elapsed: 0.072 s
% 17.46/7.92 % (3439292)Peak memory usage: 12 MB
% 17.46/7.92 % (3439292)Instructions burned: 117 (million)
% 17.46/7.92 % (3439293)Instruction limit reached!
% 17.46/7.92 % (3439293)------------------------------
% 17.46/7.92 % (3439293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.46/7.92 % (3439293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.46/7.92 % (3439293)CaDiCaL version: 2.1.3
% 17.46/7.92 % (3439293)Termination reason: Instruction limit
% 17.46/7.92 % (3439293)Termination phase: Saturation
% 17.46/7.92 % (3439293)Time elapsed: 0.081 s
% 17.46/7.92 % (3439293)Peak memory usage: 13 MB
% 17.46/7.92 % (3439293)Instructions burned: 131 (million)
% 17.46/7.92 % (3439302)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1162668791:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 17.46/7.92 % TRYING [1]
% 17.46/7.92 % TRYING [2]
% 17.46/7.92 % TRYING [3]
% 17.46/7.92 % (3439303)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=307707980:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 17.46/7.92 % TRYING [6]
% 17.46/7.92 % (3439294)Instruction limit reached!
% 17.46/7.92 % (3439294)------------------------------
% 17.46/7.92 % (3439294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.46/7.92 % (3439294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.46/7.92 % (3439294)CaDiCaL version: 2.1.3
% 17.46/7.92 % (3439294)Termination reason: Instruction limit
% 17.46/7.92 % (3439294)Termination phase: Saturation
% 17.46/7.92 % (3439294)Time elapsed: 0.096 s
% 17.46/7.92 % (3439294)Peak memory usage: 13 MB
% 17.46/7.92 % (3439294)Instructions burned: 160 (million)
% 17.46/7.92 % TRYING [4]
% 17.46/7.92 % (3439304)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3205101079:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 17.46/7.92 % (3439307)ott-21_1_sil=16000:fs=off:random_seed=1494629100:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 17.46/7.92 % TRYING [5]
% 17.46/7.92 % (3439303)Instruction limit reached!
% 17.46/7.92 % (3439303)------------------------------
% 17.46/7.92 % (3439303)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439303)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439303)Termination reason: Instruction limit
% 46.77/12.13 % (3439303)Termination phase: Saturation
% 46.77/12.13 % (3439303)Time elapsed: 0.088 s
% 46.77/12.13 % (3439303)Peak memory usage: 13 MB
% 46.77/12.13 % (3439303)Instructions burned: 131 (million)
% 46.77/12.13 % (3439307)Instruction limit reached!
% 46.77/12.13 % (3439307)------------------------------
% 46.77/12.13 % (3439307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439307)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439307)Termination reason: Instruction limit
% 46.77/12.13 % (3439307)Termination phase: Saturation
% 46.77/12.13 % (3439307)Time elapsed: 0.083 s
% 46.77/12.13 % (3439307)Peak memory usage: 12 MB
% 46.77/12.13 % (3439307)Instructions burned: 182 (million)
% 46.77/12.13 % (3439310)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4146179888:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 46.77/12.13 % TRYING [6]
% 46.77/12.13 % (3439311)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3829482745:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 46.77/12.13 % TRYING [1]
% 46.77/12.13 % TRYING [2]
% 46.77/12.13 % TRYING [3]
% 46.77/12.13 % TRYING [7]
% 46.77/12.13 % TRYING [4]
% 46.77/12.13 % TRYING [5]
% 46.77/12.13 % TRYING [6]
% 46.77/12.13 % (3439302)Instruction limit reached!
% 46.77/12.13 % (3439302)------------------------------
% 46.77/12.13 % (3439302)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439302)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439302)Termination reason: Instruction limit
% 46.77/12.13 % (3439302)Termination phase: Finite model building SAT solving
% 46.77/12.13 % (3439302)Time elapsed: 0.301 s
% 46.77/12.13 % (3439302)Peak memory usage: 24 MB
% 46.77/12.13 % (3439302)Instructions burned: 714 (million)
% 46.77/12.13 % (3439314)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3290475996:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 46.77/12.13 % (3439304)Instruction limit reached!
% 46.77/12.13 % (3439304)------------------------------
% 46.77/12.13 % (3439304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439304)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439304)Termination reason: Instruction limit
% 46.77/12.13 % (3439304)Termination phase: Saturation
% 46.77/12.13 % (3439304)Time elapsed: 0.384 s
% 46.77/12.13 % (3439304)Peak memory usage: 17 MB
% 46.77/12.13 % (3439304)Instructions burned: 684 (million)
% 46.77/12.13 % (3439316)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=387672483:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 46.77/12.13 % (3439310)Instruction limit reached!
% 46.77/12.13 % (3439310)------------------------------
% 46.77/12.13 % (3439310)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439310)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439310)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439310)Termination reason: Instruction limit
% 46.77/12.13 % (3439310)Termination phase: Saturation
% 46.77/12.13 % (3439310)Time elapsed: 0.312 s
% 46.77/12.13 % (3439310)Peak memory usage: 13 MB
% 46.77/12.13 % (3439310)Instructions burned: 478 (million)
% 46.77/12.13 % (3439318)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=198286827:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 46.77/12.13 % (3439311)Instruction limit reached!
% 46.77/12.13 % (3439311)------------------------------
% 46.77/12.13 % (3439311)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439311)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439311)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439311)Termination reason: Instruction limit
% 46.77/12.13 % (3439311)Termination phase: Finite model building SAT solving
% 46.77/12.13 % (3439311)Time elapsed: 0.355 s
% 46.77/12.13 % (3439311)Peak memory usage: 22 MB
% 46.77/12.13 % (3439311)Instructions burned: 865 (million)
% 46.77/12.13 % (3439320)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4148250932:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 46.77/12.13 % TRYING [14]
% 46.77/12.13 % TRYING [8]
% 46.77/12.13 % (3439316)Instruction limit reached!
% 46.77/12.13 % (3439316)------------------------------
% 46.77/12.13 % (3439316)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439316)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439316)Termination reason: Instruction limit
% 46.77/12.13 % (3439316)Termination phase: Finite model building constraint generation
% 46.77/12.13 % (3439316)Time elapsed: 0.327 s
% 46.77/12.13 % (3439316)Peak memory usage: 75 MB
% 46.77/12.13 % (3439316)Instructions burned: 894 (million)
% 46.77/12.13 % (3439322)fmb+10_1_sil=64000:random_seed=2335414082:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 46.77/12.13 % TRYING [1]
% 46.77/12.13 % TRYING [2]
% 46.77/12.13 % TRYING [3]
% 46.77/12.13 % TRYING [4]
% 46.77/12.13 % TRYING [5]
% 46.77/12.13 % (3439318)Instruction limit reached!
% 46.77/12.13 % (3439318)------------------------------
% 46.77/12.13 % (3439318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439318)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439318)Termination reason: Instruction limit
% 46.77/12.13 % (3439318)Termination phase: Saturation
% 46.77/12.13 % (3439318)Time elapsed: 0.441 s
% 46.77/12.13 % (3439318)Peak memory usage: 17 MB
% 46.77/12.13 % (3439318)Instructions burned: 693 (million)
% 46.77/12.13 % (3439324)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1751663516:i=9515:nm=5_2989 on theBenchmark for (2989ds/9515Mi)
% 46.77/12.13 % TRYING [20]
% 46.77/12.13 % TRYING [6]
% 46.77/12.13 % (3439314)Instruction limit reached!
% 46.77/12.13 % (3439314)------------------------------
% 46.77/12.13 % (3439314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439314)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439314)Termination reason: Instruction limit
% 46.77/12.13 % (3439314)Termination phase: Saturation
% 46.77/12.13 % (3439314)Time elapsed: 0.676 s
% 46.77/12.13 % (3439314)Peak memory usage: 22 MB
% 46.77/12.13 % (3439314)Instructions burned: 1179 (million)
% 46.77/12.13 % (3439320)Instruction limit reached!
% 46.77/12.13 % (3439320)------------------------------
% 46.77/12.13 % (3439320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439320)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439320)Termination reason: Instruction limit
% 46.77/12.13 % (3439320)Termination phase: Saturation
% 46.77/12.13 % (3439320)Time elapsed: 0.497 s
% 46.77/12.13 % (3439320)Peak memory usage: 18 MB
% 46.77/12.13 % (3439320)Instructions burned: 879 (million)
% 46.77/12.13 % (3439326)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=529655272:fmbsr=1.7:i=920_2988 on theBenchmark for (2988ds/920Mi)
% 46.77/12.13 % TRYING [8]
% 46.77/12.13 % (3439327)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3396159994:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 46.77/12.13 % TRYING [7]
% 46.77/12.13 % (3439326)Instruction limit reached!
% 46.77/12.13 % (3439326)------------------------------
% 46.77/12.13 % (3439326)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439326)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439326)Termination reason: Instruction limit
% 46.77/12.13 % (3439326)Termination phase: Finite model building SAT solving
% 46.77/12.13 % (3439326)Time elapsed: 0.395 s
% 46.77/12.13 % (3439326)Peak memory usage: 51 MB
% 46.77/12.13 % (3439326)Instructions burned: 920 (million)
% 46.77/12.13 % (3439330)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1576879944:i=1472:ins=7:fdi=8:gsp=on_2984 on theBenchmark for (2984ds/1472Mi)
% 46.77/12.13 % TRYING [8]
% 46.77/12.13 % (3439330)Instruction limit reached!
% 46.77/12.13 % (3439330)------------------------------
% 46.77/12.13 % (3439330)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439330)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439330)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439330)Termination reason: Instruction limit
% 46.77/12.13 % (3439330)Termination phase: Saturation
% 46.77/12.13 % (3439330)Time elapsed: 0.900 s
% 46.77/12.13 % (3439330)Peak memory usage: 31 MB
% 46.77/12.13 % (3439330)Instructions burned: 1472 (million)
% 46.77/12.13 % (3439332)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1687081988:i=6324_2975 on theBenchmark for (2975ds/6324Mi)
% 46.77/12.13 % TRYING [77]
% 46.77/12.13 % TRYING [9]
% 46.77/12.13 % TRYING [9]
% 46.77/12.13 % (3439327)Instruction limit reached!
% 46.77/12.13 % (3439327)------------------------------
% 46.77/12.13 % (3439327)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439327)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439327)Termination reason: Instruction limit
% 46.77/12.13 % (3439327)Termination phase: Saturation
% 46.77/12.13 % (3439327)Time elapsed: 2.716 s
% 46.77/12.13 % (3439327)Peak memory usage: 31 MB
% 46.77/12.13 % (3439327)Instructions burned: 5132 (million)
% 46.77/12.13 % (3439334)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1921611809:fmbsr=2.30978:i=2174_2961 on theBenchmark for (2961ds/2174Mi)
% 46.77/12.13 % TRYING [16]
% 46.77/12.13 % (3439334)Instruction limit reached!
% 46.77/12.13 % (3439334)------------------------------
% 46.77/12.13 % (3439334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439334)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439334)Termination reason: Instruction limit
% 46.77/12.13 % (3439334)Termination phase: Finite model building constraint generation
% 46.77/12.13 % (3439334)Time elapsed: 0.740 s
% 46.77/12.13 % (3439334)Peak memory usage: 134 MB
% 46.77/12.13 % (3439334)Instructions burned: 2176 (million)
% 46.77/12.13 % (3439336)ott-2_1_sil=16000:newcnf=on:random_seed=2379827605:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2953 on theBenchmark for (2953ds/869Mi)
% 46.77/12.13 % (3439332)Instruction limit reached!
% 46.77/12.13 % (3439332)------------------------------
% 46.77/12.13 % (3439332)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439332)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439332)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439332)Termination reason: Instruction limit
% 46.77/12.13 % (3439332)Termination phase: Finite model building constraint generation
% 46.77/12.13 % (3439332)Time elapsed: 2.325 s
% 46.77/12.13 % (3439332)Peak memory usage: 432 MB
% 46.77/12.13 % (3439332)Instructions burned: 6325 (million)
% 46.77/12.13 % (3439338)ott+10_1_sil=32000:tgt=ground:random_seed=3814399277:i=5114:av=off_2951 on theBenchmark for (2951ds/5114Mi)
% 46.77/12.13 % (3439324)Instruction limit reached!
% 46.77/12.13 % (3439324)------------------------------
% 46.77/12.13 % (3439324)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439324)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439324)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439324)Termination reason: Instruction limit
% 46.77/12.13 % (3439324)Termination phase: Finite model building constraint generation
% 46.77/12.13 % (3439324)Time elapsed: 4.104 s
% 46.77/12.13 % (3439324)Peak memory usage: 794 MB
% 46.77/12.13 % (3439324)Instructions burned: 9515 (million)
% 46.77/12.13 % (3439336)Instruction limit reached!
% 46.77/12.13 % (3439336)------------------------------
% 46.77/12.13 % (3439336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439336)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439336)Termination reason: Instruction limit
% 46.77/12.13 % (3439336)Termination phase: Saturation
% 46.77/12.13 % (3439336)Time elapsed: 0.503 s
% 46.77/12.13 % (3439336)Peak memory usage: 17 MB
% 46.77/12.13 % (3439336)Instructions burned: 871 (million)
% 46.77/12.13 % (3439340)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1638795955:i=54282_2948 on theBenchmark for (2948ds/54282Mi)
% 46.77/12.13 % TRYING [1]
% 46.77/12.13 % TRYING [2]
% 46.77/12.13 % TRYING [3]
% 46.77/12.13 % TRYING [4]
% 46.77/12.13 % TRYING [5]
% 46.77/12.13 % (3439342)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2273120396:i=3512:aac=none_2947 on theBenchmark for (2947ds/3512Mi)
% 46.77/12.13 % TRYING [6]
% 46.77/12.13 % TRYING [7]
% 46.77/12.13 % TRYING [8]
% 46.77/12.13 % (3439338) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3439283-3439338"...
% 46.77/12.13 % (3439338)...printing done.
% 46.77/12.13 % (3439338)Refutation found. Thanks to Tanya!
% 46.77/12.13 % SZS status Theorem for theBenchmark
% 46.77/12.13 % SZS output start Proof for theBenchmark
% See solution above
% 46.77/12.13 % (3439338)------------------------------
% 46.77/12.13 % (3439338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.77/12.13 % (3439338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.77/12.13 % (3439338)CaDiCaL version: 2.1.3
% 46.77/12.13 % (3439338)Termination reason: Refutation
% 46.77/12.13 % (3439338)Time elapsed: 1.778 s
% 46.77/12.13 % (3439338)Peak memory usage: 35 MB
% 46.77/12.13 % (3439338)Instructions burned: 3040 (million)
% 46.77/12.13 % (3439283)Success in time 6.697 s
% 46.77/12.13 % Vampire exiting
%------------------------------------------------------------------------------