%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL273-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:51:50 AM UTC 2026
% Result : Unsatisfiable 8.38s 2.26s
% Output : Refutation 8.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 30
% Syntax : Number of formulae : 123 ( 78 unt; 19 def)
% Number of atoms : 185 ( 32 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 123 ( 61 ~; 57 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 16 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn 81 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(and(p,q),and(q,p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),not(or(not(not(or(not(q),not(p)))),not(or(not(p),not(q)))))))),
inference(definition_unfolding,[],[f11,f12,f9,f9]) ).
fof(f20,definition,
sF0 = not(p),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
not(p) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = not(q),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
not(q) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = or(sF0,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
or(sF0,sF1) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = not(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
not(sF2) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(sF1,sF0),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(sF1,sF0) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = or(sF4,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
or(sF4,sF6) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = not(sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
not(sF7) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = not(sF6),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
not(sF6) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = or(sF9,sF3),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
or(sF9,sF3) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = not(sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
not(sF10) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF12 = or(sF8,sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
or(sF8,sF11) = sF12,
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
sF13 = not(sF12),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f47,plain,
not(sF12) = sF13,
inference(reorient_equations,[],[f46]) ).
fof(f48,plain,
~ theorem(sF13),
inference(definition_folding,[],[f19,f47,f45,f43,f41,f27,f25,f23,f21,f39,f33,f31,f21,f23,f37,f35,f33,f31,f21,f23,f29,f27,f25,f23,f21]) ).
fof(f49,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f62,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f18,f49]) ).
fof(f67,plain,
! [X0] :
( ~ theorem(or(sF8,X0))
| theorem(X0)
| ~ theorem(sF7) ),
inference(superposition,[],[f18,f37]) ).
fof(f68,plain,
! [X0] :
( ~ theorem(or(sF11,X0))
| theorem(X0)
| ~ theorem(sF10) ),
inference(superposition,[],[f18,f43]) ).
fof(f70,definition,
( spl14_1
<=> theorem(sF10) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f72,plain,
( ~ theorem(sF10)
| spl14_1 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f74,definition,
( spl14_2
<=> ! [X0] :
( ~ theorem(or(sF11,X0))
| theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f75,plain,
( ! [X0] :
( ~ theorem(or(sF11,X0))
| theorem(X0) )
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f76,plain,
( ~ spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f68,f74,f70]) ).
fof(f78,definition,
( spl14_3
<=> theorem(sF7) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f80,plain,
( ~ theorem(sF7)
| spl14_3 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f82,definition,
( spl14_4
<=> ! [X0] :
( ~ theorem(or(sF8,X0))
| theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
fof(f83,plain,
( ! [X0] :
( ~ theorem(or(sF8,X0))
| theorem(X0) )
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f84,plain,
( ~ spl14_3
| spl14_4 ),
inference(avatar_split_clause,[],[f67,f82,f78]) ).
fof(f117,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f117,f18]) ).
fof(f213,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f235,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f213,f18]) ).
fof(f240,plain,
theorem(or(not(sF12),or(sF11,sF8))),
inference(superposition,[],[f213,f45]) ).
fof(f242,plain,
theorem(or(not(or(sF1,sF0)),sF2)),
inference(superposition,[],[f213,f25]) ).
fof(f243,plain,
theorem(or(not(or(sF0,sF1)),sF5)),
inference(superposition,[],[f213,f31]) ).
fof(f247,plain,
theorem(or(not(sF2),sF5)),
inference(forward_demodulation,[],[f243,f25]) ).
fof(f248,plain,
theorem(or(not(sF5),sF2)),
inference(forward_demodulation,[],[f242,f31]) ).
fof(f250,plain,
theorem(or(sF13,or(sF11,sF8))),
inference(forward_demodulation,[],[f240,f47]) ).
fof(f254,plain,
theorem(or(sF3,sF5)),
inference(forward_demodulation,[],[f247,f27]) ).
fof(f255,plain,
theorem(or(sF6,sF2)),
inference(forward_demodulation,[],[f248,f33]) ).
fof(f268,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f62,f18]) ).
fof(f290,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f268,f213]) ).
fof(f294,plain,
! [X0,X1] :
( ~ theorem(or(sF3,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF2)) ),
inference(superposition,[],[f268,f27]) ).
fof(f296,plain,
! [X0,X1] :
( ~ theorem(or(sF6,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF5)) ),
inference(superposition,[],[f268,f33]) ).
fof(f299,plain,
! [X0,X1] :
( ~ theorem(or(sF11,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF10)) ),
inference(superposition,[],[f268,f43]) ).
fof(f323,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f410,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f411,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f410,f268]) ).
fof(f421,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f411,f323]) ).
fof(f459,plain,
theorem(or(sF11,or(sF13,sF8))),
inference(resolution,[],[f250,f118]) ).
fof(f506,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f421,f235]) ).
fof(f521,plain,
theorem(or(sF11,sF10)),
inference(superposition,[],[f421,f43]) ).
fof(f591,plain,
theorem(or(sF11,or(sF8,sF13))),
inference(resolution,[],[f459,f290]) ).
fof(f602,plain,
! [X0] :
( theorem(or(X0,or(sF8,sF13)))
| ~ theorem(or(X0,sF10)) ),
inference(resolution,[],[f299,f591]) ).
fof(f624,definition,
( spl14_21
<=> theorem(or(sF8,sF13)) ),
introduced(definition,[new_symbols(definition,[spl14_21])],[avatar_definition]) ).
fof(f625,plain,
( ~ theorem(or(sF8,sF13))
| spl14_21 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f626,plain,
( theorem(or(sF8,sF13))
| ~ spl14_21 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f636,plain,
! [X0] :
( theorem(or(X0,not(sF3)))
| ~ theorem(or(X0,sF2)) ),
inference(resolution,[],[f294,f506]) ).
fof(f637,plain,
! [X0] :
( ~ theorem(or(X0,sF2))
| theorem(or(X0,sF4)) ),
inference(forward_demodulation,[],[f636,f29]) ).
fof(f649,plain,
theorem(or(sF6,sF4)),
inference(resolution,[],[f637,f255]) ).
fof(f651,plain,
theorem(or(sF4,sF6)),
inference(resolution,[],[f649,f235]) ).
fof(f652,plain,
theorem(sF7),
inference(forward_demodulation,[],[f651,f35]) ).
fof(f653,plain,
( $false
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f652,f80]) ).
fof(f654,plain,
spl14_3,
inference(avatar_contradiction_clause,[],[f653]) ).
fof(f655,plain,
( theorem(sF13)
| ~ spl14_4
| ~ spl14_21 ),
inference(resolution,[],[f83,f626]) ).
fof(f660,plain,
( $false
| ~ spl14_4
| ~ spl14_21 ),
inference(forward_subsumption_resolution,[],[f655,f48]) ).
fof(f661,plain,
( ~ spl14_4
| ~ spl14_21 ),
inference(avatar_contradiction_clause,[],[f660]) ).
fof(f672,plain,
! [X0] :
( theorem(or(X0,not(sF6)))
| ~ theorem(or(X0,sF5)) ),
inference(resolution,[],[f296,f506]) ).
fof(f673,plain,
! [X0] :
( ~ theorem(or(X0,sF5))
| theorem(or(X0,sF9)) ),
inference(forward_demodulation,[],[f672,f39]) ).
fof(f689,plain,
theorem(or(sF3,sF9)),
inference(resolution,[],[f673,f254]) ).
fof(f693,plain,
theorem(or(sF9,sF3)),
inference(resolution,[],[f689,f235]) ).
fof(f694,plain,
theorem(sF10),
inference(forward_demodulation,[],[f693,f41]) ).
fof(f695,plain,
( $false
| spl14_1 ),
inference(forward_subsumption_resolution,[],[f694,f72]) ).
fof(f696,plain,
spl14_1,
inference(avatar_contradiction_clause,[],[f695]) ).
fof(f700,plain,
( theorem(or(sF8,sF13))
| ~ theorem(or(sF11,sF10))
| ~ spl14_2 ),
inference(resolution,[],[f75,f602]) ).
fof(f702,plain,
( ~ theorem(or(sF11,sF10))
| ~ spl14_2
| spl14_21 ),
inference(forward_subsumption_resolution,[],[f700,f625]) ).
fof(f705,plain,
( $false
| ~ spl14_2
| spl14_21 ),
inference(forward_subsumption_resolution,[],[f702,f521]) ).
fof(f706,plain,
( ~ spl14_2
| spl14_21 ),
inference(avatar_contradiction_clause,[],[f705]) ).
cnf(s1,plain,
( ~ spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f76]) ).
cnf(s2,plain,
( ~ spl14_3
| spl14_4 ),
inference(sat_conversion,[],[f84]) ).
cnf(s13,plain,
spl14_3,
inference(sat_conversion,[],[f654]) ).
cnf(s14,plain,
( ~ spl14_4
| ~ spl14_21 ),
inference(sat_conversion,[],[f661]) ).
cnf(s16,plain,
spl14_1,
inference(sat_conversion,[],[f696]) ).
cnf(s18,plain,
( ~ spl14_2
| spl14_21 ),
inference(sat_conversion,[],[f706]) ).
cnf(s19,plain,
spl14_4,
inference(rat,[],[s2,s13]) ).
cnf(s20,plain,
~ spl14_21,
inference(rat,[],[s14,s19]) ).
cnf(s21,plain,
~ spl14_2,
inference(rat,[],[s18,s20]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s1,s21,s16]) ).
fof(f707,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL273-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n011.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 15:32:00 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.45 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.38/2.26 % (2564295)Input is clausal, will run a generic CNF schedule.
% 8.38/2.26 % (2564300)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3048937844:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 8.38/2.26 % (2564301)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1303877933:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 8.38/2.26 % (2564302)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2279146041:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 8.38/2.26 % (2564303)lrs+10_1_sil=8000:sp=occurrence:random_seed=2588892624:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 8.38/2.26 % (2564304)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=735499008:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 8.38/2.26 % (2564305)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=750872868:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 8.38/2.26 % (2564306)dis-21_1_sil=8000:lcm=predicate:random_seed=3353496402:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 8.38/2.26 % (2564303)Instruction limit reached!
% 8.38/2.26 % (2564303)------------------------------
% 8.38/2.26 % (2564303)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564303)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564303)Termination reason: Instruction limit
% 8.38/2.26 % (2564303)Termination phase: Saturation
% 8.38/2.26 % (2564303)Time elapsed: 0.108 s
% 8.38/2.26 % (2564303)Peak memory usage: 89 MB
% 8.38/2.26 % (2564303)Instructions burned: 107 (million)
% 8.38/2.26 % (2564306)Instruction limit reached!
% 8.38/2.26 % (2564306)------------------------------
% 8.38/2.26 % (2564306)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564306)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564306)Termination reason: Instruction limit
% 8.38/2.26 % (2564306)Termination phase: Saturation
% 8.38/2.26 % (2564306)Time elapsed: 0.097 s
% 8.38/2.26 % (2564306)Peak memory usage: 87 MB
% 8.38/2.26 % (2564306)Instructions burned: 118 (million)
% 8.38/2.26 % (2564304)Instruction limit reached!
% 8.38/2.26 % (2564304)------------------------------
% 8.38/2.26 % (2564304)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564304)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564304)Termination reason: Instruction limit
% 8.38/2.26 % (2564304)Termination phase: Saturation
% 8.38/2.26 % (2564304)Time elapsed: 0.114 s
% 8.38/2.26 % (2564304)Peak memory usage: 88 MB
% 8.38/2.26 % (2564304)Instructions burned: 114 (million)
% 8.38/2.26 % (2564305)Instruction limit reached!
% 8.38/2.26 % (2564305)------------------------------
% 8.38/2.26 % (2564305)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564305)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564305)Termination reason: Instruction limit
% 8.38/2.26 % (2564305)Termination phase: Saturation
% 8.38/2.26 % (2564305)Time elapsed: 0.180 s
% 8.38/2.26 % (2564305)Peak memory usage: 90 MB
% 8.38/2.26 % (2564305)Instructions burned: 180 (million)
% 8.38/2.26 % (2564315)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3960779621:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2995 on theBenchmark for (2995ds/189Mi)
% 8.38/2.26 % (2564314)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3604883983:i=143:sd=2:aac=none:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/143Mi)
% 8.38/2.26 % (2564315)Refutation not found, incomplete strategy
% 8.38/2.26 % (2564315)------------------------------
% 8.38/2.26 % (2564315)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564314)Refutation not found, incomplete strategy
% 8.38/2.26 % (2564314)------------------------------
% 8.38/2.26 % (2564314)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564315)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564315)Termination reason: Refutation not found, incomplete strategy
% 8.38/2.26 % (2564315)Time elapsed: 0.002 s
% 8.38/2.26 % (2564315)Peak memory usage: 87 MB
% 8.38/2.26 % (2564314)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564314)Termination reason: Refutation not found, incomplete strategy
% 8.38/2.26 % (2564314)Time elapsed: 0.002 s
% 8.38/2.26 % (2564314)Peak memory usage: 88 MB
% 8.38/2.26 % (2564316)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3124229749:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 8.38/2.26 % (2564316)Refutation not found, incomplete strategy
% 8.38/2.26 % (2564316)------------------------------
% 8.38/2.26 % (2564316)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564316)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564316)Termination reason: Refutation not found, incomplete strategy
% 8.38/2.26 % (2564316)Time elapsed: 0.002 s
% 8.38/2.26 % (2564316)Peak memory usage: 88 MB
% 8.38/2.26 % (2564316)Instructions burned: 1 (million)
% 8.38/2.26 % (2564317)lrs+10_64_to=lpo:sil=8000:random_seed=1097698046:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 8.38/2.26 % (2564317)Instruction limit reached!
% 8.38/2.26 % (2564317)------------------------------
% 8.38/2.26 % (2564317)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.26 % (2564317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.26 % (2564317)CaDiCaL version: 2.1.3
% 8.38/2.26 % (2564317)Termination reason: Instruction limit
% 8.38/2.26 % (2564317)Termination phase: Saturation
% 8.38/2.26 % (2564317)Time elapsed: 0.118 s
% 8.38/2.26 % (2564317)Peak memory usage: 89 MB
% 8.38/2.26 % (2564317)Instructions burned: 127 (million)
% 8.38/2.26 % (2564300)First to succeed.
% 8.38/2.26 % (2564300)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2564295"
% 8.38/2.26 % (2564315)------------------------------
% 8.38/2.26 % (2564315)------------------------------
% 8.38/2.26 % (2564314)------------------------------
% 8.38/2.26 % (2564314)------------------------------
% 8.38/2.26 % (2564316)------------------------------
% 8.38/2.26 % (2564316)------------------------------
% 8.38/2.26 % (2564300)Refutation found. Thanks to Tanya!
% 8.38/2.26 % SZS status Unsatisfiable for theBenchmark
% 8.38/2.26 % SZS output start Proof for theBenchmark
% See solution above
% 8.98/2.46 % (2564300)------------------------------
% 8.98/2.46 % (2564300)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.98/2.46 % (2564300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.98/2.46 % (2564300)CaDiCaL version: 2.1.3
% 8.98/2.46 % (2564300)Termination reason: Refutation
% 8.98/2.46 % (2564300)Time elapsed: 0.667 s
% 8.98/2.46 % (2564300)Peak memory usage: 131 MB
% 8.98/2.46 % (2564300)Instructions burned: 1108 (million)
% 8.98/2.46 % (2564300)------------------------------
% 8.98/2.46 % (2564300)------------------------------
% 8.98/2.46 % (2564295)Success in time 1.162 s
% 8.98/2.46 % Vampire exiting
%------------------------------------------------------------------------------