%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET143+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:43:15 PM UTC 2026
% Result : Theorem 1.83s 0.78s
% Output : Refutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 90 ( 27 unt; 8 def)
% Number of atoms : 229 ( 38 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 244 ( 105 ~; 118 |; 14 &)
% ( 7 <=>; 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; 7 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 61 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f7,conjecture,
! [X0,X1,X2] : intersection(intersection(X0,X1),X2) = intersection(X0,intersection(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_associativity_of_intersection) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] : intersection(intersection(X0,X1),X2) = intersection(X0,intersection(X1,X2)),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f10,plain,
? [X0,X1,X2] : intersection(intersection(X0,X1),X2) != intersection(X0,intersection(X1,X2)),
inference(ennf_transformation,[],[f8]) ).
fof(f11,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,[],[f1]) ).
fof(f12,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,[],[f11]) ).
fof(f18,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,[],[f6]) ).
fof(f19,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,[],[f18]) ).
fof(f20,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))],[f19]) ).
fof(f21,plain,
intersection(intersection(sK2,sK3),sK4) != intersection(sK2,intersection(sK3,sK4)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f10]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f35,plain,
! [X0,X1] :
( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| X0 = X1
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
intersection(intersection(sK2,sK3),sK4) != intersection(sK2,intersection(sK3,sK4)),
inference(cnf_transformation,[],[f21]) ).
fof(f42,definition,
sF5 = intersection(sK2,sK3),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f43,plain,
intersection(sK2,sK3) = sF5,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF6 = intersection(sF5,sK4),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f45,plain,
intersection(sF5,sK4) = sF6,
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
sF7 = intersection(sK3,sK4),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f47,plain,
intersection(sK3,sK4) = sF7,
inference(reorient_equations,[],[f46]) ).
fof(f48,definition,
sF8 = intersection(sK2,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f49,plain,
intersection(sK2,sF7) = sF8,
inference(reorient_equations,[],[f48]) ).
fof(f50,plain,
sF6 != sF8,
inference(definition_folding,[],[f37,f49,f47,f45,f43]) ).
fof(f51,plain,
sF8 = intersection(sF7,sK2),
inference(forward_demodulation,[],[f49,f28]) ).
fof(f54,plain,
! [X0] :
( ~ member(X0,sF5)
| member(X0,sK3) ),
inference(superposition,[],[f22,f43]) ).
fof(f55,plain,
! [X0] :
( ~ member(X0,sF7)
| member(X0,sK4) ),
inference(superposition,[],[f22,f47]) ).
fof(f56,plain,
! [X0] :
( ~ member(X0,sF6)
| member(X0,sK4) ),
inference(superposition,[],[f22,f45]) ).
fof(f57,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sK2) ),
inference(superposition,[],[f22,f51]) ).
fof(f60,plain,
! [X0] :
( ~ member(X0,sF5)
| member(X0,sK2) ),
inference(superposition,[],[f23,f43]) ).
fof(f61,plain,
! [X0] :
( ~ member(X0,sF7)
| member(X0,sK3) ),
inference(superposition,[],[f23,f47]) ).
fof(f62,plain,
! [X0] :
( ~ member(X0,sF6)
| member(X0,sF5) ),
inference(superposition,[],[f23,f45]) ).
fof(f63,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sF7) ),
inference(superposition,[],[f23,f51]) ).
fof(f73,plain,
! [X0] :
( ~ member(X0,sK3)
| ~ member(X0,sK2)
| member(X0,sF5) ),
inference(superposition,[],[f24,f43]) ).
fof(f74,plain,
! [X0] :
( ~ member(X0,sK4)
| ~ member(X0,sK3)
| member(X0,sF7) ),
inference(superposition,[],[f24,f47]) ).
fof(f76,plain,
! [X0] :
( ~ member(X0,sF7)
| member(X0,sF8)
| ~ member(X0,sK2) ),
inference(superposition,[],[f24,f51]) ).
fof(f81,plain,
! [X0] :
( member(sK1(X0,sF6),sF5)
| member(sK1(X0,sF6),X0)
| sF6 = X0 ),
inference(resolution,[],[f35,f62]) ).
fof(f82,plain,
! [X0] :
( member(sK1(X0,sF6),sK4)
| member(sK1(X0,sF6),X0)
| sF6 = X0 ),
inference(resolution,[],[f35,f56]) ).
fof(f99,plain,
! [X2,X0,X1] :
( ~ member(sK1(X0,intersection(X1,X2)),X2)
| ~ member(sK1(X0,intersection(X1,X2)),X0)
| ~ member(sK1(X0,intersection(X1,X2)),X1)
| intersection(X1,X2) = X0 ),
inference(resolution,[],[f36,f24]) ).
fof(f445,plain,
! [X0] :
( ~ member(sK1(X0,sF6),sF5)
| ~ member(sK1(X0,sF6),X0)
| ~ member(sK1(X0,sF6),sK4)
| sF6 = X0 ),
inference(superposition,[],[f99,f45]) ).
fof(f881,plain,
( member(sK1(sF8,sF6),sF5)
| sF6 = sF8
| member(sK1(sF8,sF6),sF7) ),
inference(resolution,[],[f81,f63]) ).
fof(f882,plain,
( member(sK1(sF8,sF6),sF5)
| sF6 = sF8
| member(sK1(sF8,sF6),sK2) ),
inference(resolution,[],[f81,f57]) ).
fof(f889,plain,
( sF6 = sF8
| member(sK1(sF8,sF6),sK2) ),
inference(forward_subsumption_resolution,[],[f882,f60]) ).
fof(f901,plain,
member(sK1(sF8,sF6),sK2),
inference(forward_subsumption_resolution,[],[f889,f50]) ).
fof(f985,plain,
( member(sK1(sF8,sF6),sF5)
| member(sK1(sF8,sF6),sF7) ),
inference(forward_subsumption_resolution,[],[f881,f50]) ).
fof(f1008,plain,
( member(sK1(sF8,sF6),sK4)
| sF6 = sF8
| member(sK1(sF8,sF6),sF7) ),
inference(resolution,[],[f82,f63]) ).
fof(f1017,plain,
( member(sK1(sF8,sF6),sK4)
| sF6 = sF8 ),
inference(forward_subsumption_resolution,[],[f1008,f55]) ).
fof(f1022,plain,
member(sK1(sF8,sF6),sK4),
inference(forward_subsumption_resolution,[],[f1017,f50]) ).
fof(f2063,definition,
( spl9_95
<=> member(sK1(sF8,sF6),sF7) ),
introduced(definition,[new_symbols(definition,[spl9_95])],[avatar_definition]) ).
fof(f2064,plain,
( ~ member(sK1(sF8,sF6),sF7)
| spl9_95 ),
inference(avatar_component_clause,[],[f2063]) ).
fof(f2065,plain,
( member(sK1(sF8,sF6),sF7)
| ~ spl9_95 ),
inference(avatar_component_clause,[],[f2063]) ).
fof(f2067,definition,
( spl9_96
<=> member(sK1(sF8,sF6),sF5) ),
introduced(definition,[new_symbols(definition,[spl9_96])],[avatar_definition]) ).
fof(f2069,plain,
( member(sK1(sF8,sF6),sF5)
| ~ spl9_96 ),
inference(avatar_component_clause,[],[f2067]) ).
fof(f2070,plain,
( spl9_95
| spl9_96 ),
inference(avatar_split_clause,[],[f985,f2067,f2063]) ).
fof(f2073,definition,
( spl9_97
<=> member(sK1(sF8,sF6),sK2) ),
introduced(definition,[new_symbols(definition,[spl9_97])],[avatar_definition]) ).
fof(f2075,plain,
( member(sK1(sF8,sF6),sK2)
| ~ spl9_97 ),
inference(avatar_component_clause,[],[f2073]) ).
fof(f2077,definition,
( spl9_98
<=> member(sK1(sF8,sF6),sK4) ),
introduced(definition,[new_symbols(definition,[spl9_98])],[avatar_definition]) ).
fof(f2079,plain,
( member(sK1(sF8,sF6),sK4)
| ~ spl9_98 ),
inference(avatar_component_clause,[],[f2077]) ).
fof(f2081,plain,
spl9_98,
inference(avatar_split_clause,[],[f1022,f2077]) ).
fof(f2147,plain,
spl9_97,
inference(avatar_split_clause,[],[f901,f2073]) ).
fof(f2372,plain,
( member(sK1(sF8,sF6),sF8)
| ~ member(sK1(sF8,sF6),sK2)
| ~ spl9_95 ),
inference(resolution,[],[f2065,f76]) ).
fof(f2373,plain,
( member(sK1(sF8,sF6),sK3)
| ~ spl9_95 ),
inference(resolution,[],[f2065,f61]) ).
fof(f2377,plain,
( member(sK1(sF8,sF6),sF8)
| ~ spl9_95
| ~ spl9_97 ),
inference(forward_subsumption_resolution,[],[f2372,f2075]) ).
fof(f2597,plain,
( ~ member(sK1(sF8,sF6),sK3)
| member(sK1(sF8,sF6),sF7)
| ~ spl9_98 ),
inference(resolution,[],[f2079,f74]) ).
fof(f2708,plain,
( ~ member(sK1(sF8,sF6),sK2)
| member(sK1(sF8,sF6),sF5)
| ~ spl9_95 ),
inference(resolution,[],[f2373,f73]) ).
fof(f2711,plain,
( member(sK1(sF8,sF6),sF5)
| ~ spl9_95
| ~ spl9_97 ),
inference(forward_subsumption_resolution,[],[f2708,f2075]) ).
fof(f2712,plain,
( spl9_96
| ~ spl9_95
| ~ spl9_97 ),
inference(avatar_split_clause,[],[f2711,f2073,f2063,f2067]) ).
fof(f2743,plain,
( ~ member(sK1(sF8,sF6),sF8)
| ~ member(sK1(sF8,sF6),sK4)
| sF6 = sF8
| ~ spl9_96 ),
inference(resolution,[],[f2069,f445]) ).
fof(f2746,plain,
( member(sK1(sF8,sF6),sK3)
| ~ spl9_96 ),
inference(resolution,[],[f2069,f54]) ).
fof(f2750,plain,
( ~ member(sK1(sF8,sF6),sK4)
| sF6 = sF8
| ~ spl9_95
| ~ spl9_96
| ~ spl9_97 ),
inference(forward_subsumption_resolution,[],[f2743,f2377]) ).
fof(f2751,plain,
( sF6 = sF8
| ~ spl9_95
| ~ spl9_96
| ~ spl9_97
| ~ spl9_98 ),
inference(forward_subsumption_resolution,[],[f2750,f2079]) ).
fof(f2752,plain,
( $false
| ~ spl9_95
| ~ spl9_96
| ~ spl9_97
| ~ spl9_98 ),
inference(forward_subsumption_resolution,[],[f2751,f50]) ).
fof(f2753,plain,
( ~ spl9_95
| ~ spl9_96
| ~ spl9_97
| ~ spl9_98 ),
inference(avatar_contradiction_clause,[],[f2752]) ).
fof(f2754,plain,
( ~ member(sK1(sF8,sF6),sK3)
| spl9_95
| ~ spl9_98 ),
inference(forward_subsumption_resolution,[],[f2597,f2064]) ).
fof(f2756,plain,
( $false
| spl9_95
| ~ spl9_96
| ~ spl9_98 ),
inference(forward_subsumption_resolution,[],[f2754,f2746]) ).
fof(f2757,plain,
( spl9_95
| ~ spl9_96
| ~ spl9_98 ),
inference(avatar_contradiction_clause,[],[f2756]) ).
cnf(s84,plain,
( spl9_95
| spl9_96 ),
inference(sat_conversion,[],[f2070]) ).
cnf(s86,plain,
spl9_98,
inference(sat_conversion,[],[f2081]) ).
cnf(s100,plain,
spl9_97,
inference(sat_conversion,[],[f2147]) ).
cnf(s136,plain,
( ~ spl9_95
| spl9_96
| ~ spl9_97 ),
inference(sat_conversion,[],[f2712]) ).
cnf(s137,plain,
( ~ spl9_95
| ~ spl9_96
| ~ spl9_97
| ~ spl9_98 ),
inference(sat_conversion,[],[f2753]) ).
cnf(s138,plain,
( spl9_95
| ~ spl9_96
| ~ spl9_98 ),
inference(sat_conversion,[],[f2757]) ).
cnf(s139,plain,
spl9_95,
inference(rat,[],[s84,s138,s86]) ).
cnf(s140,plain,
~ spl9_96,
inference(rat,[],[s137,s86,s100,s139]) ).
cnf(s141,plain,
$false,
inference(rat,[],[s136,s100,s140,s139]) ).
fof(f2759,plain,
$false,
inference(avatar_sat_refutation,[],[s141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET143+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/0.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 00:53:37 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.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
% 1.83/0.78 % (4042170)Will run a generic schedule for satisfiability detection.
% 1.83/0.78 % (4042181)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4121024768:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.83/0.78 % (4042176)% WARNING: option uhcvi not known.
% 1.83/0.78 % (4042179)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3705871212:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.83/0.78 % (4042175)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2900555939_2999 on theBenchmark for (2999ds/0Mi)
% 1.83/0.78 % (4042176)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3085030991:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.83/0.78 % (4042178)dis+10_1_sil=32000:sp=arity:random_seed=4277378491:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.83/0.78 % (4042177)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4290805813:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.83/0.78 % (4042180)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1330514978:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.83/0.78 % TRYING [1]
% 1.83/0.78 % TRYING [2]
% 1.83/0.78 % TRYING [3]
% 1.83/0.78 % TRYING [4]
% 1.83/0.78 % (4042181)Instruction limit reached!
% 1.83/0.78 % (4042181)------------------------------
% 1.83/0.78 % (4042181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042181)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042181)Termination reason: Instruction limit
% 1.83/0.78 % (4042181)Termination phase: Saturation
% 1.83/0.78 % (4042181)Time elapsed: 0.050 s
% 1.83/0.78 % (4042181)Peak memory usage: 12 MB
% 1.83/0.78 % (4042181)Instructions burned: 162 (million)
% 1.83/0.78 % (4042189)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1418806714:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.83/0.78 % TRYING [1]
% 1.83/0.78 % TRYING [2]
% 1.83/0.78 % TRYING [3]
% 1.83/0.78 % TRYING [4]
% 1.83/0.78 % (4042178)Instruction limit reached!
% 1.83/0.78 % (4042178)------------------------------
% 1.83/0.78 % (4042178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042178)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042178)Termination reason: Instruction limit
% 1.83/0.78 % (4042178)Termination phase: Saturation
% 1.83/0.78 % (4042178)Time elapsed: 0.060 s
% 1.83/0.78 % (4042178)Peak memory usage: 12 MB
% 1.83/0.78 % (4042178)Instructions burned: 105 (million)
% 1.83/0.78 % TRYING [5]
% 1.83/0.78 % (4042179)Instruction limit reached!
% 1.83/0.78 % (4042179)------------------------------
% 1.83/0.78 % (4042179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042179)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042179)Termination reason: Instruction limit
% 1.83/0.78 % (4042179)Termination phase: Saturation
% 1.83/0.78 % (4042179)Time elapsed: 0.064 s
% 1.83/0.78 % (4042179)Peak memory usage: 12 MB
% 1.83/0.78 % (4042179)Instructions burned: 117 (million)
% 1.83/0.78 % (4042180)Instruction limit reached!
% 1.83/0.78 % (4042180)------------------------------
% 1.83/0.78 % (4042180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042180)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042180)Termination reason: Instruction limit
% 1.83/0.78 % (4042180)Termination phase: Saturation
% 1.83/0.78 % (4042180)Time elapsed: 0.075 s
% 1.83/0.78 % (4042180)Peak memory usage: 12 MB
% 1.83/0.78 % (4042180)Instructions burned: 131 (million)
% 1.83/0.78 % (4042191)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2063329960:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.83/0.78 % (4042192)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=940904914:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.83/0.78 % TRYING [5]
% 1.83/0.78 % (4042194)ott-21_1_sil=16000:fs=off:random_seed=4125589570:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.83/0.78 % (4042191)Instruction limit reached!
% 1.83/0.78 % (4042191)------------------------------
% 1.83/0.78 % (4042191)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042191)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042191)Termination reason: Instruction limit
% 1.83/0.78 % (4042191)Termination phase: Saturation
% 1.83/0.78 % (4042191)Time elapsed: 0.074 s
% 1.83/0.78 % (4042191)Peak memory usage: 12 MB
% 1.83/0.78 % (4042191)Instructions burned: 132 (million)
% 1.83/0.78 % (4042197)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1600628569:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.83/0.78 % (4042194)Instruction limit reached!
% 1.83/0.78 % (4042194)------------------------------
% 1.83/0.78 % (4042194)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042194)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042194)Termination reason: Instruction limit
% 1.83/0.78 % (4042194)Termination phase: Saturation
% 1.83/0.78 % (4042194)Time elapsed: 0.086 s
% 1.83/0.78 % (4042194)Peak memory usage: 13 MB
% 1.83/0.78 % (4042194)Instructions burned: 180 (million)
% 1.83/0.78 % (4042199)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4197590669:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.83/0.78 % TRYING [1]
% 1.83/0.78 % TRYING [2]
% 1.83/0.78 % TRYING [3]
% 1.83/0.78 % TRYING [4]
% 1.83/0.78 % TRYING [5]
% 1.83/0.78 % (4042189)Instruction limit reached!
% 1.83/0.78 % (4042189)------------------------------
% 1.83/0.78 % (4042189)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042189)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042189)Termination reason: Instruction limit
% 1.83/0.78 % (4042189)Termination phase: Finite model building SAT solving
% 1.83/0.78 % (4042189)Time elapsed: 0.220 s
% 1.83/0.78 % (4042189)Peak memory usage: 13 MB
% 1.83/0.78 % (4042189)Instructions burned: 715 (million)
% 1.83/0.78 % (4042201)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1403955740:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 1.83/0.78 % (4042201) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4042170-4042201"...
% 1.83/0.78 % (4042201)...printing done.
% 1.83/0.78 % (4042201)Refutation found. Thanks to Tanya!
% 1.83/0.78 % SZS status Theorem for theBenchmark
% 1.83/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 1.83/0.78 % (4042201)------------------------------
% 1.83/0.78 % (4042201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.78 % (4042201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.78 % (4042201)CaDiCaL version: 2.1.3
% 1.83/0.78 % (4042201)Termination reason: Refutation
% 1.83/0.78 % (4042201)Time elapsed: 0.035 s
% 1.83/0.78 % (4042201)Peak memory usage: 13 MB
% 1.83/0.78 % (4042201)Instructions burned: 109 (million)
% 1.83/0.78 % (4042170)Success in time 0.357 s
% 1.83/0.78 % Vampire exiting
%------------------------------------------------------------------------------