%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ALG074+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 09:21:14 AM UTC 2026
% Result : Theorem 0.18s 0.27s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 95 ( 23 unt; 7 def)
% Number of atoms : 276 ( 73 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 309 ( 128 ~; 117 |; 35 &)
% ( 7 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 71 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> sorti1(op1(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
fof(f2,axiom,
! [X0] :
( sorti2(X0)
=> ! [X1] :
( sorti2(X1)
=> sorti2(op2(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
fof(f3,axiom,
? [X0] :
( sorti1(X0)
& ? [X1] :
( sorti1(X1)
& op1(X1,X0) != op1(X0,X1)
& op1(op1(X0,X1),X1) = X0
& op1(op1(X0,X1),X0) != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ? [X0] :
( sorti2(X0)
& ? [X1] :
( sorti2(X1)
& op2(X1,X0) != op2(X0,X1)
& op2(op2(X0,X1),X1) = X0
& op2(op2(X0,X1),X0) != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f5,conjecture,
( ( ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) )
& ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f6,negated_conjecture,
~ ( ( ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) )
& ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0] :
( ! [X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0] :
( ! [X1] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1) )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0] :
( ~ sorti2(X0)
| ! [X1] :
( ~ sorti2(X1)
| op2(X0,X1) = op2(X1,X0)
| op2(op2(X0,X1),X1) != X0
| op2(op2(X0,X1),X0) = X1 ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f10,plain,
( ! [X2] :
( ! [X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) )
| ~ sorti1(X2) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( h(j(X6)) = X6
| ~ sorti2(X6) )
& ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
( ! [X2] :
( ! [X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) )
| ~ sorti1(X2) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( h(j(X6)) = X6
| ~ sorti2(X6) )
& ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) ) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
( sorti1(sK0)
& sorti1(sK1)
& op1(sK0,sK1) != op1(sK1,sK0)
& sK0 = op1(op1(sK0,sK1),sK1)
& sK1 != op1(op1(sK0,sK1),sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f3]) ).
fof(f13,plain,
( ! [X0] :
( ! [X1] :
( h(op1(X0,X1)) = op2(h(X0),h(X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) )
& ! [X2] :
( ! [X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3) )
| ~ sorti2(X2) )
& ! [X4] :
( h(j(X4)) = X4
| ~ sorti2(X4) )
& ! [X5] :
( j(h(X5)) = X5
| ~ sorti1(X5) )
& ! [X6] :
( sorti2(h(X6))
| ~ sorti1(X6) )
& ! [X7] :
( sorti1(j(X7))
| ~ sorti2(X7) ) ),
inference(rectify,[],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X0,X1] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
sK1 != op1(op1(sK0,sK1),sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
sK0 = op1(op1(sK0,sK1),sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
op1(sK0,sK1) != op1(sK1,sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
! [X0,X1] :
( op2(op2(X0,X1),X1) != X0
| ~ sorti2(X1)
| op2(X0,X1) = op2(X1,X0)
| ~ sorti2(X0)
| op2(op2(X0,X1),X0) = X1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f22,plain,
! [X7] :
( sorti1(j(X7))
| ~ sorti2(X7) ),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
! [X6] :
( sorti2(h(X6))
| ~ sorti1(X6) ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
! [X5] :
( ~ sorti1(X5)
| j(h(X5)) = X5 ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X2,X3] :
( ~ sorti2(X3)
| j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0,X1] :
( ~ sorti1(X1)
| h(op1(X0,X1)) = op2(h(X0),h(X1))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f36,plain,
! [X0] :
( ~ sorti1(X0)
| h(op1(X0,sK1)) = op2(h(X0),h(sK1)) ),
inference(resolution,[],[f19,f27]) ).
fof(f38,plain,
sK1 = j(h(sK1)),
inference(resolution,[],[f19,f24]) ).
fof(f41,plain,
! [X0] :
( ~ sorti1(X0)
| h(op1(X0,sK0)) = op2(h(X0),h(sK0)) ),
inference(resolution,[],[f20,f27]) ).
fof(f43,plain,
sK0 = j(h(sK0)),
inference(resolution,[],[f20,f24]) ).
fof(f49,plain,
! [X0,X1] :
( ~ sorti1(X1)
| ~ sorti1(X0)
| op1(X1,X0) = j(h(op1(X1,X0))) ),
inference(resolution,[],[f14,f24]) ).
fof(f59,plain,
h(op1(sK0,sK1)) = op2(h(sK0),h(sK1)),
inference(resolution,[],[f36,f20]) ).
fof(f64,plain,
h(op1(sK1,sK0)) = op2(h(sK1),h(sK0)),
inference(resolution,[],[f41,f19]) ).
fof(f65,plain,
( h(sK0) != op2(h(op1(sK0,sK1)),h(sK1))
| ~ sorti2(h(sK1))
| h(op1(sK0,sK1)) = op2(h(sK1),h(sK0))
| ~ sorti2(h(sK0))
| h(sK1) = op2(h(op1(sK0,sK1)),h(sK0)) ),
inference(superposition,[],[f21,f59]) ).
fof(f66,plain,
( sorti2(h(op1(sK0,sK1)))
| ~ sorti2(h(sK1))
| ~ sorti2(h(sK0)) ),
inference(superposition,[],[f15,f59]) ).
fof(f68,definition,
( spl2_1
<=> sorti2(h(sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f69,plain,
( sorti2(h(sK0))
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f70,plain,
( ~ sorti2(h(sK0))
| spl2_1 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f72,definition,
( spl2_2
<=> sorti2(h(sK1)) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f74,plain,
( ~ sorti2(h(sK1))
| spl2_2 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f76,definition,
( spl2_3
<=> sorti2(h(op1(sK0,sK1))) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f78,plain,
( sorti2(h(op1(sK0,sK1)))
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f79,plain,
( ~ spl2_1
| ~ spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f66,f76,f72,f68]) ).
fof(f81,definition,
( spl2_4
<=> h(sK1) = op2(h(op1(sK0,sK1)),h(sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f83,plain,
( h(sK1) = op2(h(op1(sK0,sK1)),h(sK0))
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f85,definition,
( spl2_5
<=> h(op1(sK0,sK1)) = op2(h(sK1),h(sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f87,plain,
( h(op1(sK0,sK1)) = op2(h(sK1),h(sK0))
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f89,definition,
( spl2_6
<=> h(sK0) = op2(h(op1(sK0,sK1)),h(sK1)) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f92,plain,
( spl2_4
| ~ spl2_1
| spl2_5
| ~ spl2_2
| ~ spl2_6 ),
inference(avatar_split_clause,[],[f65,f89,f72,f85,f68,f81]) ).
fof(f95,plain,
! [X0] :
( ~ sorti1(X0)
| op1(sK0,X0) = j(h(op1(sK0,X0))) ),
inference(resolution,[],[f49,f20]) ).
fof(f96,plain,
! [X0] :
( ~ sorti1(X0)
| op1(sK1,X0) = j(h(op1(sK1,X0))) ),
inference(resolution,[],[f49,f19]) ).
fof(f97,plain,
( ~ sorti1(sK0)
| spl2_1 ),
inference(resolution,[],[f70,f23]) ).
fof(f98,plain,
( $false
| spl2_1 ),
inference(forward_subsumption_resolution,[],[f97,f20]) ).
fof(f99,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f98]) ).
fof(f104,plain,
( ! [X0] :
( j(op2(X0,h(sK0))) = op1(j(X0),j(h(sK0)))
| ~ sorti2(X0) )
| ~ spl2_1 ),
inference(resolution,[],[f69,f26]) ).
fof(f108,plain,
( ! [X0] :
( ~ sorti2(X0)
| op1(j(X0),sK0) = j(op2(X0,h(sK0))) )
| ~ spl2_1 ),
inference(forward_demodulation,[],[f104,f43]) ).
fof(f114,plain,
( ~ sorti1(sK1)
| spl2_2 ),
inference(resolution,[],[f74,f23]) ).
fof(f115,plain,
( $false
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f114,f19]) ).
fof(f116,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f181,definition,
( spl2_9
<=> h(op1(sK0,sK1)) = h(op1(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_9])],[avatar_definition]) ).
fof(f183,plain,
( h(op1(sK0,sK1)) = h(op1(sK1,sK0))
| ~ spl2_9 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f196,plain,
op1(sK0,sK1) = j(h(op1(sK0,sK1))),
inference(resolution,[],[f95,f19]) ).
fof(f207,plain,
op1(sK1,sK0) = j(h(op1(sK1,sK0))),
inference(resolution,[],[f96,f20]) ).
fof(f244,plain,
( sorti1(op1(sK0,sK1))
| ~ sorti2(h(op1(sK0,sK1))) ),
inference(superposition,[],[f22,f196]) ).
fof(f245,plain,
( sorti1(op1(sK0,sK1))
| ~ spl2_3 ),
inference(forward_subsumption_resolution,[],[f244,f78]) ).
fof(f255,plain,
( op2(h(op1(sK0,sK1)),h(sK1)) = h(op1(op1(sK0,sK1),sK1))
| ~ spl2_3 ),
inference(resolution,[],[f245,f36]) ).
fof(f262,plain,
( h(sK0) = op2(h(op1(sK0,sK1)),h(sK1))
| ~ spl2_3 ),
inference(forward_demodulation,[],[f255,f17]) ).
fof(f264,plain,
( spl2_6
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f262,f76,f89]) ).
fof(f339,plain,
( h(op1(sK0,sK1)) = h(op1(sK1,sK0))
| ~ spl2_5 ),
inference(superposition,[],[f64,f87]) ).
fof(f342,plain,
( spl2_9
| ~ spl2_5 ),
inference(avatar_split_clause,[],[f339,f85,f181]) ).
fof(f357,plain,
( op1(sK1,sK0) = j(h(op1(sK0,sK1)))
| ~ spl2_9 ),
inference(superposition,[],[f207,f183]) ).
fof(f360,plain,
( op1(sK0,sK1) = op1(sK1,sK0)
| ~ spl2_9 ),
inference(forward_demodulation,[],[f357,f196]) ).
fof(f361,plain,
( $false
| ~ spl2_9 ),
inference(forward_subsumption_resolution,[],[f360,f18]) ).
fof(f362,plain,
~ spl2_9,
inference(avatar_contradiction_clause,[],[f361]) ).
fof(f479,plain,
( op1(j(h(op1(sK0,sK1))),sK0) = j(op2(h(op1(sK0,sK1)),h(sK0)))
| ~ spl2_1
| ~ spl2_3 ),
inference(resolution,[],[f108,f78]) ).
fof(f491,plain,
( j(h(sK1)) = op1(j(h(op1(sK0,sK1))),sK0)
| ~ spl2_1
| ~ spl2_3
| ~ spl2_4 ),
inference(forward_demodulation,[],[f479,f83]) ).
fof(f494,plain,
( op1(op1(sK0,sK1),sK0) = j(h(sK1))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_4 ),
inference(forward_demodulation,[],[f491,f196]) ).
fof(f495,plain,
( sK1 = op1(op1(sK0,sK1),sK0)
| ~ spl2_1
| ~ spl2_3
| ~ spl2_4 ),
inference(forward_demodulation,[],[f494,f38]) ).
fof(f496,plain,
( $false
| ~ spl2_1
| ~ spl2_3
| ~ spl2_4 ),
inference(forward_subsumption_resolution,[],[f495,f16]) ).
fof(f497,plain,
( ~ spl2_1
| ~ spl2_3
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f496]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f79]) ).
cnf(s2,plain,
( ~ spl2_1
| ~ spl2_2
| spl2_4
| spl2_5
| ~ spl2_6 ),
inference(sat_conversion,[],[f92]) ).
cnf(s3,plain,
spl2_1,
inference(sat_conversion,[],[f99]) ).
cnf(s4,plain,
spl2_2,
inference(sat_conversion,[],[f116]) ).
cnf(s6,plain,
( ~ spl2_3
| spl2_6 ),
inference(sat_conversion,[],[f264]) ).
cnf(s7,plain,
( ~ spl2_5
| spl2_9 ),
inference(sat_conversion,[],[f342]) ).
cnf(s9,plain,
~ spl2_9,
inference(sat_conversion,[],[f362]) ).
cnf(s12,plain,
( ~ spl2_1
| ~ spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f497]) ).
cnf(s13,plain,
~ spl2_5,
inference(rat,[],[s7,s9]) ).
cnf(s15,plain,
( spl2_4
| ~ spl2_6 ),
inference(rat,[],[s2,s13,s4,s3]) ).
cnf(s16,plain,
spl2_3,
inference(rat,[],[s1,s4,s3]) ).
cnf(s17,plain,
~ spl2_4,
inference(rat,[],[s12,s3,s16]) ).
cnf(s18,plain,
spl2_6,
inference(rat,[],[s6,s16]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s15,s18,s17]) ).
fof(f498,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG074+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n009.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 19:25:00 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 0.18/0.27 % (3369852)Will run a generic schedule for satisfiability detection.
% 0.18/0.27 % (3369860)dis+10_1_sil=32000:sp=arity:random_seed=3033310945:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.27 % (3369858)% WARNING: option uhcvi not known.
% 0.18/0.27 % (3369857)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=159328934_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.27 % (3369858)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1463838717:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.27 % (3369860) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3369852-3369860"...
% 0.18/0.27 % (3369859)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=271307687:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.27 % (3369861)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4167465874:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.27 % (3369862)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2569554249:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.27 % (3369863)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=55446503:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27 % (3369860)...printing done.
% 0.18/0.27 % TRYING [1]
% 0.18/0.27 % TRYING [2]
% 0.18/0.27 % (3369860)Refutation found. Thanks to Tanya!
% 0.18/0.27 % SZS status Theorem for theBenchmark
% 0.18/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27 % (3369860)------------------------------
% 0.18/0.27 % (3369860)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (3369860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (3369860)CaDiCaL version: 2.1.3
% 0.18/0.27 % (3369860)Termination reason: Refutation
% 0.18/0.27 % (3369860)Time elapsed: 0.008 s
% 0.18/0.27 % (3369860)Peak memory usage: 12 MB
% 0.18/0.27 % (3369860)Instructions burned: 24 (million)
% 0.18/0.27 % (3369852)Success in time 0.043 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------