%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL048-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 11:57:30 AM UTC 2026
% Result : Unsatisfiable 2.04s 0.87s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 17 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 84 ( 43 ~; 41 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 129 ( 129 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(b,c))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_19) ).
fof(f6,plain,
! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f1,f3]) ).
fof(f23,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f2,f1]) ).
fof(f24,plain,
~ is_a_theorem(implies(b,implies(a,b))),
inference(resolution,[],[f23,f5]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f23,f1]) ).
fof(f26,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f25,f3]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(implies(X2,X3),implies(X1,X3))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f25,f2]) ).
fof(f28,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(X0,implies(X3,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f25,f23]) ).
fof(f29,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f25,f4]) ).
fof(f31,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f26,f23]) ).
fof(f32,plain,
! [X0] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[],[f26,f3]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X2,implies(not(X1),X3))) ),
inference(resolution,[],[f29,f25]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f29,f1]) ).
fof(f46,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f31,f1]) ).
fof(f53,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f40,f4]) ).
fof(f87,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(not(not(X0)),X1),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f46,f4]) ).
fof(f193,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f39,f3]) ).
fof(f199,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,implies(not(X2),X3))) ),
inference(resolution,[],[f39,f4]) ).
fof(f208,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f193,f26]) ).
fof(f221,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f208,f1]) ).
fof(f222,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(implies(not(X0),X0),X1)) ),
inference(resolution,[],[f208,f26]) ).
fof(f227,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f221,f53]) ).
fof(f233,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f227,f2]) ).
fof(f245,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f233,f26]) ).
fof(f258,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f245,f25]) ).
fof(f273,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f258,f4]) ).
fof(f1061,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(implies(implies(X0,X1),implies(X2,X1))),implies(X2,X0)))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[],[f27,f6]) ).
fof(f2014,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(X0,implies(implies(X4,X2),X3)))
| is_a_theorem(implies(X0,implies(implies(X1,X2),X3)))
| ~ is_a_theorem(implies(X4,X1)) ),
inference(resolution,[],[f28,f23]) ).
fof(f2015,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(X0,implies(implies(implies(X2,X4),implies(X1,X4)),X3)))
| is_a_theorem(implies(X0,implies(implies(X1,X2),X3))) ),
inference(resolution,[],[f28,f2]) ).
fof(f2022,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(not(X1),X3),X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f28,f4]) ).
fof(f7249,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f2022,f2]) ).
fof(f7308,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f2022,f273]) ).
fof(f7656,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X0),X2))),X3))),
inference(resolution,[],[f7249,f199]) ).
fof(f8542,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,implies(not(X0),X2)))),
inference(resolution,[],[f7656,f222]) ).
fof(f9327,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[],[f7308,f32]) ).
fof(f9348,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f7308,f8542]) ).
fof(f10204,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(X0,implies(implies(X1,X2),X2))) ),
inference(resolution,[],[f2014,f9327]) ).
fof(f11022,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f1061,f9348]) ).
fof(f12564,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(implies(not(X1),X1),X1),X2),X2))),
inference(resolution,[],[f10204,f9327]) ).
fof(f13731,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f11022,f1]) ).
fof(f14749,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,implies(not(X2),X2)),implies(X1,X2)))),
inference(resolution,[],[f12564,f2015]) ).
fof(f16178,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1))),
inference(resolution,[],[f14749,f87]) ).
fof(f16312,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f16178,f13731]) ).
fof(f16424,plain,
$false,
inference(resolution,[],[f16312,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL048-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n009.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:19:00 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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
% 2.04/0.87 % (2158192)Will run a generic schedule for satisfiability detection.
% 2.04/0.87 % (2158212)dis+10_1_sil=32000:sp=arity:random_seed=1391752497:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.04/0.87 % (2158210)% WARNING: option uhcvi not known.
% 2.04/0.87 % (2158209)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=990850276_2999 on theBenchmark for (2999ds/0Mi)
% 2.04/0.87 % (2158210)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3528356655:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.04/0.87 % (2158211)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3050719924:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.04/0.87 % (2158213)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=187181855:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.04/0.87 % (2158214)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3629983066:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.04/0.87 % (2158215)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=767044439:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.04/0.87 % TRYING [1]
% 2.04/0.87 % TRYING [2]
% 2.04/0.87 % TRYING [3]
% 2.04/0.87 % TRYING [4]
% 2.04/0.87 % (2158212)Instruction limit reached!
% 2.04/0.87 % (2158212)------------------------------
% 2.04/0.87 % (2158212)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158212)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158212)Termination reason: Instruction limit
% 2.04/0.87 % (2158212)Termination phase: Saturation
% 2.04/0.87 % (2158212)Time elapsed: 0.035 s
% 2.04/0.87 % (2158212)Peak memory usage: 11 MB
% 2.04/0.87 % (2158212)Instructions burned: 105 (million)
% 2.04/0.87 % (2158245)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=407937809:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.04/0.87 % TRYING [1]
% 2.04/0.87 % TRYING [2]
% 2.04/0.87 % TRYING [3]
% 2.04/0.87 % TRYING [4]
% 2.04/0.87 % (2158213)Instruction limit reached!
% 2.04/0.87 % (2158213)------------------------------
% 2.04/0.87 % (2158213)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158213)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158213)Termination reason: Instruction limit
% 2.04/0.87 % (2158213)Termination phase: Saturation
% 2.04/0.87 % (2158213)Time elapsed: 0.072 s
% 2.04/0.87 % (2158213)Peak memory usage: 11 MB
% 2.04/0.87 % (2158213)Instructions burned: 117 (million)
% 2.04/0.87 % (2158214)Instruction limit reached!
% 2.04/0.87 % (2158214)------------------------------
% 2.04/0.87 % (2158214)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158214)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158214)Termination reason: Instruction limit
% 2.04/0.87 % (2158214)Termination phase: Saturation
% 2.04/0.87 % (2158214)Time elapsed: 0.082 s
% 2.04/0.87 % (2158214)Peak memory usage: 13 MB
% 2.04/0.87 % (2158214)Instructions burned: 131 (million)
% 2.04/0.87 % (2158252)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=469343986:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.04/0.87 % (2158253)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=1439249224:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.04/0.87 % (2158215)Instruction limit reached!
% 2.04/0.87 % (2158215)------------------------------
% 2.04/0.87 % (2158215)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158215)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158215)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158215)Termination reason: Instruction limit
% 2.04/0.87 % (2158215)Termination phase: Saturation
% 2.04/0.87 % (2158215)Time elapsed: 0.111 s
% 2.04/0.87 % (2158215)Peak memory usage: 13 MB
% 2.04/0.87 % (2158215)Instructions burned: 160 (million)
% 2.04/0.87 % (2158256)ott-21_1_sil=16000:fs=off:random_seed=4280813412:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.04/0.87 % TRYING [5]
% 2.04/0.87 % (2158252)Instruction limit reached!
% 2.04/0.87 % (2158252)------------------------------
% 2.04/0.87 % (2158252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158252)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158252)Termination reason: Instruction limit
% 2.04/0.87 % (2158252)Termination phase: Saturation
% 2.04/0.87 % (2158252)Time elapsed: 0.079 s
% 2.04/0.87 % (2158252)Peak memory usage: 12 MB
% 2.04/0.87 % (2158252)Instructions burned: 131 (million)
% 2.04/0.87 % TRYING [5]
% 2.04/0.87 % (2158258)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3270034064:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.04/0.87 % (2158256)Instruction limit reached!
% 2.04/0.87 % (2158256)------------------------------
% 2.04/0.87 % (2158256)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158256)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158256)Termination reason: Instruction limit
% 2.04/0.87 % (2158256)Termination phase: Saturation
% 2.04/0.87 % (2158256)Time elapsed: 0.093 s
% 2.04/0.87 % (2158256)Peak memory usage: 12 MB
% 2.04/0.87 % (2158256)Instructions burned: 180 (million)
% 2.04/0.87 % (2158260)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1267508600:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.04/0.87 % TRYING [1]
% 2.04/0.87 % TRYING [2]
% 2.04/0.87 % TRYING [3]
% 2.04/0.87 % TRYING [4]
% 2.04/0.87 % (2158245)Instruction limit reached!
% 2.04/0.87 % (2158245)------------------------------
% 2.04/0.87 % (2158245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158245)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158245)Termination reason: Instruction limit
% 2.04/0.87 % (2158245)Termination phase: Finite model building SAT solving
% 2.04/0.87 % (2158245)Time elapsed: 0.235 s
% 2.04/0.87 % (2158245)Peak memory usage: 14 MB
% 2.04/0.87 % (2158245)Instructions burned: 714 (million)
% 2.04/0.87 % (2158262)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1780164804:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.04/0.87 % TRYING [5]
% 2.04/0.87 % (2158253) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2158192-2158253"...
% 2.04/0.87 % (2158253)...printing done.
% 2.04/0.87 % (2158253)Refutation found. Thanks to Tanya!
% 2.04/0.87 % SZS status Unsatisfiable for theBenchmark
% 2.04/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 2.04/0.87 % (2158253)------------------------------
% 2.04/0.87 % (2158253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.87 % (2158253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.87 % (2158253)CaDiCaL version: 2.1.3
% 2.04/0.87 % (2158253)Termination reason: Refutation
% 2.04/0.87 % (2158253)Time elapsed: 0.295 s
% 2.04/0.87 % (2158253)Peak memory usage: 16 MB
% 2.04/0.87 % (2158253)Instructions burned: 491 (million)
% 2.04/0.87 % (2158192)Success in time 0.442 s
% 2.04/0.87 % Vampire exiting
%------------------------------------------------------------------------------