%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL379-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 : n002.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.84s 1.22s
% Output : Refutation 4.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 7
% Syntax : Number of formulae : 73 ( 23 unt; 2 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 124 ( 64 ~; 58 |; 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 162 ( 0 sgn 162 !; 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(x,not(x)),not(x))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_38) ).
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,
! [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(f25,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f24,f3]) ).
fof(f27,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,[],[f24,f23]) ).
fof(f28,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f24,f4]) ).
fof(f30,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f25,f23]) ).
fof(f31,plain,
! [X0] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[],[f25,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,[],[f28,f24]) ).
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,[],[f28,f1]) ).
fof(f44,plain,
~ is_a_theorem(implies(not(not(x)),x)),
inference(resolution,[],[f30,f5]) ).
fof(f54,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f40,f4]) ).
fof(f194,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(f209,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f194,f25]) ).
fof(f222,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f209,f1]) ).
fof(f228,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f222,f54]) ).
fof(f234,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f228,f2]) ).
fof(f246,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f234,f25]) ).
fof(f277,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f246,f24]) ).
fof(f292,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f277,f4]) ).
fof(f325,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f292,f25]) ).
fof(f358,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f325,f54]) ).
fof(f373,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X1),X2))),X3))),
inference(resolution,[],[f358,f4]) ).
fof(f377,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f358,f292]) ).
fof(f409,definition,
( spl0_9
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f410,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f409]) ).
fof(f421,plain,
( $false
| ~ spl0_9 ),
inference(resolution,[],[f410,f3]) ).
fof(f432,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f421]) ).
fof(f666,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f377,f25]) ).
fof(f681,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f666,f222]) ).
fof(f718,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f681,f2]) ).
fof(f735,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f718,f25]) ).
fof(f746,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f735,f24]) ).
fof(f1341,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,[],[f27,f4]) ).
fof(f1395,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
inference(resolution,[],[f373,f25]) ).
fof(f1412,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f1395,f222]) ).
fof(f1470,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f1412,f2]) ).
fof(f1516,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f1470,f1]) ).
fof(f1556,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f1516,f30]) ).
fof(f1786,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),implies(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f746,f2]) ).
fof(f6137,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f1341,f2]) ).
fof(f6197,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f1341,f292]) ).
fof(f6284,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f6137,f25]) ).
fof(f6714,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f6284,f746]) ).
fof(f7730,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f6197,f6137]) ).
fof(f7778,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f7730,f222]) ).
fof(f8056,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f7778,f2]) ).
fof(f8517,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f8056,f1]) ).
fof(f8744,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))),
inference(resolution,[],[f8517,f2]) ).
fof(f9007,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,implies(X3,X2))) ),
inference(resolution,[],[f8744,f746]) ).
fof(f11506,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f9007,f31]) ).
fof(f11666,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f11506,f6197]) ).
fof(f11771,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f11666,f222]) ).
fof(f12127,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f11771,f1786]) ).
fof(f12384,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f12127,f6714]) ).
fof(f12806,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f12384,f1556]) ).
fof(f13171,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f12806,f1556]) ).
fof(f13371,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f13171,f12127]) ).
fof(f13428,definition,
( spl0_299
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_299])],[avatar_definition]) ).
fof(f13429,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_299 ),
inference(avatar_component_clause,[],[f13428]) ).
fof(f13430,plain,
( spl0_299
| spl0_9 ),
inference(avatar_split_clause,[],[f13371,f409,f13428]) ).
fof(f13446,plain,
( $false
| ~ spl0_299 ),
inference(resolution,[],[f13429,f44]) ).
fof(f13484,plain,
~ spl0_299,
inference(avatar_contradiction_clause,[],[f13446]) ).
cnf(s19,plain,
~ spl0_9,
inference(sat_conversion,[],[f432]) ).
cnf(s549,plain,
( spl0_9
| spl0_299 ),
inference(sat_conversion,[],[f13430]) ).
cnf(s550,plain,
~ spl0_299,
inference(sat_conversion,[],[f13484]) ).
cnf(s551,plain,
spl0_9,
inference(rat,[],[s549,s550]) ).
cnf(s552,plain,
$false,
inference(rat,[],[s19,s551]) ).
fof(f13485,plain,
$false,
inference(avatar_sat_refutation,[],[s552]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL379-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.18/0.45 % Computer : n002.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Sun Sep 27 15:40:51 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.49 Running first-order model finding
% 0.18/0.50 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
% 4.84/1.22 % (3692943)Will run a generic schedule for satisfiability detection.
% 4.84/1.22 % (3692952)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3095750366:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.84/1.22 % (3692950)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4036266690:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.84/1.22 % (3692948)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2352827173_2999 on theBenchmark for (2999ds/0Mi)
% 4.84/1.22 % (3692951)dis+10_1_sil=32000:sp=arity:random_seed=545189123:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.84/1.22 % TRYING [1]
% 4.84/1.22 % TRYING [2]
% 4.84/1.22 % TRYING [3]
% 4.84/1.22 % TRYING [4]
% 4.84/1.22 % (3692953)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1901515538:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.84/1.22 % TRYING [5]
% 4.84/1.22 % (3692949)% WARNING: option uhcvi not known.
% 4.84/1.22 % (3692952)Instruction limit reached!
% 4.84/1.22 % (3692952)------------------------------
% 4.84/1.22 % (3692952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.84/1.22 % (3692952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.22 % (3692952)CaDiCaL version: 2.1.3
% 4.84/1.22 % (3692952)Termination reason: Instruction limit
% 4.84/1.22 % (3692952)Termination phase: Saturation
% 4.84/1.22 % (3692952)Time elapsed: 0.061 s
% 4.84/1.22 % (3692952)Peak memory usage: 12 MB
% 4.84/1.22 % (3692952)Instructions burned: 116 (million)
% 4.84/1.22 % (3692949)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=48939354:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.84/1.22 % (3692954)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3091466538:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.84/1.22 % (3692951)Instruction limit reached!
% 4.84/1.22 % (3692951)------------------------------
% 4.84/1.22 % (3692951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.84/1.22 % (3692951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.22 % (3692951)CaDiCaL version: 2.1.3
% 4.84/1.22 % (3692951)Termination reason: Instruction limit
% 4.84/1.22 % (3692951)Termination phase: Saturation
% 4.84/1.22 % (3692951)Time elapsed: 0.104 s
% 4.84/1.22 % (3692951)Peak memory usage: 11 MB
% 4.84/1.22 % (3692951)Instructions burned: 104 (million)
% 4.84/1.22 % (3692960)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1115527279:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.84/1.22 % TRYING [1]
% 4.84/1.22 % TRYING [2]
% 4.84/1.22 % TRYING [3]
% 4.84/1.22 % TRYING [4]
% 4.84/1.22 % (3692963)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3168786529:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.84/1.22 % TRYING [5]
% 4.84/1.22 % (3692953)Instruction limit reached!
% 4.84/1.22 % (3692953)------------------------------
% 4.84/1.22 % (3692953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.84/1.22 % (3692953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.22 % (3692953)CaDiCaL version: 2.1.3
% 4.84/1.22 % (3692953)Termination reason: Instruction limit
% 4.84/1.22 % (3692953)Termination phase: Saturation
% 4.84/1.22 % (3692953)Time elapsed: 0.165 s
% 4.84/1.22 % (3692953)Peak memory usage: 13 MB
% 4.84/1.22 % (3692953)Instructions burned: 131 (million)
% 4.84/1.22 % (3692954)Instruction limit reached!
% 4.84/1.22 % (3692954)------------------------------
% 4.84/1.22 % (3692954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.84/1.22 % (3692954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.22 % (3692954)CaDiCaL version: 2.1.3
% 4.84/1.22 % (3692954)Termination reason: Instruction limit
% 4.84/1.22 % (3692954)Termination phase: Saturation
% 4.84/1.22 % (3692954)Time elapsed: 0.155 s
% 4.84/1.22 % (3692954)Peak memory usage: 12 MB
% 4.84/1.22 % (3692954)Instructions burned: 159 (million)
% 4.84/1.22 % (3692966)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=3457785981:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2997 on theBenchmark for (2997ds/684Mi)
% 4.84/1.22 % (3692967)ott-21_1_sil=16000:fs=off:random_seed=2003748096:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 4.84/1.22 % TRYING [6]
% 4.84/1.22 % (3692963)Instruction limit reached!
% 4.84/1.22 % (3692963)------------------------------
% 4.84/1.22 % (3692963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.84/1.22 % (3692963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.22 % (3692963)CaDiCaL version: 2.1.3
% 4.84/1.22 % (3692963)Termination reason: Instruction limit
% 4.84/1.22 % (3692963)Termination phase: Saturation
% 4.84/1.22 % (3692963)Time elapsed: 0.133 s
% 4.84/1.22 % (3692963)Peak memory usage: 12 MB
% 4.84/1.22 % (3692963)Instructions burned: 131 (million)
% 4.84/1.22 % (3692970)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1837558051:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 4.84/1.22 % TRYING [6]
% 4.84/1.22 % (3692967)Instruction limit reached!
% 4.84/1.22 % (3692967)------------------------------
% 4.84/1.22 % (3692967)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.84/1.22 % (3692967)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.22 % (3692967)CaDiCaL version: 2.1.3
% 4.84/1.22 % (3692967)Termination reason: Instruction limit
% 4.84/1.22 % (3692967)Termination phase: Saturation
% 4.84/1.22 % (3692967)Time elapsed: 0.164 s
% 4.84/1.22 % (3692967)Peak memory usage: 12 MB
% 4.84/1.22 % (3692967)Instructions burned: 180 (million)
% 4.84/1.22 % (3692972)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3051590948:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 4.84/1.22 % TRYING [1]
% 4.84/1.22 % TRYING [2]
% 4.84/1.22 % TRYING [3]
% 4.84/1.22 % TRYING [4]
% 4.84/1.22 % TRYING [5]
% 4.84/1.22 % TRYING [6]
% 4.84/1.22 % (3692966) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3692943-3692966"...
% 4.84/1.22 % (3692966)...printing done.
% 4.84/1.22 % (3692966)Refutation found. Thanks to Tanya!
% 4.84/1.22 % SZS status Unsatisfiable for theBenchmark
% 4.84/1.22 % SZS output start Proof for theBenchmark
% See solution above
% 4.84/1.22 % (3692966)------------------------------
% 4.84/1.22 % (3692966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.84/1.22 % (3692966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.22 % (3692966)CaDiCaL version: 2.1.3
% 4.84/1.22 % (3692966)Termination reason: Refutation
% 4.84/1.22 % (3692966)Time elapsed: 0.414 s
% 4.84/1.22 % (3692966)Peak memory usage: 15 MB
% 4.84/1.22 % (3692966)Instructions burned: 389 (million)
% 4.84/1.22 % (3692943)Success in time 0.715 s
% 4.84/1.22 % Vampire exiting
%------------------------------------------------------------------------------