%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU137+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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 0.17s 5.92s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 76 ( 16 unt; 4 def)
% Number of atoms : 273 ( 53 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 312 ( 115 ~; 137 |; 45 &)
% ( 8 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 131 ( 0 sgn 121 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f17,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f19,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> X1 = set_union2(X0,set_difference(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t45_xboole_1) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> X1 = set_union2(X0,set_difference(X1,X0)) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f29,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f32,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f33,plain,
? [X0,X1] :
( set_union2(X0,set_difference(X1,X0)) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [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,[],[f3]) ).
fof(f38,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,[],[f37]) ).
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) ) ) )
& ( ! [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,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ( ( ( ~ in(sK0(X0,X1,X2),X0)
& ~ in(sK0(X0,X1,X2),X1) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( in(sK0(X0,X1,X2),X0)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f39]) ).
fof(f41,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,[],[f5]) ).
fof(f42,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,[],[f41]) ).
fof(f43,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,[],[f42]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& ~ in(sK1(X0,X1,X2),X1) )
| in(sK1(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,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f43]) ).
fof(f47,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f48,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK4(X0,X1),X1)
| ~ in(sK4(X0,X1),X0) )
& ( in(sK4(X0,X1),X1)
| in(sK4(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f47]) ).
fof(f49,plain,
( sK6 != set_union2(sK5,set_difference(sK6,sK5))
& subset(sK5,sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f33]) ).
fof(f51,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f52,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f53,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f54,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f60,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f44]) ).
fof(f61,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f44]) ).
fof(f73,plain,
! [X0,X1] :
( in(sK4(X0,X1),X1)
| in(sK4(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f48]) ).
fof(f74,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X1)
| X0 = X1
| ~ in(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f76,plain,
subset(sK5,sK6),
inference(cnf_transformation,[],[f49]) ).
fof(f77,plain,
sK6 != set_union2(sK5,set_difference(sK6,sK5)),
inference(cnf_transformation,[],[f49]) ).
fof(f82,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f54]) ).
fof(f83,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f53]) ).
fof(f84,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X1)
| in(X4,X0) ),
inference(equality_resolution,[],[f52]) ).
fof(f85,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| ~ in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f61]) ).
fof(f86,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f60]) ).
fof(f88,definition,
sF7 = set_difference(sK6,sK5),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f89,plain,
set_difference(sK6,sK5) = sF7,
inference(reorient_equations,[],[f88]) ).
fof(f90,definition,
sF8 = set_union2(sK5,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f91,plain,
set_union2(sK5,sF7) = sF8,
inference(reorient_equations,[],[f90]) ).
fof(f92,plain,
sK6 != sF8,
inference(definition_folding,[],[f77,f91,f89]) ).
fof(f93,plain,
sF8 = set_union2(sF7,sK5),
inference(forward_demodulation,[],[f91,f51]) ).
fof(f147,plain,
! [X0] :
( ~ in(X0,sF7)
| in(X0,sK6) ),
inference(superposition,[],[f86,f89]) ).
fof(f153,plain,
! [X0] :
( ~ in(X0,sK5)
| in(X0,sK6) ),
inference(resolution,[],[f58,f76]) ).
fof(f161,plain,
! [X0] :
( ~ in(X0,sF8)
| in(X0,sK5)
| in(X0,sF7) ),
inference(superposition,[],[f84,f93]) ).
fof(f170,plain,
! [X0] :
( ~ in(X0,sK6)
| in(X0,sF7)
| in(X0,sK5) ),
inference(superposition,[],[f85,f89]) ).
fof(f221,plain,
! [X2,X0,X1] :
( ~ in(sK4(X0,set_union2(X1,X2)),X2)
| ~ in(sK4(X0,set_union2(X1,X2)),X0)
| set_union2(X1,X2) = X0 ),
inference(resolution,[],[f74,f83]) ).
fof(f222,plain,
! [X2,X0,X1] :
( ~ in(sK4(X0,set_union2(X1,X2)),X1)
| ~ in(sK4(X0,set_union2(X1,X2)),X0)
| set_union2(X1,X2) = X0 ),
inference(resolution,[],[f74,f82]) ).
fof(f412,plain,
! [X0] :
( in(sK4(X0,sF8),sK5)
| in(sK4(X0,sF8),X0)
| in(sK4(X0,sF8),sF7)
| sF8 = X0 ),
inference(resolution,[],[f161,f73]) ).
fof(f1002,plain,
! [X0] :
( ~ in(sK4(X0,sF8),sK5)
| ~ in(sK4(X0,sF8),X0)
| sF8 = X0 ),
inference(superposition,[],[f221,f93]) ).
fof(f1016,plain,
! [X0] :
( ~ in(sK4(X0,sF8),sF7)
| ~ in(sK4(X0,sF8),X0)
| sF8 = X0 ),
inference(superposition,[],[f222,f93]) ).
fof(f10990,plain,
( in(sK4(sK6,sF8),sK5)
| in(sK4(sK6,sF8),sF7)
| sK6 = sF8
| in(sK4(sK6,sF8),sF7)
| in(sK4(sK6,sF8),sK5) ),
inference(resolution,[],[f412,f170]) ).
fof(f10994,plain,
( in(sK4(sK6,sF8),sK5)
| in(sK4(sK6,sF8),sF7)
| sK6 = sF8 ),
inference(duplicate_literal_removal,[],[f10990]) ).
fof(f10998,plain,
( in(sK4(sK6,sF8),sK5)
| in(sK4(sK6,sF8),sF7) ),
inference(forward_subsumption_resolution,[],[f10994,f92]) ).
fof(f11000,definition,
( spl9_102
<=> in(sK4(sK6,sF8),sF7) ),
introduced(definition,[new_symbols(definition,[spl9_102])],[avatar_definition]) ).
fof(f11002,plain,
( in(sK4(sK6,sF8),sF7)
| ~ spl9_102 ),
inference(avatar_component_clause,[],[f11000]) ).
fof(f11004,definition,
( spl9_103
<=> in(sK4(sK6,sF8),sK5) ),
introduced(definition,[new_symbols(definition,[spl9_103])],[avatar_definition]) ).
fof(f11006,plain,
( in(sK4(sK6,sF8),sK5)
| ~ spl9_103 ),
inference(avatar_component_clause,[],[f11004]) ).
fof(f11007,plain,
( spl9_102
| spl9_103 ),
inference(avatar_split_clause,[],[f10998,f11004,f11000]) ).
fof(f11008,plain,
( ~ in(sK4(sK6,sF8),sK6)
| sK6 = sF8
| ~ spl9_102 ),
inference(resolution,[],[f11002,f1016]) ).
fof(f11010,plain,
( in(sK4(sK6,sF8),sK6)
| ~ spl9_102 ),
inference(resolution,[],[f11002,f147]) ).
fof(f11015,plain,
( sK6 = sF8
| ~ spl9_102 ),
inference(forward_subsumption_resolution,[],[f11008,f11010]) ).
fof(f11016,plain,
( $false
| ~ spl9_102 ),
inference(forward_subsumption_resolution,[],[f11015,f92]) ).
fof(f11017,plain,
~ spl9_102,
inference(avatar_contradiction_clause,[],[f11016]) ).
fof(f11065,plain,
( ~ in(sK4(sK6,sF8),sK6)
| sK6 = sF8
| ~ spl9_103 ),
inference(resolution,[],[f11006,f1002]) ).
fof(f11066,plain,
( in(sK4(sK6,sF8),sK6)
| ~ spl9_103 ),
inference(resolution,[],[f11006,f153]) ).
fof(f11070,plain,
( sK6 = sF8
| ~ spl9_103 ),
inference(forward_subsumption_resolution,[],[f11065,f11066]) ).
fof(f11071,plain,
( $false
| ~ spl9_103 ),
inference(forward_subsumption_resolution,[],[f11070,f92]) ).
fof(f11072,plain,
~ spl9_103,
inference(avatar_contradiction_clause,[],[f11071]) ).
cnf(s204,plain,
( spl9_102
| spl9_103 ),
inference(sat_conversion,[],[f11007]) ).
cnf(s206,plain,
~ spl9_102,
inference(sat_conversion,[],[f11017]) ).
cnf(s208,plain,
~ spl9_103,
inference(sat_conversion,[],[f11072]) ).
cnf(s209,plain,
$false,
inference(rat,[],[s204,s208,s206]) ).
fof(f11073,plain,
$false,
inference(avatar_sat_refutation,[],[s209]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU137+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/5.40 % Computer : n009.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:41:20 UTC 2026
% 0.13/5.40 % CPUTime :
% 0.13/5.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/5.44 Running first-order model finding
% 0.13/5.44 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.92 % (2640587)Will run a generic schedule for satisfiability detection.
% 0.17/5.92 % (2640596)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3896996053:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/5.92 % (2640593)% WARNING: option uhcvi not known.
% 0.17/5.92 % (2640594)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=625444106:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/5.92 % (2640592)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=334549295_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/5.92 % (2640593)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4257568087:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/5.92 % (2640598)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3460167181:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/5.92 % (2640595)dis+10_1_sil=32000:sp=arity:random_seed=242673932:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/5.92 % (2640597)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3608179267:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/5.92 % TRYING [1]
% 0.17/5.92 % TRYING [2]
% 0.17/5.92 % TRYING [3]
% 0.17/5.92 % TRYING [4]
% 0.17/5.92 % TRYING [5]
% 0.17/5.92 % (2640596)Instruction limit reached!
% 0.17/5.92 % (2640596)------------------------------
% 0.17/5.92 % (2640596)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640596)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640596)Termination reason: Instruction limit
% 0.17/5.92 % (2640596)Termination phase: Saturation
% 0.17/5.92 % (2640596)Time elapsed: 0.039 s
% 0.17/5.92 % (2640596)Peak memory usage: 12 MB
% 0.17/5.92 % (2640596)Instructions burned: 118 (million)
% 0.17/5.92 % (2640606)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1907760544:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/5.92 % TRYING [1]
% 0.17/5.92 % TRYING [2]
% 0.17/5.92 % TRYING [3]
% 0.17/5.92 % TRYING [4]
% 0.17/5.92 % TRYING [5]
% 0.17/5.92 % (2640595)Instruction limit reached!
% 0.17/5.92 % (2640595)------------------------------
% 0.17/5.92 % (2640595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640595)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640595)Termination reason: Instruction limit
% 0.17/5.92 % (2640595)Termination phase: Saturation
% 0.17/5.92 % (2640595)Time elapsed: 0.061 s
% 0.17/5.92 % (2640595)Peak memory usage: 12 MB
% 0.17/5.92 % (2640595)Instructions burned: 103 (million)
% 0.17/5.92 % TRYING [6]
% 0.17/5.92 % (2640597)Instruction limit reached!
% 0.17/5.92 % (2640597)------------------------------
% 0.17/5.92 % (2640597)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640597)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640597)Termination reason: Instruction limit
% 0.17/5.92 % (2640597)Termination phase: Saturation
% 0.17/5.92 % (2640597)Time elapsed: 0.079 s
% 0.17/5.92 % (2640597)Peak memory usage: 12 MB
% 0.17/5.92 % (2640597)Instructions burned: 132 (million)
% 0.17/5.92 % (2640608)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2781100607:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/5.92 % (2640598)Instruction limit reached!
% 0.17/5.92 % (2640598)------------------------------
% 0.17/5.92 % (2640598)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640598)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640598)Termination reason: Instruction limit
% 0.17/5.92 % (2640598)Termination phase: Saturation
% 0.17/5.92 % (2640598)Time elapsed: 0.099 s
% 0.17/5.92 % (2640598)Peak memory usage: 12 MB
% 0.17/5.92 % (2640598)Instructions burned: 161 (million)
% 0.17/5.92 % (2640609)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=2368384325:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.17/5.92 % TRYING [6]
% 0.17/5.92 % (2640612)ott-21_1_sil=16000:fs=off:random_seed=319579654:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.17/5.92 % (2640608)Instruction limit reached!
% 0.17/5.92 % (2640608)------------------------------
% 0.17/5.92 % (2640608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640608)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640608)Termination reason: Instruction limit
% 0.17/5.92 % (2640608)Termination phase: Saturation
% 0.17/5.92 % (2640608)Time elapsed: 0.083 s
% 0.17/5.92 % (2640608)Peak memory usage: 12 MB
% 0.17/5.92 % (2640608)Instructions burned: 132 (million)
% 0.17/5.92 % (2640614)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3474780812:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.17/5.92 % TRYING [7]
% 0.17/5.92 % (2640612)Instruction limit reached!
% 0.17/5.92 % (2640612)------------------------------
% 0.17/5.92 % (2640612)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640612)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640612)Termination reason: Instruction limit
% 0.17/5.92 % (2640612)Termination phase: Saturation
% 0.17/5.92 % (2640612)Time elapsed: 0.091 s
% 0.17/5.92 % (2640612)Peak memory usage: 13 MB
% 0.17/5.92 % (2640612)Instructions burned: 181 (million)
% 0.17/5.92 % (2640616)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1170818805:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 0.17/5.92 % TRYING [1]
% 0.17/5.92 % TRYING [2]
% 0.17/5.92 % (2640606)Instruction limit reached!
% 0.17/5.92 % (2640606)------------------------------
% 0.17/5.92 % (2640606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640606)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640606)Termination reason: Instruction limit
% 0.17/5.92 % (2640606)Termination phase: Finite model building SAT solving
% 0.17/5.92 % (2640606)Time elapsed: 0.189 s
% 0.17/5.92 % (2640606)Peak memory usage: 19 MB
% 0.17/5.92 % (2640606)Instructions burned: 717 (million)
% 0.17/5.92 % TRYING [3]
% 0.17/5.92 % TRYING [4]
% 0.17/5.92 % (2640618)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3081335789:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 0.17/5.92 % TRYING [5]
% 0.17/5.92 % TRYING [6]
% 0.17/5.92 % (2640618) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2640587-2640618"...
% 0.17/5.92 % (2640618)...printing done.
% 0.17/5.92 % (2640618)Refutation found. Thanks to Tanya!
% 0.17/5.92 % SZS status Theorem for theBenchmark
% 0.17/5.92 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/5.92 % (2640618)------------------------------
% 0.17/5.92 % (2640618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.92 % (2640618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.92 % (2640618)CaDiCaL version: 2.1.3
% 0.17/5.92 % (2640618)Termination reason: Refutation
% 0.17/5.92 % (2640618)Time elapsed: 0.191 s
% 0.17/5.92 % (2640618)Peak memory usage: 17 MB
% 0.17/5.92 % (2640618)Instructions burned: 608 (million)
% 0.17/5.92 % (2640587)Success in time 0.476 s
% 0.17/5.92 % Vampire exiting
%------------------------------------------------------------------------------