%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL396-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:32 AM UTC 2026
% Result : Unsatisfiable 5.47s 1.35s
% Output : Refutation 5.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 7
% Syntax : Number of formulae : 86 ( 31 unt; 2 def)
% Number of atoms : 152 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 136 ( 70 ~; 64 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 7 ( 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 : 194 ( 0 sgn 194 !; 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(not(x)),y),implies(x,y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_62) ).
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(x,not(not(x)))),
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(f33,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f26,f4]) ).
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(f407,definition,
( spl0_8
<=> ! [X3] : ~ is_a_theorem(X3) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f408,plain,
( ! [X3] : ~ is_a_theorem(X3)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f422,plain,
( $false
| ~ spl0_8 ),
inference(resolution,[],[f408,f3]) ).
fof(f433,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f422]) ).
fof(f919,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(f926,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(f927,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(f932,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(f1007,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(not(X0),X1))),
inference(resolution,[],[f199,f32]) ).
fof(f1008,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,implies(not(implies(not(X1),X2)),X3))) ),
inference(resolution,[],[f199,f193]) ).
fof(f1032,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f1007,f25]) ).
fof(f1345,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X1),X0))
| is_a_theorem(implies(implies(X0,X1),implies(not(X1),X2))) ),
inference(resolution,[],[f1032,f23]) ).
fof(f1582,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X1),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1345,f273]) ).
fof(f1597,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1582,f26]) ).
fof(f1621,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f1597,f25]) ).
fof(f2014,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f932,f2]) ).
fof(f2015,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,[],[f932,f23]) ).
fof(f2036,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f932,f33]) ).
fof(f2037,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f932,f273]) ).
fof(f2261,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X0),X2))),X3))),
inference(resolution,[],[f2014,f199]) ).
fof(f2272,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f2014,f26]) ).
fof(f2296,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f2036,f1]) ).
fof(f2362,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f2296,f31]) ).
fof(f2850,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,implies(not(X0),X2)))),
inference(resolution,[],[f2261,f222]) ).
fof(f2893,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f2272,f1621]) ).
fof(f5121,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[],[f2037,f32]) ).
fof(f5140,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f2037,f2850]) ).
fof(f5364,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(X0,implies(implies(X1,X2),X2))) ),
inference(resolution,[],[f5121,f927]) ).
fof(f6384,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f5140,f919]) ).
fof(f11069,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(implies(not(X1),X1),X1),X2),X2))),
inference(resolution,[],[f5364,f5121]) ).
fof(f12371,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f6384,f1]) ).
fof(f14616,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,implies(not(X2),X2)),implies(X1,X2)))),
inference(resolution,[],[f11069,f926]) ).
fof(f16838,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1))),
inference(resolution,[],[f14616,f87]) ).
fof(f16965,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f16838,f12371]) ).
fof(f17045,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(not(implies(X1,X0)),X2)),X3))),
inference(resolution,[],[f16965,f1008]) ).
fof(f17808,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,X0)),X2))),
inference(resolution,[],[f17045,f26]) ).
fof(f17877,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f17808,f222]) ).
fof(f17948,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(resolution,[],[f17877,f2015]) ).
fof(f18298,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f17948,f1]) ).
fof(f18735,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f18298,f2893]) ).
fof(f19061,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f18735,f2362]) ).
fof(f19607,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f19061,f2362]) ).
fof(f19814,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f19607,f18298]) ).
fof(f19876,definition,
( spl0_520
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_520])],[avatar_definition]) ).
fof(f19877,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_520 ),
inference(avatar_component_clause,[],[f19876]) ).
fof(f19878,plain,
( spl0_520
| spl0_8 ),
inference(avatar_split_clause,[],[f19814,f407,f19876]) ).
fof(f19892,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_520 ),
inference(resolution,[],[f19877,f2362]) ).
fof(f20037,plain,
( $false
| ~ spl0_520 ),
inference(resolution,[],[f19892,f24]) ).
fof(f20040,plain,
~ spl0_520,
inference(avatar_contradiction_clause,[],[f20037]) ).
cnf(s19,plain,
~ spl0_8,
inference(sat_conversion,[],[f433]) ).
cnf(s1074,plain,
( spl0_8
| spl0_520 ),
inference(sat_conversion,[],[f19878]) ).
cnf(s1075,plain,
~ spl0_520,
inference(sat_conversion,[],[f20040]) ).
cnf(s1076,plain,
spl0_8,
inference(rat,[],[s1074,s1075]) ).
cnf(s1077,plain,
$false,
inference(rat,[],[s19,s1076]) ).
fof(f20041,plain,
$false,
inference(avatar_sat_refutation,[],[s1077]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL396-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.19/0.46 % Computer : n026.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Sun Sep 27 15:42:41 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.52 Running first-order model finding
% 0.24/0.52 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
% 5.47/1.35 % (3019752)Will run a generic schedule for satisfiability detection.
% 5.47/1.35 % (3019761)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1921535301:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.47/1.35 % (3019759)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1496247778:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.47/1.35 % (3019760)dis+10_1_sil=32000:sp=arity:random_seed=409063816:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.47/1.35 % (3019757)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3122709955_2999 on theBenchmark for (2999ds/0Mi)
% 5.47/1.35 % (3019762)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=667832801:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.47/1.35 % (3019763)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3870944046:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.47/1.35 % TRYING [1]
% 5.47/1.35 % TRYING [2]
% 5.47/1.35 % TRYING [3]
% 5.47/1.35 % TRYING [4]
% 5.47/1.35 % (3019758)% WARNING: option uhcvi not known.
% 5.47/1.35 % (3019758)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2973446178:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.47/1.35 % (3019761)Instruction limit reached!
% 5.47/1.35 % (3019761)------------------------------
% 5.47/1.35 % (3019761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019761)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019761)Termination reason: Instruction limit
% 5.47/1.35 % (3019761)Termination phase: Saturation
% 5.47/1.35 % (3019761)Time elapsed: 0.061 s
% 5.47/1.35 % (3019761)Peak memory usage: 11 MB
% 5.47/1.35 % (3019761)Instructions burned: 118 (million)
% 5.47/1.35 % (3019771)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3486884751:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.47/1.35 % TRYING [1]
% 5.47/1.35 % TRYING [2]
% 5.47/1.35 % TRYING [3]
% 5.47/1.35 % TRYING [4]
% 5.47/1.35 % (3019760)Instruction limit reached!
% 5.47/1.35 % (3019760)------------------------------
% 5.47/1.35 % (3019760)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019760)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019760)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019760)Termination reason: Instruction limit
% 5.47/1.35 % (3019760)Termination phase: Saturation
% 5.47/1.35 % (3019760)Time elapsed: 0.096 s
% 5.47/1.35 % (3019760)Peak memory usage: 11 MB
% 5.47/1.35 % (3019760)Instructions burned: 103 (million)
% 5.47/1.35 % (3019762)Instruction limit reached!
% 5.47/1.35 % (3019762)------------------------------
% 5.47/1.35 % (3019762)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019762)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019762)Termination reason: Instruction limit
% 5.47/1.35 % (3019762)Termination phase: Saturation
% 5.47/1.35 % (3019762)Time elapsed: 0.130 s
% 5.47/1.35 % (3019762)Peak memory usage: 13 MB
% 5.47/1.35 % (3019762)Instructions burned: 131 (million)
% 5.47/1.35 % TRYING [5]
% 5.47/1.35 % (3019773)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4037189078:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.47/1.35 % TRYING [5]
% 5.47/1.35 % (3019763)Instruction limit reached!
% 5.47/1.35 % (3019763)------------------------------
% 5.47/1.35 % (3019763)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019763)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019763)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019763)Termination reason: Instruction limit
% 5.47/1.35 % (3019763)Termination phase: Saturation
% 5.47/1.35 % (3019763)Time elapsed: 0.158 s
% 5.47/1.35 % (3019763)Peak memory usage: 12 MB
% 5.47/1.35 % (3019763)Instructions burned: 159 (million)
% 5.47/1.35 % (3019774)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=2087854063:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.47/1.35 % (3019776)ott-21_1_sil=16000:fs=off:random_seed=1888057750:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 5.47/1.35 % (3019773)Instruction limit reached!
% 5.47/1.35 % (3019773)------------------------------
% 5.47/1.35 % (3019773)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019773)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019773)Termination reason: Instruction limit
% 5.47/1.35 % (3019773)Termination phase: Saturation
% 5.47/1.35 % (3019773)Time elapsed: 0.134 s
% 5.47/1.35 % (3019773)Peak memory usage: 12 MB
% 5.47/1.35 % (3019773)Instructions burned: 131 (million)
% 5.47/1.35 % (3019779)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2582218728:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 5.47/1.35 % (3019776)Instruction limit reached!
% 5.47/1.35 % (3019776)------------------------------
% 5.47/1.35 % (3019776)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019776)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019776)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019776)Termination reason: Instruction limit
% 5.47/1.35 % (3019776)Termination phase: Saturation
% 5.47/1.35 % (3019776)Time elapsed: 0.152 s
% 5.47/1.35 % (3019776)Peak memory usage: 12 MB
% 5.47/1.35 % (3019776)Instructions burned: 180 (million)
% 5.47/1.35 % (3019781)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1824841060:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 5.47/1.35 % TRYING [1]
% 5.47/1.35 % TRYING [2]
% 5.47/1.35 % TRYING [3]
% 5.47/1.35 % TRYING [4]
% 5.47/1.35 % (3019771)Instruction limit reached!
% 5.47/1.35 % (3019771)------------------------------
% 5.47/1.35 % (3019771)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019771)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019771)Termination reason: Instruction limit
% 5.47/1.35 % (3019771)Termination phase: Finite model building SAT solving
% 5.47/1.35 % (3019771)Time elapsed: 0.335 s
% 5.47/1.35 % (3019771)Peak memory usage: 14 MB
% 5.47/1.35 % (3019771)Instructions burned: 715 (million)
% 5.47/1.35 % (3019783)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=322059382:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 5.47/1.35 % TRYING [5]
% 5.47/1.35 % (3019774) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3019752-3019774"...
% 5.47/1.35 % (3019774)...printing done.
% 5.47/1.35 % (3019774)Refutation found. Thanks to Tanya!
% 5.47/1.35 % SZS status Unsatisfiable for theBenchmark
% 5.47/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 5.47/1.35 % (3019774)------------------------------
% 5.47/1.35 % (3019774)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.47/1.35 % (3019774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.47/1.35 % (3019774)CaDiCaL version: 2.1.3
% 5.47/1.35 % (3019774)Termination reason: Refutation
% 5.47/1.35 % (3019774)Time elapsed: 0.586 s
% 5.47/1.35 % (3019774)Peak memory usage: 17 MB
% 5.47/1.35 % (3019774)Instructions burned: 596 (million)
% 5.47/1.35 % (3019752)Success in time 0.808 s
% 5.47/1.35 % Vampire exiting
%------------------------------------------------------------------------------