%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL302-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:19 AM UTC 2026
% Result : Unsatisfiable 14.65s 5.33s
% Output : Refutation 14.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 25
% Syntax : Number of formulae : 146 ( 106 unt; 14 def)
% Number of atoms : 200 ( 32 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 115 ( 61 ~; 54 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 16 con; 0-2 aty)
% Number of variables : 126 ( 126 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(p,q),implies(p,and(p,q)))),
file('/export/starexec/sandbox/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(not(or(not(or(not(or(not(p),q)),or(not(p),not(or(not(p),not(q)))))),not(or(not(or(not(p),not(or(not(p),not(q))))),or(not(p),q)))))),
inference(definition_unfolding,[],[f11,f12,f6,f6,f9]) ).
fof(f20,definition,
sF0 = not(p),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
not(p) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = or(sF0,q),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
or(sF0,q) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = not(q),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
not(q) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = or(sF0,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
or(sF0,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 = or(sF0,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
or(sF0,sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = or(sF2,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
or(sF2,sF6) = 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 = not(sF6),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
not(sF6) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = or(sF9,sF1),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
or(sF9,sF1) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = not(sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
not(sF10) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF12 = or(sF8,sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
or(sF8,sF11) = sF12,
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
sF13 = not(sF12),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f47,plain,
not(sF12) = sF13,
inference(reorient_equations,[],[f46]) ).
fof(f48,plain,
~ theorem(sF13),
inference(definition_folding,[],[f19,f47,f45,f43,f41,f23,f21,f39,f33,f31,f29,f27,f21,f21,f37,f35,f33,f31,f29,f27,f21,f21,f25,f23,f21]) ).
fof(f49,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f50,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f51,plain,
! [X0] : axiom(or(sF0,or(X0,p))),
inference(superposition,[],[f14,f21]) ).
fof(f52,plain,
! [X0] : axiom(or(sF3,or(X0,q))),
inference(superposition,[],[f14,f27]) ).
fof(f69,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f71,plain,
axiom(or(not(sF4),or(sF3,sF0))),
inference(superposition,[],[f15,f29]) ).
fof(f72,plain,
axiom(or(not(sF6),or(sF5,sF0))),
inference(superposition,[],[f15,f33]) ).
fof(f74,plain,
axiom(or(not(sF12),or(sF11,sF8))),
inference(superposition,[],[f15,f45]) ).
fof(f76,plain,
axiom(or(not(or(q,sF0)),sF1)),
inference(superposition,[],[f15,f23]) ).
fof(f78,plain,
axiom(or(not(or(sF5,sF0)),sF6)),
inference(superposition,[],[f15,f33]) ).
fof(f83,plain,
axiom(or(sF13,or(sF11,sF8))),
inference(forward_demodulation,[],[f74,f47]) ).
fof(f85,plain,
axiom(or(sF9,or(sF5,sF0))),
inference(forward_demodulation,[],[f72,f39]) ).
fof(f86,plain,
axiom(or(sF5,or(sF3,sF0))),
inference(forward_demodulation,[],[f71,f31]) ).
fof(f94,plain,
! [X0] :
( ~ theorem(or(sF8,X0))
| theorem(X0)
| ~ theorem(sF7) ),
inference(superposition,[],[f18,f37]) ).
fof(f95,plain,
! [X0] :
( ~ theorem(or(sF11,X0))
| theorem(X0)
| ~ theorem(sF10) ),
inference(superposition,[],[f18,f43]) ).
fof(f98,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f106,plain,
! [X0] : axiom(or(not(or(sF0,or(X0,sF3))),or(X0,sF4))),
inference(superposition,[],[f16,f29]) ).
fof(f107,plain,
! [X0] : axiom(or(not(or(sF0,or(X0,sF5))),or(X0,sF6))),
inference(superposition,[],[f16,f33]) ).
fof(f111,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f112,plain,
! [X0,X1] : axiom(or(not(or(sF0,X0)),or(not(or(X1,p)),or(X1,X0)))),
inference(superposition,[],[f17,f21]) ).
fof(f113,plain,
! [X0,X1] : axiom(or(not(or(sF3,X0)),or(not(or(X1,q)),or(X1,X0)))),
inference(superposition,[],[f17,f27]) ).
fof(f115,plain,
! [X0,X1] : axiom(or(not(or(sF5,X0)),or(not(or(X1,sF4)),or(X1,X0)))),
inference(superposition,[],[f17,f31]) ).
fof(f129,plain,
! [X0] : axiom(or(not(or(not(X0),sF6)),or(not(or(sF2,X0)),sF7))),
inference(superposition,[],[f17,f35]) ).
fof(f131,plain,
! [X0] : axiom(or(not(or(not(X0),sF1)),or(not(or(sF9,X0)),sF10))),
inference(superposition,[],[f17,f41]) ).
fof(f144,plain,
! [X0] : theorem(or(sF0,or(X0,p))),
inference(resolution,[],[f51,f7]) ).
fof(f146,plain,
! [X0] : theorem(or(sF3,or(X0,q))),
inference(resolution,[],[f52,f7]) ).
fof(f159,plain,
theorem(or(sF13,or(sF11,sF8))),
inference(resolution,[],[f83,f7]) ).
fof(f161,plain,
theorem(or(sF9,or(sF5,sF0))),
inference(resolution,[],[f85,f7]) ).
fof(f162,plain,
theorem(or(sF5,or(sF3,sF0))),
inference(resolution,[],[f86,f7]) ).
fof(f164,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f49,f18]) ).
fof(f165,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f50,f18]) ).
fof(f184,plain,
theorem(or(not(or(q,sF0)),sF1)),
inference(resolution,[],[f76,f7]) ).
fof(f187,plain,
theorem(or(not(or(sF5,sF0)),sF6)),
inference(resolution,[],[f78,f7]) ).
fof(f214,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f69,f18]) ).
fof(f269,plain,
! [X0] : theorem(or(not(or(sF0,or(X0,sF3))),or(X0,sF4))),
inference(resolution,[],[f106,f7]) ).
fof(f271,plain,
! [X0] : theorem(or(not(or(sF0,or(X0,sF5))),or(X0,sF6))),
inference(resolution,[],[f107,f7]) ).
fof(f308,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f98,f18]) ).
fof(f386,plain,
! [X0] : theorem(or(not(or(not(X0),sF6)),or(not(or(sF2,X0)),sF7))),
inference(resolution,[],[f129,f7]) ).
fof(f414,plain,
! [X0] : theorem(or(not(or(not(X0),sF1)),or(not(or(sF9,X0)),sF10))),
inference(resolution,[],[f131,f7]) ).
fof(f432,plain,
! [X0] : axiom(or(not(sF1),or(not(or(X0,p)),or(X0,q)))),
inference(superposition,[],[f112,f23]) ).
fof(f443,plain,
! [X0] : axiom(or(sF2,or(not(or(X0,p)),or(X0,q)))),
inference(forward_demodulation,[],[f432,f25]) ).
fof(f444,plain,
! [X0,X1] : theorem(or(not(or(sF3,X0)),or(not(or(X1,q)),or(X1,X0)))),
inference(resolution,[],[f113,f7]) ).
fof(f474,plain,
! [X0,X1] : theorem(or(not(or(sF5,X0)),or(not(or(X1,sF4)),or(X1,X0)))),
inference(resolution,[],[f115,f7]) ).
fof(f520,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f111,f18]) ).
fof(f553,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f214,f165]) ).
fof(f702,plain,
! [X0] :
( ~ theorem(or(sF0,or(X0,sF3)))
| theorem(or(X0,sF4)) ),
inference(resolution,[],[f269,f18]) ).
fof(f705,plain,
! [X0] :
( ~ theorem(or(sF0,or(X0,sF5)))
| theorem(or(X0,sF6)) ),
inference(resolution,[],[f271,f18]) ).
fof(f780,plain,
! [X0] : theorem(or(sF2,or(not(or(X0,p)),or(X0,q)))),
inference(resolution,[],[f443,f7]) ).
fof(f821,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f308,f50]) ).
fof(f822,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f308,f69]) ).
fof(f841,plain,
! [X0] : theorem(or(X0,or(sF3,q))),
inference(resolution,[],[f308,f146]) ).
fof(f843,plain,
theorem(or(sF3,or(sF5,sF0))),
inference(resolution,[],[f308,f162]) ).
fof(f851,plain,
theorem(or(sF11,or(sF13,sF8))),
inference(resolution,[],[f308,f159]) ).
fof(f898,plain,
theorem(or(sF3,q)),
inference(resolution,[],[f841,f164]) ).
fof(f911,plain,
theorem(or(q,sF3)),
inference(resolution,[],[f898,f214]) ).
fof(f1019,plain,
( theorem(or(sF13,sF8))
| ~ theorem(sF10) ),
inference(resolution,[],[f851,f95]) ).
fof(f1381,plain,
! [X0] :
( theorem(or(not(or(sF2,X0)),sF7))
| ~ theorem(or(not(X0),sF6)) ),
inference(resolution,[],[f386,f18]) ).
fof(f1420,plain,
! [X0] :
( theorem(or(not(or(sF9,X0)),sF10))
| ~ theorem(or(not(X0),sF1)) ),
inference(resolution,[],[f414,f18]) ).
fof(f1461,plain,
! [X0,X1] :
( theorem(or(not(or(X0,q)),or(X0,X1)))
| ~ theorem(or(sF3,X1)) ),
inference(resolution,[],[f444,f18]) ).
fof(f1503,plain,
! [X0,X1] : theorem(or(not(or(X0,sF4)),or(not(or(sF5,X1)),or(X0,X1)))),
inference(resolution,[],[f474,f308]) ).
fof(f1735,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f520,f18]) ).
fof(f1768,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f821,f164]) ).
fof(f1791,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f1768,f214]) ).
fof(f1816,plain,
( theorem(not(sF8))
| ~ theorem(sF7) ),
inference(resolution,[],[f1791,f94]) ).
fof(f2223,plain,
! [X0] :
( theorem(or(not(or(X0,sF11)),X0))
| ~ theorem(sF10) ),
inference(resolution,[],[f822,f95]) ).
fof(f2643,plain,
! [X0] :
( ~ theorem(or(X0,sF3))
| theorem(or(X0,sF4)) ),
inference(resolution,[],[f702,f165]) ).
fof(f3575,plain,
! [X0] : theorem(or(not(or(X0,p)),or(sF2,or(X0,q)))),
inference(resolution,[],[f780,f308]) ).
fof(f5876,plain,
! [X0] :
( ~ theorem(or(not(X0),sF6))
| theorem(sF7)
| ~ theorem(or(sF2,X0)) ),
inference(resolution,[],[f1381,f18]) ).
fof(f5924,plain,
! [X0] :
( ~ theorem(or(not(X0),sF1))
| theorem(sF10)
| ~ theorem(or(sF9,X0)) ),
inference(resolution,[],[f1420,f18]) ).
fof(f6189,plain,
theorem(or(q,sF4)),
inference(resolution,[],[f2643,f911]) ).
fof(f6769,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f1735,f49]) ).
fof(f6795,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f1735,f69]) ).
fof(f6883,plain,
! [X0] :
( ~ theorem(or(X0,or(q,sF0)))
| theorem(or(X0,sF1)) ),
inference(resolution,[],[f1735,f184]) ).
fof(f6891,plain,
! [X0] :
( ~ theorem(or(X0,or(sF5,sF0)))
| theorem(or(X0,sF6)) ),
inference(resolution,[],[f1735,f187]) ).
fof(f6905,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ),
inference(resolution,[],[f1735,f553]) ).
fof(f7193,plain,
! [X0,X1] :
( theorem(or(not(or(sF5,X0)),or(X1,X0)))
| ~ theorem(or(X1,sF4)) ),
inference(resolution,[],[f1503,f18]) ).
fof(f8285,plain,
! [X0] :
( ~ theorem(or(X0,sF11))
| theorem(X0)
| ~ theorem(sF10) ),
inference(resolution,[],[f2223,f18]) ).
fof(f10836,plain,
! [X0] :
( theorem(or(not(or(X0,q)),X0))
| ~ theorem(or(sF3,X0)) ),
inference(resolution,[],[f6769,f1461]) ).
fof(f11126,plain,
theorem(or(sF3,sF6)),
inference(resolution,[],[f6891,f843]) ).
fof(f11889,plain,
! [X0] :
( theorem(or(sF2,or(X0,q)))
| ~ theorem(or(X0,p)) ),
inference(resolution,[],[f3575,f18]) ).
fof(f16205,plain,
! [X0] :
( theorem(or(sF13,X0))
| ~ theorem(not(sF8))
| ~ theorem(sF10) ),
inference(resolution,[],[f6905,f1019]) ).
fof(f20416,plain,
! [X0] : theorem(or(sF0,or(p,X0))),
inference(resolution,[],[f6795,f144]) ).
fof(f21551,plain,
theorem(or(p,sF6)),
inference(resolution,[],[f20416,f705]) ).
fof(f21711,plain,
theorem(or(sF6,p)),
inference(resolution,[],[f21551,f214]) ).
fof(f23701,plain,
( ~ theorem(or(q,sF4))
| theorem(or(not(or(sF5,sF0)),sF1)) ),
inference(resolution,[],[f7193,f6883]) ).
fof(f23730,plain,
theorem(or(not(or(sF5,sF0)),sF1)),
inference(forward_subsumption_resolution,[],[f23701,f6189]) ).
fof(f37857,plain,
( theorem(sF10)
| ~ theorem(or(sF9,or(sF5,sF0))) ),
inference(resolution,[],[f23730,f5924]) ).
fof(f37876,plain,
theorem(sF10),
inference(forward_subsumption_resolution,[],[f37857,f161]) ).
fof(f59126,plain,
( ~ theorem(not(sF8))
| ~ theorem(sF10)
| theorem(sF13)
| ~ theorem(sF10) ),
inference(resolution,[],[f16205,f8285]) ).
fof(f59139,plain,
( ~ theorem(not(sF8))
| ~ theorem(sF10)
| theorem(sF13) ),
inference(duplicate_literal_removal,[],[f59126]) ).
fof(f59140,plain,
( ~ theorem(not(sF8))
| theorem(sF13) ),
inference(forward_subsumption_resolution,[],[f59139,f37876]) ).
fof(f59153,plain,
~ theorem(not(sF8)),
inference(forward_subsumption_resolution,[],[f59140,f48]) ).
fof(f59157,plain,
~ theorem(sF7),
inference(resolution,[],[f59153,f1816]) ).
fof(f85129,plain,
( ~ theorem(or(sF3,sF6))
| theorem(sF7)
| ~ theorem(or(sF2,or(sF6,q))) ),
inference(resolution,[],[f10836,f5876]) ).
fof(f85257,plain,
( theorem(sF7)
| ~ theorem(or(sF2,or(sF6,q))) ),
inference(forward_subsumption_resolution,[],[f85129,f11126]) ).
fof(f85262,plain,
~ theorem(or(sF2,or(sF6,q))),
inference(forward_subsumption_resolution,[],[f85257,f59157]) ).
fof(f85771,plain,
~ theorem(or(sF6,p)),
inference(resolution,[],[f85262,f11889]) ).
fof(f85786,plain,
$false,
inference(forward_subsumption_resolution,[],[f85771,f21711]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL302-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n018.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 15:35:53 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.78/3.59 % (2521370)Will run a generic schedule for satisfiability detection.
% 21.78/3.59 % (2521388)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2603725539:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 21.78/3.59 % (2521383)% WARNING: option uhcvi not known.
% 21.78/3.59 % (2521382)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3736585963_2999 on theBenchmark for (2999ds/0Mi)
% 21.78/3.59 % (2521383)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=529609625:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 21.78/3.59 % (2521387)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2296980404:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 21.78/3.59 % (2521385)dis+10_1_sil=32000:sp=arity:random_seed=2156927551:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 21.78/3.59 % (2521384)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4032239056:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 21.78/3.59 % (2521386)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3217133380:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 21.78/3.59 % TRYING [1]
% 21.78/3.59 % TRYING [2]
% 21.78/3.59 % TRYING [3]
% 21.78/3.59 % TRYING [4]
% 21.78/3.59 % (2521388)Instruction limit reached!
% 21.78/3.59 % (2521388)------------------------------
% 21.78/3.59 % (2521388)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.78/3.59 % (2521388)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.78/3.59 % (2521388)CaDiCaL version: 2.1.3
% 21.78/3.59 % (2521388)Termination reason: Instruction limit
% 21.78/3.59 % (2521388)Termination phase: Saturation
% 21.78/3.59 % (2521388)Time elapsed: 0.050 s
% 21.78/3.59 % (2521388)Peak memory usage: 12 MB
% 21.78/3.59 % (2521388)Instructions burned: 162 (million)
% 21.78/3.59 % (2521386)Instruction limit reached!
% 21.78/3.59 % (2521386)------------------------------
% 21.78/3.59 % (2521386)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.78/3.59 % (2521386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.78/3.59 % (2521386)CaDiCaL version: 2.1.3
% 21.78/3.59 % (2521386)Termination reason: Instruction limit
% 21.78/3.59 % (2521386)Termination phase: Saturation
% 21.78/3.59 % (2521386)Time elapsed: 0.055 s
% 21.78/3.59 % (2521386)Peak memory usage: 11 MB
% 21.78/3.59 % (2521386)Instructions burned: 118 (million)
% 21.78/3.59 % (2521425)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1084567516:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 21.78/3.59 % TRYING [1]
% 21.78/3.59 % TRYING [2]
% 21.78/3.59 % TRYING [3]
% 21.78/3.59 % (2521385)Instruction limit reached!
% 21.78/3.59 % (2521385)------------------------------
% 21.78/3.59 % (2521385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.78/3.59 % (2521385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.78/3.59 % (2521385)CaDiCaL version: 2.1.3
% 21.78/3.59 % (2521385)Termination reason: Instruction limit
% 21.78/3.59 % (2521385)Termination phase: Saturation
% 21.78/3.59 % (2521385)Time elapsed: 0.065 s
% 21.78/3.59 % (2521385)Peak memory usage: 12 MB
% 21.78/3.59 % (2521385)Instructions burned: 104 (million)
% 21.78/3.59 % TRYING [4]
% 21.78/3.59 % (2521429)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1758790508:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 21.78/3.59 % (2521387)Instruction limit reached!
% 21.78/3.59 % (2521387)------------------------------
% 21.78/3.59 % (2521387)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.78/3.59 % (2521387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.78/3.59 % (2521387)CaDiCaL version: 2.1.3
% 21.78/3.59 % (2521387)Termination reason: Instruction limit
% 21.78/3.59 % (2521387)Termination phase: Saturation
% 21.78/3.59 % (2521387)Time elapsed: 0.083 s
% 21.78/3.59 % (2521387)Peak memory usage: 14 MB
% 21.78/3.59 % (2521387)Instructions burned: 132 (million)
% 21.78/3.59 % (2521433)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=898487859:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 21.78/3.59 % (2521439)ott-21_1_sil=16000:fs=off:random_seed=573476950:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 21.78/3.59 % (2521429)Instruction limit reached!
% 21.78/3.59 % (2521429)------------------------------
% 21.78/3.59 % (2521429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.78/3.59 % (2521429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521429)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521429)Termination reason: Instruction limit
% 14.65/5.33 % (2521429)Termination phase: Saturation
% 14.65/5.33 % (2521429)Time elapsed: 0.085 s
% 14.65/5.33 % (2521429)Peak memory usage: 12 MB
% 14.65/5.33 % (2521429)Instructions burned: 132 (million)
% 14.65/5.33 % (2521456)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1582122707:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 14.65/5.33 % TRYING [5]
% 14.65/5.33 % (2521439)Instruction limit reached!
% 14.65/5.33 % (2521439)------------------------------
% 14.65/5.33 % (2521439)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521439)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521439)Termination reason: Instruction limit
% 14.65/5.33 % (2521439)Termination phase: Saturation
% 14.65/5.33 % (2521439)Time elapsed: 0.091 s
% 14.65/5.33 % (2521439)Peak memory usage: 13 MB
% 14.65/5.33 % (2521439)Instructions burned: 181 (million)
% 14.65/5.33 % (2521463)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1808633577:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 14.65/5.33 % TRYING [1]
% 14.65/5.33 % TRYING [2]
% 14.65/5.33 % TRYING [3]
% 14.65/5.33 % TRYING [4]
% 14.65/5.33 % TRYING [5]
% 14.65/5.33 % (2521425)Instruction limit reached!
% 14.65/5.33 % (2521425)------------------------------
% 14.65/5.33 % (2521425)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521425)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521425)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521425)Termination reason: Instruction limit
% 14.65/5.33 % (2521425)Termination phase: Finite model building SAT solving
% 14.65/5.33 % (2521425)Time elapsed: 0.226 s
% 14.65/5.33 % (2521425)Peak memory usage: 16 MB
% 14.65/5.33 % (2521425)Instructions burned: 715 (million)
% 14.65/5.33 % (2521475)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1555593676:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 14.65/5.33 % TRYING [5]
% 14.65/5.33 % (2521456)Instruction limit reached!
% 14.65/5.33 % (2521456)------------------------------
% 14.65/5.33 % (2521456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521456)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521456)Termination reason: Instruction limit
% 14.65/5.33 % (2521456)Termination phase: Saturation
% 14.65/5.33 % (2521456)Time elapsed: 0.282 s
% 14.65/5.33 % (2521456)Peak memory usage: 13 MB
% 14.65/5.33 % (2521456)Instructions burned: 477 (million)
% 14.65/5.33 % (2521478)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1697401372:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 14.65/5.33 % (2521433)Instruction limit reached!
% 14.65/5.33 % (2521433)------------------------------
% 14.65/5.33 % (2521433)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521433)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521433)Termination reason: Instruction limit
% 14.65/5.33 % (2521433)Termination phase: Saturation
% 14.65/5.33 % (2521433)Time elapsed: 0.411 s
% 14.65/5.33 % (2521433)Peak memory usage: 17 MB
% 14.65/5.33 % (2521433)Instructions burned: 684 (million)
% 14.65/5.33 % (2521484)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=611334078:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 14.65/5.33 % TRYING [14]
% 14.65/5.33 % (2521475)Instruction limit reached!
% 14.65/5.33 % (2521475)------------------------------
% 14.65/5.33 % (2521475)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521475)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521475)Termination reason: Instruction limit
% 14.65/5.33 % (2521475)Termination phase: Saturation
% 14.65/5.33 % (2521475)Time elapsed: 0.378 s
% 14.65/5.33 % (2521475)Peak memory usage: 25 MB
% 14.65/5.33 % (2521475)Instructions burned: 1182 (million)
% 14.65/5.33 % (2521494)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=705578966:i=879:kws=inv_precedence:fsr=off_2992 on theBenchmark for (2992ds/879Mi)
% 14.65/5.33 % (2521463)Instruction limit reached!
% 14.65/5.33 % (2521463)------------------------------
% 14.65/5.33 % (2521463)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521463)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521463)Termination reason: Instruction limit
% 14.65/5.33 % (2521463)Termination phase: Finite model building SAT solving
% 14.65/5.33 % (2521463)Time elapsed: 0.490 s
% 14.65/5.33 % (2521463)Peak memory usage: 14 MB
% 14.65/5.33 % (2521463)Instructions burned: 866 (million)
% 14.65/5.33 % (2521496)fmb+10_1_sil=64000:random_seed=2393443417:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 14.65/5.33 % TRYING [1]
% 14.65/5.33 % TRYING [2]
% 14.65/5.33 % TRYING [3]
% 14.65/5.33 % TRYING [4]
% 14.65/5.33 % TRYING [5]
% 14.65/5.33 % (2521484)Instruction limit reached!
% 14.65/5.33 % (2521484)------------------------------
% 14.65/5.33 % (2521484)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521484)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521484)Termination reason: Instruction limit
% 14.65/5.33 % (2521484)Termination phase: Saturation
% 14.65/5.33 % (2521484)Time elapsed: 0.338 s
% 14.65/5.33 % (2521484)Peak memory usage: 27 MB
% 14.65/5.33 % (2521484)Instructions burned: 693 (million)
% 14.65/5.33 % (2521498)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1049753500:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 14.65/5.33 % TRYING [20]
% 14.65/5.33 % (2521478)Instruction limit reached!
% 14.65/5.33 % (2521478)------------------------------
% 14.65/5.33 % (2521478)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521478)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521478)Termination reason: Instruction limit
% 14.65/5.33 % (2521478)Termination phase: Finite model building constraint generation
% 14.65/5.33 % (2521478)Time elapsed: 0.423 s
% 14.65/5.33 % (2521478)Peak memory usage: 69 MB
% 14.65/5.33 % (2521478)Instructions burned: 891 (million)
% 14.65/5.33 % (2521500)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2298798527:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 14.65/5.33 % TRYING [8]
% 14.65/5.33 % (2521494)Instruction limit reached!
% 14.65/5.33 % (2521494)------------------------------
% 14.65/5.33 % (2521494)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521494)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521494)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521494)Termination reason: Instruction limit
% 14.65/5.33 % (2521494)Termination phase: Saturation
% 14.65/5.33 % (2521494)Time elapsed: 0.254 s
% 14.65/5.33 % (2521494)Peak memory usage: 18 MB
% 14.65/5.33 % (2521494)Instructions burned: 881 (million)
% 14.65/5.33 % (2521502)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3603358966:i=5131_2990 on theBenchmark for (2990ds/5131Mi)
% 14.65/5.33 % (2521500)Instruction limit reached!
% 14.65/5.33 % (2521500)------------------------------
% 14.65/5.33 % (2521500)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521500)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521500)Termination reason: Instruction limit
% 14.65/5.33 % (2521500)Termination phase: Finite model building SAT solving
% 14.65/5.33 % (2521500)Time elapsed: 0.597 s
% 14.65/5.33 % (2521500)Peak memory usage: 51 MB
% 14.65/5.33 % (2521500)Instructions burned: 920 (million)
% 14.65/5.33 % (2521524)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2144895665:i=1472:ins=7:fdi=8:gsp=on_2984 on theBenchmark for (2984ds/1472Mi)
% 14.65/5.33 % TRYING [6]
% 14.65/5.33 % TRYING [6]
% 14.65/5.33 % (2521524)Instruction limit reached!
% 14.65/5.33 % (2521524)------------------------------
% 14.65/5.33 % (2521524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521524)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521524)Termination reason: Instruction limit
% 14.65/5.33 % (2521524)Termination phase: Saturation
% 14.65/5.33 % (2521524)Time elapsed: 1.381 s
% 14.65/5.33 % (2521524)Peak memory usage: 32 MB
% 14.65/5.33 % (2521524)Instructions burned: 1472 (million)
% 14.65/5.33 % (2521547)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2614321825:i=6324_2969 on theBenchmark for (2969ds/6324Mi)
% 14.65/5.33 % TRYING [77]
% 14.65/5.33 % (2521502)Instruction limit reached!
% 14.65/5.33 % (2521502)------------------------------
% 14.65/5.33 % (2521502)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521502)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521502)Termination reason: Instruction limit
% 14.65/5.33 % (2521502)Termination phase: Saturation
% 14.65/5.33 % (2521502)Time elapsed: 2.183 s
% 14.65/5.33 % (2521502)Peak memory usage: 24 MB
% 14.65/5.33 % (2521502)Instructions burned: 5131 (million)
% 14.65/5.33 % (2521550)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2133897137:fmbsr=2.30978:i=2174_2968 on theBenchmark for (2968ds/2174Mi)
% 14.65/5.33 % TRYING [16]
% 14.65/5.33 % (2521550)Instruction limit reached!
% 14.65/5.33 % (2521550)------------------------------
% 14.65/5.33 % (2521550)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521550)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521550)Termination reason: Instruction limit
% 14.65/5.33 % (2521550)Termination phase: Finite model building constraint generation
% 14.65/5.33 % (2521550)Time elapsed: 0.591 s
% 14.65/5.33 % (2521550)Peak memory usage: 132 MB
% 14.65/5.33 % (2521550)Instructions burned: 2176 (million)
% 14.65/5.33 % (2521555)ott-2_1_sil=16000:newcnf=on:random_seed=604585694:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2962 on theBenchmark for (2962ds/869Mi)
% 14.65/5.33 % (2521555)Instruction limit reached!
% 14.65/5.33 % (2521555)------------------------------
% 14.65/5.33 % (2521555)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521555)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521555)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521555)Termination reason: Instruction limit
% 14.65/5.33 % (2521555)Termination phase: Saturation
% 14.65/5.33 % (2521555)Time elapsed: 0.276 s
% 14.65/5.33 % (2521555)Peak memory usage: 15 MB
% 14.65/5.33 % (2521555)Instructions burned: 870 (million)
% 14.65/5.33 % (2521611)ott+10_1_sil=32000:tgt=ground:random_seed=2051514548:i=5114:av=off_2959 on theBenchmark for (2959ds/5114Mi)
% 14.65/5.33 % (2521611) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2521370-2521611"...
% 14.65/5.33 % (2521611)...printing done.
% 14.65/5.33 % (2521611)Refutation found. Thanks to Tanya!
% 14.65/5.33 % SZS status Unsatisfiable for theBenchmark
% 14.65/5.33 % SZS output start Proof for theBenchmark
% See solution above
% 14.65/5.33 % (2521611)------------------------------
% 14.65/5.33 % (2521611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/5.33 % (2521611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/5.33 % (2521611)CaDiCaL version: 2.1.3
% 14.65/5.33 % (2521611)Termination reason: Refutation
% 14.65/5.33 % (2521611)Time elapsed: 0.751 s
% 14.65/5.33 % (2521611)Peak memory usage: 26 MB
% 14.65/5.33 % (2521611)Instructions burned: 2403 (million)
% 14.65/5.33 % (2521370)Success in time 4.907 s
% 14.65/5.33 % Vampire exiting
%------------------------------------------------------------------------------