%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET795+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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 0.15s 0.49s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 74 ( 13 unt; 3 def)
% Number of atoms : 262 ( 16 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 295 ( 107 ~; 108 |; 49 &)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 146 ( 0 sgn 136 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X1
| X0 = X2 ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET006+3.ax',order) ).
fof(f14,axiom,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',upper_bound) ).
fof(f20,axiom,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
<=> ( member(X0,X1)
& upper_bound(X0,X2,X1)
& ! [X4] :
( ( member(X4,X3)
& upper_bound(X4,X2,X1) )
=> apply(X2,X0,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',least_upper_bound) ).
fof(f22,conjecture,
! [X0,X1,X2,X3] :
( ( order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) )
=> least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV7) ).
fof(f23,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( order(X0,X1)
& member(X2,X1)
& member(X3,X1)
& apply(X0,X2,X3) )
=> least_upper_bound(X3,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)
& upper_bound(X0,X2,X1)
& ! [X4] :
( ( member(X4,X3)
& upper_bound(X4,X2,X1) )
=> apply(X2,X0,X4) ) )
=> least_upper_bound(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
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] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X0,X4)
& member(X4,X3)
& upper_bound(X4,X2,X1) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ upper_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X0,X4)
& member(X4,X3)
& upper_bound(X4,X2,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
? [X0,X1,X2,X3] :
( ~ least_upper_bound(X3,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] :
( ~ least_upper_bound(X3,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(f54,plain,
! [X2,X0,X1] :
( X0 != X2
| 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] :
( ~ member(X3,X1)
| apply(X0,X3,X2)
| ~ upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f66,plain,
! [X2,X0,X1] :
( member(sK3(X0,X1,X2),X1)
| upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ apply(X0,sK3(X0,X1,X2),X2)
| upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( upper_bound(sK4(X0,X1,X2,X3),X2,X1)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f33]) ).
fof(f70,plain,
! [X2,X3,X0,X1] :
( ~ apply(X2,X0,sK4(X0,X1,X2,X3))
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f33]) ).
fof(f71,plain,
apply(sK5,sK7,sK8),
inference(cnf_transformation,[],[f35]) ).
fof(f72,plain,
member(sK8,sK6),
inference(cnf_transformation,[],[f35]) ).
fof(f74,plain,
order(sK5,sK6),
inference(cnf_transformation,[],[f35]) ).
fof(f75,plain,
~ least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6),
inference(cnf_transformation,[],[f35]) ).
fof(f78,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f54]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ~ apply(X0,X2,X2)
| ~ member(X2,X1)
| ~ order(X0,X1) ),
inference(consistent_polarity_flipping,[],[f62]) ).
fof(f87,plain,
! [X2,X0,X1] :
( apply(X0,sK3(X0,X1,X2),X2)
| ~ upper_bound(X2,X0,X1) ),
inference(consistent_polarity_flipping,[],[f67]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ upper_bound(X2,X0,X1)
| member(sK3(X0,X1,X2),X1) ),
inference(consistent_polarity_flipping,[],[f66]) ).
fof(f89,plain,
! [X2,X3,X0,X1] :
( ~ apply(X0,X3,X2)
| ~ member(X3,X1)
| upper_bound(X2,X0,X1) ),
inference(consistent_polarity_flipping,[],[f65]) ).
fof(f90,plain,
! [X2,X3,X0,X1] :
( apply(X2,X0,sK4(X0,X1,X2,X3))
| upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| ~ least_upper_bound(X0,X1,X2,X3) ),
inference(consistent_polarity_flipping,[],[f70]) ).
fof(f92,plain,
! [X2,X3,X0,X1] :
( ~ upper_bound(sK4(X0,X1,X2,X3),X2,X1)
| upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| ~ least_upper_bound(X0,X1,X2,X3) ),
inference(consistent_polarity_flipping,[],[f68]) ).
fof(f93,plain,
least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6),
inference(consistent_polarity_flipping,[],[f75]) ).
fof(f94,plain,
~ apply(sK5,sK7,sK8),
inference(consistent_polarity_flipping,[],[f71]) ).
fof(f157,definition,
( spl9_2
<=> upper_bound(sK8,sK5,unordered_pair(sK7,sK8)) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f158,plain,
( ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| spl9_2 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f159,plain,
( upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f161,plain,
( member(sK3(sK5,unordered_pair(sK7,sK8),sK8),unordered_pair(sK7,sK8))
| ~ spl9_2 ),
inference(resolution,[],[f159,f88]) ).
fof(f163,plain,
! [X2,X3,X0,X1,X4] :
( ~ least_upper_bound(X0,X2,X1,X3)
| ~ member(X0,X2)
| upper_bound(X0,X1,X2)
| ~ member(X0,X4)
| upper_bound(sK4(X0,X2,X1,X3),X1,X4) ),
inference(resolution,[],[f90,f89]) ).
fof(f211,plain,
( sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| ~ spl9_2 ),
inference(resolution,[],[f161,f53]) ).
fof(f215,definition,
( spl9_3
<=> sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_3])],[avatar_definition]) ).
fof(f217,plain,
( sK8 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f219,definition,
( spl9_4
<=> sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition]) ).
fof(f221,plain,
( sK7 = sK3(sK5,unordered_pair(sK7,sK8),sK8)
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f219]) ).
fof(f222,plain,
( spl9_3
| spl9_4
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f211,f157,f219,f215]) ).
fof(f224,plain,
( apply(sK5,sK8,sK8)
| ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ spl9_3 ),
inference(superposition,[],[f87,f217]) ).
fof(f225,plain,
( apply(sK5,sK8,sK8)
| ~ spl9_2
| ~ spl9_3 ),
inference(forward_subsumption_resolution,[],[f224,f159]) ).
fof(f257,plain,
( ! [X0] :
( ~ order(sK5,X0)
| ~ member(sK8,X0) )
| ~ spl9_2
| ~ spl9_3 ),
inference(resolution,[],[f225,f86]) ).
fof(f291,plain,
( ~ member(sK8,sK6)
| ~ spl9_2
| ~ spl9_3 ),
inference(resolution,[],[f257,f74]) ).
fof(f292,plain,
( $false
| ~ spl9_2
| ~ spl9_3 ),
inference(forward_subsumption_resolution,[],[f291,f72]) ).
fof(f293,plain,
( ~ spl9_2
| ~ spl9_3 ),
inference(avatar_contradiction_clause,[],[f292]) ).
fof(f457,plain,
( apply(sK5,sK7,sK8)
| ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ spl9_4 ),
inference(superposition,[],[f87,f221]) ).
fof(f458,plain,
( ~ upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ spl9_4 ),
inference(forward_subsumption_resolution,[],[f457,f94]) ).
fof(f461,plain,
( ~ spl9_2
| ~ spl9_4 ),
inference(avatar_split_clause,[],[f458,f219,f157]) ).
fof(f864,plain,
! [X0] :
( ~ member(sK8,unordered_pair(sK7,sK8))
| upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ member(sK8,X0)
| upper_bound(sK4(sK8,unordered_pair(sK7,sK8),sK5,sK6),sK5,X0) ),
inference(resolution,[],[f163,f93]) ).
fof(f865,plain,
! [X0] :
( upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ member(sK8,X0)
| upper_bound(sK4(sK8,unordered_pair(sK7,sK8),sK5,sK6),sK5,X0) ),
inference(forward_subsumption_resolution,[],[f864,f78]) ).
fof(f866,plain,
( ! [X0] :
( upper_bound(sK4(sK8,unordered_pair(sK7,sK8),sK5,sK6),sK5,X0)
| ~ member(sK8,X0) )
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f865,f158]) ).
fof(f1126,plain,
( ~ member(sK8,unordered_pair(sK7,sK8))
| upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ member(sK8,unordered_pair(sK7,sK8))
| ~ least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| spl9_2 ),
inference(resolution,[],[f866,f92]) ).
fof(f1129,plain,
( ~ member(sK8,unordered_pair(sK7,sK8))
| upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| spl9_2 ),
inference(duplicate_literal_removal,[],[f1126]) ).
fof(f1130,plain,
( upper_bound(sK8,sK5,unordered_pair(sK7,sK8))
| ~ least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f1129,f78]) ).
fof(f1131,plain,
( ~ least_upper_bound(sK8,unordered_pair(sK7,sK8),sK5,sK6)
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f1130,f158]) ).
fof(f1132,plain,
( $false
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f1131,f93]) ).
fof(f1133,plain,
spl9_2,
inference(avatar_contradiction_clause,[],[f1132]) ).
cnf(s2,plain,
( ~ spl9_2
| spl9_3
| spl9_4 ),
inference(sat_conversion,[],[f222]) ).
cnf(s3,plain,
( ~ spl9_2
| ~ spl9_3 ),
inference(sat_conversion,[],[f293]) ).
cnf(s5,plain,
( ~ spl9_2
| ~ spl9_4 ),
inference(sat_conversion,[],[f461]) ).
cnf(s22,plain,
spl9_2,
inference(sat_conversion,[],[f1133]) ).
cnf(s23,plain,
~ spl9_4,
inference(rat,[],[s5,s22]) ).
cnf(s24,plain,
~ spl9_3,
inference(rat,[],[s3,s22]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s2,s23,s24,s22]) ).
fof(f1134,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET795+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.38 % Computer : n019.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Mon Sep 28 02:50:19 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41 Running first-order model finding
% 0.09/0.41 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.15/0.49 % (3617090)Will run a generic schedule for satisfiability detection.
% 0.15/0.49 % (3617099)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1488509497:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.49 % (3617096)% WARNING: option uhcvi not known.
% 0.15/0.49 % (3617096)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3940252904:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.49 % (3617095)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3340393729_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.49 % (3617100)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2159925460:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.49 % (3617097)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1965676225:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.49 % (3617098)dis+10_1_sil=32000:sp=arity:random_seed=2109911505:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.49 % (3617101)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=986952231:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.49 % TRYING [1]
% 0.15/0.49 % TRYING [2]
% 0.15/0.49 % TRYING [3]
% 0.15/0.49 % TRYING [4]
% 0.15/0.49 % TRYING [5]
% 0.15/0.49 % (3617099)Instruction limit reached!
% 0.15/0.49 % (3617099)------------------------------
% 0.15/0.49 % (3617099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.49 % (3617099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.49 % (3617099)CaDiCaL version: 2.1.3
% 0.15/0.49 % (3617099)Termination reason: Instruction limit
% 0.15/0.49 % (3617099)Termination phase: Saturation
% 0.15/0.49 % (3617099)Time elapsed: 0.038 s
% 0.15/0.49 % (3617099)Peak memory usage: 13 MB
% 0.15/0.49 % (3617099)Instructions burned: 117 (million)
% 0.15/0.49 % TRYING [6]
% 0.15/0.49 % (3617096) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3617090-3617096"...
% 0.15/0.49 % (3617096)...printing done.
% 0.15/0.49 % (3617096)Refutation found. Thanks to Tanya!
% 0.15/0.49 % SZS status Theorem for theBenchmark
% 0.15/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.49 % (3617096)------------------------------
% 0.15/0.49 % (3617096)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.49 % (3617096)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.49 % (3617096)CaDiCaL version: 2.1.3
% 0.15/0.49 % (3617096)Termination reason: Refutation
% 0.15/0.49 % (3617096)Time elapsed: 0.037 s
% 0.15/0.49 % (3617096)Peak memory usage: 13 MB
% 0.15/0.49 % (3617096)Instructions burned: 55 (million)
% 0.15/0.49 % (3617090)Success in time 0.07 s
% 0.15/0.49 % Vampire exiting
%------------------------------------------------------------------------------