%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL250-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 : n019.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:46 AM UTC 2026
% Result : Unsatisfiable 8.94s 2.40s
% Output : Refutation 8.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 19
% Syntax : Number of formulae : 73 ( 52 unt; 9 def)
% Number of atoms : 98 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 76 ( 76 !; 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,negated_conjecture,
~ theorem(implies(implies(q,r),implies(and(p,q),r))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f13,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f15,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(f16,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f17,plain,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
inference(definition_unfolding,[],[f10,f6,f6,f6,f9]) ).
fof(f18,definition,
sF0 = not(q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f19,plain,
not(q) = sF0,
inference(reorient_equations,[],[f18]) ).
fof(f20,definition,
sF1 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f21,plain,
or(sF0,r) = sF1,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f23,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF3 = not(p),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f25,plain,
not(p) = sF3,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF4 = or(sF3,sF0),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f27,plain,
or(sF3,sF0) = sF4,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF5 = not(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f29,plain,
not(sF4) = sF5,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f31,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF7 = or(sF6,r),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f33,plain,
or(sF6,r) = sF7,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF8 = or(sF2,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f35,plain,
or(sF2,sF7) = sF8,
inference(reorient_equations,[],[f34]) ).
fof(f36,plain,
~ theorem(sF8),
inference(definition_folding,[],[f17,f35,f33,f31,f29,f27,f19,f25,f23,f21,f19]) ).
fof(f37,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f15,f7]) ).
fof(f64,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f16,f37]) ).
fof(f114,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f14,f7]) ).
fof(f129,plain,
! [X0] : theorem(or(not(or(sF2,or(X0,sF7))),or(X0,sF8))),
inference(superposition,[],[f114,f35]) ).
fof(f131,plain,
! [X0] : theorem(or(not(or(sF6,or(X0,r))),or(X0,sF7))),
inference(superposition,[],[f114,f33]) ).
fof(f138,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f13,f7]) ).
fof(f149,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f138,f16]) ).
fof(f161,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f180,plain,
theorem(or(not(sF0),sF4)),
inference(superposition,[],[f161,f27]) ).
fof(f181,plain,
theorem(or(not(r),sF7)),
inference(superposition,[],[f161,f33]) ).
fof(f182,plain,
! [X0] :
( ~ theorem(or(sF2,or(X0,sF7)))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f129,f16]) ).
fof(f208,plain,
theorem(or(not(or(sF6,or(sF2,r))),sF8)),
inference(superposition,[],[f131,f35]) ).
fof(f209,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f11,f7]) ).
fof(f210,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f209,f16]) ).
fof(f213,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f64,f16]) ).
fof(f216,plain,
! [X0] :
( theorem(or(not(sF1),or(sF0,X0)))
| ~ theorem(or(not(r),X0)) ),
inference(superposition,[],[f64,f21]) ).
fof(f225,plain,
! [X0] :
( theorem(or(sF2,or(sF0,X0)))
| ~ theorem(or(not(r),X0)) ),
inference(forward_demodulation,[],[f216,f23]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f213,f138]) ).
fof(f232,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f213,f161]) ).
fof(f233,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f213,f209]) ).
fof(f237,plain,
! [X0,X1] :
( ~ theorem(or(sF5,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF4)) ),
inference(superposition,[],[f213,f29]) ).
fof(f256,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f233,f161]) ).
fof(f276,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f256,f149]) ).
fof(f293,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f232,f226]) ).
fof(f454,plain,
! [X0] :
( theorem(or(X0,not(sF5)))
| ~ theorem(or(X0,sF4)) ),
inference(resolution,[],[f237,f276]) ).
fof(f457,plain,
! [X0] :
( ~ theorem(or(X0,sF4))
| theorem(or(X0,sF6)) ),
inference(forward_demodulation,[],[f454,f31]) ).
fof(f501,plain,
( ~ theorem(or(not(r),sF7))
| theorem(or(sF0,sF8)) ),
inference(resolution,[],[f225,f182]) ).
fof(f520,plain,
theorem(or(sF0,sF8)),
inference(forward_subsumption_resolution,[],[f501,f181]) ).
fof(f521,plain,
theorem(or(sF8,sF0)),
inference(resolution,[],[f520,f149]) ).
fof(f559,plain,
! [X0] :
( ~ theorem(or(X0,or(sF6,or(sF2,r))))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f208,f213]) ).
fof(f564,plain,
! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f559,f293]) ).
fof(f1177,plain,
theorem(or(not(sF0),sF6)),
inference(resolution,[],[f180,f457]) ).
fof(f1183,plain,
theorem(or(not(sF0),sF8)),
inference(resolution,[],[f1177,f564]) ).
fof(f1186,plain,
! [X0] :
( ~ theorem(or(X0,sF0))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f1183,f213]) ).
fof(f1194,plain,
theorem(or(sF8,sF8)),
inference(resolution,[],[f1186,f521]) ).
fof(f1197,plain,
theorem(sF8),
inference(resolution,[],[f1194,f210]) ).
fof(f1199,plain,
$false,
inference(forward_subsumption_resolution,[],[f1197,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL250-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n019.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sun Sep 27 15:30:33 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.44 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.49 Running first-order theorem proving
% 0.25/0.49 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.03/2.20 % (3210135)Input is clausal, will run a generic CNF schedule.
% 6.03/2.20 % (3210143)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=2352198481:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 6.03/2.20 % (3210148)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2769929560:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 6.03/2.20 % (3210146)lrs+10_1_sil=8000:sp=occurrence:random_seed=2925572838:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 6.03/2.20 % (3210147)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2364319798:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 6.03/2.20 % (3210145)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3819227696:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 6.03/2.20 % (3210144)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3151745568:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 6.03/2.20 % (3210149)dis-21_1_sil=8000:lcm=predicate:random_seed=1460542202: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.03/2.20 % (3210146)Instruction limit reached!
% 6.03/2.20 % (3210146)------------------------------
% 6.03/2.20 % (3210146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.03/2.20 % (3210146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/2.20 % (3210146)CaDiCaL version: 2.1.3
% 6.03/2.20 % (3210146)Termination reason: Instruction limit
% 6.03/2.20 % (3210146)Termination phase: Saturation
% 6.03/2.20 % (3210146)Time elapsed: 0.112 s
% 6.03/2.20 % (3210146)Peak memory usage: 89 MB
% 6.03/2.20 % (3210146)Instructions burned: 107 (million)
% 6.03/2.20 % (3210148)Instruction limit reached!
% 6.03/2.20 % (3210148)------------------------------
% 6.03/2.20 % (3210148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.03/2.20 % (3210148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/2.20 % (3210148)CaDiCaL version: 2.1.3
% 6.03/2.20 % (3210148)Termination reason: Instruction limit
% 6.03/2.20 % (3210148)Termination phase: Saturation
% 6.03/2.20 % (3210148)Time elapsed: 0.157 s
% 6.03/2.20 % (3210148)Peak memory usage: 89 MB
% 6.03/2.20 % (3210148)Instructions burned: 180 (million)
% 6.03/2.20 % (3210147)Instruction limit reached!
% 6.03/2.20 % (3210147)------------------------------
% 6.03/2.20 % (3210147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.03/2.20 % (3210147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/2.20 % (3210147)CaDiCaL version: 2.1.3
% 6.03/2.20 % (3210147)Termination reason: Instruction limit
% 6.03/2.20 % (3210147)Termination phase: Saturation
% 6.03/2.20 % (3210147)Time elapsed: 0.115 s
% 6.03/2.20 % (3210147)Peak memory usage: 88 MB
% 6.03/2.20 % (3210147)Instructions burned: 114 (million)
% 6.03/2.20 % (3210149)Instruction limit reached!
% 6.03/2.20 % (3210149)------------------------------
% 6.03/2.20 % (3210149)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.03/2.20 % (3210149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/2.20 % (3210149)CaDiCaL version: 2.1.3
% 6.03/2.20 % (3210149)Termination reason: Instruction limit
% 6.03/2.20 % (3210149)Termination phase: Saturation
% 6.03/2.20 % (3210149)Time elapsed: 0.101 s
% 6.03/2.20 % (3210149)Peak memory usage: 88 MB
% 6.03/2.20 % (3210149)Instructions burned: 117 (million)
% 6.03/2.20 % (3210157)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=107593355:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 6.03/2.20 % (3210157)Refutation not found, incomplete strategy
% 6.03/2.20 % (3210157)------------------------------
% 6.03/2.20 % (3210157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.03/2.20 % (3210157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/2.20 % (3210157)CaDiCaL version: 2.1.3
% 6.03/2.20 % (3210157)Termination reason: Refutation not found, incomplete strategy
% 6.03/2.20 % (3210157)Time elapsed: 0.001 s
% 6.03/2.20 % (3210157)Peak memory usage: 88 MB
% 6.03/2.20 % (3210159)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=4268481445:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 8.94/2.40 % (3210158)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2393736300:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 8.94/2.40 % (3210158)Refutation not found, incomplete strategy
% 8.94/2.40 % (3210158)------------------------------
% 8.94/2.40 % (3210158)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.94/2.40 % (3210158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.94/2.40 % (3210158)CaDiCaL version: 2.1.3
% 8.94/2.40 % (3210158)Termination reason: Refutation not found, incomplete strategy
% 8.94/2.40 % (3210158)Time elapsed: 0.002 s
% 8.94/2.40 % (3210158)Peak memory usage: 87 MB
% 8.94/2.40 % (3210159)Refutation not found, incomplete strategy
% 8.94/2.40 % (3210159)------------------------------
% 8.94/2.40 % (3210159)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.94/2.40 % (3210159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.94/2.40 % (3210159)CaDiCaL version: 2.1.3
% 8.94/2.40 % (3210159)Termination reason: Refutation not found, incomplete strategy
% 8.94/2.40 % (3210159)Time elapsed: 0.002 s
% 8.94/2.40 % (3210159)Peak memory usage: 88 MB
% 8.94/2.40 % (3210160)lrs+10_64_to=lpo:sil=8000:random_seed=1232460950:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 8.94/2.40 % (3210160)Instruction limit reached!
% 8.94/2.40 % (3210160)------------------------------
% 8.94/2.40 % (3210160)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.94/2.40 % (3210160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.94/2.40 % (3210160)CaDiCaL version: 2.1.3
% 8.94/2.40 % (3210160)Termination reason: Instruction limit
% 8.94/2.40 % (3210160)Termination phase: Saturation
% 8.94/2.40 % (3210160)Time elapsed: 0.121 s
% 8.94/2.40 % (3210160)Peak memory usage: 89 MB
% 8.94/2.40 % (3210160)Instructions burned: 126 (million)
% 8.94/2.40 % (3210157)------------------------------
% 8.94/2.40 % (3210157)------------------------------
% 8.94/2.40 % (3210143)First to succeed.
% 8.94/2.40 % (3210143)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3210135"
% 8.94/2.40 % (3210159)------------------------------
% 8.94/2.40 % (3210159)------------------------------
% 8.94/2.40 % (3210158)------------------------------
% 8.94/2.40 % (3210158)------------------------------
% 8.94/2.40 % (3210165)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1966945145:avsq=on:i=194:fgj=on:bd=preordered_2992 on theBenchmark for (2992ds/194Mi)
% 8.94/2.40 % (3210143)Refutation found. Thanks to Tanya!
% 8.94/2.40 % SZS status Unsatisfiable for theBenchmark
% 8.94/2.40 % SZS output start Proof for theBenchmark
% See solution above
% 8.94/2.40 % (3210143)------------------------------
% 8.94/2.40 % (3210143)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.94/2.40 % (3210143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.94/2.40 % (3210143)CaDiCaL version: 2.1.3
% 8.94/2.40 % (3210143)Termination reason: Refutation
% 8.94/2.40 % (3210143)Time elapsed: 0.737 s
% 8.94/2.40 % (3210143)Peak memory usage: 131 MB
% 8.94/2.40 % (3210143)Instructions burned: 1246 (million)
% 8.94/2.40 % (3210143)------------------------------
% 8.94/2.40 % (3210143)------------------------------
% 8.94/2.40 % (3210135)Success in time 1.165 s
% 8.94/2.40 % Vampire exiting
%------------------------------------------------------------------------------