%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL222-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 : n006.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:38 AM UTC 2026
% Result : Unsatisfiable 6.59s 1.92s
% Output : Refutation 8.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 20
% Syntax : Number of formulae : 123 ( 69 unt; 11 def)
% Number of atoms : 188 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 137 ( 72 ~; 63 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 134 ( 0 sgn 134 !; 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,negated_conjecture,
~ theorem(implies(implies(q,p),implies(or(or(p,q),r),or(p,r)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,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(f15,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(not(q),p)),or(not(or(or(p,q),r)),or(p,r)))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
fof(f17,definition,
sF0 = not(q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f18,plain,
not(q) = sF0,
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
sF1 = or(sF0,p),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f20,plain,
or(sF0,p) = sF1,
inference(reorient_equations,[],[f19]) ).
fof(f21,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f22,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF3 = or(p,q),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f24,plain,
or(p,q) = sF3,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF4 = or(sF3,r),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f26,plain,
or(sF3,r) = sF4,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF5 = not(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f28,plain,
not(sF4) = sF5,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF6 = or(p,r),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f30,plain,
or(p,r) = sF6,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF7 = or(sF5,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f32,plain,
or(sF5,sF6) = sF7,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF8 = or(sF2,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f34,plain,
or(sF2,sF7) = sF8,
inference(reorient_equations,[],[f33]) ).
fof(f35,plain,
~ theorem(sF8),
inference(definition_folding,[],[f16,f34,f32,f30,f28,f26,f24,f22,f20,f18]) ).
fof(f38,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f7,f14]) ).
fof(f55,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f15,f38]) ).
fof(f95,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f13,f7]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f95,f15]) ).
fof(f115,plain,
! [X0] : theorem(or(not(or(sF2,or(X0,sF7))),or(X0,sF8))),
inference(superposition,[],[f95,f34]) ).
fof(f116,plain,
! [X0] : theorem(or(not(or(sF5,or(X0,sF6))),or(X0,sF7))),
inference(superposition,[],[f95,f32]) ).
fof(f117,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f106,f38]) ).
fof(f135,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f151,plain,
theorem(or(not(r),sF6)),
inference(superposition,[],[f135,f30]) ).
fof(f158,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f173,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f158,f15]) ).
fof(f174,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f158,f106]) ).
fof(f176,plain,
theorem(or(not(sF3),or(q,p))),
inference(superposition,[],[f158,f24]) ).
fof(f179,plain,
theorem(or(not(sF4),or(r,sF3))),
inference(superposition,[],[f158,f26]) ).
fof(f187,plain,
theorem(or(sF5,or(r,sF3))),
inference(forward_demodulation,[],[f179,f28]) ).
fof(f189,plain,
! [X0] :
( ~ theorem(or(sF2,or(X0,sF7)))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f115,f15]) ).
fof(f230,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f55,f15]) ).
fof(f235,plain,
! [X0] :
( theorem(or(not(sF1),or(sF0,X0)))
| ~ theorem(or(not(p),X0)) ),
inference(superposition,[],[f55,f20]) ).
fof(f246,plain,
! [X0] :
( theorem(or(sF2,or(sF0,X0)))
| ~ theorem(or(not(p),X0)) ),
inference(forward_demodulation,[],[f235,f22]) ).
fof(f248,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f230,f158]) ).
fof(f249,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f230,f55]) ).
fof(f251,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X2,or(X1,X3))))
| theorem(or(X0,or(X1,or(X2,X3)))) ),
inference(resolution,[],[f230,f95]) ).
fof(f253,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f230,f135]) ).
fof(f262,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f248,f135]) ).
fof(f269,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f249,f158]) ).
fof(f272,plain,
! [X2,X3,X0,X1] :
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ),
inference(resolution,[],[f249,f95]) ).
fof(f282,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f10,f7]) ).
fof(f283,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f282,f230]) ).
fof(f293,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f283,f135]) ).
fof(f307,plain,
! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF7)) ),
inference(superposition,[],[f253,f32]) ).
fof(f309,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f117,f15]) ).
fof(f333,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f269,f15]) ).
fof(f337,plain,
! [X0,X1] :
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f269,f283]) ).
fof(f356,plain,
! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
inference(resolution,[],[f251,f158]) ).
fof(f378,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f293,f173]) ).
fof(f393,plain,
theorem(or(not(p),sF6)),
inference(superposition,[],[f262,f30]) ).
fof(f399,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X2,or(not(X1),X3)))
| theorem(or(X2,or(X0,X3)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f309,f230]) ).
fof(f425,plain,
theorem(or(not(or(sF5,or(sF2,sF6))),sF8)),
inference(superposition,[],[f116,f34]) ).
fof(f449,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,or(X0,X1)))
| theorem(or(X2,X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f337,f230]) ).
fof(f524,plain,
( ~ theorem(or(not(p),sF7))
| theorem(or(sF0,sF8)) ),
inference(resolution,[],[f246,f189]) ).
fof(f542,definition,
( spl9_27
<=> theorem(or(sF0,sF8)) ),
introduced(definition,[new_symbols(definition,[spl9_27])],[avatar_definition]) ).
fof(f544,plain,
( theorem(or(sF0,sF8))
| ~ spl9_27 ),
inference(avatar_component_clause,[],[f542]) ).
fof(f546,definition,
( spl9_28
<=> theorem(or(not(p),sF7)) ),
introduced(definition,[new_symbols(definition,[spl9_28])],[avatar_definition]) ).
fof(f547,plain,
( theorem(or(not(p),sF7))
| ~ spl9_28 ),
inference(avatar_component_clause,[],[f546]) ).
fof(f548,plain,
( ~ theorem(or(not(p),sF7))
| spl9_28 ),
inference(avatar_component_clause,[],[f546]) ).
fof(f549,plain,
( spl9_27
| ~ spl9_28 ),
inference(avatar_split_clause,[],[f524,f546,f542]) ).
fof(f555,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(X3,X2))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f272,f15]) ).
fof(f599,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,or(X0,X1)))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ),
inference(resolution,[],[f555,f337]) ).
fof(f614,plain,
theorem(or(r,or(sF5,sF3))),
inference(resolution,[],[f187,f106]) ).
fof(f634,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[],[f333,f378]) ).
fof(f779,plain,
! [X0] :
( ~ theorem(or(X0,sF8))
| theorem(sF8)
| ~ theorem(or(not(X0),sF7)) ),
inference(superposition,[],[f599,f34]) ).
fof(f784,plain,
! [X0] :
( ~ theorem(or(not(X0),sF7))
| ~ theorem(or(X0,sF8)) ),
inference(forward_subsumption_resolution,[],[f779,f35]) ).
fof(f896,plain,
! [X0] :
( ~ theorem(or(X0,or(sF5,or(sF2,sF6))))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f425,f230]) ).
fof(f902,plain,
! [X0] :
( ~ theorem(or(X0,or(sF2,sF6)))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f896,f253]) ).
fof(f910,plain,
theorem(or(not(sF5),sF8)),
inference(resolution,[],[f896,f262]) ).
fof(f919,plain,
! [X0] :
( ~ theorem(or(sF5,X0))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f910,f333]) ).
fof(f932,plain,
! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f902,f253]) ).
fof(f1058,plain,
theorem(or(not(r),sF8)),
inference(resolution,[],[f151,f932]) ).
fof(f1061,plain,
! [X0] :
( ~ theorem(or(r,X0))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f1058,f333]) ).
fof(f1281,plain,
theorem(or(not(p),sF7)),
inference(resolution,[],[f307,f393]) ).
fof(f1287,plain,
( $false
| spl9_28 ),
inference(forward_subsumption_resolution,[],[f1281,f548]) ).
fof(f1288,plain,
spl9_28,
inference(avatar_contradiction_clause,[],[f1287]) ).
fof(f1306,plain,
( ~ theorem(or(p,sF8))
| ~ spl9_28 ),
inference(resolution,[],[f547,f784]) ).
fof(f1343,plain,
theorem(or(or(sF5,sF3),sF8)),
inference(resolution,[],[f614,f1061]) ).
fof(f1519,plain,
! [X2,X0,X1] :
( ~ theorem(or(or(X0,X2),X1))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f356,f15]) ).
fof(f1921,plain,
theorem(or(sF5,or(sF8,sF3))),
inference(resolution,[],[f1519,f1343]) ).
fof(f1942,plain,
theorem(or(sF5,or(sF3,sF8))),
inference(resolution,[],[f1921,f248]) ).
fof(f1945,plain,
theorem(or(or(sF3,sF8),sF8)),
inference(resolution,[],[f1942,f919]) ).
fof(f1953,plain,
theorem(or(sF3,or(sF8,sF8))),
inference(resolution,[],[f1945,f1519]) ).
fof(f2955,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X2,X0)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f399,f174]) ).
fof(f3661,plain,
! [X0,X1] :
( theorem(or(not(not(X0)),X1))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f634,f173]) ).
fof(f3707,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(not(not(X0)),X1)) ),
inference(resolution,[],[f3661,f283]) ).
fof(f5272,plain,
theorem(or(not(not(sF3)),sF8)),
inference(resolution,[],[f3707,f1953]) ).
fof(f5288,plain,
! [X0] :
( ~ theorem(or(not(sF3),X0))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f5272,f333]) ).
fof(f5304,plain,
theorem(or(or(q,p),sF8)),
inference(resolution,[],[f5288,f176]) ).
fof(f5324,plain,
theorem(or(q,or(sF8,p))),
inference(resolution,[],[f5304,f1519]) ).
fof(f5335,plain,
theorem(or(p,or(q,sF8))),
inference(resolution,[],[f5324,f2955]) ).
fof(f5351,plain,
( theorem(or(p,sF8))
| ~ theorem(or(not(q),sF8)) ),
inference(resolution,[],[f5335,f449]) ).
fof(f5360,plain,
( ~ theorem(or(not(q),sF8))
| ~ spl9_28 ),
inference(forward_subsumption_resolution,[],[f5351,f1306]) ).
fof(f5364,plain,
( ~ theorem(or(sF0,sF8))
| ~ spl9_28 ),
inference(forward_demodulation,[],[f5360,f18]) ).
fof(f5365,plain,
( $false
| ~ spl9_27
| ~ spl9_28 ),
inference(forward_subsumption_resolution,[],[f5364,f544]) ).
fof(f5366,plain,
( ~ spl9_27
| ~ spl9_28 ),
inference(avatar_contradiction_clause,[],[f5365]) ).
cnf(s14,plain,
( spl9_27
| ~ spl9_28 ),
inference(sat_conversion,[],[f549]) ).
cnf(s26,plain,
spl9_28,
inference(sat_conversion,[],[f1288]) ).
cnf(s89,plain,
( ~ spl9_27
| ~ spl9_28 ),
inference(sat_conversion,[],[f5366]) ).
cnf(s98,plain,
~ spl9_27,
inference(rat,[],[s89,s26]) ).
cnf(s102,plain,
$false,
inference(rat,[],[s14,s26,s98]) ).
fof(f5367,plain,
$false,
inference(avatar_sat_refutation,[],[s102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL222-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.09/0.38 % Computer : n006.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sun Sep 27 15:27:56 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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
% 6.59/1.92 % (3100477)Input is clausal, will run a generic CNF schedule.
% 6.59/1.92 % (3100482)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=3478500944:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 6.59/1.92 % (3100484)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1628010824:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 6.59/1.92 % (3100485)lrs+10_1_sil=8000:sp=occurrence:random_seed=1117717859:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 6.59/1.92 % (3100486)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=726866667:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 6.59/1.92 % (3100488)dis-21_1_sil=8000:lcm=predicate:random_seed=3309853747: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)
% 6.59/1.92 % (3100483)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=33871719:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 6.59/1.92 % (3100487)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=761904910:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 6.59/1.92 % (3100488)Instruction limit reached!
% 6.59/1.92 % (3100488)------------------------------
% 6.59/1.92 % (3100488)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100488)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100488)Termination reason: Instruction limit
% 6.59/1.92 % (3100488)Termination phase: Saturation
% 6.59/1.92 % (3100488)Time elapsed: 0.058 s
% 6.59/1.92 % (3100488)Peak memory usage: 87 MB
% 6.59/1.92 % (3100488)Instructions burned: 117 (million)
% 6.59/1.92 % (3100486)Instruction limit reached!
% 6.59/1.92 % (3100486)------------------------------
% 6.59/1.92 % (3100486)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100486)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100486)Termination reason: Instruction limit
% 6.59/1.92 % (3100486)Termination phase: Saturation
% 6.59/1.92 % (3100486)Time elapsed: 0.062 s
% 6.59/1.92 % (3100486)Peak memory usage: 87 MB
% 6.59/1.92 % (3100486)Instructions burned: 114 (million)
% 6.59/1.92 % (3100485)Instruction limit reached!
% 6.59/1.92 % (3100485)------------------------------
% 6.59/1.92 % (3100485)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100485)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100485)Termination reason: Instruction limit
% 6.59/1.92 % (3100485)Termination phase: Saturation
% 6.59/1.92 % (3100485)Time elapsed: 0.070 s
% 6.59/1.92 % (3100485)Peak memory usage: 89 MB
% 6.59/1.92 % (3100485)Instructions burned: 108 (million)
% 6.59/1.92 % (3100487)Instruction limit reached!
% 6.59/1.92 % (3100487)------------------------------
% 6.59/1.92 % (3100487)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100487)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100487)Termination reason: Instruction limit
% 6.59/1.92 % (3100487)Termination phase: Saturation
% 6.59/1.92 % (3100487)Time elapsed: 0.118 s
% 6.59/1.92 % (3100487)Peak memory usage: 89 MB
% 6.59/1.92 % (3100487)Instructions burned: 181 (million)
% 6.59/1.92 % (3100496)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=2733964062:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 6.59/1.92 % (3100497)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2656797736:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 6.59/1.92 % (3100496)Refutation not found, incomplete strategy
% 6.59/1.92 % (3100496)------------------------------
% 6.59/1.92 % (3100496)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100497)Refutation not found, incomplete strategy
% 6.59/1.92 % (3100497)------------------------------
% 6.59/1.92 % (3100497)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100496)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100496)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100496)Termination reason: Refutation not found, incomplete strategy
% 6.59/1.92 % (3100496)Time elapsed: 0.001 s
% 6.59/1.92 % (3100496)Peak memory usage: 87 MB
% 6.59/1.92 % (3100497)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100497)Termination reason: Refutation not found, incomplete strategy
% 6.59/1.92 % (3100497)Time elapsed: 0.001 s
% 6.59/1.92 % (3100497)Peak memory usage: 87 MB
% 6.59/1.92 % (3100498)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2883469637:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 6.59/1.92 % (3100498)Refutation not found, incomplete strategy
% 6.59/1.92 % (3100498)------------------------------
% 6.59/1.92 % (3100498)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100498)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100498)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100498)Termination reason: Refutation not found, incomplete strategy
% 6.59/1.92 % (3100498)Time elapsed: 0.001 s
% 6.59/1.92 % (3100498)Peak memory usage: 87 MB
% 6.59/1.92 % (3100499)lrs+10_64_to=lpo:sil=8000:random_seed=2935330917:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 6.59/1.92 % (3100499)Instruction limit reached!
% 6.59/1.92 % (3100499)------------------------------
% 6.59/1.92 % (3100499)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100499)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100499)Termination reason: Instruction limit
% 6.59/1.92 % (3100499)Termination phase: Saturation
% 6.59/1.92 % (3100499)Time elapsed: 0.072 s
% 6.59/1.92 % (3100499)Peak memory usage: 89 MB
% 6.59/1.92 % (3100499)Instructions burned: 128 (million)
% 6.59/1.92 % (3100496)------------------------------
% 6.59/1.92 % (3100496)------------------------------
% 6.59/1.92 % (3100497)------------------------------
% 6.59/1.92 % (3100497)------------------------------
% 6.59/1.92 % (3100498)------------------------------
% 6.59/1.92 % (3100498)------------------------------
% 6.59/1.92 % (3100504)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=831533628:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 6.59/1.92 % (3100506)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=3606296518:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 6.59/1.92 % (3100505)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=1799374911:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 6.59/1.92 % (3100504)Instruction limit reached!
% 6.59/1.92 % (3100504)------------------------------
% 6.59/1.92 % (3100504)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100504)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100504)Termination reason: Instruction limit
% 6.59/1.92 % (3100504)Termination phase: Saturation
% 6.59/1.92 % (3100504)Time elapsed: 0.125 s
% 6.59/1.92 % (3100504)Peak memory usage: 90 MB
% 6.59/1.92 % (3100504)Instructions burned: 195 (million)
% 6.59/1.92 % (3100508)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=1078421253:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 6.59/1.92 % (3100508)Instruction limit reached!
% 6.59/1.92 % (3100508)------------------------------
% 6.59/1.92 % (3100508)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100508)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100508)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100508)Termination reason: Instruction limit
% 6.59/1.92 % (3100508)Termination phase: Saturation
% 6.59/1.92 % (3100508)Time elapsed: 0.057 s
% 6.59/1.92 % (3100508)Peak memory usage: 89 MB
% 6.59/1.92 % (3100508)Instructions burned: 106 (million)
% 6.59/1.92 % (3100505)Instruction limit reached!
% 6.59/1.92 % (3100505)------------------------------
% 6.59/1.92 % (3100505)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100505)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100505)Termination reason: Instruction limit
% 6.59/1.92 % (3100505)Termination phase: Saturation
% 6.59/1.92 % (3100505)Time elapsed: 0.104 s
% 6.59/1.92 % (3100505)Peak memory usage: 91 MB
% 6.59/1.92 % (3100505)Instructions burned: 158 (million)
% 6.59/1.92 % (3100511)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1622275417:i=107_2992 on theBenchmark for (2992ds/107Mi)
% 6.59/1.92 % (3100511)Refutation not found, incomplete strategy
% 6.59/1.92 % (3100511)------------------------------
% 6.59/1.92 % (3100511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.59/1.92 % (3100511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.59/1.92 % (3100511)CaDiCaL version: 2.1.3
% 6.59/1.92 % (3100511)Termination reason: Refutation not found, incomplete strategy
% 6.59/1.92 % (3100511)Time elapsed: 0.001 s
% 6.59/1.92 % (3100511)Peak memory usage: 87 MB
% 6.59/1.92 % (3100482)First to succeed.
% 6.59/1.92 % (3100482)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3100477"
% 6.59/1.92 % (3100513)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3705874644:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2991 on theBenchmark for (2991ds/242Mi)
% 6.59/1.92 % (3100514)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=732233737:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 6.59/1.92 % (3100482)Refutation found. Thanks to Tanya!
% 6.59/1.92 % SZS status Unsatisfiable for theBenchmark
% 6.59/1.92 % SZS output start Proof for theBenchmark
% See solution above
% 8.03/2.11 % (3100482)------------------------------
% 8.03/2.11 % (3100482)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.03/2.11 % (3100482)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.03/2.11 % (3100482)CaDiCaL version: 2.1.3
% 8.03/2.11 % (3100482)Termination reason: Refutation
% 8.03/2.11 % (3100482)Time elapsed: 0.784 s
% 8.03/2.11 % (3100482)Peak memory usage: 141 MB
% 8.03/2.11 % (3100482)Instructions burned: 2189 (million)
% 8.03/2.11 % (3100482)------------------------------
% 8.03/2.11 % (3100482)------------------------------
% 8.03/2.11 % (3100477)Success in time 1.06 s
% 8.03/2.11 % Vampire exiting
%------------------------------------------------------------------------------