%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL223-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 : n003.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:04 AM UTC 2026
% Result : Unsatisfiable 6.56s 1.56s
% Output : Refutation 6.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 88 ( 59 unt; 10 def)
% Number of atoms : 121 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 37 ~; 32 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 79 !; 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(or(p,implies(q,r)),or(p,r)))),
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(p,or(not(q),r))),or(p,r)))),
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(q),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f22,plain,
not(q) = sF2,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF3 = or(sF2,r),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f24,plain,
or(sF2,r) = sF3,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF4 = or(p,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f26,plain,
or(p,sF3) = 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(sF1,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f34,plain,
or(sF1,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(f36,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f10,f7]) ).
fof(f37,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f46,plain,
axiom(or(not(sF6),sF7)),
inference(superposition,[],[f11,f32]) ).
fof(f48,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f91,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f13,f7]) ).
fof(f104,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f14,f7]) ).
fof(f108,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
inference(superposition,[],[f14,f18]) ).
fof(f109,plain,
! [X0] : axiom(or(not(or(not(sF3),X0)),or(not(sF4),or(p,X0)))),
inference(superposition,[],[f14,f26]) ).
fof(f117,plain,
! [X0] : axiom(or(not(or(not(X0),sF7)),or(not(or(sF1,X0)),sF8))),
inference(superposition,[],[f14,f34]) ).
fof(f120,plain,
! [X0] : axiom(or(not(or(not(sF3),X0)),or(sF5,or(p,X0)))),
inference(forward_demodulation,[],[f109,f28]) ).
fof(f121,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f108,f20]) ).
fof(f122,plain,
! [X0] : axiom(or(not(or(sF2,X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f121,f22]) ).
fof(f127,plain,
theorem(or(not(sF6),sF7)),
inference(resolution,[],[f46,f7]) ).
fof(f148,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f36,f15]) ).
fof(f149,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f37,f15]) ).
fof(f184,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f48,f15]) ).
fof(f261,plain,
axiom(or(not(or(sF2,r)),or(sF1,sF6))),
inference(superposition,[],[f122,f30]) ).
fof(f262,plain,
axiom(or(not(sF3),or(sF1,sF6))),
inference(forward_demodulation,[],[f261,f24]) ).
fof(f268,plain,
axiom(or(not(or(not(sF3),r)),or(sF5,sF6))),
inference(superposition,[],[f120,f30]) ).
fof(f269,plain,
axiom(or(not(or(not(sF3),r)),sF7)),
inference(forward_demodulation,[],[f268,f32]) ).
fof(f270,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f91,f15]) ).
fof(f339,plain,
theorem(or(not(sF3),or(sF1,sF6))),
inference(resolution,[],[f262,f7]) ).
fof(f340,plain,
! [X0] : theorem(or(not(or(not(X0),sF7)),or(not(or(sF1,X0)),sF8))),
inference(resolution,[],[f117,f7]) ).
fof(f431,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f104,f15]) ).
fof(f452,plain,
theorem(or(not(or(not(sF3),r)),sF7)),
inference(resolution,[],[f269,f7]) ).
fof(f674,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f270,f149]) ).
fof(f884,plain,
! [X0] :
( theorem(or(not(or(sF1,X0)),sF8))
| ~ theorem(or(not(X0),sF7)) ),
inference(resolution,[],[f340,f15]) ).
fof(f960,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f431,f15]) ).
fof(f1233,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f674,f148]) ).
fof(f1234,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X1))
| theorem(or(or(X2,X1),X0)) ),
inference(resolution,[],[f674,f184]) ).
fof(f2130,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f960,f48]) ).
fof(f2226,plain,
! [X0] :
( ~ theorem(or(X0,or(not(sF3),r)))
| theorem(or(X0,sF7)) ),
inference(resolution,[],[f960,f452]) ).
fof(f2232,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(sF1,X1)))
| theorem(or(X0,sF8))
| ~ theorem(or(not(X1),sF7)) ),
inference(resolution,[],[f960,f884]) ).
fof(f3098,plain,
( ~ theorem(or(sF8,sF7))
| theorem(sF8) ),
inference(superposition,[],[f1233,f34]) ).
fof(f3103,plain,
~ theorem(or(sF8,sF7)),
inference(forward_subsumption_resolution,[],[f3098,f35]) ).
fof(f3698,definition,
( spl9_48
<=> theorem(or(not(sF3),sF8)) ),
introduced(definition,[new_symbols(definition,[spl9_48])],[avatar_definition]) ).
fof(f3699,plain,
( theorem(or(not(sF3),sF8))
| ~ spl9_48 ),
inference(avatar_component_clause,[],[f3698]) ).
fof(f3700,plain,
( ~ theorem(or(not(sF3),sF8))
| spl9_48 ),
inference(avatar_component_clause,[],[f3698]) ).
fof(f6628,plain,
( theorem(or(sF8,not(sF3)))
| ~ spl9_48 ),
inference(resolution,[],[f3699,f184]) ).
fof(f13709,plain,
( theorem(or(not(sF3),sF8))
| ~ theorem(or(not(sF6),sF7)) ),
inference(resolution,[],[f2232,f339]) ).
fof(f13741,plain,
( ~ theorem(or(not(sF6),sF7))
| spl9_48 ),
inference(forward_subsumption_resolution,[],[f13709,f3700]) ).
fof(f13756,plain,
( $false
| spl9_48 ),
inference(forward_subsumption_resolution,[],[f13741,f127]) ).
fof(f13757,plain,
spl9_48,
inference(avatar_contradiction_clause,[],[f13756]) ).
fof(f13792,plain,
( ! [X0] : theorem(or(or(X0,not(sF3)),sF8))
| ~ spl9_48 ),
inference(resolution,[],[f6628,f1234]) ).
fof(f14189,plain,
( ! [X0] : theorem(or(sF8,or(X0,not(sF3))))
| ~ spl9_48 ),
inference(resolution,[],[f13792,f184]) ).
fof(f14263,plain,
( ! [X0] : theorem(or(sF8,or(not(sF3),X0)))
| ~ spl9_48 ),
inference(resolution,[],[f14189,f2130]) ).
fof(f14706,plain,
( theorem(or(sF8,sF7))
| ~ spl9_48 ),
inference(resolution,[],[f14263,f2226]) ).
fof(f14725,plain,
( $false
| ~ spl9_48 ),
inference(forward_subsumption_resolution,[],[f14706,f3103]) ).
fof(f14726,plain,
~ spl9_48,
inference(avatar_contradiction_clause,[],[f14725]) ).
cnf(s837,plain,
spl9_48,
inference(sat_conversion,[],[f13757]) ).
cnf(s851,plain,
~ spl9_48,
inference(sat_conversion,[],[f14726]) ).
cnf(s853,plain,
$false,
inference(rat,[],[s837,s851]) ).
fof(f14728,plain,
$false,
inference(avatar_sat_refutation,[],[s853]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL223-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.19/0.46 % Computer : n003.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Sun Sep 27 15:29:56 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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
% 6.56/1.56 % (711115)Will run a generic schedule for satisfiability detection.
% 6.56/1.56 % (711123)dis+10_1_sil=32000:sp=arity:random_seed=2838113623:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.56/1.56 % (711121)% WARNING: option uhcvi not known.
% 6.56/1.56 % (711120)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3421006069_2999 on theBenchmark for (2999ds/0Mi)
% 6.56/1.56 % (711121)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1956962048:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.56/1.56 % (711122)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4192495865:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.56/1.56 % (711125)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3237926943:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.56/1.56 % (711126)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4241419183:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.56/1.56 % TRYING [1]
% 6.56/1.56 % TRYING [2]
% 6.56/1.56 % TRYING [3]
% 6.56/1.56 % (711124)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2110575403:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.56/1.56 % (711123)Instruction limit reached!
% 6.56/1.56 % (711123)------------------------------
% 6.56/1.56 % (711123)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711123)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711123)Termination reason: Instruction limit
% 6.56/1.56 % (711123)Termination phase: Saturation
% 6.56/1.56 % (711123)Time elapsed: 0.052 s
% 6.56/1.56 % (711123)Peak memory usage: 12 MB
% 6.56/1.56 % (711123)Instructions burned: 105 (million)
% 6.56/1.56 % TRYING [4]
% 6.56/1.56 % (711134)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=537977133:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.56/1.56 % TRYING [1]
% 6.56/1.56 % TRYING [2]
% 6.56/1.56 % TRYING [3]
% 6.56/1.56 % TRYING [4]
% 6.56/1.56 % (711125)Instruction limit reached!
% 6.56/1.56 % (711125)------------------------------
% 6.56/1.56 % (711125)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711125)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711125)Termination reason: Instruction limit
% 6.56/1.56 % (711125)Termination phase: Saturation
% 6.56/1.56 % (711125)Time elapsed: 0.127 s
% 6.56/1.56 % (711125)Peak memory usage: 13 MB
% 6.56/1.56 % (711125)Instructions burned: 132 (million)
% 6.56/1.56 % (711124)Instruction limit reached!
% 6.56/1.56 % (711124)------------------------------
% 6.56/1.56 % (711124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711124)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711124)Termination reason: Instruction limit
% 6.56/1.56 % (711124)Termination phase: Saturation
% 6.56/1.56 % (711124)Time elapsed: 0.103 s
% 6.56/1.56 % (711124)Peak memory usage: 11 MB
% 6.56/1.56 % (711124)Instructions burned: 116 (million)
% 6.56/1.56 % (711126)Instruction limit reached!
% 6.56/1.56 % (711126)------------------------------
% 6.56/1.56 % (711126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711126)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711126)Termination reason: Instruction limit
% 6.56/1.56 % (711126)Termination phase: Saturation
% 6.56/1.56 % (711126)Time elapsed: 0.152 s
% 6.56/1.56 % (711126)Peak memory usage: 13 MB
% 6.56/1.56 % (711126)Instructions burned: 159 (million)
% 6.56/1.56 % (711137)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=1493985140:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.56/1.56 % (711136)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1801299018:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 6.56/1.56 % (711138)ott-21_1_sil=16000:fs=off:random_seed=2020752354:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 6.56/1.56 % TRYING [5]
% 6.56/1.56 % (711136)Instruction limit reached!
% 6.56/1.56 % (711136)------------------------------
% 6.56/1.56 % (711136)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711136)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711136)Termination reason: Instruction limit
% 6.56/1.56 % (711136)Termination phase: Saturation
% 6.56/1.56 % (711136)Time elapsed: 0.141 s
% 6.56/1.56 % (711136)Peak memory usage: 12 MB
% 6.56/1.56 % (711136)Instructions burned: 131 (million)
% 6.56/1.56 % (711134)Instruction limit reached!
% 6.56/1.56 % (711134)------------------------------
% 6.56/1.56 % (711134)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711134)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711134)Termination reason: Instruction limit
% 6.56/1.56 % (711134)Termination phase: Finite model building SAT solving
% 6.56/1.56 % (711134)Time elapsed: 0.300 s
% 6.56/1.56 % (711134)Peak memory usage: 15 MB
% 6.56/1.56 % (711134)Instructions burned: 714 (million)
% 6.56/1.56 % (711138)Instruction limit reached!
% 6.56/1.56 % (711138)------------------------------
% 6.56/1.56 % (711138)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711138)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711138)Termination reason: Instruction limit
% 6.56/1.56 % (711138)Termination phase: Saturation
% 6.56/1.56 % (711138)Time elapsed: 0.152 s
% 6.56/1.56 % (711138)Peak memory usage: 12 MB
% 6.56/1.56 % (711138)Instructions burned: 180 (million)
% 6.56/1.56 % (711142)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=396483226:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 6.56/1.56 % (711143)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4108421076:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 6.56/1.56 % TRYING [1]
% 6.56/1.56 % TRYING [2]
% 6.56/1.56 % TRYING [3]
% 6.56/1.56 % TRYING [4]
% 6.56/1.56 % (711144)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3701307025:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 6.56/1.56 % TRYING [5]
% 6.56/1.56 % TRYING [5]
% 6.56/1.56 % (711143)Instruction limit reached!
% 6.56/1.56 % (711143)------------------------------
% 6.56/1.56 % (711143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711143)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711143)Termination reason: Instruction limit
% 6.56/1.56 % (711143)Termination phase: Finite model building SAT solving
% 6.56/1.56 % (711143)Time elapsed: 0.371 s
% 6.56/1.56 % (711143)Peak memory usage: 13 MB
% 6.56/1.56 % (711143)Instructions burned: 867 (million)
% 6.56/1.56 % (711137)Instruction limit reached!
% 6.56/1.56 % (711137)------------------------------
% 6.56/1.56 % (711137)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711137)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711137)Termination reason: Instruction limit
% 6.56/1.56 % (711137)Termination phase: Saturation
% 6.56/1.56 % (711137)Time elapsed: 0.626 s
% 6.56/1.56 % (711137)Peak memory usage: 16 MB
% 6.56/1.56 % (711137)Instructions burned: 685 (million)
% 6.56/1.56 % (711148)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3891415548:i=889:ins=1_2991 on theBenchmark for (2991ds/889Mi)
% 6.56/1.56 % (711149)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3424181012:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2991 on theBenchmark for (2991ds/692Mi)
% 6.56/1.56 % (711142)Instruction limit reached!
% 6.56/1.56 % (711142)------------------------------
% 6.56/1.56 % (711142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711142)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711142)Termination reason: Instruction limit
% 6.56/1.56 % (711142)Termination phase: Saturation
% 6.56/1.56 % (711142)Time elapsed: 0.469 s
% 6.56/1.56 % (711142)Peak memory usage: 13 MB
% 6.56/1.56 % (711142)Instructions burned: 478 (million)
% 6.56/1.56 % (711152)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4172646848:i=879:kws=inv_precedence:fsr=off_2990 on theBenchmark for (2990ds/879Mi)
% 6.56/1.56 % TRYING [14]
% 6.56/1.56 % (711144) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-711115-711144"...
% 6.56/1.56 % (711144)...printing done.
% 6.56/1.56 % (711144)Refutation found. Thanks to Tanya!
% 6.56/1.56 % SZS status Unsatisfiable for theBenchmark
% 6.56/1.56 % SZS output start Proof for theBenchmark
% See solution above
% 6.56/1.56 % (711144)------------------------------
% 6.56/1.56 % (711144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.56/1.56 % (711144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.56/1.56 % (711144)CaDiCaL version: 2.1.3
% 6.56/1.56 % (711144)Termination reason: Refutation
% 6.56/1.56 % (711144)Time elapsed: 0.552 s
% 6.56/1.56 % (711144)Peak memory usage: 19 MB
% 6.56/1.56 % (711144)Instructions burned: 560 (million)
% 6.56/1.56 % (711115)Success in time 1.028 s
% 6.56/1.56 % Vampire exiting
%------------------------------------------------------------------------------