%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL214-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:58:02 AM UTC 2026
% Result : Unsatisfiable 3.95s 1.10s
% Output : Refutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 82 ( 59 unt; 7 def)
% Number of atoms : 109 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 37 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 85 ( 85 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',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/Axioms/LCL004-0.ax',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/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(or(p,q),implies(implies(p,q),q))),
file('/export/starexec/sandbox2/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(p,q)),or(not(or(not(p),q)),q))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
fof(f17,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f18,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
sF1 = not(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f20,plain,
not(sF0) = sF1,
inference(reorient_equations,[],[f19]) ).
fof(f21,definition,
sF2 = not(p),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f22,plain,
not(p) = sF2,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF3 = or(sF2,q),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f24,plain,
or(sF2,q) = sF3,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f26,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF5 = or(sF4,q),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f28,plain,
or(sF4,q) = sF5,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF6 = or(sF1,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f30,plain,
or(sF1,sF5) = sF6,
inference(reorient_equations,[],[f29]) ).
fof(f31,plain,
~ theorem(sF6),
inference(definition_folding,[],[f16,f30,f28,f26,f24,f22,f20,f18]) ).
fof(f32,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f10,f7]) ).
fof(f33,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f36,plain,
! [X0] : axiom(or(sF4,or(X0,sF3))),
inference(superposition,[],[f11,f26]) ).
fof(f39,plain,
axiom(or(not(q),sF5)),
inference(superposition,[],[f11,f28]) ).
fof(f41,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f45,plain,
axiom(or(not(sF6),or(sF5,sF1))),
inference(superposition,[],[f12,f30]) ).
fof(f49,plain,
axiom(or(not(or(sF5,sF1)),sF6)),
inference(superposition,[],[f12,f30]) ).
fof(f80,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f13,f7]) ).
fof(f82,plain,
! [X0] : axiom(or(not(or(X0,sF3)),or(sF2,or(X0,q)))),
inference(superposition,[],[f13,f24]) ).
fof(f88,plain,
! [X0] : axiom(or(not(or(sF1,or(X0,sF5))),or(X0,sF6))),
inference(superposition,[],[f13,f30]) ).
fof(f89,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f14,f7]) ).
fof(f93,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
inference(superposition,[],[f14,f18]) ).
fof(f102,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f93,f20]) ).
fof(f104,plain,
theorem(or(not(q),sF5)),
inference(resolution,[],[f39,f7]) ).
fof(f111,plain,
! [X0] : theorem(or(sF4,or(X0,sF3))),
inference(resolution,[],[f36,f7]) ).
fof(f118,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f33,f15]) ).
fof(f127,plain,
theorem(or(not(sF6),or(sF5,sF1))),
inference(resolution,[],[f45,f7]) ).
fof(f137,plain,
theorem(or(not(or(sF5,sF1)),sF6)),
inference(resolution,[],[f49,f7]) ).
fof(f139,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f41,f15]) ).
fof(f160,plain,
axiom(or(not(or(sF4,sF3)),or(sF2,sF5))),
inference(superposition,[],[f82,f28]) ).
fof(f188,plain,
! [X0] : theorem(or(not(or(sF1,or(X0,sF5))),or(X0,sF6))),
inference(resolution,[],[f88,f7]) ).
fof(f192,plain,
( theorem(sF6)
| ~ theorem(or(sF5,sF1)) ),
inference(resolution,[],[f137,f15]) ).
fof(f193,plain,
~ theorem(or(sF5,sF1)),
inference(forward_subsumption_resolution,[],[f192,f31]) ).
fof(f194,plain,
! [X0] : theorem(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
inference(resolution,[],[f102,f7]) ).
fof(f197,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f80,f15]) ).
fof(f345,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f89,f15]) ).
fof(f379,plain,
theorem(or(not(or(sF4,sF3)),or(sF2,sF5))),
inference(resolution,[],[f160,f7]) ).
fof(f495,plain,
! [X0] :
( ~ theorem(or(sF1,or(X0,sF5)))
| theorem(or(X0,sF6)) ),
inference(resolution,[],[f188,f15]) ).
fof(f521,plain,
! [X0] :
( ~ theorem(or(not(q),X0))
| theorem(or(sF1,or(p,X0))) ),
inference(resolution,[],[f194,f15]) ).
fof(f527,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f197,f118]) ).
fof(f535,plain,
! [X0,X1] : theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))),
inference(resolution,[],[f197,f32]) ).
fof(f559,plain,
! [X0] : theorem(or(X0,or(sF4,sF3))),
inference(resolution,[],[f197,f111]) ).
fof(f705,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f345,f15]) ).
fof(f706,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f345,f197]) ).
fof(f1033,plain,
theorem(or(sF1,or(p,sF5))),
inference(resolution,[],[f521,f104]) ).
fof(f1070,plain,
theorem(or(p,sF6)),
inference(resolution,[],[f1033,f495]) ).
fof(f1081,plain,
theorem(or(sF6,p)),
inference(resolution,[],[f1070,f139]) ).
fof(f1314,plain,
! [X0,X1] :
( theorem(or(not(or(or(not(X0),X1),or(not(X0),X1))),X1))
| ~ theorem(X0) ),
inference(resolution,[],[f535,f15]) ).
fof(f1501,plain,
! [X0] :
( theorem(or(X0,or(sF2,sF5)))
| ~ theorem(or(X0,or(sF4,sF3))) ),
inference(resolution,[],[f705,f379]) ).
fof(f1523,plain,
! [X0] :
( theorem(or(X0,or(sF5,sF1)))
| ~ theorem(or(X0,sF6)) ),
inference(resolution,[],[f705,f127]) ).
fof(f1547,plain,
! [X0] : theorem(or(X0,or(sF2,sF5))),
inference(forward_subsumption_resolution,[],[f1501,f559]) ).
fof(f1621,plain,
! [X2,X0,X1] :
( theorem(or(or(not(or(X2,X0)),X1),X2))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f706,f139]) ).
fof(f1798,plain,
theorem(or(sF2,sF6)),
inference(resolution,[],[f1547,f495]) ).
fof(f2907,plain,
! [X0] :
( ~ theorem(or(not(X0),sF6))
| theorem(or(sF5,sF1))
| ~ theorem(X0) ),
inference(resolution,[],[f1523,f15]) ).
fof(f2924,plain,
! [X0] :
( ~ theorem(or(not(X0),sF6))
| ~ theorem(X0) ),
inference(forward_subsumption_resolution,[],[f2907,f193]) ).
fof(f8435,plain,
! [X0] :
( ~ theorem(or(or(not(X0),sF6),or(not(X0),sF6)))
| ~ theorem(X0) ),
inference(resolution,[],[f1314,f2924]) ).
fof(f10130,plain,
! [X0] :
( ~ theorem(or(or(not(X0),sF6),sF6))
| ~ theorem(X0) ),
inference(resolution,[],[f8435,f527]) ).
fof(f10206,plain,
! [X0] :
( ~ theorem(or(not(X0),sF6))
| ~ theorem(or(sF6,X0)) ),
inference(resolution,[],[f10130,f1621]) ).
fof(f10582,plain,
( ~ theorem(or(sF2,sF6))
| ~ theorem(or(sF6,p)) ),
inference(superposition,[],[f10206,f22]) ).
fof(f10584,plain,
~ theorem(or(sF6,p)),
inference(forward_subsumption_resolution,[],[f10582,f1798]) ).
fof(f10585,plain,
$false,
inference(forward_subsumption_resolution,[],[f10584,f1081]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL214-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.43 % Computer : n014.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Sun Sep 27 15:27:02 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.48 Running first-order model finding
% 0.22/0.48 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.95/1.10 % (941283)Will run a generic schedule for satisfiability detection.
% 3.95/1.10 % (941293)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=963397771:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 3.95/1.10 % (941290)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3059379577:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 3.95/1.10 % (941289)% WARNING: option uhcvi not known.
% 3.95/1.10 % (941288)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2886502211_3000 on theBenchmark for (3000ds/0Mi)
% 3.95/1.10 % (941292)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1883928170:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 3.95/1.10 % (941291)dis+10_1_sil=32000:sp=arity:random_seed=3720682180:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 3.95/1.10 % (941289)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1886853667:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 3.95/1.10 % (941294)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3050910867:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 3.95/1.10 % TRYING [1]
% 3.95/1.10 % TRYING [2]
% 3.95/1.10 % TRYING [3]
% 3.95/1.10 % TRYING [4]
% 3.95/1.10 % (941293)Instruction limit reached!
% 3.95/1.10 % (941293)------------------------------
% 3.95/1.10 % (941293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.10 % (941293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.10 % (941293)CaDiCaL version: 2.1.3
% 3.95/1.10 % (941293)Termination reason: Instruction limit
% 3.95/1.10 % (941293)Termination phase: Saturation
% 3.95/1.10 % (941293)Time elapsed: 0.069 s
% 3.95/1.10 % (941293)Peak memory usage: 13 MB
% 3.95/1.10 % (941293)Instructions burned: 131 (million)
% 3.95/1.10 % (941304)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3572937488:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.95/1.10 % TRYING [1]
% 3.95/1.10 % TRYING [2]
% 3.95/1.10 % TRYING [3]
% 3.95/1.10 % (941292)Instruction limit reached!
% 3.95/1.10 % (941292)------------------------------
% 3.95/1.10 % (941292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.10 % (941292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.10 % (941292)CaDiCaL version: 2.1.3
% 3.95/1.10 % (941292)Termination reason: Instruction limit
% 3.95/1.10 % (941292)Termination phase: Saturation
% 3.95/1.10 % (941292)Time elapsed: 0.094 s
% 3.95/1.10 % (941292)Peak memory usage: 11 MB
% 3.95/1.10 % (941292)Instructions burned: 117 (million)
% 3.95/1.10 % TRYING [4]
% 3.95/1.10 % (941291)Instruction limit reached!
% 3.95/1.10 % (941291)------------------------------
% 3.95/1.10 % (941291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.10 % (941291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.10 % (941291)CaDiCaL version: 2.1.3
% 3.95/1.10 % (941291)Termination reason: Instruction limit
% 3.95/1.10 % (941291)Termination phase: Saturation
% 3.95/1.10 % (941291)Time elapsed: 0.102 s
% 3.95/1.10 % (941291)Peak memory usage: 12 MB
% 3.95/1.10 % (941291)Instructions burned: 103 (million)
% 3.95/1.10 % (941306)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3259357842:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.95/1.10 % (941307)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3477632219:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.95/1.10 % (941294)Instruction limit reached!
% 3.95/1.10 % (941294)------------------------------
% 3.95/1.10 % (941294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.10 % (941294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.10 % (941294)CaDiCaL version: 2.1.3
% 3.95/1.10 % (941294)Termination reason: Instruction limit
% 3.95/1.10 % (941294)Termination phase: Saturation
% 3.95/1.10 % (941294)Time elapsed: 0.162 s
% 3.95/1.10 % (941294)Peak memory usage: 13 MB
% 3.95/1.10 % (941294)Instructions burned: 159 (million)
% 3.95/1.10 % (941306)Instruction limit reached!
% 3.95/1.10 % (941306)------------------------------
% 3.95/1.10 % (941306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.10 % (941306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.10 % (941306)CaDiCaL version: 2.1.3
% 3.95/1.10 % (941306)Termination reason: Instruction limit
% 3.95/1.10 % (941306)Termination phase: Saturation
% 3.95/1.10 % (941306)Time elapsed: 0.070 s
% 3.95/1.10 % (941306)Peak memory usage: 13 MB
% 3.95/1.10 % (941306)Instructions burned: 132 (million)
% 3.95/1.10 % (941312)ott-21_1_sil=16000:fs=off:random_seed=792256341:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.95/1.10 % (941313)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2037283676:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 3.95/1.10 % TRYING [5]
% 3.95/1.10 % TRYING [5]
% 3.95/1.10 % (941312)Instruction limit reached!
% 3.95/1.10 % (941312)------------------------------
% 3.95/1.10 % (941312)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.10 % (941312)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.10 % (941312)CaDiCaL version: 2.1.3
% 3.95/1.10 % (941312)Termination reason: Instruction limit
% 3.95/1.10 % (941312)Termination phase: Saturation
% 3.95/1.10 % (941312)Time elapsed: 0.153 s
% 3.95/1.10 % (941312)Peak memory usage: 12 MB
% 3.95/1.10 % (941312)Instructions burned: 181 (million)
% 3.95/1.10 % (941316)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1417875851:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 3.95/1.10 % TRYING [1]
% 3.95/1.10 % TRYING [2]
% 3.95/1.10 % TRYING [3]
% 3.95/1.10 % TRYING [4]
% 3.95/1.10 % (941313)Instruction limit reached!
% 3.95/1.10 % (941313)------------------------------
% 3.95/1.10 % (941313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.10 % (941313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.10 % (941313)CaDiCaL version: 2.1.3
% 3.95/1.10 % (941313)Termination reason: Instruction limit
% 3.95/1.10 % (941313)Termination phase: Saturation
% 3.95/1.10 % (941313)Time elapsed: 0.215 s
% 3.95/1.10 % (941313)Peak memory usage: 13 MB
% 3.95/1.10 % (941313)Instructions burned: 480 (million)
% 3.95/1.10 % (941319)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=873287352:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.95/1.10 % TRYING [5]
% 3.95/1.10 % (941319) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-941283-941319"...
% 3.95/1.10 % (941319)...printing done.
% 3.95/1.10 % (941319)Refutation found. Thanks to Tanya!
% 3.95/1.10 % SZS status Unsatisfiable for theBenchmark
% 3.95/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 3.95/1.11 % (941319)------------------------------
% 3.95/1.11 % (941319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/1.11 % (941319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.11 % (941319)CaDiCaL version: 2.1.3
% 3.95/1.11 % (941319)Termination reason: Refutation
% 3.95/1.11 % (941319)Time elapsed: 0.140 s
% 3.95/1.11 % (941319)Peak memory usage: 16 MB
% 3.95/1.11 % (941319)Instructions burned: 422 (million)
% 3.95/1.11 % (941283)Success in time 0.612 s
% 3.95/1.11 % Vampire exiting
%------------------------------------------------------------------------------