%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL402-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 : n013.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:33 AM UTC 2026
% Result : Unsatisfiable 3.82s 1.13s
% Output : Refutation 3.82s
% 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 : 167 ( 0 sgn 167 !; 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(implies(x,not(y))),y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_68) ).
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(f305,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f293,f29]) ).
fof(f332,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f305,f56]) ).
fof(f374,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X1),X2))),X3))),
inference(resolution,[],[f332,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,[],[f332,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(f667,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,[],[f667,f2]) ).
fof(f735,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f697,f29]) ).
fof(f744,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,f28]) ).
fof(f1315,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
inference(resolution,[],[f374,f29]) ).
fof(f1361,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f1315,f239]) ).
fof(f1424,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f1361,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(f1690,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(f1783,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),implies(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f744,f2]) ).
fof(f6133,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f1690,f2]) ).
fof(f6193,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f1690,f293]) ).
fof(f6280,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f6133,f29]) ).
fof(f6479,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f6280,f744]) ).
fof(f7515,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f6193,f6133]) ).
fof(f7609,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f7515,f239]) ).
fof(f7928,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f7609,f2]) ).
fof(f8392,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
| is_a_theorem(implies(X1,X3)) ),
inference(resolution,[],[f7928,f1]) ).
fof(f8615,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))),
inference(resolution,[],[f8392,f2]) ).
fof(f8847,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,implies(X3,X2))) ),
inference(resolution,[],[f8615,f744]) ).
fof(f10784,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f8847,f35]) ).
fof(f10935,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f10784,f6193]) ).
fof(f11092,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f10935,f239]) ).
fof(f11549,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f11092,f1783]) ).
fof(f11885,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11549,f6479]) ).
fof(f12240,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f11885,f1506]) ).
fof(f12665,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f12240,f1506]) ).
fof(f12804,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f12665,f11549]) ).
fof(f12861,definition,
( spl0_284
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_284])],[avatar_definition]) ).
fof(f12862,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_284 ),
inference(avatar_component_clause,[],[f12861]) ).
fof(f12863,plain,
( spl0_284
| spl0_8 ),
inference(avatar_split_clause,[],[f12804,f407,f12861]) ).
fof(f12873,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_284 ),
inference(resolution,[],[f12862,f1506]) ).
fof(f12957,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,not(not(implies(X1,X0)))))
| ~ spl0_284 ),
inference(resolution,[],[f12873,f11549]) ).
fof(f13588,plain,
( ! [X0,X1] : is_a_theorem(implies(not(implies(X0,not(X1))),X1))
| ~ spl0_284 ),
inference(resolution,[],[f12957,f1506]) ).
fof(f13827,plain,
( $false
| ~ spl0_284 ),
inference(resolution,[],[f13588,f5]) ).
fof(f13865,plain,
~ spl0_284,
inference(avatar_contradiction_clause,[],[f13827]) ).
cnf(s20,plain,
~ spl0_8,
inference(sat_conversion,[],[f433]) ).
cnf(s527,plain,
( spl0_8
| spl0_284 ),
inference(sat_conversion,[],[f12863]) ).
cnf(s558,plain,
~ spl0_284,
inference(sat_conversion,[],[f13865]) ).
cnf(s559,plain,
spl0_8,
inference(rat,[],[s527,s558]) ).
cnf(s560,plain,
$false,
inference(rat,[],[s20,s559]) ).
fof(f13866,plain,
$false,
inference(avatar_sat_refutation,[],[s560]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL402-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.20/0.45 % Computer : n013.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Sun Sep 27 15:39:36 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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
% 3.82/1.13 % (367984)Will run a generic schedule for satisfiability detection.
% 3.82/1.13 % (367993)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2100683710:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.82/1.13 % (367992)dis+10_1_sil=32000:sp=arity:random_seed=3564690214:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.82/1.13 % (367991)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1163514960:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.82/1.13 % (367995)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=763731733:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.82/1.13 % (367989)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2302107762_2999 on theBenchmark for (2999ds/0Mi)
% 3.82/1.13 % (367994)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=800204834:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.82/1.13 % TRYING [1]
% 3.82/1.13 % TRYING [2]
% 3.82/1.13 % TRYING [3]
% 3.82/1.13 % (367990)% WARNING: option uhcvi not known.
% 3.82/1.13 % TRYING [4]
% 3.82/1.13 % (367990)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3261553662:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.82/1.13 % (367993)Instruction limit reached!
% 3.82/1.13 % (367993)------------------------------
% 3.82/1.13 % (367993)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (367993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (367993)CaDiCaL version: 2.1.3
% 3.82/1.13 % (367993)Termination reason: Instruction limit
% 3.82/1.13 % (367993)Termination phase: Saturation
% 3.82/1.13 % (367993)Time elapsed: 0.057 s
% 3.82/1.13 % (367993)Peak memory usage: 11 MB
% 3.82/1.13 % (367993)Instructions burned: 116 (million)
% 3.82/1.13 % (368003)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2796056664:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.82/1.13 % TRYING [1]
% 3.82/1.13 % TRYING [2]
% 3.82/1.13 % TRYING [3]
% 3.82/1.13 % TRYING [4]
% 3.82/1.13 % (367992)Instruction limit reached!
% 3.82/1.13 % (367992)------------------------------
% 3.82/1.13 % (367992)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (367992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (367992)CaDiCaL version: 2.1.3
% 3.82/1.13 % (367992)Termination reason: Instruction limit
% 3.82/1.13 % (367992)Termination phase: Saturation
% 3.82/1.13 % (367992)Time elapsed: 0.099 s
% 3.82/1.13 % (367992)Peak memory usage: 11 MB
% 3.82/1.13 % (367992)Instructions burned: 109 (million)
% 3.82/1.13 % (367994)Instruction limit reached!
% 3.82/1.13 % (367994)------------------------------
% 3.82/1.13 % (367994)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (367994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (367994)CaDiCaL version: 2.1.3
% 3.82/1.13 % (367994)Termination reason: Instruction limit
% 3.82/1.13 % (367994)Termination phase: Saturation
% 3.82/1.13 % (367994)Time elapsed: 0.129 s
% 3.82/1.13 % (367994)Peak memory usage: 13 MB
% 3.82/1.13 % (367994)Instructions burned: 131 (million)
% 3.82/1.13 % TRYING [5]
% 3.82/1.13 % (368005)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=486246848:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.82/1.13 % (367995)Instruction limit reached!
% 3.82/1.13 % (367995)------------------------------
% 3.82/1.13 % (367995)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (367995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (367995)CaDiCaL version: 2.1.3
% 3.82/1.13 % (367995)Termination reason: Instruction limit
% 3.82/1.13 % (367995)Termination phase: Saturation
% 3.82/1.13 % (367995)Time elapsed: 0.150 s
% 3.82/1.13 % (367995)Peak memory usage: 12 MB
% 3.82/1.13 % (367995)Instructions burned: 160 (million)
% 3.82/1.13 % TRYING [5]
% 3.82/1.13 % (368006)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=1210858094:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.82/1.13 % (368008)ott-21_1_sil=16000:fs=off:random_seed=2909478645:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 3.82/1.13 % (368005)Instruction limit reached!
% 3.82/1.13 % (368005)------------------------------
% 3.82/1.13 % (368005)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (368005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (368005)CaDiCaL version: 2.1.3
% 3.82/1.13 % (368005)Termination reason: Instruction limit
% 3.82/1.13 % (368005)Termination phase: Saturation
% 3.82/1.13 % (368005)Time elapsed: 0.125 s
% 3.82/1.13 % (368005)Peak memory usage: 12 MB
% 3.82/1.13 % (368005)Instructions burned: 131 (million)
% 3.82/1.13 % (368011)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=587700268:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.82/1.13 % (368008)Instruction limit reached!
% 3.82/1.13 % (368008)------------------------------
% 3.82/1.13 % (368008)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (368008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (368008)CaDiCaL version: 2.1.3
% 3.82/1.13 % (368008)Termination reason: Instruction limit
% 3.82/1.13 % (368008)Termination phase: Saturation
% 3.82/1.13 % (368008)Time elapsed: 0.162 s
% 3.82/1.13 % (368008)Peak memory usage: 12 MB
% 3.82/1.13 % (368008)Instructions burned: 181 (million)
% 3.82/1.13 % (368003)Instruction limit reached!
% 3.82/1.13 % (368003)------------------------------
% 3.82/1.13 % (368003)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (368003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (368003)CaDiCaL version: 2.1.3
% 3.82/1.13 % (368003)Termination reason: Instruction limit
% 3.82/1.13 % (368003)Termination phase: Finite model building SAT solving
% 3.82/1.13 % (368003)Time elapsed: 0.335 s
% 3.82/1.13 % (368003)Peak memory usage: 14 MB
% 3.82/1.13 % (368003)Instructions burned: 716 (million)
% 3.82/1.13 % (368013)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3255098229:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 3.82/1.13 % TRYING [1]
% 3.82/1.13 % TRYING [2]
% 3.82/1.13 % TRYING [3]
% 3.82/1.13 % TRYING [4]
% 3.82/1.13 % (368014)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2336745937:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.82/1.13 % TRYING [5]
% 3.82/1.13 % (368006) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-367984-368006"...
% 3.82/1.13 % (368006)...printing done.
% 3.82/1.13 % (368006)Refutation found. Thanks to Tanya!
% 3.82/1.13 % SZS status Unsatisfiable for theBenchmark
% 3.82/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.82/1.13 % (368006)------------------------------
% 3.82/1.13 % (368006)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.82/1.13 % (368006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.13 % (368006)CaDiCaL version: 2.1.3
% 3.82/1.13 % (368006)Termination reason: Refutation
% 3.82/1.13 % (368006)Time elapsed: 0.383 s
% 3.82/1.13 % (368006)Peak memory usage: 15 MB
% 3.82/1.13 % (368006)Instructions burned: 395 (million)
% 3.82/1.13 % (367984)Success in time 0.617 s
% 3.82/1.13 % Vampire exiting
%------------------------------------------------------------------------------