%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP092-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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 10:16:38 AM UTC 2026
% Result : Unsatisfiable 1.05s 0.59s
% Output : Refutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 87 ( 62 unt; 4 def)
% Number of atoms : 120 ( 77 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 62 ( 29 ~; 29 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 110 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(X0,X1),divide(divide(X0,X2),X1)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
fof(f6,plain,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| a2 != multiply(multiply(inverse(b2),b2),a2)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(reorient_equations,[],[f5]) ).
fof(f8,definition,
( spl0_1
<=> multiply(a4,b4) = multiply(b4,a4) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f10,plain,
( multiply(a4,b4) != multiply(b4,a4)
| spl0_1 ),
inference(avatar_component_clause,[],[f8]) ).
fof(f12,definition,
( spl0_2
<=> multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f14,plain,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| spl0_2 ),
inference(avatar_component_clause,[],[f12]) ).
fof(f16,definition,
( spl0_3
<=> a2 = multiply(multiply(inverse(b2),b2),a2) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f18,plain,
( a2 != multiply(multiply(inverse(b2),b2),a2)
| spl0_3 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f20,definition,
( spl0_4
<=> multiply(inverse(a1),a1) = multiply(inverse(b1),b1) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f22,plain,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| spl0_4 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f23,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f6,f20,f16,f12,f8]) ).
fof(f24,plain,
! [X0] : inverse(X0) = divide(identity,X0),
inference(forward_demodulation,[],[f3,f4]) ).
fof(f25,plain,
identity = inverse(identity),
inference(superposition,[],[f24,f4]) ).
fof(f27,plain,
! [X0,X1] : divide(identity,divide(divide(X0,X1),X0)) = X1,
inference(superposition,[],[f1,f4]) ).
fof(f30,plain,
! [X0,X1] : divide(divide(X0,X1),divide(identity,X1)) = X0,
inference(superposition,[],[f1,f4]) ).
fof(f31,plain,
! [X0,X1] : divide(divide(identity,X1),divide(inverse(X0),X1)) = X0,
inference(superposition,[],[f1,f24]) ).
fof(f34,plain,
! [X2,X0,X1] : divide(divide(X1,divide(divide(X1,X0),X2)),X0) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f35,plain,
! [X0,X1] : divide(inverse(X1),divide(inverse(X0),X1)) = X0,
inference(forward_demodulation,[],[f31,f24]) ).
fof(f36,plain,
! [X0,X1] : divide(divide(X0,X1),inverse(X1)) = X0,
inference(forward_demodulation,[],[f30,f24]) ).
fof(f38,plain,
! [X0,X1] : inverse(divide(divide(X0,X1),X0)) = X1,
inference(forward_demodulation,[],[f27,f24]) ).
fof(f39,plain,
! [X0] : divide(identity,inverse(X0)) = X0,
inference(superposition,[],[f36,f4]) ).
fof(f43,plain,
! [X0] : divide(divide(X0,identity),identity) = X0,
inference(superposition,[],[f36,f25]) ).
fof(f46,plain,
! [X0,X1] : divide(divide(X0,inverse(X1)),X0) = X1,
inference(superposition,[],[f1,f36]) ).
fof(f47,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f39,f24]) ).
fof(f55,plain,
! [X0] : identity = divide(divide(X0,identity),X0),
inference(superposition,[],[f1,f43]) ).
fof(f63,plain,
! [X0,X1] : divide(divide(divide(X0,identity),X1),divide(identity,X1)) = X0,
inference(superposition,[],[f1,f55]) ).
fof(f69,plain,
! [X0,X1] : divide(divide(divide(X0,identity),X1),inverse(X1)) = X0,
inference(forward_demodulation,[],[f63,f24]) ).
fof(f73,plain,
! [X0] : divide(X0,identity) = X0,
inference(forward_demodulation,[],[f69,f36]) ).
fof(f87,plain,
! [X0,X1] : divide(divide(X0,identity),divide(X0,X1)) = X1,
inference(superposition,[],[f1,f73]) ).
fof(f88,plain,
! [X0,X1] : divide(X0,divide(X0,X1)) = X1,
inference(forward_demodulation,[],[f87,f73]) ).
fof(f112,plain,
! [X0,X1] : divide(X1,X0) = inverse(divide(X0,X1)),
inference(superposition,[],[f38,f88]) ).
fof(f120,plain,
! [X0,X1] : inverse(X0) = divide(divide(X1,X0),X1),
inference(superposition,[],[f47,f38]) ).
fof(f141,plain,
! [X0,X1] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[],[f36,f46]) ).
fof(f295,plain,
! [X0,X1] : inverse(X1) = divide(X0,inverse(divide(inverse(X0),X1))),
inference(superposition,[],[f36,f35]) ).
fof(f303,plain,
! [X0,X1] : inverse(X1) = divide(X0,divide(X1,inverse(X0))),
inference(forward_demodulation,[],[f295,f112]) ).
fof(f708,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
inference(forward_demodulation,[],[f2,f4]) ).
fof(f709,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[],[f708,f24]) ).
fof(f712,plain,
! [X2,X0,X1] : divide(X1,X0) = multiply(X1,divide(divide(X2,X0),X2)),
inference(superposition,[],[f709,f38]) ).
fof(f714,plain,
! [X0,X1] : multiply(divide(X0,X1),X1) = X0,
inference(superposition,[],[f709,f36]) ).
fof(f719,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(superposition,[],[f709,f4]) ).
fof(f732,plain,
! [X0,X1] : divide(multiply(X0,X1),X0) = X1,
inference(superposition,[],[f46,f709]) ).
fof(f775,plain,
! [X0,X1] : divide(X1,X0) = multiply(X1,inverse(X0)),
inference(forward_demodulation,[],[f712,f120]) ).
fof(f780,plain,
! [X0,X1] : identity = multiply(X0,divide(divide(X1,X0),X1)),
inference(superposition,[],[f719,f38]) ).
fof(f784,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(forward_demodulation,[],[f780,f120]) ).
fof(f839,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f714,f732]) ).
fof(f892,plain,
! [X0,X1] : multiply(X1,divide(X0,X1)) = X0,
inference(superposition,[],[f839,f714]) ).
fof(f905,plain,
( multiply(a4,b4) != multiply(a4,b4)
| spl0_1 ),
inference(superposition,[],[f10,f839]) ).
fof(f915,plain,
( $false
| spl0_1 ),
inference(trivial_inequality_removal,[],[f905]) ).
fof(f916,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f915]) ).
fof(f917,plain,
( multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3))
| spl0_2 ),
inference(forward_demodulation,[],[f14,f839]) ).
fof(f1296,plain,
! [X2,X0,X1] : divide(divide(divide(X0,X1),divide(X0,X2)),inverse(X1)) = X2,
inference(superposition,[],[f34,f36]) ).
fof(f1351,plain,
! [X2,X0,X1] : multiply(divide(X1,divide(divide(X1,inverse(X2)),X0)),X2) = X0,
inference(superposition,[],[f709,f34]) ).
fof(f1360,plain,
! [X2,X0,X1] : multiply(X2,divide(X1,divide(divide(X1,inverse(X2)),X0))) = X0,
inference(forward_demodulation,[],[f1351,f839]) ).
fof(f1400,plain,
! [X2,X0,X1] : divide(X1,inverse(divide(divide(X0,X1),divide(X0,X2)))) = X2,
inference(forward_demodulation,[],[f1296,f141]) ).
fof(f1410,plain,
! [X2,X0,X1] : multiply(X2,divide(X1,divide(multiply(X1,X2),X0))) = X0,
inference(forward_demodulation,[],[f1360,f709]) ).
fof(f1429,plain,
! [X2,X0,X1] : multiply(X1,divide(divide(X0,X1),divide(X0,X2))) = X2,
inference(forward_demodulation,[],[f1400,f709]) ).
fof(f2658,plain,
! [X2,X0,X1] : divide(X0,inverse(multiply(X2,X1))) = multiply(X1,divide(X2,inverse(X0))),
inference(superposition,[],[f1410,f303]) ).
fof(f2713,plain,
! [X2,X0,X1] : divide(X0,inverse(multiply(X2,X1))) = multiply(X1,multiply(X2,X0)),
inference(forward_demodulation,[],[f2658,f709]) ).
fof(f2729,plain,
! [X2,X0,X1] : multiply(X0,multiply(X2,X1)) = multiply(X1,multiply(X2,X0)),
inference(forward_demodulation,[],[f2713,f709]) ).
fof(f2787,plain,
! [X2,X0,X1] : divide(X0,inverse(X2)) = multiply(X1,divide(divide(X2,X1),inverse(X0))),
inference(superposition,[],[f1429,f303]) ).
fof(f2846,plain,
! [X2,X0,X1] : divide(X0,inverse(X2)) = multiply(X1,multiply(divide(X2,X1),X0)),
inference(forward_demodulation,[],[f2787,f709]) ).
fof(f2878,plain,
! [X2,X0,X1] : multiply(X0,X2) = multiply(X1,multiply(divide(X2,X1),X0)),
inference(forward_demodulation,[],[f2846,f709]) ).
fof(f7243,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = multiply(X1,multiply(X2,X0)),
inference(superposition,[],[f2878,f732]) ).
fof(f17391,plain,
( multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(c3,a3))
| spl0_2 ),
inference(superposition,[],[f917,f7243]) ).
fof(f17509,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f17391,f7243]) ).
fof(f17510,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f17509]) ).
fof(f17974,plain,
( a2 != multiply(a2,multiply(inverse(b2),b2))
| spl0_3 ),
inference(forward_demodulation,[],[f18,f839]) ).
fof(f17975,plain,
( a2 != multiply(b2,multiply(inverse(b2),a2))
| spl0_3 ),
inference(forward_demodulation,[],[f17974,f2729]) ).
fof(f17976,plain,
( a2 != multiply(b2,multiply(a2,inverse(b2)))
| spl0_3 ),
inference(forward_demodulation,[],[f17975,f839]) ).
fof(f17977,plain,
( a2 != multiply(b2,divide(a2,b2))
| spl0_3 ),
inference(forward_demodulation,[],[f17976,f775]) ).
fof(f17978,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f17977,f892]) ).
fof(f17979,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f17978]) ).
fof(f17981,plain,
( multiply(inverse(a1),a1) != multiply(b1,inverse(b1))
| spl0_4 ),
inference(forward_demodulation,[],[f22,f839]) ).
fof(f17983,plain,
( identity != multiply(inverse(a1),a1)
| spl0_4 ),
inference(forward_demodulation,[],[f17981,f784]) ).
fof(f17985,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f17983,f719]) ).
fof(f17986,plain,
spl0_4,
inference(avatar_contradiction_clause,[],[f17985]) ).
cnf(s7,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f23]) ).
cnf(s274,plain,
spl0_1,
inference(sat_conversion,[],[f916]) ).
cnf(s3257,plain,
spl0_2,
inference(sat_conversion,[],[f17510]) ).
cnf(s3374,plain,
spl0_3,
inference(sat_conversion,[],[f17979]) ).
cnf(s3375,plain,
spl0_4,
inference(sat_conversion,[],[f17986]) ).
cnf(s3376,plain,
$false,
inference(rat,[],[s7,s3375,s3374,s3257,s274]) ).
fof(f17988,plain,
$false,
inference(avatar_sat_refutation,[],[s3376]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP092-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n001.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 09:25:00 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 Running first-order model finding
% 0.13/0.40 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.05/0.58 % (3288096)Will run a generic schedule for satisfiability detection.
% 1.05/0.58 % (3288103)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2660748929:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.05/0.58 % (3288102)% WARNING: option uhcvi not known.
% 1.05/0.58 % (3288101)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3695973081_2999 on theBenchmark for (2999ds/0Mi)
% 1.05/0.58 % (3288104)dis+10_1_sil=32000:sp=arity:random_seed=460394903:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.05/0.58 % (3288105)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2029479728:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.05/0.58 % (3288106)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3757390738:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.05/0.58 % (3288107)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3177347273:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.05/0.58 % (3288102)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=140928622:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.05/0.58 % TRYING [1]
% 1.05/0.58 % TRYING [2]
% 1.05/0.58 % TRYING [3]
% 1.05/0.58 % TRYING [4]
% 1.05/0.58 % TRYING [5]
% 1.05/0.58 % (3288104)Instruction limit reached!
% 1.05/0.58 % (3288104)------------------------------
% 1.05/0.58 % (3288104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.05/0.58 % (3288104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.05/0.58 % (3288104)CaDiCaL version: 2.1.3
% 1.05/0.58 % (3288104)Termination reason: Instruction limit
% 1.05/0.58 % (3288104)Termination phase: Saturation
% 1.05/0.58 % (3288104)Time elapsed: 0.061 s
% 1.05/0.58 % (3288104)Peak memory usage: 12 MB
% 1.05/0.58 % (3288104)Instructions burned: 105 (million)
% 1.05/0.58 % (3288105)Instruction limit reached!
% 1.05/0.58 % (3288105)------------------------------
% 1.05/0.58 % (3288105)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.05/0.58 % (3288105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.05/0.58 % (3288105)CaDiCaL version: 2.1.3
% 1.05/0.58 % (3288105)Termination reason: Instruction limit
% 1.05/0.58 % (3288105)Termination phase: Saturation
% 1.05/0.58 % (3288105)Time elapsed: 0.068 s
% 1.05/0.58 % (3288105)Peak memory usage: 12 MB
% 1.05/0.58 % (3288105)Instructions burned: 116 (million)
% 1.05/0.58 % (3288106)Instruction limit reached!
% 1.05/0.58 % (3288106)------------------------------
% 1.05/0.58 % (3288106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.05/0.58 % (3288106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.05/0.58 % (3288106)CaDiCaL version: 2.1.3
% 1.05/0.58 % (3288106)Termination reason: Instruction limit
% 1.05/0.58 % (3288106)Termination phase: Saturation
% 1.05/0.58 % (3288106)Time elapsed: 0.078 s
% 1.05/0.58 % (3288106)Peak memory usage: 12 MB
% 1.05/0.58 % (3288106)Instructions burned: 131 (million)
% 1.05/0.58 % (3288115)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2839144259:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.05/0.58 % TRYING [1]
% 1.05/0.58 % TRYING [2]
% 1.05/0.58 % TRYING [3]
% 1.05/0.58 % (3288116)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1641871640:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.05/0.58 % TRYING [4]
% 1.05/0.58 % (3288117)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=1886190655:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.05/0.58 % (3288107)Instruction limit reached!
% 1.05/0.58 % (3288107)------------------------------
% 1.05/0.58 % (3288107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.05/0.58 % (3288107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.05/0.58 % (3288107)CaDiCaL version: 2.1.3
% 1.05/0.58 % (3288107)Termination reason: Instruction limit
% 1.05/0.58 % (3288107)Termination phase: Saturation
% 1.05/0.58 % (3288107)Time elapsed: 0.099 s
% 1.05/0.58 % (3288107)Peak memory usage: 13 MB
% 1.05/0.58 % (3288107)Instructions burned: 160 (million)
% 1.05/0.58 % TRYING [6]
% 1.05/0.58 % TRYING [5]
% 1.05/0.58 % (3288121)ott-21_1_sil=16000:fs=off:random_seed=2049418481:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.05/0.58 % (3288103) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3288096-3288103"...
% 1.05/0.58 % (3288103)...printing done.
% 1.05/0.58 % (3288103)Refutation found. Thanks to Tanya!
% 1.05/0.59 % SZS status Unsatisfiable for theBenchmark
% 1.05/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.05/0.59 % (3288103)------------------------------
% 1.05/0.59 % (3288103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.05/0.59 % (3288103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.05/0.59 % (3288103)CaDiCaL version: 2.1.3
% 1.05/0.59 % (3288103)Termination reason: Refutation
% 1.05/0.59 % (3288103)Time elapsed: 0.149 s
% 1.05/0.59 % (3288103)Peak memory usage: 17 MB
% 1.05/0.59 % (3288103)Instructions burned: 523 (million)
% 1.05/0.59 % (3288096)Success in time 0.173 s
% 1.05/0.59 % Vampire exiting
%------------------------------------------------------------------------------