%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL256-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:13 AM UTC 2026
% Result : Unsatisfiable 5.53s 1.36s
% Output : Refutation 5.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 7
% Syntax : Number of formulae : 80 ( 21 unt; 2 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 154 ( 79 ~; 73 |; 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 : 173 ( 0 sgn 173 !; 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(not(not(implies(p,p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_not_not_implies) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f4]) ).
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(f29,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,not(X1)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f24,f7]) ).
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(f32,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f25,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,[],[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(f41,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(not(X0)),not(X0)),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f29,f3]) ).
fof(f45,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f30,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(f87,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(implies(not(X2),X0)) ),
inference(resolution,[],[f45,f28]) ).
fof(f175,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f87,f41]) ).
fof(f192,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(f207,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f192,f25]) ).
fof(f220,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f207,f1]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f220,f52]) ).
fof(f232,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f226,f2]) ).
fof(f244,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f232,f25]) ).
fof(f257,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f244,f24]) ).
fof(f272,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f257,f4]) ).
fof(f298,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f272,f25]) ).
fof(f334,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f298,f52]) ).
fof(f348,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X1),X2))),X3))),
inference(resolution,[],[f334,f4]) ).
fof(f351,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f334,f272]) ).
fof(f380,definition,
( spl0_8
<=> ! [X2] : ~ is_a_theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f381,plain,
( ! [X2] : ~ is_a_theorem(X2)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f380]) ).
fof(f395,plain,
( $false
| ~ spl0_8 ),
inference(resolution,[],[f381,f3]) ).
fof(f406,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f395]) ).
fof(f607,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X1,implies(X2,X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f351,f25]) ).
fof(f634,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f607,f220]) ).
fof(f666,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f634,f2]) ).
fof(f683,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f666,f25]) ).
fof(f685,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X2,X1)) ),
inference(resolution,[],[f666,f1]) ).
fof(f817,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,f683]) ).
fof(f1284,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
inference(resolution,[],[f348,f25]) ).
fof(f1321,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f1284,f220]) ).
fof(f1373,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f1321,f2]) ).
fof(f1414,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X3,implies(X0,X2))) ),
inference(resolution,[],[f1373,f685]) ).
fof(f1416,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f1373,f1]) ).
fof(f1454,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f1416,f30]) ).
fof(f2113,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f817,f2]) ).
fof(f2535,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(f6884,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f2535,f2]) ).
fof(f7030,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
inference(resolution,[],[f6884,f1414]) ).
fof(f7041,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
inference(resolution,[],[f6884,f25]) ).
fof(f7079,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
| is_a_theorem(X3) ),
inference(resolution,[],[f7030,f220]) ).
fof(f7338,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f7041,f817]) ).
fof(f12182,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,implies(not(X0),X3)),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f7079,f2113]) ).
fof(f17289,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f12182,f2113]) ).
fof(f19410,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(resolution,[],[f17289,f31]) ).
fof(f19621,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f19410,f1414]) ).
fof(f19772,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f19621,f220]) ).
fof(f20267,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f19772,f2113]) ).
fof(f20717,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f20267,f7338]) ).
fof(f20986,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f20717,f1454]) ).
fof(f21475,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f20986,f1454]) ).
fof(f21827,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f21475,f20267]) ).
fof(f21902,definition,
( spl0_594
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_594])],[avatar_definition]) ).
fof(f21903,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_594 ),
inference(avatar_component_clause,[],[f21902]) ).
fof(f21904,plain,
( spl0_594
| spl0_8 ),
inference(avatar_split_clause,[],[f21827,f380,f21902]) ).
fof(f21917,plain,
( ! [X0] :
( is_a_theorem(not(not(X0)))
| ~ is_a_theorem(X0) )
| ~ spl0_594 ),
inference(resolution,[],[f21903,f175]) ).
fof(f22068,plain,
( ~ is_a_theorem(implies(p,p))
| ~ spl0_594 ),
inference(resolution,[],[f21917,f5]) ).
fof(f22099,plain,
( $false
| ~ spl0_594 ),
inference(forward_subsumption_resolution,[],[f22068,f32]) ).
fof(f22100,plain,
~ spl0_594,
inference(avatar_contradiction_clause,[],[f22099]) ).
cnf(s19,plain,
~ spl0_8,
inference(sat_conversion,[],[f406]) ).
cnf(s1049,plain,
( spl0_8
| spl0_594 ),
inference(sat_conversion,[],[f21904]) ).
cnf(s1050,plain,
~ spl0_594,
inference(sat_conversion,[],[f22100]) ).
cnf(s1051,plain,
spl0_8,
inference(rat,[],[s1049,s1050]) ).
cnf(s1052,plain,
$false,
inference(rat,[],[s19,s1051]) ).
fof(f22101,plain,
$false,
inference(avatar_sat_refutation,[],[s1052]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL256-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.47 % Computer : n020.cluster.edu
% 0.23/0.47 % Model : x86_64 x86_64
% 0.23/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.47 % Memory : 8046.5625MB
% 0.23/0.47 % OS : Linux 6.8.0-71-generic
% 0.23/0.47 % CPULimit : 300
% 0.23/0.47 % WCLimit : 300
% 0.23/0.47 % DateTime : Sun Sep 27 15:32:19 UTC 2026
% 0.26/0.47 % CPUTime :
% 0.26/0.47 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.26/0.53 Running first-order model finding
% 0.26/0.53 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.53/1.36 % (3544257)Will run a generic schedule for satisfiability detection.
% 5.53/1.36 % (3544267)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3062937032:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.53/1.36 % (3544263)% WARNING: option uhcvi not known.
% 5.53/1.36 % (3544262)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1362473731_2999 on theBenchmark for (2999ds/0Mi)
% 5.53/1.36 % (3544264)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4120065879:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.53/1.36 % (3544265)dis+10_1_sil=32000:sp=arity:random_seed=2232364434:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.53/1.36 % (3544268)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=112612093:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.53/1.36 % (3544266)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2208687498:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.53/1.36 % (3544263)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=915325111:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.53/1.36 % TRYING [1]
% 5.53/1.36 % TRYING [2]
% 5.53/1.36 % TRYING [3]
% 5.53/1.36 % TRYING [4]
% 5.53/1.36 % (3544267)Instruction limit reached!
% 5.53/1.36 % (3544267)------------------------------
% 5.53/1.36 % (3544267)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544267)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544267)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544267)Termination reason: Instruction limit
% 5.53/1.36 % (3544267)Termination phase: Saturation
% 5.53/1.36 % (3544267)Time elapsed: 0.070 s
% 5.53/1.36 % (3544267)Peak memory usage: 13 MB
% 5.53/1.36 % (3544267)Instructions burned: 131 (million)
% 5.53/1.36 % TRYING [5]
% 5.53/1.36 % (3544276)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2822344033:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 5.53/1.36 % TRYING [1]
% 5.53/1.36 % TRYING [2]
% 5.53/1.36 % TRYING [3]
% 5.53/1.36 % TRYING [4]
% 5.53/1.36 % (3544265)Instruction limit reached!
% 5.53/1.36 % (3544265)------------------------------
% 5.53/1.36 % (3544265)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544265)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544265)Termination reason: Instruction limit
% 5.53/1.36 % (3544265)Termination phase: Saturation
% 5.53/1.36 % (3544265)Time elapsed: 0.101 s
% 5.53/1.36 % (3544265)Peak memory usage: 11 MB
% 5.53/1.36 % (3544265)Instructions burned: 103 (million)
% 5.53/1.36 % TRYING [5]
% 5.53/1.36 % (3544266)Instruction limit reached!
% 5.53/1.36 % (3544266)------------------------------
% 5.53/1.36 % (3544266)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544266)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544266)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544266)Termination reason: Instruction limit
% 5.53/1.36 % (3544266)Termination phase: Saturation
% 5.53/1.36 % (3544266)Time elapsed: 0.117 s
% 5.53/1.36 % (3544266)Peak memory usage: 11 MB
% 5.53/1.36 % (3544266)Instructions burned: 118 (million)
% 5.53/1.36 % (3544278)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=17043117:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.53/1.36 % (3544268)Instruction limit reached!
% 5.53/1.36 % (3544268)------------------------------
% 5.53/1.36 % (3544268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544268)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544268)Termination reason: Instruction limit
% 5.53/1.36 % (3544268)Termination phase: Saturation
% 5.53/1.36 % (3544268)Time elapsed: 0.146 s
% 5.53/1.36 % (3544268)Peak memory usage: 12 MB
% 5.53/1.36 % (3544268)Instructions burned: 159 (million)
% 5.53/1.36 % (3544279)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=2901986839:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.53/1.36 % (3544281)ott-21_1_sil=16000:fs=off:random_seed=2632646266:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.53/1.36 % (3544278)Instruction limit reached!
% 5.53/1.36 % (3544278)------------------------------
% 5.53/1.36 % (3544278)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544278)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544278)Termination reason: Instruction limit
% 5.53/1.36 % (3544278)Termination phase: Saturation
% 5.53/1.36 % (3544278)Time elapsed: 0.127 s
% 5.53/1.36 % (3544278)Peak memory usage: 12 MB
% 5.53/1.36 % (3544278)Instructions burned: 131 (million)
% 5.53/1.36 % (3544284)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1236372620:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 5.53/1.36 % (3544281)Instruction limit reached!
% 5.53/1.36 % (3544281)------------------------------
% 5.53/1.36 % (3544281)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544281)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544281)Termination reason: Instruction limit
% 5.53/1.36 % (3544281)Termination phase: Saturation
% 5.53/1.36 % (3544281)Time elapsed: 0.157 s
% 5.53/1.36 % (3544281)Peak memory usage: 12 MB
% 5.53/1.36 % (3544281)Instructions burned: 180 (million)
% 5.53/1.36 % TRYING [6]
% 5.53/1.36 % (3544286)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2351770771:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 5.53/1.36 % TRYING [1]
% 5.53/1.36 % TRYING [2]
% 5.53/1.36 % TRYING [3]
% 5.53/1.36 % TRYING [4]
% 5.53/1.36 % (3544276)Instruction limit reached!
% 5.53/1.36 % (3544276)------------------------------
% 5.53/1.36 % (3544276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544276)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544276)Termination reason: Instruction limit
% 5.53/1.36 % (3544276)Termination phase: Finite model building SAT solving
% 5.53/1.36 % (3544276)Time elapsed: 0.328 s
% 5.53/1.36 % (3544276)Peak memory usage: 14 MB
% 5.53/1.36 % (3544276)Instructions burned: 714 (million)
% 5.53/1.36 % TRYING [5]
% 5.53/1.36 % (3544288)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1987117835:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 5.53/1.36 % TRYING [6]
% 5.53/1.36 % TRYING [6]
% 5.53/1.36 % (3544279) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3544257-3544279"...
% 5.53/1.36 % (3544279)...printing done.
% 5.53/1.36 % (3544279)Refutation found. Thanks to Tanya!
% 5.53/1.36 % SZS status Unsatisfiable for theBenchmark
% 5.53/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 5.53/1.36 % (3544279)------------------------------
% 5.53/1.36 % (3544279)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.53/1.36 % (3544279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.36 % (3544279)CaDiCaL version: 2.1.3
% 5.53/1.36 % (3544279)Termination reason: Refutation
% 5.53/1.36 % (3544279)Time elapsed: 0.609 s
% 5.53/1.36 % (3544279)Peak memory usage: 17 MB
% 5.53/1.36 % (3544279)Instructions burned: 629 (million)
% 5.53/1.36 % (3544257)Success in time 0.816 s
% 5.53/1.36 % Vampire exiting
%------------------------------------------------------------------------------