%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL305-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:55 AM UTC 2026
% Result : Unsatisfiable 8.87s 2.09s
% Output : Refutation 9.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 23
% Syntax : Number of formulae : 103 ( 71 unt; 12 def)
% Number of atoms : 145 ( 28 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 87 ( 45 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 14 con; 0-2 aty)
% Number of variables : 117 ( 117 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(implies(q,equivalent(p,and(p,q)))),
file('/export/starexec/sandbox2/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(or(not(q),not(or(not(or(not(p),not(or(not(p),not(q))))),not(or(not(not(or(not(p),not(q)))),p)))))),
inference(definition_unfolding,[],[f11,f6,f12,f9]) ).
fof(f20,definition,
sF0 = not(q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
not(q) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = not(p),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
not(p) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = or(sF1,sF0),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
or(sF1,sF0) = 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 = or(sF1,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
or(sF1,sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = not(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
not(sF4) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = not(sF3),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
not(sF3) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = or(sF6,p),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
or(sF6,p) = 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 = or(sF5,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
or(sF5,sF8) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = not(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
not(sF9) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = or(sF0,sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
or(sF0,sF10) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,plain,
~ theorem(sF11),
inference(definition_folding,[],[f19,f43,f41,f39,f37,f35,f33,f27,f25,f21,f23,f31,f29,f27,f25,f21,f23,f23,f21]) ).
fof(f45,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,f45]) ).
fof(f123,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f123,f18]) ).
fof(f133,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f128,f45]) ).
fof(f185,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f200,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f185,f18]) ).
fof(f203,plain,
theorem(or(not(sF2),or(sF0,sF1))),
inference(superposition,[],[f185,f25]) ).
fof(f205,plain,
theorem(or(not(sF9),or(sF8,sF5))),
inference(superposition,[],[f185,f39]) ).
fof(f213,plain,
theorem(or(sF10,or(sF8,sF5))),
inference(forward_demodulation,[],[f205,f41]) ).
fof(f215,plain,
theorem(or(sF3,or(sF0,sF1))),
inference(forward_demodulation,[],[f203,f27]) ).
fof(f216,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f232,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f216,f128]) ).
fof(f260,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f62,f18]) ).
fof(f279,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f260,f185]) ).
fof(f280,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f260,f62]) ).
fof(f284,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f260,f216]) ).
fof(f287,plain,
! [X0,X1] :
( ~ theorem(or(sF3,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF2)) ),
inference(superposition,[],[f260,f27]) ).
fof(f290,plain,
! [X0,X1] :
( ~ theorem(or(sF8,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF7)) ),
inference(superposition,[],[f260,f37]) ).
fof(f297,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f279,f216]) ).
fof(f303,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f280,f185]) ).
fof(f306,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,[],[f280,f123]) ).
fof(f319,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f284,f279]) ).
fof(f327,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f328,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f327,f260]) ).
fof(f329,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f327,f18]) ).
fof(f338,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f328,f216]) ).
fof(f342,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f133,f18]) ).
fof(f371,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(X3,X2))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f306,f18]) ).
fof(f388,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f303,f18]) ).
fof(f419,plain,
! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF7)) ),
inference(superposition,[],[f319,f35]) ).
fof(f445,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f338,f200]) ).
fof(f471,plain,
! [X0,X1] :
( ~ theorem(or(not(sF7),X0))
| theorem(or(X1,X0))
| ~ theorem(or(sF6,or(X1,p))) ),
inference(superposition,[],[f371,f35]) ).
fof(f472,plain,
! [X0,X1] :
( ~ theorem(or(sF6,or(X1,p)))
| theorem(or(X1,X0))
| ~ theorem(or(sF8,X0)) ),
inference(forward_demodulation,[],[f471,f37]) ).
fof(f496,plain,
! [X0,X1] :
( theorem(or(not(or(sF5,X0)),or(X1,X0)))
| ~ theorem(or(X1,sF4)) ),
inference(superposition,[],[f342,f31]) ).
fof(f540,plain,
! [X0] :
( theorem(or(X0,not(sF3)))
| ~ theorem(or(X0,sF2)) ),
inference(resolution,[],[f287,f445]) ).
fof(f541,plain,
! [X0] :
( ~ theorem(or(X0,sF2))
| theorem(or(X0,sF6)) ),
inference(forward_demodulation,[],[f540,f33]) ).
fof(f574,plain,
theorem(or(not(sF1),sF2)),
inference(superposition,[],[f297,f25]) ).
fof(f640,plain,
theorem(or(sF8,or(sF10,sF5))),
inference(resolution,[],[f213,f128]) ).
fof(f652,plain,
theorem(or(sF0,or(sF3,sF1))),
inference(resolution,[],[f215,f128]) ).
fof(f758,plain,
theorem(or(sF0,or(sF1,sF3))),
inference(resolution,[],[f652,f279]) ).
fof(f761,plain,
theorem(or(sF0,sF4)),
inference(forward_demodulation,[],[f758,f29]) ).
fof(f785,plain,
theorem(or(sF8,or(sF5,sF10))),
inference(resolution,[],[f640,f279]) ).
fof(f850,plain,
! [X0] :
( theorem(or(not(p),X0))
| ~ theorem(or(sF8,X0)) ),
inference(resolution,[],[f232,f472]) ).
fof(f861,plain,
! [X0] :
( ~ theorem(or(sF8,X0))
| theorem(or(sF1,X0)) ),
inference(forward_demodulation,[],[f850,f23]) ).
fof(f1178,plain,
theorem(or(not(sF1),sF6)),
inference(resolution,[],[f574,f541]) ).
fof(f1184,plain,
theorem(or(not(sF1),sF7)),
inference(resolution,[],[f1178,f419]) ).
fof(f1724,plain,
theorem(or(sF1,or(sF5,sF10))),
inference(resolution,[],[f861,f785]) ).
fof(f1889,plain,
( theorem(or(not(or(sF5,sF10)),sF11))
| ~ theorem(or(sF0,sF4)) ),
inference(superposition,[],[f496,f43]) ).
fof(f1909,plain,
theorem(or(not(or(sF5,sF10)),sF11)),
inference(forward_subsumption_resolution,[],[f1889,f761]) ).
fof(f1921,plain,
! [X0] :
( ~ theorem(or(X0,or(sF5,sF10)))
| theorem(or(X0,sF11)) ),
inference(resolution,[],[f1909,f260]) ).
fof(f1944,plain,
theorem(or(sF1,sF11)),
inference(resolution,[],[f1921,f1724]) ).
fof(f1945,plain,
theorem(or(sF8,sF11)),
inference(resolution,[],[f1921,f785]) ).
fof(f1953,plain,
! [X0] :
( ~ theorem(or(X0,sF7))
| theorem(or(X0,sF11)) ),
inference(resolution,[],[f1945,f290]) ).
fof(f1981,plain,
theorem(or(not(sF1),sF11)),
inference(resolution,[],[f1953,f1184]) ).
fof(f2002,plain,
! [X0] :
( ~ theorem(or(sF1,X0))
| theorem(or(X0,sF11)) ),
inference(resolution,[],[f1981,f388]) ).
fof(f2038,plain,
theorem(or(sF11,sF11)),
inference(resolution,[],[f2002,f1944]) ).
fof(f2044,plain,
theorem(sF11),
inference(resolution,[],[f2038,f329]) ).
fof(f2046,plain,
$false,
inference(forward_subsumption_resolution,[],[f2044,f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL305-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n012.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 15:33:19 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.87/2.09 % (2523404)Input is clausal, will run a generic CNF schedule.
% 8.87/2.09 % (2523409)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=2688661436:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 8.87/2.09 % (2523410)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4226779371:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 8.87/2.09 % (2523414)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1895491406:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 8.87/2.09 % (2523413)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=874510557:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 8.87/2.09 % (2523412)lrs+10_1_sil=8000:sp=occurrence:random_seed=2723260306:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 8.87/2.09 % (2523411)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=506117365:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 8.87/2.09 % (2523415)dis-21_1_sil=8000:lcm=predicate:random_seed=534956461: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.87/2.09 % (2523412)Instruction limit reached!
% 8.87/2.09 % (2523412)------------------------------
% 8.87/2.09 % (2523412)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523412)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523412)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523412)Termination reason: Instruction limit
% 8.87/2.09 % (2523412)Termination phase: Saturation
% 8.87/2.09 % (2523412)Time elapsed: 0.055 s
% 8.87/2.09 % (2523412)Peak memory usage: 89 MB
% 8.87/2.09 % (2523412)Instructions burned: 107 (million)
% 8.87/2.09 % (2523413)Instruction limit reached!
% 8.87/2.09 % (2523413)------------------------------
% 8.87/2.09 % (2523413)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523413)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523413)Termination reason: Instruction limit
% 8.87/2.09 % (2523413)Termination phase: Saturation
% 8.87/2.09 % (2523413)Time elapsed: 0.055 s
% 8.87/2.09 % (2523413)Peak memory usage: 88 MB
% 8.87/2.09 % (2523413)Instructions burned: 114 (million)
% 8.87/2.09 % (2523415)Instruction limit reached!
% 8.87/2.09 % (2523415)------------------------------
% 8.87/2.09 % (2523415)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523415)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523415)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523415)Termination reason: Instruction limit
% 8.87/2.09 % (2523415)Termination phase: Saturation
% 8.87/2.09 % (2523415)Time elapsed: 0.048 s
% 8.87/2.09 % (2523415)Peak memory usage: 87 MB
% 8.87/2.09 % (2523415)Instructions burned: 118 (million)
% 8.87/2.09 % (2523414)Instruction limit reached!
% 8.87/2.09 % (2523414)------------------------------
% 8.87/2.09 % (2523414)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523414)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523414)Termination reason: Instruction limit
% 8.87/2.09 % (2523414)Termination phase: Saturation
% 8.87/2.09 % (2523414)Time elapsed: 0.098 s
% 8.87/2.09 % (2523414)Peak memory usage: 89 MB
% 8.87/2.09 % (2523414)Instructions burned: 181 (million)
% 8.87/2.09 % (2523423)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=167391084:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 8.87/2.09 % (2523423)Refutation not found, incomplete strategy
% 8.87/2.09 % (2523423)------------------------------
% 8.87/2.09 % (2523423)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523423)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523423)Termination reason: Refutation not found, incomplete strategy
% 8.87/2.09 % (2523423)Time elapsed: 0.001 s
% 8.87/2.09 % (2523423)Peak memory usage: 88 MB
% 8.87/2.09 % (2523425)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3415331153:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 8.87/2.09 % (2523424)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1054565332: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)
% 8.87/2.09 % (2523425)Refutation not found, incomplete strategy
% 8.87/2.09 % (2523425)------------------------------
% 8.87/2.09 % (2523425)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523425)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523425)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523425)Termination reason: Refutation not found, incomplete strategy
% 8.87/2.09 % (2523425)Time elapsed: 0.001 s
% 8.87/2.09 % (2523425)Peak memory usage: 88 MB
% 8.87/2.09 % (2523425)Instructions burned: 1 (million)
% 8.87/2.09 % (2523424)Refutation not found, incomplete strategy
% 8.87/2.09 % (2523424)------------------------------
% 8.87/2.09 % (2523424)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523424)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523424)Termination reason: Refutation not found, incomplete strategy
% 8.87/2.09 % (2523424)Time elapsed: 0.001 s
% 8.87/2.09 % (2523424)Peak memory usage: 87 MB
% 8.87/2.09 % (2523426)lrs+10_64_to=lpo:sil=8000:random_seed=3932718832:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 8.87/2.09 % (2523426)Instruction limit reached!
% 8.87/2.09 % (2523426)------------------------------
% 8.87/2.09 % (2523426)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523426)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523426)Termination reason: Instruction limit
% 8.87/2.09 % (2523426)Termination phase: Saturation
% 8.87/2.09 % (2523426)Time elapsed: 0.064 s
% 8.87/2.09 % (2523426)Peak memory usage: 89 MB
% 8.87/2.09 % (2523426)Instructions burned: 128 (million)
% 8.87/2.09 % (2523423)------------------------------
% 8.87/2.09 % (2523423)------------------------------
% 8.87/2.09 % (2523424)------------------------------
% 8.87/2.09 % (2523424)------------------------------
% 8.87/2.09 % (2523425)------------------------------
% 8.87/2.09 % (2523425)------------------------------
% 8.87/2.09 % (2523431)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3139748833:avsq=on:i=194:fgj=on:bd=preordered_2993 on theBenchmark for (2993ds/194Mi)
% 8.87/2.09 % (2523432)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=4251688621:i=157:gtg=all_2992 on theBenchmark for (2992ds/157Mi)
% 8.87/2.09 % (2523431)Instruction limit reached!
% 8.87/2.09 % (2523431)------------------------------
% 8.87/2.09 % (2523431)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523431)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523431)Termination reason: Instruction limit
% 8.87/2.09 % (2523431)Termination phase: Saturation
% 8.87/2.09 % (2523431)Time elapsed: 0.105 s
% 8.87/2.09 % (2523431)Peak memory usage: 90 MB
% 8.87/2.09 % (2523431)Instructions burned: 195 (million)
% 8.87/2.09 % (2523433)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=3179603153:i=3394:sd=4:ss=included:sgt=64_2992 on theBenchmark for (2992ds/3394Mi)
% 8.87/2.09 % (2523434)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=1339556621:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2992 on theBenchmark for (2992ds/106Mi)
% 8.87/2.09 % (2523432)Instruction limit reached!
% 8.87/2.09 % (2523432)------------------------------
% 8.87/2.09 % (2523432)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523432)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523432)Termination reason: Instruction limit
% 8.87/2.09 % (2523432)Termination phase: Saturation
% 8.87/2.09 % (2523432)Time elapsed: 0.086 s
% 8.87/2.09 % (2523432)Peak memory usage: 91 MB
% 8.87/2.09 % (2523432)Instructions burned: 158 (million)
% 8.87/2.09 % (2523434)Instruction limit reached!
% 8.87/2.09 % (2523434)------------------------------
% 8.87/2.09 % (2523434)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523434)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523434)Termination reason: Instruction limit
% 8.87/2.09 % (2523434)Termination phase: Saturation
% 8.87/2.09 % (2523434)Time elapsed: 0.048 s
% 8.87/2.09 % (2523434)Peak memory usage: 89 MB
% 8.87/2.09 % (2523434)Instructions burned: 106 (million)
% 8.87/2.09 % (2523409)First to succeed.
% 8.87/2.09 % (2523409)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2523404"
% 8.87/2.09 % (2523437)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=503602183:i=107_2990 on theBenchmark for (2990ds/107Mi)
% 8.87/2.09 % (2523437)Refutation not found, incomplete strategy
% 8.87/2.09 % (2523437)------------------------------
% 8.87/2.09 % (2523437)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.09 % (2523437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.09 % (2523437)CaDiCaL version: 2.1.3
% 8.87/2.09 % (2523437)Termination reason: Refutation not found, incomplete strategy
% 8.87/2.09 % (2523437)Time elapsed: 0.001 s
% 8.87/2.09 % (2523437)Peak memory usage: 87 MB
% 8.87/2.09 % (2523440)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2008757542:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2989 on theBenchmark for (2989ds/242Mi)
% 8.87/2.09 % (2523441)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=4027458480:cond=fast:i=5208:av=off_2989 on theBenchmark for (2989ds/5208Mi)
% 8.87/2.09 % (2523409)Refutation found. Thanks to Tanya!
% 8.87/2.09 % SZS status Unsatisfiable for theBenchmark
% 8.87/2.09 % SZS output start Proof for theBenchmark
% See solution above
% 9.48/2.30 % (2523409)------------------------------
% 9.48/2.30 % (2523409)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.48/2.30 % (2523409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.48/2.30 % (2523409)CaDiCaL version: 2.1.3
% 9.48/2.30 % (2523409)Termination reason: Refutation
% 9.48/2.30 % (2523409)Time elapsed: 0.817 s
% 9.48/2.30 % (2523409)Peak memory usage: 131 MB
% 9.48/2.30 % (2523409)Instructions burned: 1417 (million)
% 9.48/2.30 % (2523409)------------------------------
% 9.48/2.30 % (2523409)------------------------------
% 9.48/2.30 % (2523404)Success in time 1.281 s
% 9.48/2.30 % Vampire exiting
%------------------------------------------------------------------------------