%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL057-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 : n004.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:31 AM UTC 2026
% Result : Unsatisfiable 1.95s 0.74s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 7
% Syntax : Number of formulae : 73 ( 22 unt; 2 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 125 ( 64 ~; 59 |; 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 : 163 ( 0 sgn 163 !; 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(a,not(not(a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_40) ).
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(f52,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f40,f4]) ).
fof(f206,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(f222,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f206,f25]) ).
fof(f235,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f222,f1]) ).
fof(f241,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f235,f52]) ).
fof(f248,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f241,f2]) ).
fof(f261,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f248,f25]) ).
fof(f274,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f261,f24]) ).
fof(f289,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f274,f4]) ).
fof(f301,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f289,f25]) ).
fof(f327,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f301,f52]) ).
fof(f368,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X1),X2))),X3))),
inference(resolution,[],[f327,f4]) ).
fof(f372,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f327,f289]) ).
fof(f401,definition,
( spl0_8
<=> ! [X2] : ~ is_a_theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f402,plain,
( ! [X2] : ~ is_a_theorem(X2)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f401]) ).
fof(f416,plain,
( $false
| ~ spl0_8 ),
inference(resolution,[],[f402,f3]) ).
fof(f427,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f416]) ).
fof(f628,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f372,f25]) ).
fof(f658,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f628,f235]) ).
fof(f687,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f658,f2]) ).
fof(f704,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f687,f25]) ).
fof(f1102,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f24,f704]) ).
fof(f1305,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
inference(resolution,[],[f368,f25]) ).
fof(f1351,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f1305,f235]) ).
fof(f1427,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(f1457,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f1351,f2]) ).
fof(f1503,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f1457,f1]) ).
fof(f1543,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f1503,f30]) ).
fof(f2229,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f1102,f2]) ).
fof(f5502,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f1427,f2]) ).
fof(f5561,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f1427,f289]) ).
fof(f5645,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f5502,f25]) ).
fof(f5837,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f5645,f1102]) ).
fof(f6214,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f5561,f5502]) ).
fof(f6300,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f6214,f235]) ).
fof(f6735,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f6300,f2]) ).
fof(f7010,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f6735,f1]) ).
fof(f7186,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))),
inference(resolution,[],[f7010,f2]) ).
fof(f7400,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f7186,f1102]) ).
fof(f10769,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f7400,f31]) ).
fof(f10920,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f10769,f5561]) ).
fof(f11077,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f10920,f235]) ).
fof(f11534,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f11077,f2229]) ).
fof(f11618,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11534,f5837]) ).
fof(f11965,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11618,f1543]) ).
fof(f12382,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11965,f1543]) ).
fof(f12519,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f12382,f11534]) ).
fof(f12574,definition,
( spl0_284
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_284])],[avatar_definition]) ).
fof(f12575,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_284 ),
inference(avatar_component_clause,[],[f12574]) ).
fof(f12576,plain,
( spl0_284
| spl0_8 ),
inference(avatar_split_clause,[],[f12519,f401,f12574]) ).
fof(f12586,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_284 ),
inference(resolution,[],[f12575,f1543]) ).
fof(f12694,plain,
( $false
| ~ spl0_284 ),
inference(resolution,[],[f12586,f5]) ).
fof(f12696,plain,
~ spl0_284,
inference(avatar_contradiction_clause,[],[f12694]) ).
cnf(s19,plain,
~ spl0_8,
inference(sat_conversion,[],[f427]) ).
cnf(s522,plain,
( spl0_8
| spl0_284 ),
inference(sat_conversion,[],[f12576]) ).
cnf(s523,plain,
~ spl0_284,
inference(sat_conversion,[],[f12696]) ).
cnf(s524,plain,
spl0_8,
inference(rat,[],[s522,s523]) ).
cnf(s525,plain,
$false,
inference(rat,[],[s19,s524]) ).
fof(f12697,plain,
$false,
inference(avatar_sat_refutation,[],[s525]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL057-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.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 15:19:50 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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
% 1.95/0.74 % (3651508)Will run a generic schedule for satisfiability detection.
% 1.95/0.74 % (3651518)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3666607574:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.95/0.74 % (3651514)% WARNING: option uhcvi not known.
% 1.95/0.74 % (3651513)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3269812218_2999 on theBenchmark for (2999ds/0Mi)
% 1.95/0.74 % (3651519)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3647013527:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.95/0.74 % (3651515)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=370239503:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.95/0.74 % (3651516)dis+10_1_sil=32000:sp=arity:random_seed=1545557272:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.95/0.74 % (3651517)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=164242726:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.95/0.74 % (3651514)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1182238516:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.95/0.74 % TRYING [1]
% 1.95/0.74 % TRYING [2]
% 1.95/0.74 % TRYING [3]
% 1.95/0.74 % TRYING [4]
% 1.95/0.74 % TRYING [5]
% 1.95/0.74 % (3651518)Instruction limit reached!
% 1.95/0.74 % (3651518)------------------------------
% 1.95/0.74 % (3651518)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.74 % (3651518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.74 % (3651518)CaDiCaL version: 2.1.3
% 1.95/0.74 % (3651518)Termination reason: Instruction limit
% 1.95/0.74 % (3651518)Termination phase: Saturation
% 1.95/0.74 % (3651518)Time elapsed: 0.045 s
% 1.95/0.74 % (3651518)Peak memory usage: 13 MB
% 1.95/0.74 % (3651518)Instructions burned: 131 (million)
% 1.95/0.74 % (3651527)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3264080914:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.95/0.74 % TRYING [1]
% 1.95/0.74 % TRYING [2]
% 1.95/0.74 % TRYING [3]
% 1.95/0.74 % TRYING [4]
% 1.95/0.74 % (3651516)Instruction limit reached!
% 1.95/0.74 % (3651516)------------------------------
% 1.95/0.74 % (3651516)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.74 % (3651516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.74 % (3651516)CaDiCaL version: 2.1.3
% 1.95/0.74 % (3651516)Termination reason: Instruction limit
% 1.95/0.74 % (3651516)Termination phase: Saturation
% 1.95/0.74 % (3651516)Time elapsed: 0.065 s
% 1.95/0.74 % (3651516)Peak memory usage: 11 MB
% 1.95/0.74 % (3651516)Instructions burned: 104 (million)
% 1.95/0.74 % TRYING [5]
% 1.95/0.74 % (3651517)Instruction limit reached!
% 1.95/0.74 % (3651517)------------------------------
% 1.95/0.74 % (3651517)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.74 % (3651517)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.74 % (3651517)CaDiCaL version: 2.1.3
% 1.95/0.74 % (3651517)Termination reason: Instruction limit
% 1.95/0.74 % (3651517)Termination phase: Saturation
% 1.95/0.74 % (3651517)Time elapsed: 0.070 s
% 1.95/0.74 % (3651517)Peak memory usage: 11 MB
% 1.95/0.74 % (3651517)Instructions burned: 116 (million)
% 1.95/0.74 % (3651529)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1467416161:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.95/0.74 % (3651530)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=1162642892:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.95/0.74 % (3651519)Instruction limit reached!
% 1.95/0.74 % (3651519)------------------------------
% 1.95/0.74 % (3651519)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.74 % (3651519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.74 % (3651519)CaDiCaL version: 2.1.3
% 1.95/0.74 % (3651519)Termination reason: Instruction limit
% 1.95/0.74 % (3651519)Termination phase: Saturation
% 1.95/0.74 % (3651519)Time elapsed: 0.101 s
% 1.95/0.74 % (3651519)Peak memory usage: 12 MB
% 1.95/0.74 % (3651519)Instructions burned: 165 (million)
% 1.95/0.74 % (3651533)ott-21_1_sil=16000:fs=off:random_seed=4275545008:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.95/0.74 % (3651529)Instruction limit reached!
% 1.95/0.74 % (3651529)------------------------------
% 1.95/0.74 % (3651529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.74 % (3651529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.74 % (3651529)CaDiCaL version: 2.1.3
% 1.95/0.74 % (3651529)Termination reason: Instruction limit
% 1.95/0.74 % (3651529)Termination phase: Saturation
% 1.95/0.74 % (3651529)Time elapsed: 0.080 s
% 1.95/0.74 % (3651529)Peak memory usage: 12 MB
% 1.95/0.74 % (3651529)Instructions burned: 131 (million)
% 1.95/0.74 % TRYING [6]
% 1.95/0.74 % (3651535)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1082011043:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.95/0.74 % (3651533)Instruction limit reached!
% 1.95/0.74 % (3651533)------------------------------
% 1.95/0.74 % (3651533)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.74 % (3651533)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.74 % (3651533)CaDiCaL version: 2.1.3
% 1.95/0.74 % (3651533)Termination reason: Instruction limit
% 1.95/0.74 % (3651533)Termination phase: Saturation
% 1.95/0.74 % (3651533)Time elapsed: 0.093 s
% 1.95/0.74 % (3651533)Peak memory usage: 13 MB
% 1.95/0.74 % (3651533)Instructions burned: 181 (million)
% 1.95/0.74 % TRYING [6]
% 1.95/0.74 % (3651537)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2469565252:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.95/0.74 % TRYING [1]
% 1.95/0.74 % TRYING [2]
% 1.95/0.74 % TRYING [3]
% 1.95/0.74 % TRYING [4]
% 1.95/0.74 % TRYING [5]
% 1.95/0.74 % (3651527)Instruction limit reached!
% 1.95/0.74 % (3651527)------------------------------
% 1.95/0.74 % (3651527)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.74 % (3651527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.74 % (3651527)CaDiCaL version: 2.1.3
% 1.95/0.74 % (3651527)Termination reason: Instruction limit
% 1.95/0.74 % (3651527)Termination phase: Finite model building SAT solving
% 1.95/0.74 % (3651527)Time elapsed: 0.218 s
% 1.95/0.74 % (3651527)Peak memory usage: 16 MB
% 1.95/0.74 % (3651527)Instructions burned: 714 (million)
% 1.95/0.74 % (3651539)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3048508071:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.95/0.74 % (3651530) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3651508-3651530"...
% 1.95/0.74 % (3651530)...printing done.
% 1.95/0.74 % (3651530)Refutation found. Thanks to Tanya!
% 1.95/0.74 % SZS status Unsatisfiable for theBenchmark
% 1.95/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 1.95/0.75 % (3651530)------------------------------
% 1.95/0.75 % (3651530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.75 % (3651530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.75 % (3651530)CaDiCaL version: 2.1.3
% 1.95/0.75 % (3651530)Termination reason: Refutation
% 1.95/0.75 % (3651530)Time elapsed: 0.216 s
% 1.95/0.75 % (3651530)Peak memory usage: 14 MB
% 1.95/0.75 % (3651530)Instructions burned: 365 (million)
% 1.95/0.75 % (3651508)Success in time 0.342 s
% 1.95/0.75 % Vampire exiting
%------------------------------------------------------------------------------