%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET608+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:44:07 PM UTC 2026
% Result : Theorem 0.16s 10.82s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 95 ( 18 unt; 7 def)
% Number of atoms : 264 ( 35 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 276 ( 107 ~; 137 |; 23 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 87 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f9,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f10,conjecture,
! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_intersection_difference) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f13,plain,
? [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) != X0,
inference(ennf_transformation,[],[f11]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f18]) ).
fof(f25,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f26]) ).
fof(f28,plain,
sK2 != union(intersection(sK2,sK3),difference(sK2,sK3)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f13]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f49,plain,
! [X0,X1] :
( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f50,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| X0 = X1
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
sK2 != union(intersection(sK2,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f28]) ).
fof(f56,definition,
sF4 = intersection(sK2,sK3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f57,plain,
intersection(sK2,sK3) = sF4,
inference(reorient_equations,[],[f56]) ).
fof(f58,definition,
sF5 = difference(sK2,sK3),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f59,plain,
difference(sK2,sK3) = sF5,
inference(reorient_equations,[],[f58]) ).
fof(f60,definition,
sF6 = union(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f61,plain,
union(sF4,sF5) = sF6,
inference(reorient_equations,[],[f60]) ).
fof(f62,plain,
sK2 != sF6,
inference(definition_folding,[],[f51,f61,f59,f57]) ).
fof(f69,plain,
! [X0] :
( ~ member(X0,sF4)
| member(X0,sK3) ),
inference(superposition,[],[f32,f57]) ).
fof(f72,plain,
! [X0] :
( ~ member(X0,sF4)
| member(X0,sK2) ),
inference(superposition,[],[f33,f57]) ).
fof(f76,plain,
! [X0] :
( ~ member(X0,sF5)
| member(X0,sK2) ),
inference(superposition,[],[f36,f59]) ).
fof(f85,plain,
! [X0] :
( ~ member(X0,sF6)
| member(X0,sF5)
| member(X0,sF4) ),
inference(superposition,[],[f29,f61]) ).
fof(f91,plain,
! [X0] :
( ~ member(X0,sK3)
| ~ member(X0,sK2)
| member(X0,sF4) ),
inference(superposition,[],[f34,f57]) ).
fof(f97,plain,
! [X0] :
( ~ member(X0,sK2)
| member(X0,sF5)
| member(X0,sK3) ),
inference(superposition,[],[f37,f59]) ).
fof(f111,plain,
! [X0] :
( member(sK1(X0,sF6),sF5)
| member(sK1(X0,sF6),X0)
| sF6 = X0
| member(sK1(X0,sF6),sF4) ),
inference(resolution,[],[f49,f85]) ).
fof(f117,plain,
! [X0] :
( member(sK1(sK2,X0),sK3)
| member(sK1(sK2,X0),X0)
| member(sK1(sK2,X0),sF5)
| sK2 = X0 ),
inference(resolution,[],[f49,f97]) ).
fof(f130,plain,
! [X2,X0,X1] :
( ~ member(sK1(X0,union(X1,X2)),X1)
| ~ member(sK1(X0,union(X1,X2)),X0)
| union(X1,X2) = X0 ),
inference(resolution,[],[f50,f31]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ~ member(sK1(X0,union(X1,X2)),X2)
| ~ member(sK1(X0,union(X1,X2)),X0)
| union(X1,X2) = X0 ),
inference(resolution,[],[f50,f30]) ).
fof(f567,plain,
! [X0] :
( ~ member(sK1(X0,sF6),sF4)
| ~ member(sK1(X0,sF6),X0)
| sF6 = X0 ),
inference(superposition,[],[f130,f61]) ).
fof(f585,plain,
! [X0] :
( ~ member(sK1(X0,sF6),sF5)
| ~ member(sK1(X0,sF6),X0)
| sF6 = X0 ),
inference(superposition,[],[f131,f61]) ).
fof(f1748,plain,
( member(sK1(sK2,sF6),sK3)
| member(sK1(sK2,sF6),sF5)
| sK2 = sF6
| member(sK1(sK2,sF6),sF5)
| member(sK1(sK2,sF6),sF4) ),
inference(resolution,[],[f117,f85]) ).
fof(f1750,plain,
( member(sK1(sK2,sF6),sK3)
| member(sK1(sK2,sF6),sF5)
| sK2 = sF6
| member(sK1(sK2,sF6),sF4) ),
inference(duplicate_literal_removal,[],[f1748]) ).
fof(f1754,plain,
( member(sK1(sK2,sF6),sK3)
| member(sK1(sK2,sF6),sF5)
| member(sK1(sK2,sF6),sF4) ),
inference(forward_subsumption_resolution,[],[f1750,f62]) ).
fof(f1765,plain,
( member(sK1(sK2,sF6),sK3)
| member(sK1(sK2,sF6),sF5) ),
inference(forward_subsumption_resolution,[],[f1754,f69]) ).
fof(f2963,definition,
( spl7_54
<=> member(sK1(sK2,sF6),sK3) ),
introduced(definition,[new_symbols(definition,[spl7_54])],[avatar_definition]) ).
fof(f2965,plain,
( member(sK1(sK2,sF6),sK3)
| ~ spl7_54 ),
inference(avatar_component_clause,[],[f2963]) ).
fof(f2967,definition,
( spl7_55
<=> member(sK1(sK2,sF6),sF5) ),
introduced(definition,[new_symbols(definition,[spl7_55])],[avatar_definition]) ).
fof(f2968,plain,
( ~ member(sK1(sK2,sF6),sF5)
| spl7_55 ),
inference(avatar_component_clause,[],[f2967]) ).
fof(f2969,plain,
( member(sK1(sK2,sF6),sF5)
| ~ spl7_55 ),
inference(avatar_component_clause,[],[f2967]) ).
fof(f2971,plain,
( spl7_55
| spl7_54 ),
inference(avatar_split_clause,[],[f1765,f2963,f2967]) ).
fof(f3196,plain,
( ~ member(sK1(sK2,sF6),sK2)
| member(sK1(sK2,sF6),sF4)
| ~ spl7_54 ),
inference(resolution,[],[f2965,f91]) ).
fof(f3203,definition,
( spl7_66
<=> member(sK1(sK2,sF6),sF4) ),
introduced(definition,[new_symbols(definition,[spl7_66])],[avatar_definition]) ).
fof(f3205,plain,
( member(sK1(sK2,sF6),sF4)
| ~ spl7_66 ),
inference(avatar_component_clause,[],[f3203]) ).
fof(f3207,definition,
( spl7_67
<=> member(sK1(sK2,sF6),sK2) ),
introduced(definition,[new_symbols(definition,[spl7_67])],[avatar_definition]) ).
fof(f3208,plain,
( member(sK1(sK2,sF6),sK2)
| ~ spl7_67 ),
inference(avatar_component_clause,[],[f3207]) ).
fof(f3209,plain,
( ~ member(sK1(sK2,sF6),sK2)
| spl7_67 ),
inference(avatar_component_clause,[],[f3207]) ).
fof(f3210,plain,
( spl7_66
| ~ spl7_67
| ~ spl7_54 ),
inference(avatar_split_clause,[],[f3196,f2963,f3207,f3203]) ).
fof(f3572,plain,
( ~ member(sK1(sK2,sF6),sK2)
| sK2 = sF6
| ~ spl7_55 ),
inference(resolution,[],[f2969,f585]) ).
fof(f3573,plain,
( member(sK1(sK2,sF6),sK2)
| ~ spl7_55 ),
inference(resolution,[],[f2969,f76]) ).
fof(f3581,plain,
( sK2 = sF6
| ~ spl7_55
| ~ spl7_67 ),
inference(forward_subsumption_resolution,[],[f3572,f3208]) ).
fof(f3582,plain,
( $false
| ~ spl7_55
| ~ spl7_67 ),
inference(forward_subsumption_resolution,[],[f3581,f62]) ).
fof(f3583,plain,
( ~ spl7_55
| ~ spl7_67 ),
inference(avatar_contradiction_clause,[],[f3582]) ).
fof(f3585,plain,
( $false
| ~ spl7_55
| spl7_67 ),
inference(forward_subsumption_resolution,[],[f3573,f3209]) ).
fof(f3586,plain,
( ~ spl7_55
| spl7_67 ),
inference(avatar_contradiction_clause,[],[f3585]) ).
fof(f3687,plain,
( member(sK1(sK2,sF6),sF5)
| sK2 = sF6
| member(sK1(sK2,sF6),sF4)
| spl7_67 ),
inference(resolution,[],[f3209,f111]) ).
fof(f3690,plain,
( sK2 = sF6
| member(sK1(sK2,sF6),sF4)
| spl7_55
| spl7_67 ),
inference(forward_subsumption_resolution,[],[f3687,f2968]) ).
fof(f3691,plain,
( member(sK1(sK2,sF6),sF4)
| spl7_55
| spl7_67 ),
inference(forward_subsumption_resolution,[],[f3690,f62]) ).
fof(f3692,plain,
( spl7_66
| spl7_55
| spl7_67 ),
inference(avatar_split_clause,[],[f3691,f3207,f2967,f3203]) ).
fof(f3720,plain,
( ~ member(sK1(sK2,sF6),sK2)
| sK2 = sF6
| ~ spl7_66 ),
inference(resolution,[],[f3205,f567]) ).
fof(f3721,plain,
( member(sK1(sK2,sF6),sK2)
| ~ spl7_66 ),
inference(resolution,[],[f3205,f72]) ).
fof(f3729,plain,
( $false
| ~ spl7_66
| spl7_67 ),
inference(forward_subsumption_resolution,[],[f3721,f3209]) ).
fof(f3730,plain,
( ~ spl7_66
| spl7_67 ),
inference(avatar_contradiction_clause,[],[f3729]) ).
fof(f3731,plain,
( sK2 = sF6
| ~ spl7_66
| ~ spl7_67 ),
inference(forward_subsumption_resolution,[],[f3720,f3208]) ).
fof(f3732,plain,
( $false
| ~ spl7_66
| ~ spl7_67 ),
inference(forward_subsumption_resolution,[],[f3731,f62]) ).
fof(f3733,plain,
( ~ spl7_66
| ~ spl7_67 ),
inference(avatar_contradiction_clause,[],[f3732]) ).
cnf(s57,plain,
( spl7_54
| spl7_55 ),
inference(sat_conversion,[],[f2971]) ).
cnf(s67,plain,
( ~ spl7_54
| spl7_66
| ~ spl7_67 ),
inference(sat_conversion,[],[f3210]) ).
cnf(s73,plain,
( ~ spl7_55
| ~ spl7_67 ),
inference(sat_conversion,[],[f3583]) ).
cnf(s74,plain,
( ~ spl7_55
| spl7_67 ),
inference(sat_conversion,[],[f3586]) ).
cnf(s78,plain,
( spl7_55
| spl7_66
| spl7_67 ),
inference(sat_conversion,[],[f3692]) ).
cnf(s79,plain,
( ~ spl7_66
| spl7_67 ),
inference(sat_conversion,[],[f3730]) ).
cnf(s80,plain,
( ~ spl7_66
| ~ spl7_67 ),
inference(sat_conversion,[],[f3733]) ).
cnf(s82,plain,
~ spl7_55,
inference(rat,[],[s73,s74]) ).
cnf(s83,plain,
spl7_54,
inference(rat,[],[s57,s82]) ).
cnf(s85,plain,
~ spl7_66,
inference(rat,[],[s79,s80]) ).
cnf(s87,plain,
spl7_67,
inference(rat,[],[s78,s82,s85]) ).
cnf(s88,plain,
$false,
inference(rat,[],[s67,s83,s85,s87]) ).
fof(f3734,plain,
$false,
inference(avatar_sat_refutation,[],[s88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET608+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/10.39 % Computer : n004.cluster.edu
% 0.12/10.39 % Model : x86_64 x86_64
% 0.12/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39 % Memory : 8046.5625MB
% 0.12/10.39 % OS : Linux 6.8.0-71-generic
% 0.12/10.39 % CPULimit : 300
% 0.12/10.39 % WCLimit : 300
% 0.12/10.39 % DateTime : Mon Sep 28 02:18:33 UTC 2026
% 0.12/10.39 % CPUTime :
% 0.12/10.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/10.42 Running first-order model finding
% 0.16/10.42 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.16/10.82 % (4084021)Will run a generic schedule for satisfiability detection.
% 0.16/10.82 % (4084031)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1779253263:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/10.82 % (4084027)% WARNING: option uhcvi not known.
% 0.16/10.82 % (4084026)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2821376107_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/10.82 % (4084027)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3585714186:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/10.82 % (4084028)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1608427467:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/10.82 % (4084029)dis+10_1_sil=32000:sp=arity:random_seed=2448676727:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/10.82 % (4084030)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=271647676:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/10.82 % (4084032)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4231563536:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/10.82 % TRYING [1]
% 0.16/10.82 % TRYING [2]
% 0.16/10.82 % TRYING [3]
% 0.16/10.82 % TRYING [4]
% 0.16/10.82 % (4084031)Instruction limit reached!
% 0.16/10.82 % (4084031)------------------------------
% 0.16/10.82 % (4084031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084031)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084031)Termination reason: Instruction limit
% 0.16/10.82 % (4084031)Termination phase: Saturation
% 0.16/10.82 % (4084031)Time elapsed: 0.041 s
% 0.16/10.82 % (4084031)Peak memory usage: 12 MB
% 0.16/10.82 % (4084031)Instructions burned: 134 (million)
% 0.16/10.82 % (4084040)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3972878322:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.16/10.82 % TRYING [1]
% 0.16/10.82 % TRYING [2]
% 0.16/10.82 % TRYING [3]
% 0.16/10.82 % TRYING [4]
% 0.16/10.82 % TRYING [5]
% 0.16/10.82 % (4084029)Instruction limit reached!
% 0.16/10.82 % (4084029)------------------------------
% 0.16/10.82 % (4084029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084029)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084029)Termination reason: Instruction limit
% 0.16/10.82 % (4084029)Termination phase: Saturation
% 0.16/10.82 % (4084029)Time elapsed: 0.061 s
% 0.16/10.82 % (4084029)Peak memory usage: 12 MB
% 0.16/10.82 % (4084029)Instructions burned: 104 (million)
% 0.16/10.82 % (4084030)Instruction limit reached!
% 0.16/10.82 % (4084030)------------------------------
% 0.16/10.82 % (4084030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084030)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084030)Termination reason: Instruction limit
% 0.16/10.82 % (4084030)Termination phase: Saturation
% 0.16/10.82 % (4084030)Time elapsed: 0.063 s
% 0.16/10.82 % (4084030)Peak memory usage: 12 MB
% 0.16/10.82 % (4084030)Instructions burned: 117 (million)
% 0.16/10.82 % TRYING [5]
% 0.16/10.82 % (4084042)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=568254892:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/10.82 % (4084043)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=676582931:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.16/10.82 % (4084032)Instruction limit reached!
% 0.16/10.82 % (4084032)------------------------------
% 0.16/10.82 % (4084032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084032)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084032)Termination reason: Instruction limit
% 0.16/10.82 % (4084032)Termination phase: Saturation
% 0.16/10.82 % (4084032)Time elapsed: 0.094 s
% 0.16/10.82 % (4084032)Peak memory usage: 12 MB
% 0.16/10.82 % (4084032)Instructions burned: 161 (million)
% 0.16/10.82 % (4084046)ott-21_1_sil=16000:fs=off:random_seed=1321761868:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.16/10.82 % (4084042)Instruction limit reached!
% 0.16/10.82 % (4084042)------------------------------
% 0.16/10.82 % (4084042)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084042)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084042)Termination reason: Instruction limit
% 0.16/10.82 % (4084042)Termination phase: Saturation
% 0.16/10.82 % (4084042)Time elapsed: 0.077 s
% 0.16/10.82 % (4084042)Peak memory usage: 12 MB
% 0.16/10.82 % (4084042)Instructions burned: 131 (million)
% 0.16/10.82 % (4084048)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3135905259:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.16/10.82 % (4084046)Instruction limit reached!
% 0.16/10.82 % (4084046)------------------------------
% 0.16/10.82 % (4084046)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084046)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084046)Termination reason: Instruction limit
% 0.16/10.82 % (4084046)Termination phase: Saturation
% 0.16/10.82 % (4084046)Time elapsed: 0.086 s
% 0.16/10.82 % (4084046)Peak memory usage: 12 MB
% 0.16/10.82 % (4084046)Instructions burned: 181 (million)
% 0.16/10.82 % (4084050)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4272839007:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 0.16/10.82 % TRYING [1]
% 0.16/10.82 % TRYING [2]
% 0.16/10.82 % TRYING [3]
% 0.16/10.82 % TRYING [4]
% 0.16/10.82 % TRYING [6]
% 0.16/10.82 % TRYING [5]
% 0.16/10.82 % (4084040)Instruction limit reached!
% 0.16/10.82 % (4084040)------------------------------
% 0.16/10.82 % (4084040)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084040)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084040)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084040)Termination reason: Instruction limit
% 0.16/10.82 % (4084040)Termination phase: Finite model building SAT solving
% 0.16/10.82 % (4084040)Time elapsed: 0.216 s
% 0.16/10.82 % (4084040)Peak memory usage: 14 MB
% 0.16/10.82 % (4084040)Instructions burned: 716 (million)
% 0.16/10.82 % (4084052)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1117756365:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 0.16/10.82 % TRYING [6]
% 0.16/10.82 % (4084052) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4084021-4084052"...
% 0.16/10.82 % (4084052)...printing done.
% 0.16/10.82 % (4084052)Refutation found. Thanks to Tanya!
% 0.16/10.82 % SZS status Theorem for theBenchmark
% 0.16/10.82 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/10.82 % (4084052)------------------------------
% 0.16/10.82 % (4084052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/10.82 % (4084052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/10.82 % (4084052)CaDiCaL version: 2.1.3
% 0.16/10.82 % (4084052)Termination reason: Refutation
% 0.16/10.82 % (4084052)Time elapsed: 0.072 s
% 0.16/10.82 % (4084052)Peak memory usage: 14 MB
% 0.16/10.82 % (4084052)Instructions burned: 237 (million)
% 0.16/10.82 % (4084021)Success in time 0.384 s
% 0.16/10.82 % Vampire exiting
%------------------------------------------------------------------------------