%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL344-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 : n013.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:24 AM UTC 2026
% Result : Unsatisfiable 33.58s 5.18s
% Output : Refutation 33.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 29
% Syntax : Number of formulae : 155 ( 111 unt; 18 def)
% Number of atoms : 210 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 121 ( 66 ~; 55 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 20 con; 0-2 aty)
% Number of variables : 128 ( 128 !; 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,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(or(equivalent(and(p,q),p),equivalent(and(p,q),q))),
file('/export/starexec/sandbox2/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(or(not(or(not(or(not(not(or(not(p),not(q)))),p)),not(or(not(p),not(or(not(p),not(q))))))),not(or(not(or(not(not(or(not(p),not(q)))),q)),not(or(not(q),not(or(not(p),not(q))))))))),
inference(definition_unfolding,[],[f11,f12,f9,f12,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 = not(q),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
not(q) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = or(sF0,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
or(sF0,sF1) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = not(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
not(sF2) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(sF4,p),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(sF4,p) = 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 = or(sF0,sF3),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
or(sF0,sF3) = 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 = or(sF6,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
or(sF6,sF8) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = not(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
not(sF9) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = or(sF4,q),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
or(sF4,q) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF12 = not(sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
not(sF11) = sF12,
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
sF13 = or(sF1,sF3),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f47,plain,
or(sF1,sF3) = sF13,
inference(reorient_equations,[],[f46]) ).
fof(f48,definition,
sF14 = not(sF13),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f49,plain,
not(sF13) = sF14,
inference(reorient_equations,[],[f48]) ).
fof(f50,definition,
sF15 = or(sF12,sF14),
introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).
fof(f51,plain,
or(sF12,sF14) = 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(sF10,sF16),
introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).
fof(f55,plain,
or(sF10,sF16) = sF17,
inference(reorient_equations,[],[f54]) ).
fof(f56,plain,
~ theorem(sF17),
inference(definition_folding,[],[f19,f55,f53,f51,f49,f47,f27,f25,f23,f21,f23,f45,f43,f29,f27,f25,f23,f21,f41,f39,f37,f35,f27,f25,f23,f21,f21,f33,f31,f29,f27,f25,f23,f21]) ).
fof(f57,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f58,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f59,plain,
! [X0] : axiom(or(sF0,or(X0,p))),
inference(superposition,[],[f14,f21]) ).
fof(f60,plain,
! [X0] : axiom(or(sF1,or(X0,q))),
inference(superposition,[],[f14,f23]) ).
fof(f62,plain,
! [X0] : axiom(or(sF4,or(X0,sF3))),
inference(superposition,[],[f14,f29]) ).
fof(f68,plain,
! [X0] : axiom(or(sF16,or(X0,sF15))),
inference(superposition,[],[f14,f53]) ).
fof(f82,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f83,plain,
axiom(or(not(sF2),or(sF1,sF0))),
inference(superposition,[],[f15,f25]) ).
fof(f92,plain,
axiom(or(not(or(sF3,sF0)),sF7)),
inference(superposition,[],[f15,f35]) ).
fof(f94,plain,
axiom(or(not(or(p,sF4)),sF5)),
inference(superposition,[],[f15,f31]) ).
fof(f95,plain,
axiom(or(not(or(q,sF4)),sF11)),
inference(superposition,[],[f15,f43]) ).
fof(f105,plain,
axiom(or(sF3,or(sF1,sF0))),
inference(forward_demodulation,[],[f83,f27]) ).
fof(f114,plain,
! [X0] :
( ~ theorem(or(sF12,X0))
| theorem(X0)
| ~ theorem(sF11) ),
inference(superposition,[],[f18,f45]) ).
fof(f118,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f126,plain,
! [X0] : axiom(or(not(or(X0,sF15)),or(sF12,or(X0,sF14)))),
inference(superposition,[],[f16,f51]) ).
fof(f127,plain,
! [X0] : axiom(or(not(or(sF0,or(X0,sF1))),or(X0,sF2))),
inference(superposition,[],[f16,f25]) ).
fof(f136,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f139,plain,
! [X0,X1] : axiom(or(not(or(sF3,X0)),or(not(or(X1,sF2)),or(X1,X0)))),
inference(superposition,[],[f17,f27]) ).
fof(f141,plain,
! [X0,X1] : axiom(or(not(or(sF6,X0)),or(not(or(X1,sF5)),or(X1,X0)))),
inference(superposition,[],[f17,f33]) ).
fof(f157,plain,
! [X0] : axiom(or(not(or(not(X0),sF3)),or(not(or(sF1,X0)),sF13))),
inference(superposition,[],[f17,f47]) ).
fof(f161,plain,
! [X0] : axiom(or(not(or(not(X0),sF16)),or(not(or(sF10,X0)),sF17))),
inference(superposition,[],[f17,f55]) ).
fof(f179,plain,
! [X0] : theorem(or(sF0,or(X0,p))),
inference(resolution,[],[f59,f7]) ).
fof(f181,plain,
! [X0] : theorem(or(sF1,or(X0,q))),
inference(resolution,[],[f60,f7]) ).
fof(f185,plain,
! [X0] : theorem(or(sF4,or(X0,sF3))),
inference(resolution,[],[f62,f7]) ).
fof(f196,plain,
! [X0] : theorem(or(sF16,or(X0,sF15))),
inference(resolution,[],[f68,f7]) ).
fof(f203,plain,
theorem(or(sF3,or(sF1,sF0))),
inference(resolution,[],[f105,f7]) ).
fof(f204,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f57,f18]) ).
fof(f206,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f58,f18]) ).
fof(f234,plain,
theorem(or(not(or(sF3,sF0)),sF7)),
inference(resolution,[],[f92,f7]) ).
fof(f236,plain,
theorem(or(not(or(p,sF4)),sF5)),
inference(resolution,[],[f94,f7]) ).
fof(f237,plain,
theorem(or(not(or(q,sF4)),sF11)),
inference(resolution,[],[f95,f7]) ).
fof(f270,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f82,f18]) ).
fof(f330,plain,
! [X0] : theorem(or(not(or(X0,sF15)),or(sF12,or(X0,sF14)))),
inference(resolution,[],[f126,f7]) ).
fof(f332,plain,
! [X0] : theorem(or(not(or(sF0,or(X0,sF1))),or(X0,sF2))),
inference(resolution,[],[f127,f7]) ).
fof(f391,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f118,f18]) ).
fof(f459,plain,
axiom(or(not(or(sF8,sF3)),or(not(or(sF1,sF7)),sF13))),
inference(superposition,[],[f157,f37]) ).
fof(f534,plain,
! [X0] : theorem(or(not(or(not(X0),sF16)),or(not(or(sF10,X0)),sF17))),
inference(resolution,[],[f161,f7]) ).
fof(f604,plain,
! [X0,X1] : theorem(or(not(or(sF3,X0)),or(not(or(X1,sF2)),or(X1,X0)))),
inference(resolution,[],[f139,f7]) ).
fof(f636,plain,
! [X0] : axiom(or(not(sF9),or(not(or(X0,sF5)),or(X0,sF8)))),
inference(superposition,[],[f141,f39]) ).
fof(f645,plain,
! [X0] : axiom(or(sF10,or(not(or(X0,sF5)),or(X0,sF8)))),
inference(forward_demodulation,[],[f636,f41]) ).
fof(f700,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f136,f18]) ).
fof(f949,plain,
! [X0] :
( theorem(or(sF12,or(X0,sF14)))
| ~ theorem(or(X0,sF15)) ),
inference(resolution,[],[f330,f18]) ).
fof(f953,plain,
! [X0] :
( ~ theorem(or(sF0,or(X0,sF1)))
| theorem(or(X0,sF2)) ),
inference(resolution,[],[f332,f18]) ).
fof(f1062,plain,
! [X0] : theorem(or(sF10,or(not(or(X0,sF5)),or(X0,sF8)))),
inference(resolution,[],[f645,f7]) ).
fof(f1087,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f391,f206]) ).
fof(f1118,plain,
! [X0] : theorem(or(X0,or(sF1,q))),
inference(resolution,[],[f391,f181]) ).
fof(f1120,plain,
theorem(or(sF1,or(sF3,sF0))),
inference(resolution,[],[f391,f203]) ).
fof(f1122,plain,
! [X0] : theorem(or(X0,or(sF4,sF3))),
inference(resolution,[],[f391,f185]) ).
fof(f1137,plain,
! [X0] : theorem(or(X0,or(sF16,sF15))),
inference(resolution,[],[f391,f196]) ).
fof(f1168,plain,
theorem(or(sF1,q)),
inference(resolution,[],[f1118,f204]) ).
fof(f1183,plain,
theorem(or(q,sF1)),
inference(resolution,[],[f1168,f270]) ).
fof(f1212,plain,
theorem(or(sF4,sF3)),
inference(resolution,[],[f1122,f204]) ).
fof(f1227,plain,
theorem(or(sF3,sF4)),
inference(resolution,[],[f1212,f270]) ).
fof(f1255,plain,
theorem(or(not(or(sF8,sF3)),or(not(or(sF1,sF7)),sF13))),
inference(resolution,[],[f459,f7]) ).
fof(f1362,plain,
( theorem(or(sF16,sF15))
| ~ theorem(sF11) ),
inference(resolution,[],[f1137,f114]) ).
fof(f2174,plain,
! [X0] :
( theorem(or(not(or(sF10,X0)),sF17))
| ~ theorem(or(not(X0),sF16)) ),
inference(resolution,[],[f534,f18]) ).
fof(f2474,plain,
! [X0,X1] :
( theorem(or(not(or(X0,sF2)),or(X0,X1)))
| ~ theorem(or(sF3,X1)) ),
inference(resolution,[],[f604,f18]) ).
fof(f2657,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f700,f18]) ).
fof(f2658,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f700,f391]) ).
fof(f3842,plain,
! [X0] :
( ~ theorem(or(X0,sF15))
| theorem(or(X0,sF14))
| ~ theorem(sF11) ),
inference(resolution,[],[f949,f114]) ).
fof(f4149,plain,
! [X0] :
( ~ theorem(or(X0,sF1))
| theorem(or(X0,sF2)) ),
inference(resolution,[],[f953,f206]) ).
fof(f4363,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f1087,f18]) ).
fof(f5981,plain,
! [X0] : theorem(or(not(or(X0,sF5)),or(sF10,or(X0,sF8)))),
inference(resolution,[],[f1062,f391]) ).
fof(f9159,plain,
theorem(or(q,sF2)),
inference(resolution,[],[f4149,f1183]) ).
fof(f9352,plain,
! [X0] :
( ~ theorem(or(not(X0),sF16))
| theorem(sF17)
| ~ theorem(or(sF10,X0)) ),
inference(resolution,[],[f2174,f18]) ).
fof(f9366,plain,
! [X0] :
( ~ theorem(or(not(X0),sF16))
| ~ theorem(or(sF10,X0)) ),
inference(forward_subsumption_resolution,[],[f9352,f56]) ).
fof(f10366,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f2657,f57]) ).
fof(f10398,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f2657,f82]) ).
fof(f10453,plain,
! [X0] :
( theorem(or(X0,or(not(or(sF1,sF7)),sF13)))
| ~ theorem(or(X0,or(sF8,sF3))) ),
inference(resolution,[],[f2657,f1255]) ).
fof(f10535,plain,
! [X0] :
( ~ theorem(or(X0,or(p,sF4)))
| theorem(or(X0,sF5)) ),
inference(resolution,[],[f2657,f236]) ).
fof(f10537,plain,
! [X0] :
( ~ theorem(or(X0,or(sF3,sF0)))
| theorem(or(X0,sF7)) ),
inference(resolution,[],[f2657,f234]) ).
fof(f10543,plain,
! [X0] :
( ~ theorem(or(X0,or(q,sF4)))
| theorem(or(X0,sF11)) ),
inference(resolution,[],[f2657,f237]) ).
fof(f11169,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X2),X0)),X1))
| ~ theorem(or(not(X0),X1))
| ~ theorem(X2) ),
inference(resolution,[],[f2658,f18]) ).
fof(f13494,plain,
( theorem(or(sF16,sF14))
| ~ theorem(sF11)
| ~ theorem(sF11) ),
inference(resolution,[],[f3842,f1362]) ).
fof(f13496,plain,
( theorem(or(sF16,sF14))
| ~ theorem(sF11) ),
inference(duplicate_literal_removal,[],[f13494]) ).
fof(f15128,plain,
( theorem(or(not(or(p,sF2)),sF5))
| ~ theorem(or(sF3,sF4)) ),
inference(resolution,[],[f10535,f2474]) ).
fof(f15170,plain,
theorem(or(not(or(p,sF2)),sF5)),
inference(forward_subsumption_resolution,[],[f15128,f1227]) ).
fof(f15226,plain,
theorem(or(sF1,sF7)),
inference(resolution,[],[f10537,f1120]) ).
fof(f15323,plain,
( theorem(or(not(or(q,sF2)),sF11))
| ~ theorem(or(sF3,sF4)) ),
inference(resolution,[],[f10543,f2474]) ).
fof(f15365,plain,
theorem(or(not(or(q,sF2)),sF11)),
inference(forward_subsumption_resolution,[],[f15323,f1227]) ).
fof(f16265,plain,
! [X0] :
( theorem(or(sF10,or(X0,sF8)))
| ~ theorem(or(X0,sF5)) ),
inference(resolution,[],[f5981,f18]) ).
fof(f19051,plain,
( theorem(or(sF14,sF16))
| ~ theorem(sF11) ),
inference(resolution,[],[f13496,f270]) ).
fof(f29825,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f10398,f1087]) ).
fof(f30174,plain,
! [X0] : theorem(or(sF0,or(p,X0))),
inference(resolution,[],[f10398,f179]) ).
fof(f45860,plain,
! [X0,X1] :
( ~ theorem(or(sF10,or(not(X1),X0)))
| ~ theorem(X1)
| ~ theorem(or(not(X0),sF16)) ),
inference(resolution,[],[f11169,f9366]) ).
fof(f54727,plain,
( ~ theorem(or(sF1,sF7))
| ~ theorem(or(not(sF13),sF16))
| ~ theorem(or(sF10,or(sF8,sF3))) ),
inference(resolution,[],[f45860,f10453]) ).
fof(f54792,plain,
( ~ theorem(or(not(sF13),sF16))
| ~ theorem(or(sF10,or(sF8,sF3))) ),
inference(forward_subsumption_resolution,[],[f54727,f15226]) ).
fof(f54859,plain,
( ~ theorem(or(sF10,or(sF8,sF3)))
| ~ theorem(or(sF14,sF16)) ),
inference(forward_demodulation,[],[f54792,f49]) ).
fof(f55052,plain,
theorem(or(p,sF2)),
inference(resolution,[],[f30174,f953]) ).
fof(f55959,plain,
! [X0] :
( theorem(or(X0,sF5))
| ~ theorem(or(p,sF2)) ),
inference(resolution,[],[f15170,f4363]) ).
fof(f55978,plain,
! [X0] : theorem(or(X0,sF5)),
inference(forward_subsumption_resolution,[],[f55959,f55052]) ).
fof(f55987,plain,
( theorem(sF11)
| ~ theorem(or(q,sF2)) ),
inference(resolution,[],[f15365,f18]) ).
fof(f56003,plain,
theorem(sF11),
inference(forward_subsumption_resolution,[],[f55987,f9159]) ).
fof(f100040,plain,
( ~ theorem(or(sF8,sF5))
| theorem(or(sF10,sF8)) ),
inference(resolution,[],[f16265,f10366]) ).
fof(f100076,plain,
theorem(or(sF10,sF8)),
inference(forward_subsumption_resolution,[],[f100040,f55978]) ).
fof(f112192,plain,
( ~ theorem(or(sF10,sF8))
| ~ theorem(or(sF14,sF16)) ),
inference(resolution,[],[f29825,f54859]) ).
fof(f112316,plain,
~ theorem(or(sF14,sF16)),
inference(forward_subsumption_resolution,[],[f112192,f100076]) ).
fof(f112438,plain,
~ theorem(sF11),
inference(resolution,[],[f112316,f19051]) ).
fof(f112443,plain,
$false,
inference(forward_subsumption_resolution,[],[f112438,f56003]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL344-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.36 % Computer : n013.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 15:35:06 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.39 Running first-order model finding
% 0.08/0.39 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
% 20.54/3.35 % (361460)Will run a generic schedule for satisfiability detection.
% 20.54/3.35 % (361468)dis+10_1_sil=32000:sp=arity:random_seed=4121013312:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 20.54/3.35 % (361466)% WARNING: option uhcvi not known.
% 20.54/3.35 % (361465)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3354601012_2999 on theBenchmark for (2999ds/0Mi)
% 20.54/3.35 % (361471)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1059912287:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 20.54/3.35 % (361467)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3388717084:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 20.54/3.35 % (361470)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2477317410:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 20.54/3.35 % (361469)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1840842592:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 20.54/3.35 % (361466)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2440926196:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 20.54/3.35 % TRYING [1]
% 20.54/3.35 % TRYING [2]
% 20.54/3.35 % TRYING [3]
% 20.54/3.35 % TRYING [4]
% 20.54/3.35 % (361468)Instruction limit reached!
% 20.54/3.35 % (361468)------------------------------
% 20.54/3.35 % (361468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.54/3.35 % (361468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.54/3.35 % (361468)CaDiCaL version: 2.1.3
% 20.54/3.35 % (361468)Termination reason: Instruction limit
% 20.54/3.35 % (361468)Termination phase: Saturation
% 20.54/3.35 % (361468)Time elapsed: 0.035 s
% 20.54/3.35 % (361468)Peak memory usage: 12 MB
% 20.54/3.35 % (361468)Instructions burned: 104 (million)
% 20.54/3.35 % (361479)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=359455781:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 20.54/3.35 % TRYING [1]
% 20.54/3.35 % TRYING [2]
% 20.54/3.35 % TRYING [3]
% 20.54/3.35 % TRYING [4]
% 20.54/3.35 % (361469)Instruction limit reached!
% 20.54/3.35 % (361469)------------------------------
% 20.54/3.35 % (361469)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.54/3.35 % (361469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.54/3.35 % (361469)CaDiCaL version: 2.1.3
% 20.54/3.35 % (361469)Termination reason: Instruction limit
% 20.54/3.35 % (361469)Termination phase: Saturation
% 20.54/3.35 % (361469)Time elapsed: 0.056 s
% 20.54/3.35 % (361469)Peak memory usage: 11 MB
% 20.54/3.35 % (361469)Instructions burned: 118 (million)
% 20.54/3.35 % (361481)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3787395421:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 20.54/3.35 % (361470)Instruction limit reached!
% 20.54/3.35 % (361470)------------------------------
% 20.54/3.35 % (361470)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.54/3.35 % (361470)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.54/3.35 % (361470)CaDiCaL version: 2.1.3
% 20.54/3.35 % (361470)Termination reason: Instruction limit
% 20.54/3.35 % (361470)Termination phase: Saturation
% 20.54/3.35 % (361470)Time elapsed: 0.084 s
% 20.54/3.35 % (361470)Peak memory usage: 14 MB
% 20.54/3.35 % (361470)Instructions burned: 133 (million)
% 20.54/3.35 % (361471)Instruction limit reached!
% 20.54/3.35 % (361471)------------------------------
% 20.54/3.35 % (361471)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.54/3.35 % (361471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.54/3.35 % (361471)CaDiCaL version: 2.1.3
% 20.54/3.35 % (361471)Termination reason: Instruction limit
% 20.54/3.35 % (361471)Termination phase: Saturation
% 20.54/3.35 % (361471)Time elapsed: 0.098 s
% 20.54/3.35 % (361471)Peak memory usage: 13 MB
% 20.54/3.35 % (361471)Instructions burned: 159 (million)
% 20.54/3.35 % (361483)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=1051123139:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 20.54/3.35 % (361484)ott-21_1_sil=16000:fs=off:random_seed=2959154879:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 20.54/3.35 % (361481)Instruction limit reached!
% 20.54/3.35 % (361481)------------------------------
% 20.54/3.35 % (361481)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.54/3.35 % (361481)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361481)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361481)Termination reason: Instruction limit
% 33.58/5.18 % (361481)Termination phase: Saturation
% 33.58/5.18 % (361481)Time elapsed: 0.079 s
% 33.58/5.18 % (361481)Peak memory usage: 12 MB
% 33.58/5.18 % (361481)Instructions burned: 132 (million)
% 33.58/5.18 % (361487)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1998500359:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 33.58/5.18 % TRYING [5]
% 33.58/5.18 % (361484)Instruction limit reached!
% 33.58/5.18 % (361484)------------------------------
% 33.58/5.18 % (361484)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361484)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361484)Termination reason: Instruction limit
% 33.58/5.18 % (361484)Termination phase: Saturation
% 33.58/5.18 % (361484)Time elapsed: 0.089 s
% 33.58/5.18 % (361484)Peak memory usage: 12 MB
% 33.58/5.18 % (361484)Instructions burned: 181 (million)
% 33.58/5.18 % (361489)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1773112788:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 33.58/5.18 % TRYING [1]
% 33.58/5.18 % TRYING [2]
% 33.58/5.18 % TRYING [3]
% 33.58/5.18 % TRYING [4]
% 33.58/5.18 % (361479)Instruction limit reached!
% 33.58/5.18 % (361479)------------------------------
% 33.58/5.18 % (361479)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361479)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361479)Termination reason: Instruction limit
% 33.58/5.18 % (361479)Termination phase: Finite model building SAT solving
% 33.58/5.18 % (361479)Time elapsed: 0.217 s
% 33.58/5.18 % (361479)Peak memory usage: 16 MB
% 33.58/5.18 % (361479)Instructions burned: 716 (million)
% 33.58/5.18 % TRYING [5]
% 33.58/5.18 % (361491)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2791735253:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 33.58/5.18 % TRYING [5]
% 33.58/5.18 % (361487)Instruction limit reached!
% 33.58/5.18 % (361487)------------------------------
% 33.58/5.18 % (361487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361487)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361487)Termination reason: Instruction limit
% 33.58/5.18 % (361487)Termination phase: Saturation
% 33.58/5.18 % (361487)Time elapsed: 0.280 s
% 33.58/5.18 % (361487)Peak memory usage: 13 MB
% 33.58/5.18 % (361487)Instructions burned: 477 (million)
% 33.58/5.18 % (361493)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=4294449336:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 33.58/5.18 % (361483)Instruction limit reached!
% 33.58/5.18 % (361483)------------------------------
% 33.58/5.18 % (361483)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361483)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361483)Termination reason: Instruction limit
% 33.58/5.18 % (361483)Termination phase: Saturation
% 33.58/5.18 % (361483)Time elapsed: 0.403 s
% 33.58/5.18 % (361483)Peak memory usage: 17 MB
% 33.58/5.18 % (361483)Instructions burned: 684 (million)
% 33.58/5.18 % (361495)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=216852612: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)
% 33.58/5.18 % TRYING [14]
% 33.58/5.18 % (361491)Instruction limit reached!
% 33.58/5.18 % (361491)------------------------------
% 33.58/5.18 % (361491)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361491)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361491)Termination reason: Instruction limit
% 33.58/5.18 % (361491)Termination phase: Saturation
% 33.58/5.18 % (361491)Time elapsed: 0.375 s
% 33.58/5.18 % (361491)Peak memory usage: 26 MB
% 33.58/5.18 % (361491)Instructions burned: 1180 (million)
% 33.58/5.18 % (361497)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2888246079:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 33.58/5.18 % (361489)Instruction limit reached!
% 33.58/5.18 % (361489)------------------------------
% 33.58/5.18 % (361489)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361489)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361489)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361489)Termination reason: Instruction limit
% 33.58/5.18 % (361489)Termination phase: Finite model building SAT solving
% 33.58/5.18 % (361489)Time elapsed: 0.472 s
% 33.58/5.18 % (361489)Peak memory usage: 14 MB
% 33.58/5.18 % (361489)Instructions burned: 866 (million)
% 33.58/5.18 % (361499)fmb+10_1_sil=64000:random_seed=2037351305:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 33.58/5.18 % TRYING [1]
% 33.58/5.18 % TRYING [2]
% 33.58/5.18 % TRYING [3]
% 33.58/5.18 % TRYING [4]
% 33.58/5.18 % (361493)Instruction limit reached!
% 33.58/5.18 % (361493)------------------------------
% 33.58/5.18 % (361493)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361493)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361493)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361493)Termination reason: Instruction limit
% 33.58/5.18 % (361493)Termination phase: Finite model building constraint generation
% 33.58/5.18 % (361493)Time elapsed: 0.315 s
% 33.58/5.18 % (361493)Peak memory usage: 69 MB
% 33.58/5.18 % (361493)Instructions burned: 892 (million)
% 33.58/5.18 % (361501)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1670595480:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 33.58/5.18 % TRYING [20]
% 33.58/5.18 % TRYING [5]
% 33.58/5.18 % (361497)Instruction limit reached!
% 33.58/5.18 % (361497)------------------------------
% 33.58/5.18 % (361497)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361497)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361497)Termination reason: Instruction limit
% 33.58/5.18 % (361497)Termination phase: Saturation
% 33.58/5.18 % (361497)Time elapsed: 0.249 s
% 33.58/5.18 % (361497)Peak memory usage: 17 MB
% 33.58/5.18 % (361497)Instructions burned: 883 (million)
% 33.58/5.18 % (361495)Instruction limit reached!
% 33.58/5.18 % (361495)------------------------------
% 33.58/5.18 % (361495)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361495)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361495)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361495)Termination reason: Instruction limit
% 33.58/5.18 % (361495)Termination phase: Saturation
% 33.58/5.18 % (361495)Time elapsed: 0.385 s
% 33.58/5.18 % (361495)Peak memory usage: 18 MB
% 33.58/5.18 % (361495)Instructions burned: 692 (million)
% 33.58/5.18 % (361503)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1076847274:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 33.58/5.18 % TRYING [8]
% 33.58/5.18 % (361504)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=399224827:i=5131_2990 on theBenchmark for (2990ds/5131Mi)
% 33.58/5.18 % (361503)Instruction limit reached!
% 33.58/5.18 % (361503)------------------------------
% 33.58/5.18 % (361503)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361503)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361503)Termination reason: Instruction limit
% 33.58/5.18 % (361503)Termination phase: Finite model building SAT solving
% 33.58/5.18 % (361503)Time elapsed: 0.257 s
% 33.58/5.18 % (361503)Peak memory usage: 51 MB
% 33.58/5.18 % (361503)Instructions burned: 920 (million)
% 33.58/5.18 % (361507)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=898203204:i=1472:ins=7:fdi=8:gsp=on_2987 on theBenchmark for (2987ds/1472Mi)
% 33.58/5.18 % (361507)Instruction limit reached!
% 33.58/5.18 % (361507)------------------------------
% 33.58/5.18 % (361507)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361507)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361507)Termination reason: Instruction limit
% 33.58/5.18 % (361507)Termination phase: Saturation
% 33.58/5.18 % (361507)Time elapsed: 0.431 s
% 33.58/5.18 % (361507)Peak memory usage: 33 MB
% 33.58/5.18 % (361507)Instructions burned: 1476 (million)
% 33.58/5.18 % (361509)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=363093089:i=6324_2983 on theBenchmark for (2983ds/6324Mi)
% 33.58/5.18 % TRYING [77]
% 33.58/5.18 % TRYING [6]
% 33.58/5.18 % TRYING [6]
% 33.58/5.18 % (361509)Instruction limit reached!
% 33.58/5.18 % (361509)------------------------------
% 33.58/5.18 % (361509)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361509)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361509)Termination reason: Instruction limit
% 33.58/5.18 % (361509)Termination phase: Finite model building constraint generation
% 33.58/5.18 % (361509)Time elapsed: 1.288 s
% 33.58/5.18 % (361509)Peak memory usage: 457 MB
% 33.58/5.18 % (361509)Instructions burned: 6326 (million)
% 33.58/5.18 % (361511)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1671746297:fmbsr=2.30978:i=2174_2970 on theBenchmark for (2970ds/2174Mi)
% 33.58/5.18 % TRYING [16]
% 33.58/5.18 % (361511)Instruction limit reached!
% 33.58/5.18 % (361511)------------------------------
% 33.58/5.18 % (361511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361511)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361511)Termination reason: Instruction limit
% 33.58/5.18 % (361511)Termination phase: Finite model building constraint generation
% 33.58/5.18 % (361511)Time elapsed: 0.409 s
% 33.58/5.18 % (361511)Peak memory usage: 132 MB
% 33.58/5.18 % (361511)Instructions burned: 2180 (million)
% 33.58/5.18 % (361513)ott-2_1_sil=16000:newcnf=on:random_seed=3879705142:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2965 on theBenchmark for (2965ds/869Mi)
% 33.58/5.18 % (361513)Instruction limit reached!
% 33.58/5.18 % (361513)------------------------------
% 33.58/5.18 % (361513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361513)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361513)Termination reason: Instruction limit
% 33.58/5.18 % (361513)Termination phase: Saturation
% 33.58/5.18 % (361513)Time elapsed: 0.270 s
% 33.58/5.18 % (361513)Peak memory usage: 15 MB
% 33.58/5.18 % (361513)Instructions burned: 869 (million)
% 33.58/5.18 % (361515)ott+10_1_sil=32000:tgt=ground:random_seed=5311600:i=5114:av=off_2963 on theBenchmark for (2963ds/5114Mi)
% 33.58/5.18 % (361504)Instruction limit reached!
% 33.58/5.18 % (361504)------------------------------
% 33.58/5.18 % (361504)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361504)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361504)Termination reason: Instruction limit
% 33.58/5.18 % (361504)Termination phase: Saturation
% 33.58/5.18 % (361504)Time elapsed: 2.751 s
% 33.58/5.18 % (361504)Peak memory usage: 27 MB
% 33.58/5.18 % (361504)Instructions burned: 5132 (million)
% 33.58/5.18 % (361517)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3750008604:i=54282_2962 on theBenchmark for (2962ds/54282Mi)
% 33.58/5.18 % TRYING [1]
% 33.58/5.18 % TRYING [2]
% 33.58/5.18 % TRYING [3]
% 33.58/5.18 % TRYING [4]
% 33.58/5.18 % TRYING [5]
% 33.58/5.18 % (361501)Instruction limit reached!
% 33.58/5.18 % (361501)------------------------------
% 33.58/5.18 % (361501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361501)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361501)Termination reason: Instruction limit
% 33.58/5.18 % (361501)Termination phase: Finite model building constraint generation
% 33.58/5.18 % (361501)Time elapsed: 3.280 s
% 33.58/5.18 % (361501)Peak memory usage: 546 MB
% 33.58/5.18 % (361501)Instructions burned: 9515 (million)
% 33.58/5.18 % (361519)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2012781166:i=3512:aac=none_2958 on theBenchmark for (2958ds/3512Mi)
% 33.58/5.18 % (361515) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-361460-361515"...
% 33.58/5.18 % (361515)...printing done.
% 33.58/5.18 % (361515)Refutation found. Thanks to Tanya!
% 33.58/5.18 % SZS status Unsatisfiable for theBenchmark
% 33.58/5.18 % SZS output start Proof for theBenchmark
% See solution above
% 33.58/5.18 % (361515)------------------------------
% 33.58/5.18 % (361515)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 33.58/5.18 % (361515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.58/5.18 % (361515)CaDiCaL version: 2.1.3
% 33.58/5.18 % (361515)Termination reason: Refutation
% 33.58/5.18 % (361515)Time elapsed: 1.058 s
% 33.58/5.18 % (361515)Peak memory usage: 32 MB
% 33.58/5.18 % (361515)Instructions burned: 3421 (million)
% 33.58/5.18 % (361460)Success in time 4.78 s
% 33.58/5.18 % Vampire exiting
%------------------------------------------------------------------------------