%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET796+4 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:38 PM UTC 2026
% Result : Theorem 1.31s 0.65s
% Output : Refutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 56 ( 12 unt; 2 def)
% Number of atoms : 210 ( 18 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 230 ( 76 ~; 75 |; 49 &)
% ( 8 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 134 ( 0 sgn 124 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X1
| X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(f12,axiom,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X2,X3] :
( ( member(X2,X1)
& member(X3,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X2) )
=> X2 = X3 ) )
& ! [X2,X3,X4] :
( ( member(X2,X1)
& member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X4) )
=> apply(X0,X2,X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',order) ).
fof(f15,axiom,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',lower_bound) ).
fof(f21,axiom,
! [X0,X1,X2,X3] :
( greatest_lower_bound(X0,X1,X2,X3)
<=> ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X4] :
( ( member(X4,X3)
& lower_bound(X4,X2,X1) )
=> apply(X2,X4,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',greatest_lower_bound) ).
fof(f22,conjecture,
! [X0,X1,X2,X3] :
( ( order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) )
=> greatest_lower_bound(X2,unordered_pair(X2,X3),X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV8) ).
fof(f23,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) )
=> greatest_lower_bound(X2,unordered_pair(X2,X3),X0,X1) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
=> X3 = X4 ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X1)
& member(X7,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X4] :
( ( member(X4,X3)
& lower_bound(X4,X2,X1) )
=> apply(X2,X4,X0) ) )
=> greatest_lower_bound(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f26,plain,
! [X0,X1] :
( order(X0,X1)
=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
=> X3 = X4 ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X1)
& member(X7,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f29,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4] :
( X3 = X4
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3)
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4] :
( X3 = X4
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3)
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( greatest_lower_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X4,X0)
& member(X4,X3)
& lower_bound(X4,X2,X1) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( greatest_lower_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X4,X0)
& member(X4,X3)
& lower_bound(X4,X2,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
? [X0,X1,X2,X3] :
( ~ greatest_lower_bound(X2,unordered_pair(X2,X3),X0,X1)
& order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) ),
inference(ennf_transformation,[],[f23]) ).
fof(f35,plain,
? [X0,X1,X2,X3] :
( ~ greatest_lower_bound(X2,unordered_pair(X2,X3),X0,X1)
& order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) ),
inference(flattening,[],[f34]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f9]) ).
fof(f55,plain,
! [X2,X0,X1] :
( X0 != X1
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ order(X0,X1)
| ~ member(X2,X1)
| apply(X0,X2,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( ~ lower_bound(X2,X0,X1)
| apply(X0,X2,X3)
| ~ member(X3,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f66,plain,
! [X2,X0,X1] :
( member(sK3(X0,X1,X2),X1)
| lower_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ apply(X0,X2,sK3(X0,X1,X2))
| lower_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( lower_bound(sK4(X0,X1,X2,X3),X2,X1)
| ~ lower_bound(X0,X2,X1)
| ~ member(X0,X1)
| greatest_lower_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f33]) ).
fof(f70,plain,
! [X2,X3,X0,X1] :
( ~ apply(X2,sK4(X0,X1,X2,X3),X0)
| ~ lower_bound(X0,X2,X1)
| ~ member(X0,X1)
| greatest_lower_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f33]) ).
fof(f71,plain,
apply(sK5,sK7,sK8),
inference(cnf_transformation,[],[f35]) ).
fof(f73,plain,
member(sK7,sK6),
inference(cnf_transformation,[],[f35]) ).
fof(f74,plain,
order(sK5,sK6),
inference(cnf_transformation,[],[f35]) ).
fof(f75,plain,
~ greatest_lower_bound(sK7,unordered_pair(sK7,sK8),sK5,sK6),
inference(cnf_transformation,[],[f35]) ).
fof(f77,plain,
! [X2,X1] : member(X1,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f55]) ).
fof(f81,plain,
! [X0] :
( apply(sK5,X0,X0)
| ~ member(X0,sK6) ),
inference(resolution,[],[f62,f74]) ).
fof(f896,plain,
! [X2,X3,X0,X1] :
( lower_bound(X0,X1,unordered_pair(X2,X3))
| sK3(X1,unordered_pair(X2,X3),X0) = X2
| sK3(X1,unordered_pair(X2,X3),X0) = X3 ),
inference(resolution,[],[f66,f53]) ).
fof(f2632,plain,
! [X2,X3,X0,X1,X4] :
( apply(X0,sK4(X1,X2,X0,X3),X4)
| ~ member(X4,X2)
| ~ lower_bound(X1,X0,X2)
| ~ member(X1,X2)
| greatest_lower_bound(X1,X2,X0,X3) ),
inference(resolution,[],[f65,f68]) ).
fof(f2640,plain,
! [X2,X3,X0,X1] :
( ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| ~ member(X0,X1)
| greatest_lower_bound(X0,X1,X2,X3)
| ~ lower_bound(X0,X2,X1)
| ~ member(X0,X1)
| greatest_lower_bound(X0,X1,X2,X3) ),
inference(resolution,[],[f2632,f70]) ).
fof(f2644,plain,
! [X2,X3,X0,X1] :
( greatest_lower_bound(X0,X1,X2,X3)
| ~ lower_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(duplicate_literal_removal,[],[f2640]) ).
fof(f2685,plain,
( ~ lower_bound(sK7,sK5,unordered_pair(sK7,sK8))
| ~ member(sK7,unordered_pair(sK7,sK8)) ),
inference(resolution,[],[f2644,f75]) ).
fof(f2688,plain,
~ lower_bound(sK7,sK5,unordered_pair(sK7,sK8)),
inference(forward_subsumption_resolution,[],[f2685,f77]) ).
fof(f2710,plain,
( sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK7)
| sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK7) ),
inference(resolution,[],[f2688,f896]) ).
fof(f2712,definition,
( spl9_39
<=> sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK7) ),
introduced(definition,[new_symbols(definition,[spl9_39])],[avatar_definition]) ).
fof(f2714,plain,
( sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK7)
| ~ spl9_39 ),
inference(avatar_component_clause,[],[f2712]) ).
fof(f2716,definition,
( spl9_40
<=> sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK7) ),
introduced(definition,[new_symbols(definition,[spl9_40])],[avatar_definition]) ).
fof(f2718,plain,
( sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK7)
| ~ spl9_40 ),
inference(avatar_component_clause,[],[f2716]) ).
fof(f2719,plain,
( spl9_39
| spl9_40 ),
inference(avatar_split_clause,[],[f2710,f2716,f2712]) ).
fof(f2768,plain,
( ~ apply(sK5,sK7,sK8)
| lower_bound(sK7,sK5,unordered_pair(sK7,sK8))
| ~ spl9_39 ),
inference(superposition,[],[f67,f2714]) ).
fof(f2770,plain,
( lower_bound(sK7,sK5,unordered_pair(sK7,sK8))
| ~ spl9_39 ),
inference(forward_subsumption_resolution,[],[f2768,f71]) ).
fof(f2771,plain,
( $false
| ~ spl9_39 ),
inference(forward_subsumption_resolution,[],[f2770,f2688]) ).
fof(f2772,plain,
~ spl9_39,
inference(avatar_contradiction_clause,[],[f2771]) ).
fof(f2774,plain,
( ~ apply(sK5,sK7,sK7)
| lower_bound(sK7,sK5,unordered_pair(sK7,sK8))
| ~ spl9_40 ),
inference(superposition,[],[f67,f2718]) ).
fof(f2776,plain,
( ~ apply(sK5,sK7,sK7)
| ~ spl9_40 ),
inference(forward_subsumption_resolution,[],[f2774,f2688]) ).
fof(f2777,plain,
( ~ member(sK7,sK6)
| ~ spl9_40 ),
inference(resolution,[],[f2776,f81]) ).
fof(f2778,plain,
( $false
| ~ spl9_40 ),
inference(forward_subsumption_resolution,[],[f2777,f73]) ).
fof(f2779,plain,
~ spl9_40,
inference(avatar_contradiction_clause,[],[f2778]) ).
cnf(s42,plain,
( spl9_39
| spl9_40 ),
inference(sat_conversion,[],[f2719]) ).
cnf(s43,plain,
~ spl9_39,
inference(sat_conversion,[],[f2772]) ).
cnf(s44,plain,
~ spl9_40,
inference(sat_conversion,[],[f2779]) ).
cnf(s45,plain,
$false,
inference(rat,[],[s42,s44,s43]) ).
fof(f2780,plain,
$false,
inference(avatar_sat_refutation,[],[s45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET796+4 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n002.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % 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 02:52:52 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.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
% 1.31/0.64 % (4108272)Will run a generic schedule for satisfiability detection.
% 1.31/0.64 % (4108282)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2057393931:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.31/0.64 % (4108278)% WARNING: option uhcvi not known.
% 1.31/0.64 % (4108277)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3629930233_2999 on theBenchmark for (2999ds/0Mi)
% 1.31/0.64 % (4108279)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=639416026:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.31/0.64 % (4108278)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3686976551:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.31/0.64 % (4108280)dis+10_1_sil=32000:sp=arity:random_seed=1301865181:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.31/0.64 % (4108281)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2539519759:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.31/0.64 % (4108283)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3822634427:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.31/0.64 % TRYING [1]
% 1.31/0.64 % TRYING [2]
% 1.31/0.64 % TRYING [3]
% 1.31/0.64 % TRYING [4]
% 1.31/0.64 % TRYING [5]
% 1.31/0.64 % TRYING [6]
% 1.31/0.64 % (4108282)Instruction limit reached!
% 1.31/0.64 % (4108282)------------------------------
% 1.31/0.64 % (4108282)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.31/0.64 % (4108282)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.31/0.64 % (4108282)CaDiCaL version: 2.1.3
% 1.31/0.64 % (4108282)Termination reason: Instruction limit
% 1.31/0.64 % (4108282)Termination phase: Saturation
% 1.31/0.64 % (4108282)Time elapsed: 0.044 s
% 1.31/0.64 % (4108282)Peak memory usage: 14 MB
% 1.31/0.64 % (4108282)Instructions burned: 132 (million)
% 1.31/0.64 % (4108291)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2984036100:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.31/0.64 % TRYING [1]
% 1.31/0.64 % TRYING [2]
% 1.31/0.64 % TRYING [3]
% 1.31/0.64 % TRYING [4]
% 1.31/0.64 % (4108280)Instruction limit reached!
% 1.31/0.64 % (4108280)------------------------------
% 1.31/0.64 % (4108280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.31/0.64 % (4108280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.31/0.64 % (4108280)CaDiCaL version: 2.1.3
% 1.31/0.64 % (4108280)Termination reason: Instruction limit
% 1.31/0.64 % (4108280)Termination phase: Saturation
% 1.31/0.64 % (4108280)Time elapsed: 0.063 s
% 1.31/0.64 % (4108280)Peak memory usage: 12 MB
% 1.31/0.64 % (4108280)Instructions burned: 103 (million)
% 1.31/0.64 % TRYING [5]
% 1.31/0.64 % (4108281)Instruction limit reached!
% 1.31/0.64 % (4108281)------------------------------
% 1.31/0.64 % (4108281)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.31/0.64 % (4108281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.31/0.64 % (4108281)CaDiCaL version: 2.1.3
% 1.31/0.64 % (4108281)Termination reason: Instruction limit
% 1.31/0.64 % (4108281)Termination phase: Saturation
% 1.31/0.64 % (4108281)Time elapsed: 0.070 s
% 1.31/0.64 % (4108281)Peak memory usage: 13 MB
% 1.31/0.64 % (4108281)Instructions burned: 117 (million)
% 1.31/0.64 % TRYING [7]
% 1.31/0.64 % (4108293)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1776464646:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.31/0.64 % (4108294)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=2450253499:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.31/0.64 % TRYING [6]
% 1.31/0.64 % (4108283)Instruction limit reached!
% 1.31/0.64 % (4108283)------------------------------
% 1.31/0.64 % (4108283)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.31/0.64 % (4108283)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.31/0.64 % (4108283)CaDiCaL version: 2.1.3
% 1.31/0.64 % (4108283)Termination reason: Instruction limit
% 1.31/0.64 % (4108283)Termination phase: Saturation
% 1.31/0.64 % (4108283)Time elapsed: 0.102 s
% 1.31/0.64 % (4108283)Peak memory usage: 13 MB
% 1.31/0.64 % (4108283)Instructions burned: 159 (million)
% 1.31/0.64 % (4108297)ott-21_1_sil=16000:fs=off:random_seed=3747254633:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.31/0.64 % (4108294) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4108272-4108294"...
% 1.31/0.64 % (4108294)...printing done.
% 1.31/0.65 % (4108293)Instruction limit reached!
% 1.31/0.65 % (4108293)------------------------------
% 1.31/0.65 % (4108293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.31/0.65 % (4108293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.31/0.65 % (4108293)CaDiCaL version: 2.1.3
% 1.31/0.65 % (4108293)Termination reason: Instruction limit
% 1.31/0.65 % (4108293)Termination phase: Saturation
% 1.31/0.65 % (4108293)Time elapsed: 0.087 s
% 1.31/0.65 % (4108293)Peak memory usage: 14 MB
% 1.31/0.65 % (4108293)Instructions burned: 132 (million)
% 1.31/0.65 % (4108294)Refutation found. Thanks to Tanya!
% 1.31/0.65 % SZS status Theorem for theBenchmark
% 1.31/0.65 % SZS output start Proof for theBenchmark
% See solution above
% 1.31/0.65 % (4108294)------------------------------
% 1.31/0.65 % (4108294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.31/0.65 % (4108294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.31/0.65 % (4108294)CaDiCaL version: 2.1.3
% 1.31/0.65 % (4108294)Termination reason: Refutation
% 1.31/0.65 % (4108294)Time elapsed: 0.078 s
% 1.31/0.65 % (4108294)Peak memory usage: 14 MB
% 1.31/0.65 % (4108294)Instructions burned: 120 (million)
% 1.31/0.65 % (4108272)Success in time 0.213 s
% 1.31/0.65 % Vampire exiting
%------------------------------------------------------------------------------