%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL083-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 : 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:57:36 AM UTC 2026
% Result : Unsatisfiable 4.12s 1.09s
% Output : Refutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 92 ( 22 unt; 9 def)
% Number of atoms : 200 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 200 ( 92 ~; 99 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 11 ( 10 usr; 10 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 211 ( 0 sgn 211 !; 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,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_3) ).
fof(f4,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(implies(X2,X0),implies(X3,X0))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1))),implies(X5,implies(implies(X3,X1),implies(X4,X1))))),
inference(resolution,[],[f5,f4]) ).
fof(f7,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))
| is_a_theorem(implies(X4,implies(X1,X3))) ),
inference(resolution,[],[f5,f1]) ).
fof(f8,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2))))),
inference(resolution,[],[f7,f5]) ).
fof(f10,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X1,implies(X0,X1))),X2),implies(X3,X2))),
inference(resolution,[],[f8,f4]) ).
fof(f16,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f17,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f29,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X1,implies(X0,X1))),X2))
| is_a_theorem(implies(X3,X2)) ),
inference(resolution,[],[f10,f1]) ).
fof(f39,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f17,f10]) ).
fof(f50,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f39]) ).
fof(f89,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,implies(X2,X1)),X2),implies(X3,X2)))),
inference(resolution,[],[f29,f2]) ).
fof(f99,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,implies(X1,X0)),X1),implies(X2,X1)),X3),implies(X4,X3))),
inference(resolution,[],[f89,f4]) ).
fof(f108,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,implies(X1,X2))))),
inference(resolution,[],[f99,f7]) ).
fof(f117,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X2)))) ),
inference(resolution,[],[f108,f1]) ).
fof(f119,definition,
( spl0_4
<=> ! [X2,X1,X3] : is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f120,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X2))))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f121,plain,
( spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f117,f16,f119]) ).
fof(f122,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(X2,X1),implies(X3,X1)))))
| ~ spl0_4 ),
inference(resolution,[],[f120,f7]) ).
fof(f137,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(implies(X2,X1),implies(X3,X1)))) )
| ~ spl0_4 ),
inference(resolution,[],[f122,f1]) ).
fof(f139,definition,
( spl0_5
<=> ! [X2,X1,X3] : is_a_theorem(implies(X1,implies(implies(X2,X1),implies(X3,X1)))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f140,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(X2,X1),implies(X3,X1))))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f141,plain,
( spl0_5
| spl0_2
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f137,f119,f16,f139]) ).
fof(f144,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X0),implies(X2,X0)))
| ~ is_a_theorem(X0) )
| ~ spl0_5 ),
inference(resolution,[],[f140,f1]) ).
fof(f146,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(implies(implies(implies(X1,X0),X2),implies(X3,X2)))
| ~ is_a_theorem(X0) )
| ~ spl0_5 ),
inference(resolution,[],[f144,f4]) ).
fof(f190,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X3,X2)) )
| ~ spl0_5 ),
inference(resolution,[],[f146,f1]) ).
fof(f280,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(implies(X1,implies(implies(X0,X2),implies(X3,X2))))
| ~ is_a_theorem(X0) )
| ~ spl0_5 ),
inference(resolution,[],[f190,f2]) ).
fof(f311,plain,
( ! [X2,X3,X0,X1,X4] :
( is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(X4,X3)))
| ~ is_a_theorem(X0) )
| ~ spl0_5 ),
inference(resolution,[],[f280,f4]) ).
fof(f921,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X4,X3)) )
| ~ spl0_5 ),
inference(resolution,[],[f311,f1]) ).
fof(f1028,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(X2,implies(implies(X3,X4),implies(X4,X4))))) )
| ~ spl0_5 ),
inference(resolution,[],[f921,f6]) ).
fof(f1055,definition,
( spl0_35
<=> ! [X4,X2,X1,X3] : is_a_theorem(implies(X1,implies(X2,implies(implies(X3,X4),implies(X4,X4))))) ),
introduced(definition,[new_symbols(definition,[spl0_35])],[avatar_definition]) ).
fof(f1056,plain,
( ! [X2,X3,X1,X4] : is_a_theorem(implies(X1,implies(X2,implies(implies(X3,X4),implies(X4,X4)))))
| ~ spl0_35 ),
inference(avatar_component_clause,[],[f1055]) ).
fof(f1057,plain,
( spl0_35
| spl0_2
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f1028,f139,f16,f1055]) ).
fof(f1078,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))) )
| ~ spl0_35 ),
inference(resolution,[],[f1056,f1]) ).
fof(f1080,definition,
( spl0_36
<=> ! [X2,X1,X3] : is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))) ),
introduced(definition,[new_symbols(definition,[spl0_36])],[avatar_definition]) ).
fof(f1081,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3))))
| ~ spl0_36 ),
inference(avatar_component_clause,[],[f1080]) ).
fof(f1082,plain,
( spl0_36
| spl0_2
| ~ spl0_35 ),
inference(avatar_split_clause,[],[f1078,f1055,f16,f1080]) ).
fof(f1112,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) )
| ~ spl0_36 ),
inference(resolution,[],[f1081,f1]) ).
fof(f1114,definition,
( spl0_39
<=> ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) ),
introduced(definition,[new_symbols(definition,[spl0_39])],[avatar_definition]) ).
fof(f1115,plain,
( ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,X2)))
| ~ spl0_39 ),
inference(avatar_component_clause,[],[f1114]) ).
fof(f1116,plain,
( spl0_39
| spl0_2
| ~ spl0_36 ),
inference(avatar_split_clause,[],[f1112,f1080,f16,f1114]) ).
fof(f1120,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),implies(X2,X1)))
| ~ spl0_39 ),
inference(resolution,[],[f1115,f4]) ).
fof(f1133,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X1,X1)) )
| ~ spl0_39 ),
inference(resolution,[],[f1115,f1]) ).
fof(f1148,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X0,X1)))
| ~ spl0_39 ),
inference(resolution,[],[f1133,f99]) ).
fof(f1193,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0)))
| ~ spl0_39 ),
inference(resolution,[],[f1148,f4]) ).
fof(f1219,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X0),X1))
| is_a_theorem(implies(X2,X1)) )
| ~ spl0_39 ),
inference(resolution,[],[f1120,f1]) ).
fof(f1452,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1))))
| ~ spl0_39 ),
inference(resolution,[],[f1219,f2]) ).
fof(f1479,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),implies(X1,X2)),implies(X3,implies(X1,X2))))
| ~ spl0_39 ),
inference(resolution,[],[f1193,f4]) ).
fof(f1633,plain,
( ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),X0),implies(X2,X0)),X3),implies(X4,X3)))
| ~ spl0_39 ),
inference(resolution,[],[f1452,f4]) ).
fof(f1984,plain,
( ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(X3,X1)),implies(X4,implies(X3,X1))))
| ~ spl0_39 ),
inference(resolution,[],[f1479,f4]) ).
fof(f3337,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),X0),implies(X2,X0)),X3))
| is_a_theorem(implies(X4,X3)) )
| ~ spl0_39 ),
inference(resolution,[],[f1633,f1]) ).
fof(f3405,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X3,X1)))
| is_a_theorem(implies(X4,implies(X3,X1))) )
| ~ spl0_39 ),
inference(resolution,[],[f1984,f1]) ).
fof(f3695,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))))
| ~ spl0_39 ),
inference(resolution,[],[f3405,f2]) ).
fof(f3766,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) )
| ~ spl0_39 ),
inference(resolution,[],[f3695,f1]) ).
fof(f3785,definition,
( spl0_101
<=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) ),
introduced(definition,[new_symbols(definition,[spl0_101])],[avatar_definition]) ).
fof(f3786,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2)))
| ~ spl0_101 ),
inference(avatar_component_clause,[],[f3785]) ).
fof(f3787,plain,
( spl0_101
| spl0_2
| ~ spl0_39 ),
inference(avatar_split_clause,[],[f3766,f1114,f16,f3785]) ).
fof(f3795,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),implies(implies(X0,X1),X2)),implies(X3,implies(implies(X0,X1),X2))))
| ~ spl0_101 ),
inference(resolution,[],[f3786,f4]) ).
fof(f15697,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(implies(X2,X3),X2),X2))))
| ~ spl0_39
| ~ spl0_101 ),
inference(resolution,[],[f3795,f3337]) ).
fof(f16111,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) )
| ~ spl0_39
| ~ spl0_101 ),
inference(resolution,[],[f15697,f1]) ).
fof(f16130,definition,
( spl0_226
<=> ! [X2,X1,X3] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) ),
introduced(definition,[new_symbols(definition,[spl0_226])],[avatar_definition]) ).
fof(f16131,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2)))
| ~ spl0_226 ),
inference(avatar_component_clause,[],[f16130]) ).
fof(f16132,plain,
( spl0_226
| spl0_2
| ~ spl0_39
| ~ spl0_101 ),
inference(avatar_split_clause,[],[f16111,f3785,f1114,f16,f16130]) ).
fof(f16223,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) )
| ~ spl0_226 ),
inference(resolution,[],[f16131,f1]) ).
fof(f16232,definition,
( spl0_227
<=> ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_227])],[avatar_definition]) ).
fof(f16233,plain,
( ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
| ~ spl0_227 ),
inference(avatar_component_clause,[],[f16232]) ).
fof(f16234,plain,
( spl0_227
| spl0_2
| ~ spl0_226 ),
inference(avatar_split_clause,[],[f16223,f16130,f16,f16232]) ).
fof(f16283,plain,
( $false
| ~ spl0_227 ),
inference(resolution,[],[f16233,f3]) ).
fof(f16290,plain,
~ spl0_227,
inference(avatar_contradiction_clause,[],[f16283]) ).
cnf(s8,plain,
~ spl0_2,
inference(sat_conversion,[],[f50]) ).
cnf(s11,plain,
( spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f121]) ).
cnf(s12,plain,
( spl0_2
| ~ spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f141]) ).
cnf(s63,plain,
( spl0_2
| ~ spl0_5
| spl0_35 ),
inference(sat_conversion,[],[f1057]) ).
cnf(s64,plain,
( spl0_2
| ~ spl0_35
| spl0_36 ),
inference(sat_conversion,[],[f1082]) ).
cnf(s68,plain,
( spl0_2
| ~ spl0_36
| spl0_39 ),
inference(sat_conversion,[],[f1116]) ).
cnf(s199,plain,
( spl0_2
| ~ spl0_39
| spl0_101 ),
inference(sat_conversion,[],[f3787]) ).
cnf(s600,plain,
( spl0_2
| ~ spl0_39
| ~ spl0_101
| spl0_226 ),
inference(sat_conversion,[],[f16132]) ).
cnf(s606,plain,
( spl0_2
| ~ spl0_226
| spl0_227 ),
inference(sat_conversion,[],[f16234]) ).
cnf(s608,plain,
~ spl0_227,
inference(sat_conversion,[],[f16290]) ).
cnf(s609,plain,
( spl0_2
| ~ spl0_226 ),
inference(rat,[],[s606,s608]) ).
cnf(s610,plain,
~ spl0_226,
inference(rat,[],[s609,s8]) ).
cnf(s612,plain,
spl0_4,
inference(rat,[],[s11,s8]) ).
cnf(s615,plain,
spl0_5,
inference(rat,[],[s12,s8,s612]) ).
cnf(s632,plain,
spl0_35,
inference(rat,[],[s63,s8,s615]) ).
cnf(s640,plain,
spl0_36,
inference(rat,[],[s64,s8,s632]) ).
cnf(s691,plain,
spl0_39,
inference(rat,[],[s68,s8,s640]) ).
cnf(s713,plain,
~ spl0_101,
inference(rat,[],[s600,s610,s8,s691]) ).
cnf(s716,plain,
$false,
inference(rat,[],[s199,s8,s713,s691]) ).
fof(f16291,plain,
$false,
inference(avatar_sat_refutation,[],[s716]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL083-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41 % Computer : n001.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Sun Sep 27 15:27:01 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.46 Running first-order model finding
% 0.16/0.46 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.12/1.09 % (3704746)Will run a generic schedule for satisfiability detection.
% 4.12/1.09 % (3704753)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2646201816:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 4.12/1.09 % (3704752)% WARNING: option uhcvi not known.
% 4.12/1.09 % (3704751)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1172130037_3000 on theBenchmark for (3000ds/0Mi)
% 4.12/1.09 % (3704754)dis+10_1_sil=32000:sp=arity:random_seed=3954520587:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 4.12/1.09 % (3704755)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1963353001:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 4.12/1.09 % (3704756)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3923790326:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 4.12/1.09 % (3704757)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3587941635:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 4.12/1.09 % TRYING [1]
% 4.12/1.09 % TRYING [2]
% 4.12/1.09 % (3704752)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2380078411:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 4.12/1.09 % TRYING [3]
% 4.12/1.09 % TRYING [4]
% 4.12/1.09 % (3704754)Instruction limit reached!
% 4.12/1.09 % (3704754)------------------------------
% 4.12/1.09 % (3704754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.12/1.09 % (3704754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.09 % (3704754)CaDiCaL version: 2.1.3
% 4.12/1.09 % (3704754)Termination reason: Instruction limit
% 4.12/1.09 % (3704754)Termination phase: Saturation
% 4.12/1.09 % (3704754)Time elapsed: 0.100 s
% 4.12/1.09 % (3704754)Peak memory usage: 11 MB
% 4.12/1.09 % (3704754)Instructions burned: 103 (million)
% 4.12/1.09 % (3704755)Instruction limit reached!
% 4.12/1.09 % (3704755)------------------------------
% 4.12/1.09 % (3704755)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.12/1.09 % (3704755)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.09 % (3704755)CaDiCaL version: 2.1.3
% 4.12/1.09 % (3704755)Termination reason: Instruction limit
% 4.12/1.09 % (3704755)Termination phase: Saturation
% 4.12/1.09 % (3704755)Time elapsed: 0.108 s
% 4.12/1.09 % (3704755)Peak memory usage: 11 MB
% 4.12/1.09 % (3704755)Instructions burned: 116 (million)
% 4.12/1.09 % TRYING [5]
% 4.12/1.09 % (3704765)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2730539498:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 4.12/1.09 % TRYING [1]
% 4.12/1.09 % TRYING [2]
% 4.12/1.09 % TRYING [3]
% 4.12/1.09 % (3704756)Instruction limit reached!
% 4.12/1.09 % (3704756)------------------------------
% 4.12/1.09 % (3704756)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.12/1.09 % (3704756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.09 % (3704756)CaDiCaL version: 2.1.3
% 4.12/1.09 % (3704756)Termination reason: Instruction limit
% 4.12/1.09 % (3704756)Termination phase: Saturation
% 4.12/1.09 % (3704756)Time elapsed: 0.127 s
% 4.12/1.09 % (3704756)Peak memory usage: 12 MB
% 4.12/1.09 % (3704756)Instructions burned: 131 (million)
% 4.12/1.09 % TRYING [4]
% 4.12/1.09 % (3704766)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1995537888:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.12/1.09 % (3704757)Instruction limit reached!
% 4.12/1.09 % (3704757)------------------------------
% 4.12/1.09 % (3704757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.12/1.09 % (3704757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.09 % (3704757)CaDiCaL version: 2.1.3
% 4.12/1.09 % (3704757)Termination reason: Instruction limit
% 4.12/1.09 % (3704757)Termination phase: Saturation
% 4.12/1.09 % (3704757)Time elapsed: 0.153 s
% 4.12/1.09 % (3704757)Peak memory usage: 12 MB
% 4.12/1.09 % (3704757)Instructions burned: 159 (million)
% 4.12/1.09 % (3704769)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=3559928066:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.12/1.09 % (3704772)ott-21_1_sil=16000:fs=off:random_seed=718706721:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.12/1.09 % TRYING [5]
% 4.12/1.09 % (3704766)Instruction limit reached!
% 4.12/1.09 % (3704766)------------------------------
% 4.12/1.09 % (3704766)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.12/1.09 % (3704766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.09 % (3704766)CaDiCaL version: 2.1.3
% 4.12/1.09 % (3704766)Termination reason: Instruction limit
% 4.12/1.09 % (3704766)Termination phase: Saturation
% 4.12/1.09 % (3704766)Time elapsed: 0.119 s
% 4.12/1.09 % (3704766)Peak memory usage: 11 MB
% 4.12/1.09 % (3704766)Instructions burned: 131 (million)
% 4.12/1.09 % (3704775)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=6013049:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 4.12/1.09 % (3704772)Instruction limit reached!
% 4.12/1.09 % (3704772)------------------------------
% 4.12/1.09 % (3704772)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.12/1.09 % (3704772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.09 % (3704772)CaDiCaL version: 2.1.3
% 4.12/1.09 % (3704772)Termination reason: Instruction limit
% 4.12/1.09 % (3704772)Termination phase: Saturation
% 4.12/1.09 % (3704772)Time elapsed: 0.164 s
% 4.12/1.09 % (3704772)Peak memory usage: 12 MB
% 4.12/1.09 % (3704772)Instructions burned: 180 (million)
% 4.12/1.09 % (3704777)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2740093471:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 4.12/1.09 % TRYING [1]
% 4.12/1.09 % TRYING [2]
% 4.12/1.09 % TRYING [3]
% 4.12/1.09 % TRYING [4]
% 4.12/1.09 % TRYING [5]
% 4.12/1.09 % (3704769) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3704746-3704769"...
% 4.12/1.09 % (3704769)...printing done.
% 4.12/1.09 % (3704769)Refutation found. Thanks to Tanya!
% 4.12/1.09 % SZS status Unsatisfiable for theBenchmark
% 4.12/1.09 % SZS output start Proof for theBenchmark
% See solution above
% 4.12/1.09 % (3704769)------------------------------
% 4.12/1.09 % (3704769)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.12/1.09 % (3704769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.09 % (3704769)CaDiCaL version: 2.1.3
% 4.12/1.09 % (3704769)Termination reason: Refutation
% 4.12/1.09 % (3704769)Time elapsed: 0.413 s
% 4.12/1.09 % (3704769)Peak memory usage: 16 MB
% 4.12/1.09 % (3704769)Instructions burned: 439 (million)
% 4.12/1.09 % (3704746)Success in time 0.618 s
% 4.12/1.09 % Vampire exiting
%------------------------------------------------------------------------------