%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL303-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 : n010.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 30.19s 4.77s
% Output : Refutation 30.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 30
% Syntax : Number of formulae : 206 ( 142 unt; 19 def)
% Number of atoms : 286 ( 42 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 172 ( 92 ~; 80 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 21 con; 0-2 aty)
% Number of variables : 170 ( 170 !; 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),equivalent(q,or(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)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))),
inference(definition_unfolding,[],[f11,f12,f6,f12]) ).
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(p,q),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
or(p,q) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(sF3,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(sF3,sF4) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = not(sF4),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
not(sF4) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = or(sF7,q),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
or(sF7,q) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = not(sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
not(sF8) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = or(sF6,sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
or(sF6,sF9) = 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(sF2,sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
or(sF2,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,definition,
sF14 = not(sF11),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f49,plain,
not(sF11) = sF14,
inference(reorient_equations,[],[f48]) ).
fof(f50,definition,
sF15 = or(sF14,sF1),
introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).
fof(f51,plain,
or(sF14,sF1) = sF15,
inference(reorient_equations,[],[f50]) ).
fof(f52,definition,
sF16 = not(sF15),
introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).
fof(f53,plain,
not(sF15) = sF16,
inference(reorient_equations,[],[f52]) ).
fof(f54,definition,
sF17 = or(sF13,sF16),
introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).
fof(f55,plain,
or(sF13,sF16) = sF17,
inference(reorient_equations,[],[f54]) ).
fof(f56,definition,
sF18 = not(sF17),
introduced(definition,[new_symbols(definition,[sF18])],[function_definition]) ).
fof(f57,plain,
not(sF17) = sF18,
inference(reorient_equations,[],[f56]) ).
fof(f58,plain,
~ theorem(sF18),
inference(definition_folding,[],[f19,f57,f55,f53,f51,f23,f21,f49,f43,f41,f39,f37,f35,f29,f33,f31,f29,f27,f47,f45,f43,f41,f39,f37,f35,f29,f33,f31,f29,f27,f25,f23,f21]) ).
fof(f59,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f60,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f61,plain,
! [X0] : axiom(or(sF0,or(X0,p))),
inference(superposition,[],[f14,f21]) ).
fof(f64,plain,
! [X0] : axiom(or(sF7,or(X0,sF4))),
inference(superposition,[],[f14,f35]) ).
fof(f67,plain,
! [X0] : axiom(or(sF11,or(X0,sF10))),
inference(superposition,[],[f14,f43]) ).
fof(f68,plain,
! [X0] : axiom(or(sF14,or(X0,sF11))),
inference(superposition,[],[f14,f49]) ).
fof(f73,plain,
axiom(or(not(q),sF4)),
inference(superposition,[],[f14,f29]) ).
fof(f74,plain,
axiom(or(not(q),sF8)),
inference(superposition,[],[f14,f37]) ).
fof(f83,plain,
axiom(or(sF3,sF8)),
inference(forward_demodulation,[],[f74,f27]) ).
fof(f84,plain,
axiom(or(sF3,sF4)),
inference(forward_demodulation,[],[f73,f27]) ).
fof(f86,plain,
axiom(sF5),
inference(forward_demodulation,[],[f84,f31]) ).
fof(f87,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f95,plain,
axiom(or(not(sF17),or(sF16,sF13))),
inference(superposition,[],[f15,f55]) ).
fof(f97,plain,
axiom(or(not(or(q,p)),sF4)),
inference(superposition,[],[f15,f29]) ).
fof(f99,plain,
axiom(or(not(or(sF1,sF14)),sF15)),
inference(superposition,[],[f15,f51]) ).
fof(f104,plain,
axiom(or(sF18,or(sF16,sF13))),
inference(forward_demodulation,[],[f95,f57]) ).
fof(f112,plain,
theorem(sF5),
inference(resolution,[],[f86,f7]) ).
fof(f117,plain,
! [X0] :
( ~ theorem(or(sF6,X0))
| theorem(X0)
| ~ theorem(sF5) ),
inference(superposition,[],[f18,f33]) ).
fof(f121,plain,
! [X0] :
( ~ theorem(or(sF13,X0))
| theorem(X0)
| ~ theorem(sF12) ),
inference(superposition,[],[f18,f47]) ).
fof(f122,plain,
! [X0] :
( ~ theorem(or(sF16,X0))
| theorem(X0)
| ~ theorem(sF15) ),
inference(superposition,[],[f18,f53]) ).
fof(f124,plain,
! [X0] :
( ~ theorem(or(sF6,X0))
| theorem(X0) ),
inference(forward_subsumption_resolution,[],[f117,f112]) ).
fof(f125,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f127,plain,
! [X0] : axiom(or(not(or(X0,sF4)),or(p,or(X0,q)))),
inference(superposition,[],[f16,f29]) ).
fof(f131,plain,
! [X0] : axiom(or(not(or(X0,sF10)),or(sF6,or(X0,sF9)))),
inference(superposition,[],[f16,f41]) ).
fof(f132,plain,
! [X0] : axiom(or(not(or(X0,sF12)),or(sF2,or(X0,sF11)))),
inference(superposition,[],[f16,f45]) ).
fof(f139,plain,
! [X0] : axiom(or(not(or(sF6,or(X0,sF9))),or(X0,sF10))),
inference(superposition,[],[f16,f41]) ).
fof(f140,plain,
! [X0] : axiom(or(not(or(sF2,or(X0,sF11))),or(X0,sF12))),
inference(superposition,[],[f16,f45]) ).
fof(f143,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f144,plain,
! [X0,X1] : axiom(or(not(or(sF0,X0)),or(not(or(X1,p)),or(X1,X0)))),
inference(superposition,[],[f17,f21]) ).
fof(f150,plain,
! [X0,X1] : axiom(or(not(or(sF11,X0)),or(not(or(X1,sF10)),or(X1,X0)))),
inference(superposition,[],[f17,f43]) ).
fof(f155,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF1),or(sF0,X0)))),
inference(superposition,[],[f17,f23]) ).
fof(f163,plain,
! [X0] : axiom(or(not(or(not(X0),q)),or(not(or(sF0,X0)),sF1))),
inference(superposition,[],[f17,f23]) ).
fof(f169,plain,
! [X0] : axiom(or(not(or(not(X0),sF11)),or(not(or(sF2,X0)),sF12))),
inference(superposition,[],[f17,f45]) ).
fof(f178,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(sF2,or(sF0,X0)))),
inference(forward_demodulation,[],[f155,f25]) ).
fof(f184,plain,
! [X0] : axiom(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
inference(forward_demodulation,[],[f178,f27]) ).
fof(f187,plain,
theorem(or(sF3,sF8)),
inference(resolution,[],[f83,f7]) ).
fof(f191,plain,
! [X0] : theorem(or(sF0,or(X0,p))),
inference(resolution,[],[f61,f7]) ).
fof(f200,plain,
! [X0] : theorem(or(sF7,or(X0,sF4))),
inference(resolution,[],[f64,f7]) ).
fof(f205,plain,
! [X0] : theorem(or(sF11,or(X0,sF10))),
inference(resolution,[],[f67,f7]) ).
fof(f206,plain,
! [X0] : theorem(or(sF14,or(X0,sF11))),
inference(resolution,[],[f68,f7]) ).
fof(f211,plain,
theorem(or(sF18,or(sF16,sF13))),
inference(resolution,[],[f104,f7]) ).
fof(f221,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f60,f18]) ).
fof(f253,plain,
theorem(or(not(or(q,p)),sF4)),
inference(resolution,[],[f97,f7]) ).
fof(f257,plain,
theorem(or(not(or(sF1,sF14)),sF15)),
inference(resolution,[],[f99,f7]) ).
fof(f300,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f87,f18]) ).
fof(f337,plain,
axiom(or(not(or(sF7,sF4)),or(p,sF8))),
inference(superposition,[],[f127,f37]) ).
fof(f350,plain,
! [X0] : theorem(or(not(or(X0,sF10)),or(sF6,or(X0,sF9)))),
inference(resolution,[],[f131,f7]) ).
fof(f353,plain,
! [X0] : theorem(or(not(or(X0,sF12)),or(sF2,or(X0,sF11)))),
inference(resolution,[],[f132,f7]) ).
fof(f397,plain,
! [X0] : theorem(or(not(or(sF6,or(X0,sF9))),or(X0,sF10))),
inference(resolution,[],[f139,f7]) ).
fof(f400,plain,
! [X0] : theorem(or(not(or(sF2,or(X0,sF11))),or(X0,sF12))),
inference(resolution,[],[f140,f7]) ).
fof(f426,plain,
! [X0] : theorem(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
inference(resolution,[],[f184,f7]) ).
fof(f435,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f125,f18]) ).
fof(f458,plain,
axiom(or(not(or(sF7,q)),or(not(or(sF0,sF4)),sF1))),
inference(superposition,[],[f163,f35]) ).
fof(f468,plain,
axiom(or(not(sF8),or(not(or(sF0,sF4)),sF1))),
inference(forward_demodulation,[],[f458,f37]) ).
fof(f472,plain,
axiom(or(sF9,or(not(or(sF0,sF4)),sF1))),
inference(forward_demodulation,[],[f468,f39]) ).
fof(f572,plain,
! [X0] : theorem(or(not(or(not(X0),sF11)),or(not(or(sF2,X0)),sF12))),
inference(resolution,[],[f169,f7]) ).
fof(f578,plain,
axiom(or(not(or(sF9,sF11)),or(not(or(sF2,sF8)),sF12))),
inference(superposition,[],[f169,f39]) ).
fof(f606,plain,
! [X0,X1] : theorem(or(not(or(sF0,X0)),or(not(or(X1,p)),or(X1,X0)))),
inference(resolution,[],[f144,f7]) ).
fof(f699,plain,
! [X0,X1] : theorem(or(not(or(sF11,X0)),or(not(or(X1,sF10)),or(X1,X0)))),
inference(resolution,[],[f150,f7]) ).
fof(f756,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f143,f18]) ).
fof(f799,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f300,f221]) ).
fof(f917,plain,
theorem(or(not(or(sF7,sF4)),or(p,sF8))),
inference(resolution,[],[f337,f7]) ).
fof(f955,plain,
theorem(or(sF9,or(not(or(sF0,sF4)),sF1))),
inference(resolution,[],[f472,f7]) ).
fof(f1003,plain,
! [X0] :
( theorem(or(sF6,or(X0,sF9)))
| ~ theorem(or(X0,sF10)) ),
inference(resolution,[],[f350,f18]) ).
fof(f1022,plain,
! [X0] :
( theorem(or(sF2,or(X0,sF11)))
| ~ theorem(or(X0,sF12)) ),
inference(resolution,[],[f353,f18]) ).
fof(f1084,plain,
! [X0] :
( ~ theorem(or(sF6,or(X0,sF9)))
| theorem(or(X0,sF10)) ),
inference(resolution,[],[f397,f18]) ).
fof(f1138,plain,
! [X0] :
( theorem(or(sF2,or(sF0,X0)))
| ~ theorem(or(sF3,X0)) ),
inference(resolution,[],[f426,f18]) ).
fof(f1192,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f435,f221]) ).
fof(f1199,plain,
! [X0] : theorem(or(X0,or(not(or(sF2,or(X0,sF11))),sF12))),
inference(resolution,[],[f435,f400]) ).
fof(f1201,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f435,f60]) ).
fof(f1202,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f435,f87]) ).
fof(f1233,plain,
! [X0] : theorem(or(X0,or(sF7,sF4))),
inference(resolution,[],[f435,f200]) ).
fof(f1237,plain,
! [X0] : theorem(or(X0,or(sF11,sF10))),
inference(resolution,[],[f435,f205]) ).
fof(f1241,plain,
! [X0] : theorem(or(X0,or(sF14,sF11))),
inference(resolution,[],[f435,f206]) ).
fof(f1246,plain,
theorem(or(sF16,or(sF18,sF13))),
inference(resolution,[],[f435,f211]) ).
fof(f1396,plain,
theorem(or(sF11,sF10)),
inference(resolution,[],[f1237,f124]) ).
fof(f1446,plain,
theorem(or(sF14,sF11)),
inference(resolution,[],[f1241,f124]) ).
fof(f1456,plain,
theorem(or(sF11,sF14)),
inference(resolution,[],[f1446,f300]) ).
fof(f1507,plain,
( theorem(or(sF18,sF13))
| ~ theorem(sF15) ),
inference(resolution,[],[f1246,f122]) ).
fof(f1562,plain,
theorem(or(not(or(sF9,sF11)),or(not(or(sF2,sF8)),sF12))),
inference(resolution,[],[f578,f7]) ).
fof(f1729,plain,
! [X0] :
( theorem(or(not(or(sF2,X0)),sF12))
| ~ theorem(or(not(X0),sF11)) ),
inference(resolution,[],[f572,f18]) ).
fof(f1766,plain,
! [X0,X1] :
( theorem(or(not(or(X0,p)),or(X0,X1)))
| ~ theorem(or(sF0,X1)) ),
inference(resolution,[],[f606,f18]) ).
fof(f1872,plain,
! [X0,X1] :
( theorem(or(not(or(X0,sF10)),or(X0,X1)))
| ~ theorem(or(sF11,X1)) ),
inference(resolution,[],[f699,f18]) ).
fof(f1942,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f756,f18]) ).
fof(f1943,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f756,f435]) ).
fof(f1985,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f1201,f124]) ).
fof(f2005,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f1985,f300]) ).
fof(f2030,plain,
( theorem(not(sF13))
| ~ theorem(sF12) ),
inference(resolution,[],[f2005,f121]) ).
fof(f2192,plain,
theorem(or(not(or(sF0,sF4)),or(sF9,sF1))),
inference(resolution,[],[f955,f435]) ).
fof(f2214,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f1202,f18]) ).
fof(f2224,plain,
! [X0] :
( theorem(or(not(or(X0,sF16)),X0))
| ~ theorem(sF15) ),
inference(resolution,[],[f1202,f122]) ).
fof(f2287,plain,
! [X0] :
( ~ theorem(or(X0,sF10))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f1003,f124]) ).
fof(f2362,plain,
! [X0] :
( ~ theorem(or(X0,sF9))
| theorem(or(X0,sF10)) ),
inference(resolution,[],[f1084,f221]) ).
fof(f2491,plain,
! [X0] :
( theorem(or(sF0,or(sF2,X0)))
| ~ theorem(or(sF3,X0)) ),
inference(resolution,[],[f1138,f435]) ).
fof(f2519,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f1192,f18]) ).
fof(f3008,plain,
! [X0] :
( theorem(or(not(or(sF2,or(not(X0),sF11))),sF12))
| ~ theorem(X0) ),
inference(resolution,[],[f1199,f18]) ).
fof(f3339,plain,
theorem(or(sF11,sF9)),
inference(resolution,[],[f2287,f1396]) ).
fof(f3355,plain,
theorem(or(sF9,sF11)),
inference(resolution,[],[f3339,f300]) ).
fof(f3617,plain,
( theorem(or(not(or(sF2,sF8)),sF12))
| ~ theorem(or(sF9,sF11)) ),
inference(resolution,[],[f1562,f18]) ).
fof(f3620,plain,
theorem(or(not(or(sF2,sF8)),sF12)),
inference(forward_subsumption_resolution,[],[f3617,f3355]) ).
fof(f4400,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f1942,f59]) ).
fof(f4431,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f1942,f87]) ).
fof(f4535,plain,
! [X0] :
( theorem(or(X0,or(p,sF8)))
| ~ theorem(or(X0,or(sF7,sF4))) ),
inference(resolution,[],[f1942,f917]) ).
fof(f4574,plain,
! [X0] :
( ~ theorem(or(X0,or(q,p)))
| theorem(or(X0,sF4)) ),
inference(resolution,[],[f1942,f253]) ).
fof(f4590,plain,
! [X0] :
( ~ theorem(or(X0,or(sF2,sF8)))
| theorem(or(X0,sF12)) ),
inference(resolution,[],[f1942,f3620]) ).
fof(f4591,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(sF2,X1)))
| theorem(or(X0,sF12))
| ~ theorem(or(not(X1),sF11)) ),
inference(resolution,[],[f1942,f1729]) ).
fof(f4592,plain,
! [X0] :
( ~ theorem(or(X0,or(sF1,sF14)))
| theorem(or(X0,sF15)) ),
inference(resolution,[],[f1942,f257]) ).
fof(f4599,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ),
inference(resolution,[],[f1942,f799]) ).
fof(f4604,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f1942,f1202]) ).
fof(f4652,plain,
! [X0] : theorem(or(X0,or(p,sF8))),
inference(forward_subsumption_resolution,[],[f4535,f1233]) ).
fof(f4653,plain,
! [X0] : theorem(or(p,or(X0,sF8))),
inference(resolution,[],[f4652,f435]) ).
fof(f5149,plain,
! [X0,X1] :
( theorem(or(not(or(sF6,X0)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f1943,f124]) ).
fof(f6052,plain,
! [X0] :
( ~ theorem(or(X0,sF16))
| theorem(X0)
| ~ theorem(sF15) ),
inference(resolution,[],[f2224,f18]) ).
fof(f6330,plain,
! [X0,X1] :
( theorem(or(X1,not(or(X1,not(X0)))))
| ~ theorem(X0) ),
inference(resolution,[],[f2214,f300]) ).
fof(f8631,plain,
! [X0] :
( theorem(or(not(or(X0,p)),X0))
| ~ theorem(or(sF0,X0)) ),
inference(resolution,[],[f4400,f1766]) ).
fof(f8892,plain,
theorem(or(sF0,sF4)),
inference(resolution,[],[f4574,f191]) ).
fof(f9204,plain,
( theorem(or(not(or(sF1,sF10)),sF15))
| ~ theorem(or(sF11,sF14)) ),
inference(resolution,[],[f4592,f1872]) ).
fof(f9257,plain,
theorem(or(not(or(sF1,sF10)),sF15)),
inference(forward_subsumption_resolution,[],[f9204,f1456]) ).
fof(f9387,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X2,X1)) ),
inference(resolution,[],[f2519,f87]) ).
fof(f9530,plain,
! [X0] :
( theorem(or(X0,or(sF9,sF1)))
| ~ theorem(or(sF0,sF4)) ),
inference(resolution,[],[f2519,f2192]) ).
fof(f9666,plain,
! [X0] : theorem(or(X0,or(sF9,sF1))),
inference(forward_subsumption_resolution,[],[f9530,f8892]) ).
fof(f9944,plain,
theorem(or(sF9,sF1)),
inference(resolution,[],[f9666,f124]) ).
fof(f10046,plain,
theorem(or(sF1,sF9)),
inference(resolution,[],[f9944,f300]) ).
fof(f10060,plain,
theorem(or(sF1,sF10)),
inference(resolution,[],[f10046,f2362]) ).
fof(f13465,plain,
! [X0] :
( theorem(or(sF18,X0))
| ~ theorem(not(sF13))
| ~ theorem(sF15) ),
inference(resolution,[],[f4599,f1507]) ).
fof(f14054,plain,
! [X0] :
( ~ theorem(or(sF2,or(not(X0),sF11)))
| theorem(sF12)
| ~ theorem(X0) ),
inference(resolution,[],[f3008,f18]) ).
fof(f17203,plain,
! [X0] :
( theorem(or(sF2,or(sF11,X0)))
| ~ theorem(or(X0,sF12)) ),
inference(resolution,[],[f4431,f1022]) ).
fof(f29755,plain,
( theorem(or(p,sF12))
| ~ theorem(or(not(sF8),sF11)) ),
inference(resolution,[],[f4591,f4653]) ).
fof(f29833,plain,
( ~ theorem(or(sF9,sF11))
| theorem(or(p,sF12)) ),
inference(forward_demodulation,[],[f29755,f39]) ).
fof(f29857,plain,
theorem(or(p,sF12)),
inference(forward_subsumption_resolution,[],[f29833,f3355]) ).
fof(f41077,plain,
( theorem(sF15)
| ~ theorem(or(sF1,sF10)) ),
inference(resolution,[],[f9257,f18]) ).
fof(f41082,plain,
theorem(sF15),
inference(forward_subsumption_resolution,[],[f41077,f10060]) ).
fof(f67823,plain,
( ~ theorem(not(sF13))
| ~ theorem(sF15)
| theorem(sF18)
| ~ theorem(sF15) ),
inference(resolution,[],[f13465,f6052]) ).
fof(f67827,plain,
( ~ theorem(not(sF13))
| ~ theorem(sF15)
| theorem(sF18) ),
inference(duplicate_literal_removal,[],[f67823]) ).
fof(f67828,plain,
( ~ theorem(not(sF13))
| theorem(sF18) ),
inference(forward_subsumption_resolution,[],[f67827,f41082]) ).
fof(f67852,plain,
~ theorem(not(sF13)),
inference(forward_subsumption_resolution,[],[f67828,f58]) ).
fof(f67857,plain,
~ theorem(sF12),
inference(resolution,[],[f67852,f2030]) ).
fof(f73768,plain,
( theorem(or(sF0,sF12))
| ~ theorem(or(sF3,sF8)) ),
inference(resolution,[],[f4590,f2491]) ).
fof(f73816,plain,
theorem(or(sF0,sF12)),
inference(forward_subsumption_resolution,[],[f73768,f187]) ).
fof(f126580,plain,
! [X0] :
( theorem(sF12)
| ~ theorem(or(sF11,not(X0)))
| ~ theorem(or(sF2,X0)) ),
inference(resolution,[],[f14054,f4604]) ).
fof(f126623,plain,
! [X0] :
( ~ theorem(or(sF11,not(X0)))
| ~ theorem(or(sF2,X0)) ),
inference(forward_subsumption_resolution,[],[f126580,f67857]) ).
fof(f126739,plain,
! [X0] :
( ~ theorem(or(sF2,or(sF11,not(X0))))
| ~ theorem(X0) ),
inference(resolution,[],[f126623,f6330]) ).
fof(f126961,plain,
! [X0] :
( ~ theorem(or(not(X0),sF12))
| ~ theorem(X0) ),
inference(resolution,[],[f126739,f17203]) ).
fof(f127179,plain,
! [X0] :
( ~ theorem(or(not(X0),sF12))
| ~ theorem(or(sF6,X0)) ),
inference(resolution,[],[f126961,f5149]) ).
fof(f130322,plain,
( ~ theorem(or(sF6,or(sF12,p)))
| ~ theorem(or(sF0,sF12)) ),
inference(resolution,[],[f127179,f8631]) ).
fof(f130442,plain,
~ theorem(or(sF6,or(sF12,p))),
inference(forward_subsumption_resolution,[],[f130322,f73816]) ).
fof(f130920,plain,
~ theorem(or(p,sF12)),
inference(resolution,[],[f130442,f9387]) ).
fof(f130927,plain,
$false,
inference(forward_subsumption_resolution,[],[f130920,f29857]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL303-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.12/0.39 % Computer : n010.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 15:33:47 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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
% 15.97/2.75 % (1105213)Will run a generic schedule for satisfiability detection.
% 15.97/2.75 % (1105223)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3104071892:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 15.97/2.75 % (1105219)% WARNING: option uhcvi not known.
% 15.97/2.75 % (1105218)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3618508051_2999 on theBenchmark for (2999ds/0Mi)
% 15.97/2.75 % (1105219)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2275232010:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 15.97/2.75 % (1105220)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2488384472:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 15.97/2.75 % (1105221)dis+10_1_sil=32000:sp=arity:random_seed=1047333531:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 15.97/2.75 % (1105222)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1614103775:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 15.97/2.75 % (1105224)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3463033132:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 15.97/2.75 % TRYING [1]
% 15.97/2.75 % TRYING [2]
% 15.97/2.75 % TRYING [3]
% 15.97/2.75 % TRYING [4]
% 15.97/2.75 % (1105223)Instruction limit reached!
% 15.97/2.75 % (1105223)------------------------------
% 15.97/2.75 % (1105223)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.97/2.75 % (1105223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.97/2.75 % (1105223)CaDiCaL version: 2.1.3
% 15.97/2.75 % (1105223)Termination reason: Instruction limit
% 15.97/2.75 % (1105223)Termination phase: Saturation
% 15.97/2.75 % (1105223)Time elapsed: 0.044 s
% 15.97/2.75 % (1105223)Peak memory usage: 13 MB
% 15.97/2.75 % (1105223)Instructions burned: 131 (million)
% 15.97/2.75 % (1105232)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3066805378:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 15.97/2.75 % TRYING [1]
% 15.97/2.75 % TRYING [2]
% 15.97/2.75 % TRYING [3]
% 15.97/2.75 % (1105222)Instruction limit reached!
% 15.97/2.75 % (1105222)------------------------------
% 15.97/2.75 % (1105222)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.97/2.75 % (1105222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.97/2.75 % (1105222)CaDiCaL version: 2.1.3
% 15.97/2.75 % (1105222)Termination reason: Instruction limit
% 15.97/2.75 % (1105222)Termination phase: Saturation
% 15.97/2.75 % (1105222)Time elapsed: 0.054 s
% 15.97/2.75 % (1105222)Peak memory usage: 11 MB
% 15.97/2.75 % (1105222)Instructions burned: 118 (million)
% 15.97/2.75 % TRYING [4]
% 15.97/2.75 % (1105221)Instruction limit reached!
% 15.97/2.75 % (1105221)------------------------------
% 15.97/2.75 % (1105221)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.97/2.75 % (1105221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.97/2.75 % (1105221)CaDiCaL version: 2.1.3
% 15.97/2.75 % (1105221)Termination reason: Instruction limit
% 15.97/2.75 % (1105221)Termination phase: Saturation
% 15.97/2.75 % (1105221)Time elapsed: 0.064 s
% 15.97/2.75 % (1105221)Peak memory usage: 12 MB
% 15.97/2.75 % (1105221)Instructions burned: 104 (million)
% 15.97/2.75 % (1105234)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3427812078:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 15.97/2.75 % (1105235)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=2044122061:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 15.97/2.75 % (1105224)Instruction limit reached!
% 15.97/2.75 % (1105224)------------------------------
% 15.97/2.75 % (1105224)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.97/2.75 % (1105224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.97/2.75 % (1105224)CaDiCaL version: 2.1.3
% 15.97/2.75 % (1105224)Termination reason: Instruction limit
% 15.97/2.75 % (1105224)Termination phase: Saturation
% 15.97/2.75 % (1105224)Time elapsed: 0.087 s
% 15.97/2.75 % (1105224)Peak memory usage: 12 MB
% 15.97/2.75 % (1105224)Instructions burned: 160 (million)
% 15.97/2.75 % (1105238)ott-21_1_sil=16000:fs=off:random_seed=2998717541:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 15.97/2.75 % (1105234)Instruction limit reached!
% 15.97/2.75 % (1105234)------------------------------
% 15.97/2.75 % (1105234)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.97/2.75 % (1105234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105234)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105234)Termination reason: Instruction limit
% 30.19/4.77 % (1105234)Termination phase: Saturation
% 30.19/4.77 % (1105234)Time elapsed: 0.078 s
% 30.19/4.77 % (1105234)Peak memory usage: 12 MB
% 30.19/4.77 % (1105234)Instructions burned: 131 (million)
% 30.19/4.77 % (1105240)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2729470722:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 30.19/4.77 % (1105238)Instruction limit reached!
% 30.19/4.77 % (1105238)------------------------------
% 30.19/4.77 % (1105238)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105238)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105238)Termination reason: Instruction limit
% 30.19/4.77 % (1105238)Termination phase: Saturation
% 30.19/4.77 % (1105238)Time elapsed: 0.089 s
% 30.19/4.77 % (1105238)Peak memory usage: 13 MB
% 30.19/4.77 % (1105238)Instructions burned: 181 (million)
% 30.19/4.77 % TRYING [5]
% 30.19/4.77 % (1105242)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=190232264:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 30.19/4.77 % TRYING [1]
% 30.19/4.77 % TRYING [2]
% 30.19/4.77 % TRYING [3]
% 30.19/4.77 % TRYING [4]
% 30.19/4.77 % (1105232)Instruction limit reached!
% 30.19/4.77 % (1105232)------------------------------
% 30.19/4.77 % (1105232)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105232)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105232)Termination reason: Instruction limit
% 30.19/4.77 % (1105232)Termination phase: Finite model building SAT solving
% 30.19/4.77 % (1105232)Time elapsed: 0.212 s
% 30.19/4.77 % (1105232)Peak memory usage: 15 MB
% 30.19/4.77 % (1105232)Instructions burned: 714 (million)
% 30.19/4.77 % (1105244)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3688325501:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 30.19/4.77 % TRYING [5]
% 30.19/4.77 % TRYING [5]
% 30.19/4.77 % (1105240)Instruction limit reached!
% 30.19/4.77 % (1105240)------------------------------
% 30.19/4.77 % (1105240)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105240)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105240)Termination reason: Instruction limit
% 30.19/4.77 % (1105240)Termination phase: Saturation
% 30.19/4.77 % (1105240)Time elapsed: 0.278 s
% 30.19/4.77 % (1105240)Peak memory usage: 12 MB
% 30.19/4.77 % (1105240)Instructions burned: 477 (million)
% 30.19/4.77 % (1105246)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2727911214:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 30.19/4.77 % (1105235)Instruction limit reached!
% 30.19/4.77 % (1105235)------------------------------
% 30.19/4.77 % (1105235)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105235)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105235)Termination reason: Instruction limit
% 30.19/4.77 % (1105235)Termination phase: Saturation
% 30.19/4.77 % (1105235)Time elapsed: 0.388 s
% 30.19/4.77 % (1105235)Peak memory usage: 18 MB
% 30.19/4.77 % (1105235)Instructions burned: 686 (million)
% 30.19/4.77 % (1105248)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=1179324287: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)
% 30.19/4.77 % TRYING [14]
% 30.19/4.77 % (1105244)Instruction limit reached!
% 30.19/4.77 % (1105244)------------------------------
% 30.19/4.77 % (1105244)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105244)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105244)Termination reason: Instruction limit
% 30.19/4.77 % (1105244)Termination phase: Saturation
% 30.19/4.77 % (1105244)Time elapsed: 0.370 s
% 30.19/4.77 % (1105244)Peak memory usage: 25 MB
% 30.19/4.77 % (1105244)Instructions burned: 1179 (million)
% 30.19/4.77 % (1105250)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1285841528:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 30.19/4.77 % (1105242)Instruction limit reached!
% 30.19/4.77 % (1105242)------------------------------
% 30.19/4.77 % (1105242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105242)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105242)Termination reason: Instruction limit
% 30.19/4.77 % (1105242)Termination phase: Finite model building SAT solving
% 30.19/4.77 % (1105242)Time elapsed: 0.474 s
% 30.19/4.77 % (1105242)Peak memory usage: 13 MB
% 30.19/4.77 % (1105242)Instructions burned: 866 (million)
% 30.19/4.77 % (1105252)fmb+10_1_sil=64000:random_seed=4018270608:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 30.19/4.77 % TRYING [1]
% 30.19/4.77 % TRYING [2]
% 30.19/4.77 % TRYING [3]
% 30.19/4.77 % TRYING [4]
% 30.19/4.77 % (1105246)Instruction limit reached!
% 30.19/4.77 % (1105246)------------------------------
% 30.19/4.77 % (1105246)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105246)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105246)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105246)Termination reason: Instruction limit
% 30.19/4.77 % (1105246)Termination phase: Finite model building constraint generation
% 30.19/4.77 % (1105246)Time elapsed: 0.314 s
% 30.19/4.77 % (1105246)Peak memory usage: 69 MB
% 30.19/4.77 % (1105246)Instructions burned: 890 (million)
% 30.19/4.77 % (1105254)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=891401224:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 30.19/4.77 % TRYING [20]
% 30.19/4.77 % (1105248)Instruction limit reached!
% 30.19/4.77 % (1105248)------------------------------
% 30.19/4.77 % (1105248)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105248)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105248)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105248)Termination reason: Instruction limit
% 30.19/4.77 % (1105248)Termination phase: Saturation
% 30.19/4.77 % (1105248)Time elapsed: 0.331 s
% 30.19/4.77 % (1105248)Peak memory usage: 28 MB
% 30.19/4.77 % (1105248)Instructions burned: 692 (million)
% 30.19/4.77 % (1105256)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=744751257:fmbsr=1.7:i=920_2991 on theBenchmark for (2991ds/920Mi)
% 30.19/4.77 % TRYING [8]
% 30.19/4.77 % TRYING [5]
% 30.19/4.77 % (1105250)Instruction limit reached!
% 30.19/4.77 % (1105250)------------------------------
% 30.19/4.77 % (1105250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105250)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105250)Termination reason: Instruction limit
% 30.19/4.77 % (1105250)Termination phase: Saturation
% 30.19/4.77 % (1105250)Time elapsed: 0.257 s
% 30.19/4.77 % (1105250)Peak memory usage: 17 MB
% 30.19/4.77 % (1105250)Instructions burned: 882 (million)
% 30.19/4.77 % (1105258)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=884399045:i=5131_2990 on theBenchmark for (2990ds/5131Mi)
% 30.19/4.77 % (1105256)Instruction limit reached!
% 30.19/4.77 % (1105256)------------------------------
% 30.19/4.77 % (1105256)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105256)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105256)Termination reason: Instruction limit
% 30.19/4.77 % (1105256)Termination phase: Finite model building SAT solving
% 30.19/4.77 % (1105256)Time elapsed: 0.482 s
% 30.19/4.77 % (1105256)Peak memory usage: 50 MB
% 30.19/4.77 % (1105256)Instructions burned: 920 (million)
% 30.19/4.77 % (1105260)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3819433452:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 30.19/4.77 % (1105260)Instruction limit reached!
% 30.19/4.77 % (1105260)------------------------------
% 30.19/4.77 % (1105260)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105260)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105260)Termination reason: Instruction limit
% 30.19/4.77 % (1105260)Termination phase: Saturation
% 30.19/4.77 % (1105260)Time elapsed: 0.765 s
% 30.19/4.77 % (1105260)Peak memory usage: 32 MB
% 30.19/4.77 % (1105260)Instructions burned: 1474 (million)
% 30.19/4.77 % (1105262)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1277797188:i=6324_2978 on theBenchmark for (2978ds/6324Mi)
% 30.19/4.77 % TRYING [77]
% 30.19/4.77 % TRYING [6]
% 30.19/4.77 % (1105258)Instruction limit reached!
% 30.19/4.77 % (1105258)------------------------------
% 30.19/4.77 % (1105258)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105258)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105258)Termination reason: Instruction limit
% 30.19/4.77 % (1105258)Termination phase: Saturation
% 30.19/4.77 % (1105258)Time elapsed: 1.364 s
% 30.19/4.77 % (1105258)Peak memory usage: 25 MB
% 30.19/4.77 % (1105258)Instructions burned: 5133 (million)
% 30.19/4.77 % (1105264)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1915621512:fmbsr=2.30978:i=2174_2976 on theBenchmark for (2976ds/2174Mi)
% 30.19/4.77 % TRYING [16]
% 30.19/4.77 % (1105264)Instruction limit reached!
% 30.19/4.77 % (1105264)------------------------------
% 30.19/4.77 % (1105264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105264)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105264)Termination reason: Instruction limit
% 30.19/4.77 % (1105264)Termination phase: Finite model building constraint generation
% 30.19/4.77 % (1105264)Time elapsed: 0.410 s
% 30.19/4.77 % (1105264)Peak memory usage: 132 MB
% 30.19/4.77 % (1105264)Instructions burned: 2175 (million)
% 30.19/4.77 % (1105266)ott-2_1_sil=16000:newcnf=on:random_seed=493615787:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2972 on theBenchmark for (2972ds/869Mi)
% 30.19/4.77 % TRYING [6]
% 30.19/4.77 % (1105266)Instruction limit reached!
% 30.19/4.77 % (1105266)------------------------------
% 30.19/4.77 % (1105266)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105266)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105266)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105266)Termination reason: Instruction limit
% 30.19/4.77 % (1105266)Termination phase: Saturation
% 30.19/4.77 % (1105266)Time elapsed: 0.274 s
% 30.19/4.77 % (1105266)Peak memory usage: 14 MB
% 30.19/4.77 % (1105266)Instructions burned: 869 (million)
% 30.19/4.77 % (1105268)ott+10_1_sil=32000:tgt=ground:random_seed=1752288612:i=5114:av=off_2969 on theBenchmark for (2969ds/5114Mi)
% 30.19/4.77 % (1105254)Instruction limit reached!
% 30.19/4.77 % (1105254)------------------------------
% 30.19/4.77 % (1105254)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.77 % (1105254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.77 % (1105254)CaDiCaL version: 2.1.3
% 30.19/4.77 % (1105254)Termination reason: Instruction limit
% 30.19/4.77 % (1105254)Termination phase: Finite model building constraint generation
% 30.19/4.77 % (1105254)Time elapsed: 3.285 s
% 30.19/4.77 % (1105254)Peak memory usage: 545 MB
% 30.19/4.77 % (1105254)Instructions burned: 9515 (million)
% 30.19/4.77 % (1105270)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=4218253235:i=54282_2957 on theBenchmark for (2957ds/54282Mi)
% 30.19/4.77 % TRYING [1]
% 30.19/4.77 % TRYING [2]
% 30.19/4.77 % TRYING [3]
% 30.19/4.77 % TRYING [4]
% 30.19/4.77 % (1105268) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1105213-1105268"...
% 30.19/4.77 % (1105268)...printing done.
% 30.19/4.77 % (1105268)Refutation found. Thanks to Tanya!
% 30.19/4.77 % SZS status Unsatisfiable for theBenchmark
% 30.19/4.77 % SZS output start Proof for theBenchmark
% See solution above
% 30.19/4.78 % (1105268)------------------------------
% 30.19/4.78 % (1105268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 30.19/4.78 % (1105268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 30.19/4.78 % (1105268)CaDiCaL version: 2.1.3
% 30.19/4.78 % (1105268)Termination reason: Refutation
% 30.19/4.78 % (1105268)Time elapsed: 1.243 s
% 30.19/4.78 % (1105268)Peak memory usage: 37 MB
% 30.19/4.78 % (1105268)Instructions burned: 3913 (million)
% 30.19/4.78 % (1105213)Success in time 4.351 s
% 30.19/4.78 % Vampire exiting
%------------------------------------------------------------------------------