%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL378-1 : TPTP v9.3.1. Released v2.3.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 11:58:29 AM UTC 2026
% Result : Unsatisfiable 4.16s 1.09s
% Output : Refutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 7
% Syntax : Number of formulae : 75 ( 22 unt; 2 def)
% Number of atoms : 138 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 129 ( 66 ~; 61 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 168 ( 0 sgn 168 !; 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(not(x),implies(x,y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_36) ).
fof(f27,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(f28,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f27,f1]) ).
fof(f29,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f28,f3]) ).
fof(f31,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,[],[f28,f27]) ).
fof(f32,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f28,f4]) ).
fof(f34,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f29,f27]) ).
fof(f35,plain,
! [X0] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[],[f29,f3]) ).
fof(f43,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,[],[f32,f28]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f32,f1]) ).
fof(f56,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f44,f4]) ).
fof(f210,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f43,f3]) ).
fof(f226,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f210,f29]) ).
fof(f239,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f226,f1]) ).
fof(f245,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f239,f56]) ).
fof(f252,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f245,f2]) ).
fof(f265,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f252,f29]) ).
fof(f278,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f265,f28]) ).
fof(f293,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f278,f4]) ).
fof(f321,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f293,f29]) ).
fof(f359,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f321,f56]) ).
fof(f374,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X1),X2))),X3))),
inference(resolution,[],[f359,f4]) ).
fof(f378,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f359,f293]) ).
fof(f407,definition,
( spl0_8
<=> ! [X2] : ~ is_a_theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f408,plain,
( ! [X2] : ~ is_a_theorem(X2)
| ~ 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(f637,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f378,f29]) ).
fof(f668,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f637,f239]) ).
fof(f697,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f668,f2]) ).
fof(f714,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f697,f29]) ).
fof(f778,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f28,f714]) ).
fof(f1335,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
inference(resolution,[],[f374,f29]) ).
fof(f1381,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f1335,f239]) ).
fof(f1424,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f1381,f2]) ).
fof(f1468,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f1424,f1]) ).
fof(f1506,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f1468,f34]) ).
fof(f1513,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f1468,f27]) ).
fof(f2165,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,[],[f31,f4]) ).
fof(f2206,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f778,f2]) ).
fof(f6459,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f2165,f2]) ).
fof(f6521,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f2165,f293]) ).
fof(f6752,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f6459,f29]) ).
fof(f6962,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f6752,f778]) ).
fof(f7514,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f6521,f6459]) ).
fof(f7608,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f7514,f239]) ).
fof(f7927,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f7608,f2]) ).
fof(f8286,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f7927,f1]) ).
fof(f8412,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))),
inference(resolution,[],[f8286,f2]) ).
fof(f8641,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f8412,f778]) ).
fof(f10643,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f8641,f35]) ).
fof(f10793,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f10643,f6521]) ).
fof(f10947,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f10793,f239]) ).
fof(f11404,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f10947,f2206]) ).
fof(f11488,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11404,f6962]) ).
fof(f11983,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11488,f1506]) ).
fof(f12400,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11983,f1506]) ).
fof(f12537,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f12400,f11404]) ).
fof(f12592,definition,
( spl0_284
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_284])],[avatar_definition]) ).
fof(f12593,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_284 ),
inference(avatar_component_clause,[],[f12592]) ).
fof(f12594,plain,
( spl0_284
| spl0_8 ),
inference(avatar_split_clause,[],[f12537,f407,f12592]) ).
fof(f12604,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_284 ),
inference(resolution,[],[f12593,f1506]) ).
fof(f12648,plain,
( ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1)))
| ~ spl0_284 ),
inference(resolution,[],[f12604,f1513]) ).
fof(f12778,plain,
( $false
| ~ spl0_284 ),
inference(resolution,[],[f12648,f5]) ).
fof(f12805,plain,
~ spl0_284,
inference(avatar_contradiction_clause,[],[f12778]) ).
cnf(s20,plain,
~ spl0_8,
inference(sat_conversion,[],[f433]) ).
cnf(s525,plain,
( spl0_8
| spl0_284 ),
inference(sat_conversion,[],[f12594]) ).
cnf(s526,plain,
~ spl0_284,
inference(sat_conversion,[],[f12805]) ).
cnf(s527,plain,
spl0_8,
inference(rat,[],[s525,s526]) ).
cnf(s528,plain,
$false,
inference(rat,[],[s20,s527]) ).
fof(f12806,plain,
$false,
inference(avatar_sat_refutation,[],[s528]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL378-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 % Computer : n001.cluster.edu
% 0.13/0.41 % Model : x86_64 x86_64
% 0.13/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41 % Memory : 8046.5625MB
% 0.13/0.41 % OS : Linux 6.8.0-71-generic
% 0.13/0.41 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Sun Sep 27 15:44:16 UTC 2026
% 0.13/0.42 % CPUTime :
% 0.13/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.47 Running first-order model finding
% 0.13/0.47 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
% 4.16/1.09 % (3735036)Will run a generic schedule for satisfiability detection.
% 4.16/1.09 % (3735045)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2865352160:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.16/1.09 % (3735042)% WARNING: option uhcvi not known.
% 4.16/1.09 % (3735042)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=162783799:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.16/1.09 % (3735043)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=513882106:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.16/1.09 % (3735041)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=482525149_2999 on theBenchmark for (2999ds/0Mi)
% 4.16/1.09 % (3735047)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2510852845:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.16/1.09 % (3735044)dis+10_1_sil=32000:sp=arity:random_seed=2651927436:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.16/1.09 % (3735046)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=739311759:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.16/1.09 % TRYING [1]
% 4.16/1.09 % TRYING [2]
% 4.16/1.09 % TRYING [3]
% 4.16/1.09 % TRYING [4]
% 4.16/1.09 % (3735045)Instruction limit reached!
% 4.16/1.09 % (3735045)------------------------------
% 4.16/1.09 % (3735045)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735045)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735045)Termination reason: Instruction limit
% 4.16/1.09 % (3735045)Termination phase: Saturation
% 4.16/1.09 % (3735045)Time elapsed: 0.058 s
% 4.16/1.09 % (3735045)Peak memory usage: 11 MB
% 4.16/1.09 % (3735045)Instructions burned: 117 (million)
% 4.16/1.09 % (3735055)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3372108362:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.16/1.09 % TRYING [1]
% 4.16/1.09 % TRYING [2]
% 4.16/1.09 % TRYING [3]
% 4.16/1.09 % TRYING [4]
% 4.16/1.09 % TRYING [5]
% 4.16/1.09 % (3735044)Instruction limit reached!
% 4.16/1.09 % (3735044)------------------------------
% 4.16/1.09 % (3735044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735044)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735044)Termination reason: Instruction limit
% 4.16/1.09 % (3735044)Termination phase: Saturation
% 4.16/1.09 % (3735044)Time elapsed: 0.102 s
% 4.16/1.09 % (3735044)Peak memory usage: 11 MB
% 4.16/1.09 % (3735044)Instructions burned: 103 (million)
% 4.16/1.09 % TRYING [5]
% 4.16/1.09 % (3735046)Instruction limit reached!
% 4.16/1.09 % (3735046)------------------------------
% 4.16/1.09 % (3735046)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735046)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735046)Termination reason: Instruction limit
% 4.16/1.09 % (3735046)Termination phase: Saturation
% 4.16/1.09 % (3735046)Time elapsed: 0.139 s
% 4.16/1.09 % (3735046)Peak memory usage: 13 MB
% 4.16/1.09 % (3735046)Instructions burned: 131 (million)
% 4.16/1.09 % (3735057)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=610833104:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.16/1.09 % (3735047)Instruction limit reached!
% 4.16/1.09 % (3735047)------------------------------
% 4.16/1.09 % (3735047)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735047)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735047)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735047)Termination reason: Instruction limit
% 4.16/1.09 % (3735047)Termination phase: Saturation
% 4.16/1.09 % (3735047)Time elapsed: 0.161 s
% 4.16/1.09 % (3735047)Peak memory usage: 13 MB
% 4.16/1.09 % (3735047)Instructions burned: 159 (million)
% 4.16/1.09 % (3735058)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=1363781216:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.16/1.09 % (3735060)ott-21_1_sil=16000:fs=off:random_seed=2228047823:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 4.16/1.09 % (3735057)Instruction limit reached!
% 4.16/1.09 % (3735057)------------------------------
% 4.16/1.09 % (3735057)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735057)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735057)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735057)Termination reason: Instruction limit
% 4.16/1.09 % (3735057)Termination phase: Saturation
% 4.16/1.09 % (3735057)Time elapsed: 0.128 s
% 4.16/1.09 % (3735057)Peak memory usage: 12 MB
% 4.16/1.09 % (3735057)Instructions burned: 131 (million)
% 4.16/1.09 % (3735063)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1739607321:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 4.16/1.09 % (3735060)Instruction limit reached!
% 4.16/1.09 % (3735060)------------------------------
% 4.16/1.09 % (3735060)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735060)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735060)Termination reason: Instruction limit
% 4.16/1.09 % (3735060)Termination phase: Saturation
% 4.16/1.09 % (3735060)Time elapsed: 0.161 s
% 4.16/1.09 % (3735060)Peak memory usage: 12 MB
% 4.16/1.09 % (3735060)Instructions burned: 181 (million)
% 4.16/1.09 % (3735055)Instruction limit reached!
% 4.16/1.09 % (3735055)------------------------------
% 4.16/1.09 % (3735055)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735055)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735055)Termination reason: Instruction limit
% 4.16/1.09 % (3735055)Termination phase: Finite model building SAT solving
% 4.16/1.09 % (3735055)Time elapsed: 0.325 s
% 4.16/1.09 % (3735055)Peak memory usage: 14 MB
% 4.16/1.09 % (3735055)Instructions burned: 714 (million)
% 4.16/1.09 % (3735065)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=323077052:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 4.16/1.09 % TRYING [1]
% 4.16/1.09 % TRYING [2]
% 4.16/1.09 % TRYING [3]
% 4.16/1.09 % TRYING [4]
% 4.16/1.09 % (3735066)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3025662596:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 4.16/1.09 % TRYING [5]
% 4.16/1.09 % (3735058) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3735036-3735058"...
% 4.16/1.09 % (3735058)...printing done.
% 4.16/1.09 % (3735058)Refutation found. Thanks to Tanya!
% 4.16/1.09 % SZS status Unsatisfiable for theBenchmark
% 4.16/1.09 % SZS output start Proof for theBenchmark
% See solution above
% 4.16/1.09 % (3735058)------------------------------
% 4.16/1.09 % (3735058)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.16/1.09 % (3735058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.09 % (3735058)CaDiCaL version: 2.1.3
% 4.16/1.09 % (3735058)Termination reason: Refutation
% 4.16/1.09 % (3735058)Time elapsed: 0.371 s
% 4.16/1.09 % (3735058)Peak memory usage: 15 MB
% 4.16/1.09 % (3735058)Instructions burned: 371 (million)
% 4.16/1.09 % (3735036)Success in time 0.606 s
% 4.16/1.09 % Vampire exiting
%------------------------------------------------------------------------------