%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:58:27 AM UTC 2026
% Result : Unsatisfiable 2.37s 1.00s
% Output : Refutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 17 unt; 2 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 93 ( 48 ~; 43 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn 114 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(implies(y,x),x))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_15) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f4]) ).
fof(f8,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(f18,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f8,f1]) ).
fof(f19,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f18,f3]) ).
fof(f20,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,[],[f18,f2]) ).
fof(f21,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,[],[f18,f8]) ).
fof(f22,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f18,f4]) ).
fof(f24,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f19,f8]) ).
fof(f25,plain,
! [X0] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[],[f19,f3]) ).
fof(f26,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f19,f4]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f22,f1]) ).
fof(f41,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(implies(not(X1),X1),X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f21,f3]) ).
fof(f42,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,[],[f21,f2]) ).
fof(f44,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,[],[f21,f4]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X3,X2)))
| is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f21,f7]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(implies(X2,implies(X1,X0)))
| is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f24,f18]) ).
fof(f79,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(implies(not(X1),X1)),implies(not(X1),X1))))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f25,f18]) ).
fof(f99,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(implies(implies(not(X1),X1),X2)),X3)) ),
inference(resolution,[],[f41,f33]) ).
fof(f106,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X2),X3),X0))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[],[f44,f8]) ).
fof(f111,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X2,not(X1))))
| is_a_theorem(implies(X0,implies(X1,implies(X2,X3)))) ),
inference(resolution,[],[f44,f20]) ).
fof(f121,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f48,f4]) ).
fof(f127,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f121,f19]) ).
fof(f137,definition,
( spl0_5
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f138,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f137]) ).
fof(f186,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X2,X0),X3))),
inference(resolution,[],[f42,f26]) ).
fof(f221,plain,
( $false
| ~ spl0_5 ),
inference(backward_subsumption_resolution,[],[f26,f138]) ).
fof(f231,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f221]) ).
fof(f819,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f50,f127]) ).
fof(f977,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X0),X1))),
inference(resolution,[],[f106,f25]) ).
fof(f997,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X0,implies(X1,implies(not(X2),X3)))) ),
inference(resolution,[],[f111,f121]) ).
fof(f1413,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(implies(X2,X2)),X3)))),
inference(resolution,[],[f997,f26]) ).
fof(f1453,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3))
| is_a_theorem(implies(implies(X2,X0),X3)) ),
inference(resolution,[],[f186,f1]) ).
fof(f1693,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(resolution,[],[f79,f1413]) ).
fof(f1930,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)) ),
inference(resolution,[],[f99,f1693]) ).
fof(f1966,definition,
( spl0_38
<=> ! [X2,X1] : is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)) ),
introduced(definition,[new_symbols(definition,[spl0_38])],[avatar_definition]) ).
fof(f1967,plain,
( ! [X2,X1] : is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2))
| ~ spl0_38 ),
inference(avatar_component_clause,[],[f1966]) ).
fof(f1968,plain,
( spl0_38
| spl0_5 ),
inference(avatar_split_clause,[],[f1930,f137,f1966]) ).
fof(f10286,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f819,f977]) ).
fof(f10756,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(implies(implies(not(X0),X0),X0),X1),X1))
| ~ spl0_38 ),
inference(resolution,[],[f10286,f1967]) ).
fof(f12214,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1)))
| ~ spl0_38 ),
inference(resolution,[],[f1453,f10756]) ).
fof(f12640,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X1,X0),X0)))
| ~ spl0_38 ),
inference(resolution,[],[f12214,f1453]) ).
fof(f13089,plain,
( $false
| ~ spl0_38 ),
inference(backward_subsumption_resolution,[],[f5,f12640]) ).
fof(f13163,plain,
~ spl0_38,
inference(avatar_contradiction_clause,[],[f13089]) ).
cnf(s9,plain,
~ spl0_5,
inference(sat_conversion,[],[f231]) ).
cnf(s96,plain,
( spl0_5
| spl0_38 ),
inference(sat_conversion,[],[f1968]) ).
cnf(s652,plain,
~ spl0_38,
inference(sat_conversion,[],[f13163]) ).
cnf(s656,plain,
spl0_5,
inference(rat,[],[s96,s652]) ).
cnf(s682,plain,
$false,
inference(rat,[],[s9,s656]) ).
fof(f13164,plain,
$false,
inference(avatar_sat_refutation,[],[s682]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n006.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sun Sep 27 15:36:41 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 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
% 2.37/1.00 % (3116522)Will run a generic schedule for satisfiability detection.
% 2.37/1.00 % (3116529)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2315158045:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 2.37/1.00 % (3116528)% WARNING: option uhcvi not known.
% 2.37/1.00 % (3116528)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=94629915:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 2.37/1.00 % (3116530)dis+10_1_sil=32000:sp=arity:random_seed=3239409493:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 2.37/1.00 % (3116532)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1578501577:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 2.37/1.00 % (3116531)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=826826252:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 2.37/1.00 % (3116527)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2074542320_3000 on theBenchmark for (3000ds/0Mi)
% 2.37/1.00 % (3116533)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2589825074:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 2.37/1.00 % TRYING [1]
% 2.37/1.00 % TRYING [2]
% 2.37/1.00 % TRYING [3]
% 2.37/1.00 % TRYING [4]
% 2.37/1.00 % (3116530)Instruction limit reached!
% 2.37/1.00 % (3116530)------------------------------
% 2.37/1.00 % (3116530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116530)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116530)Termination reason: Instruction limit
% 2.37/1.00 % (3116530)Termination phase: Saturation
% 2.37/1.00 % (3116530)Time elapsed: 0.098 s
% 2.37/1.00 % (3116530)Peak memory usage: 11 MB
% 2.37/1.00 % (3116530)Instructions burned: 103 (million)
% 2.37/1.00 % (3116531)Instruction limit reached!
% 2.37/1.00 % (3116531)------------------------------
% 2.37/1.00 % (3116531)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116531)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116531)Termination reason: Instruction limit
% 2.37/1.00 % (3116531)Termination phase: Saturation
% 2.37/1.00 % (3116531)Time elapsed: 0.117 s
% 2.37/1.00 % (3116531)Peak memory usage: 11 MB
% 2.37/1.00 % (3116531)Instructions burned: 117 (million)
% 2.37/1.00 % (3116543)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3638029897:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.37/1.00 % TRYING [1]
% 2.37/1.00 % TRYING [2]
% 2.37/1.00 % TRYING [3]
% 2.37/1.00 % (3116532)Instruction limit reached!
% 2.37/1.00 % (3116532)------------------------------
% 2.37/1.00 % (3116532)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116532)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116532)Termination reason: Instruction limit
% 2.37/1.00 % (3116532)Termination phase: Saturation
% 2.37/1.00 % (3116532)Time elapsed: 0.134 s
% 2.37/1.00 % (3116532)Peak memory usage: 13 MB
% 2.37/1.00 % (3116532)Instructions burned: 131 (million)
% 2.37/1.00 % (3116544)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2018053712:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.37/1.00 % TRYING [4]
% 2.37/1.00 % TRYING [5]
% 2.37/1.00 % (3116533)Instruction limit reached!
% 2.37/1.00 % (3116533)------------------------------
% 2.37/1.00 % (3116533)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116533)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116533)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116533)Termination reason: Instruction limit
% 2.37/1.00 % (3116533)Termination phase: Saturation
% 2.37/1.00 % (3116533)Time elapsed: 0.143 s
% 2.37/1.00 % (3116533)Peak memory usage: 12 MB
% 2.37/1.00 % (3116533)Instructions burned: 159 (million)
% 2.37/1.00 % (3116547)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=4017808956:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.37/1.00 % (3116548)ott-21_1_sil=16000:fs=off:random_seed=4168183506:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.37/1.00 % (3116544)Instruction limit reached!
% 2.37/1.00 % (3116544)------------------------------
% 2.37/1.00 % (3116544)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116544)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116544)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116544)Termination reason: Instruction limit
% 2.37/1.00 % (3116544)Termination phase: Saturation
% 2.37/1.00 % (3116544)Time elapsed: 0.063 s
% 2.37/1.00 % (3116544)Peak memory usage: 12 MB
% 2.37/1.00 % (3116544)Instructions burned: 131 (million)
% 2.37/1.00 % (3116552)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1664481295:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.37/1.00 % TRYING [5]
% 2.37/1.00 % (3116548)Instruction limit reached!
% 2.37/1.00 % (3116548)------------------------------
% 2.37/1.00 % (3116548)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116548)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116548)Termination reason: Instruction limit
% 2.37/1.00 % (3116548)Termination phase: Saturation
% 2.37/1.00 % (3116548)Time elapsed: 0.147 s
% 2.37/1.00 % (3116548)Peak memory usage: 13 MB
% 2.37/1.00 % (3116548)Instructions burned: 180 (million)
% 2.37/1.00 % (3116558)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2172830215:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 2.37/1.00 % TRYING [1]
% 2.37/1.00 % TRYING [2]
% 2.37/1.00 % TRYING [3]
% 2.37/1.00 % TRYING [4]
% 2.37/1.00 % TRYING [5]
% 2.37/1.00 % (3116552)Instruction limit reached!
% 2.37/1.00 % (3116552)------------------------------
% 2.37/1.00 % (3116552)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116552)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116552)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116552)Termination reason: Instruction limit
% 2.37/1.00 % (3116552)Termination phase: Saturation
% 2.37/1.00 % (3116552)Time elapsed: 0.237 s
% 2.37/1.00 % (3116552)Peak memory usage: 12 MB
% 2.37/1.00 % (3116552)Instructions burned: 477 (million)
% 2.37/1.00 % (3116561)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2172222935:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.37/1.00 % (3116528) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3116522-3116528"...
% 2.37/1.00 % (3116528)...printing done.
% 2.37/1.00 % (3116528)Refutation found. Thanks to Tanya!
% 2.37/1.00 % SZS status Unsatisfiable for theBenchmark
% 2.37/1.00 % SZS output start Proof for theBenchmark
% See solution above
% 2.37/1.00 % (3116528)------------------------------
% 2.37/1.00 % (3116528)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.37/1.00 % (3116528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.37/1.00 % (3116528)CaDiCaL version: 2.1.3
% 2.37/1.00 % (3116528)Termination reason: Refutation
% 2.37/1.00 % (3116528)Time elapsed: 0.508 s
% 2.37/1.00 % (3116528)Peak memory usage: 17 MB
% 2.37/1.00 % (3116528)Instructions burned: 531 (million)
% 2.37/1.00 % (3116522)Success in time 0.55 s
% 2.37/1.00 % Vampire exiting
%------------------------------------------------------------------------------