%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL349-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 : n001.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 68.34s 10.10s
% Output : Refutation 68.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 26
% Syntax : Number of formulae : 163 ( 111 unt; 15 def)
% Number of atoms : 229 ( 34 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 142 ( 76 ~; 66 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 17 con; 0-2 aty)
% Number of variables : 144 ( 144 !; 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(or(p,q),or(p,and(not(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(p,q)),or(p,not(or(not(not(p)),not(q)))))),not(or(not(or(p,not(or(not(not(p)),not(q))))),or(p,q)))))),
inference(definition_unfolding,[],[f11,f12,f9]) ).
fof(f20,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = not(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
not(sF0) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = not(p),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
not(p) = 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(q),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
not(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 = or(p,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
or(p,sF6) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = or(sF1,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
or(sF1,sF7) = 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 = not(sF7),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
not(sF7) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = or(sF10,sF0),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
or(sF10,sF0) = 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(sF9,sF12),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f47,plain,
or(sF9,sF12) = 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,plain,
~ theorem(sF14),
inference(definition_folding,[],[f19,f49,f47,f45,f43,f21,f41,f35,f33,f31,f29,f27,f25,f39,f37,f35,f33,f31,f29,f27,f25,f23,f21]) ).
fof(f51,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f52,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f53,plain,
! [X0] : axiom(or(sF2,or(X0,p))),
inference(superposition,[],[f14,f25]) ).
fof(f54,plain,
! [X0] : axiom(or(sF4,or(X0,q))),
inference(superposition,[],[f14,f29]) ).
fof(f57,plain,
! [X0] : axiom(or(sF6,or(X0,sF5))),
inference(superposition,[],[f14,f33]) ).
fof(f71,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f73,plain,
axiom(or(not(sF7),or(sF6,p))),
inference(superposition,[],[f15,f35]) ).
fof(f76,plain,
axiom(or(not(sF13),or(sF12,sF9))),
inference(superposition,[],[f15,f47]) ).
fof(f78,plain,
axiom(or(not(or(q,p)),sF0)),
inference(superposition,[],[f15,f21]) ).
fof(f79,plain,
axiom(or(not(or(sF6,p)),sF7)),
inference(superposition,[],[f15,f35]) ).
fof(f85,plain,
axiom(or(sF14,or(sF12,sF9))),
inference(forward_demodulation,[],[f76,f49]) ).
fof(f88,plain,
axiom(or(sF10,or(sF6,p))),
inference(forward_demodulation,[],[f73,f41]) ).
fof(f97,plain,
! [X0] :
( ~ theorem(or(sF9,X0))
| theorem(X0)
| ~ theorem(sF8) ),
inference(superposition,[],[f18,f39]) ).
fof(f98,plain,
! [X0] :
( ~ theorem(or(sF12,X0))
| theorem(X0)
| ~ theorem(sF11) ),
inference(superposition,[],[f18,f45]) ).
fof(f101,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f104,plain,
! [X0] : axiom(or(not(or(X0,sF8)),or(sF1,or(X0,sF7)))),
inference(superposition,[],[f16,f37]) ).
fof(f105,plain,
! [X0] : axiom(or(not(or(X0,sF5)),or(sF3,or(X0,sF4)))),
inference(superposition,[],[f16,f31]) ).
fof(f110,plain,
! [X0] : axiom(or(not(or(sF1,or(X0,sF7))),or(X0,sF8))),
inference(superposition,[],[f16,f37]) ).
fof(f111,plain,
! [X0] : axiom(or(not(or(sF3,or(X0,sF4))),or(X0,sF5))),
inference(superposition,[],[f16,f31]) ).
fof(f115,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f119,plain,
! [X0,X1] : axiom(or(not(or(sF3,X0)),or(not(or(X1,sF2)),or(X1,X0)))),
inference(superposition,[],[f17,f27]) ).
fof(f120,plain,
! [X0,X1] : axiom(or(not(or(sF6,X0)),or(not(or(X1,sF5)),or(X1,X0)))),
inference(superposition,[],[f17,f33]) ).
fof(f125,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
inference(superposition,[],[f17,f21]) ).
fof(f136,plain,
! [X0] : axiom(or(not(or(not(X0),sF0)),or(not(or(sF10,X0)),sF11))),
inference(superposition,[],[f17,f43]) ).
fof(f142,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f125,f23]) ).
fof(f145,plain,
! [X0] : axiom(or(not(or(sF4,X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f142,f29]) ).
fof(f150,plain,
! [X0] : theorem(or(sF2,or(X0,p))),
inference(resolution,[],[f53,f7]) ).
fof(f151,plain,
! [X0] : theorem(or(sF4,or(X0,q))),
inference(resolution,[],[f54,f7]) ).
fof(f158,plain,
! [X0] : theorem(or(sF6,or(X0,sF5))),
inference(resolution,[],[f57,f7]) ).
fof(f165,plain,
theorem(or(sF14,or(sF12,sF9))),
inference(resolution,[],[f85,f7]) ).
fof(f168,plain,
theorem(or(sF10,or(sF6,p))),
inference(resolution,[],[f88,f7]) ).
fof(f170,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f51,f18]) ).
fof(f171,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f52,f18]) ).
fof(f191,plain,
theorem(or(not(or(q,p)),sF0)),
inference(resolution,[],[f78,f7]) ).
fof(f193,plain,
theorem(or(not(or(sF6,p)),sF7)),
inference(resolution,[],[f79,f7]) ).
fof(f220,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f71,f18]) ).
fof(f265,plain,
! [X0] : theorem(or(not(or(X0,sF8)),or(sF1,or(X0,sF7)))),
inference(resolution,[],[f104,f7]) ).
fof(f267,plain,
! [X0] : theorem(or(not(or(X0,sF5)),or(sF3,or(X0,sF4)))),
inference(resolution,[],[f105,f7]) ).
fof(f280,plain,
! [X0] : theorem(or(not(or(sF1,or(X0,sF7))),or(X0,sF8))),
inference(resolution,[],[f110,f7]) ).
fof(f282,plain,
! [X0] : theorem(or(not(or(sF3,or(X0,sF4))),or(X0,sF5))),
inference(resolution,[],[f111,f7]) ).
fof(f300,plain,
axiom(or(not(or(sF4,sF6)),or(sF1,sF7))),
inference(superposition,[],[f145,f35]) ).
fof(f301,plain,
axiom(or(not(or(sF4,sF6)),sF8)),
inference(forward_demodulation,[],[f300,f37]) ).
fof(f313,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f101,f18]) ).
fof(f411,plain,
! [X0] : theorem(or(not(or(not(X0),sF0)),or(not(or(sF10,X0)),sF11))),
inference(resolution,[],[f136,f7]) ).
fof(f463,plain,
! [X0,X1] : theorem(or(not(or(sF3,X0)),or(not(or(X1,sF2)),or(X1,X0)))),
inference(resolution,[],[f119,f7]) ).
fof(f474,plain,
! [X0,X1] : theorem(or(not(or(sF6,X0)),or(not(or(X1,sF5)),or(X1,X0)))),
inference(resolution,[],[f120,f7]) ).
fof(f519,plain,
theorem(or(not(or(sF4,sF6)),sF8)),
inference(resolution,[],[f301,f7]) ).
fof(f520,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f115,f18]) ).
fof(f552,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f220,f171]) ).
fof(f681,plain,
! [X0] :
( theorem(or(sF1,or(X0,sF7)))
| ~ theorem(or(X0,sF8)) ),
inference(resolution,[],[f265,f18]) ).
fof(f686,plain,
! [X0] :
( theorem(or(sF3,or(X0,sF4)))
| ~ theorem(or(X0,sF5)) ),
inference(resolution,[],[f267,f18]) ).
fof(f703,plain,
! [X0] :
( ~ theorem(or(sF1,or(X0,sF7)))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f280,f18]) ).
fof(f706,plain,
! [X0] :
( ~ theorem(or(sF3,or(X0,sF4)))
| theorem(or(X0,sF5)) ),
inference(resolution,[],[f282,f18]) ).
fof(f794,plain,
! [X0] : theorem(or(X0,or(not(or(sF1,or(X0,sF7))),sF8))),
inference(resolution,[],[f313,f280]) ).
fof(f798,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f313,f52]) ).
fof(f799,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f313,f71]) ).
fof(f819,plain,
! [X0] : theorem(or(X0,or(sF4,q))),
inference(resolution,[],[f313,f151]) ).
fof(f820,plain,
! [X0] : theorem(or(X0,or(sF6,sF5))),
inference(resolution,[],[f313,f158]) ).
fof(f829,plain,
theorem(or(sF12,or(sF14,sF9))),
inference(resolution,[],[f313,f165]) ).
fof(f899,plain,
theorem(or(sF4,q)),
inference(resolution,[],[f819,f170]) ).
fof(f913,plain,
theorem(or(q,sF4)),
inference(resolution,[],[f899,f220]) ).
fof(f918,plain,
theorem(or(sF6,sF5)),
inference(resolution,[],[f820,f170]) ).
fof(f1026,plain,
( theorem(or(sF14,sF9))
| ~ theorem(sF11) ),
inference(resolution,[],[f829,f98]) ).
fof(f1441,plain,
! [X0] :
( theorem(or(not(or(sF10,X0)),sF11))
| ~ theorem(or(not(X0),sF0)) ),
inference(resolution,[],[f411,f18]) ).
fof(f1663,plain,
! [X0,X1] :
( theorem(or(not(or(X0,sF2)),or(X0,X1)))
| ~ theorem(or(sF3,X1)) ),
inference(resolution,[],[f463,f18]) ).
fof(f1683,plain,
! [X0,X1] : theorem(or(not(or(X0,sF5)),or(not(or(sF6,X1)),or(X0,X1)))),
inference(resolution,[],[f474,f313]) ).
fof(f1773,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f520,f18]) ).
fof(f1806,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f798,f170]) ).
fof(f1831,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f1806,f220]) ).
fof(f1858,plain,
( theorem(not(sF9))
| ~ theorem(sF8) ),
inference(resolution,[],[f1831,f97]) ).
fof(f2245,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f799,f18]) ).
fof(f2253,plain,
! [X0] :
( theorem(or(not(or(X0,sF12)),X0))
| ~ theorem(sF11) ),
inference(resolution,[],[f799,f98]) ).
fof(f2650,plain,
! [X0] :
( ~ theorem(or(X0,sF7))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f703,f171]) ).
fof(f2664,plain,
! [X0] :
( ~ theorem(or(X0,sF4))
| theorem(or(X0,sF5)) ),
inference(resolution,[],[f706,f171]) ).
fof(f4001,plain,
! [X0] :
( theorem(or(not(or(sF1,or(not(X0),sF7))),sF8))
| ~ theorem(X0) ),
inference(resolution,[],[f794,f18]) ).
fof(f6452,plain,
! [X0] :
( ~ theorem(or(not(X0),sF0))
| theorem(sF11)
| ~ theorem(or(sF10,X0)) ),
inference(resolution,[],[f1441,f18]) ).
fof(f7388,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f1773,f51]) ).
fof(f7416,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f1773,f71]) ).
fof(f7510,plain,
! [X0] :
( ~ theorem(or(X0,or(q,p)))
| theorem(or(X0,sF0)) ),
inference(resolution,[],[f1773,f191]) ).
fof(f7517,plain,
! [X0] :
( ~ theorem(or(X0,or(sF6,p)))
| theorem(or(X0,sF7)) ),
inference(resolution,[],[f1773,f193]) ).
fof(f7521,plain,
! [X0] :
( ~ theorem(or(X0,or(sF4,sF6)))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f1773,f519]) ).
fof(f7531,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ),
inference(resolution,[],[f1773,f552]) ).
fof(f7536,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f1773,f799]) ).
fof(f7840,plain,
! [X0,X1] :
( theorem(or(not(or(sF6,X0)),or(X1,X0)))
| ~ theorem(or(X1,sF5)) ),
inference(resolution,[],[f1683,f18]) ).
fof(f8446,plain,
theorem(or(q,sF5)),
inference(resolution,[],[f2664,f913]) ).
fof(f8997,plain,
! [X0] :
( ~ theorem(or(X0,sF12))
| theorem(X0)
| ~ theorem(sF11) ),
inference(resolution,[],[f2253,f18]) ).
fof(f9417,plain,
! [X0,X1] :
( theorem(or(X1,not(or(X1,not(X0)))))
| ~ theorem(X0) ),
inference(resolution,[],[f2245,f220]) ).
fof(f11308,plain,
! [X0] :
( theorem(or(not(or(X0,sF2)),X0))
| ~ theorem(or(sF3,X0)) ),
inference(resolution,[],[f7388,f1663]) ).
fof(f11609,plain,
theorem(or(sF2,sF7)),
inference(resolution,[],[f7517,f150]) ).
fof(f11627,plain,
theorem(or(sF2,sF8)),
inference(resolution,[],[f11609,f2650]) ).
fof(f11784,plain,
theorem(or(sF8,sF2)),
inference(resolution,[],[f11627,f220]) ).
fof(f17080,plain,
! [X0] :
( theorem(or(sF14,X0))
| ~ theorem(not(sF9))
| ~ theorem(sF11) ),
inference(resolution,[],[f7531,f1026]) ).
fof(f17467,plain,
! [X0] :
( ~ theorem(or(sF1,or(not(X0),sF7)))
| theorem(sF8)
| ~ theorem(X0) ),
inference(resolution,[],[f4001,f18]) ).
fof(f22543,plain,
! [X0] :
( theorem(or(sF1,or(sF7,X0)))
| ~ theorem(or(X0,sF8)) ),
inference(resolution,[],[f7416,f681]) ).
fof(f22560,plain,
! [X0] :
( theorem(or(sF3,or(sF4,X0)))
| ~ theorem(or(X0,sF5)) ),
inference(resolution,[],[f7416,f686]) ).
fof(f25541,plain,
( ~ theorem(or(q,sF5))
| theorem(or(not(or(sF6,p)),sF0)) ),
inference(resolution,[],[f7840,f7510]) ).
fof(f25568,plain,
theorem(or(not(or(sF6,p)),sF0)),
inference(forward_subsumption_resolution,[],[f25541,f8446]) ).
fof(f40896,plain,
( theorem(sF11)
| ~ theorem(or(sF10,or(sF6,p))) ),
inference(resolution,[],[f25568,f6452]) ).
fof(f40916,plain,
theorem(sF11),
inference(forward_subsumption_resolution,[],[f40896,f168]) ).
fof(f62856,plain,
( ~ theorem(not(sF9))
| ~ theorem(sF11)
| theorem(sF14)
| ~ theorem(sF11) ),
inference(resolution,[],[f17080,f8997]) ).
fof(f62870,plain,
( ~ theorem(not(sF9))
| ~ theorem(sF11)
| theorem(sF14) ),
inference(duplicate_literal_removal,[],[f62856]) ).
fof(f62871,plain,
( ~ theorem(not(sF9))
| theorem(sF14) ),
inference(forward_subsumption_resolution,[],[f62870,f40916]) ).
fof(f62888,plain,
~ theorem(not(sF9)),
inference(forward_subsumption_resolution,[],[f62871,f50]) ).
fof(f62893,plain,
~ theorem(sF8),
inference(resolution,[],[f62888,f1858]) ).
fof(f80277,plain,
( ~ theorem(or(sF6,sF5))
| theorem(or(sF3,sF8)) ),
inference(resolution,[],[f22560,f7521]) ).
fof(f80309,plain,
theorem(or(sF3,sF8)),
inference(forward_subsumption_resolution,[],[f80277,f918]) ).
fof(f104082,plain,
! [X0] :
( theorem(sF8)
| ~ theorem(or(sF7,not(X0)))
| ~ theorem(or(sF1,X0)) ),
inference(resolution,[],[f17467,f7536]) ).
fof(f104135,plain,
! [X0] :
( ~ theorem(or(sF7,not(X0)))
| ~ theorem(or(sF1,X0)) ),
inference(forward_subsumption_resolution,[],[f104082,f62893]) ).
fof(f104658,plain,
! [X0] :
( ~ theorem(or(sF1,or(sF7,not(X0))))
| ~ theorem(X0) ),
inference(resolution,[],[f104135,f9417]) ).
fof(f107779,plain,
! [X0] :
( ~ theorem(or(not(X0),sF8))
| ~ theorem(X0) ),
inference(resolution,[],[f104658,f22543]) ).
fof(f107994,plain,
( ~ theorem(or(sF8,sF2))
| ~ theorem(or(sF3,sF8)) ),
inference(resolution,[],[f107779,f11308]) ).
fof(f108102,plain,
~ theorem(or(sF3,sF8)),
inference(forward_subsumption_resolution,[],[f107994,f11784]) ).
fof(f108105,plain,
$false,
inference(forward_subsumption_resolution,[],[f108102,f80309]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL349-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.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:41:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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
% 43.81/6.66 % (3730565)Will run a generic schedule for satisfiability detection.
% 43.81/6.66 % (3730572)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2815660982:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 43.81/6.66 % (3730571)% WARNING: option uhcvi not known.
% 43.81/6.66 % (3730570)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1883888775_2999 on theBenchmark for (2999ds/0Mi)
% 43.81/6.66 % (3730571)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=698791387:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 43.81/6.66 % (3730573)dis+10_1_sil=32000:sp=arity:random_seed=2854966422:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 43.81/6.66 % (3730574)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3413015681:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 43.81/6.66 % TRYING [1]
% 43.81/6.66 % TRYING [2]
% 43.81/6.66 % TRYING [3]
% 43.81/6.66 % (3730575)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2734655887:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 43.81/6.66 % (3730576)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1852412071:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 43.81/6.66 % TRYING [4]
% 43.81/6.66 % (3730574)Instruction limit reached!
% 43.81/6.66 % (3730574)------------------------------
% 43.81/6.66 % (3730574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.81/6.66 % (3730574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.81/6.66 % (3730574)CaDiCaL version: 2.1.3
% 43.81/6.66 % (3730574)Termination reason: Instruction limit
% 43.81/6.66 % (3730574)Termination phase: Saturation
% 43.81/6.66 % (3730574)Time elapsed: 0.054 s
% 43.81/6.66 % (3730574)Peak memory usage: 11 MB
% 43.81/6.66 % (3730574)Instructions burned: 117 (million)
% 43.81/6.66 % (3730573)Instruction limit reached!
% 43.81/6.66 % (3730573)------------------------------
% 43.81/6.66 % (3730573)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.81/6.66 % (3730573)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.81/6.66 % (3730573)CaDiCaL version: 2.1.3
% 43.81/6.66 % (3730573)Termination reason: Instruction limit
% 43.81/6.66 % (3730573)Termination phase: Saturation
% 43.81/6.66 % (3730573)Time elapsed: 0.065 s
% 43.81/6.66 % (3730573)Peak memory usage: 12 MB
% 43.81/6.66 % (3730573)Instructions burned: 104 (million)
% 43.81/6.66 % (3730584)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2642710536:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 43.81/6.66 % TRYING [1]
% 43.81/6.66 % TRYING [2]
% 43.81/6.66 % TRYING [3]
% 43.81/6.66 % (3730585)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1001995648:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 43.81/6.66 % TRYING [4]
% 43.81/6.66 % (3730575)Instruction limit reached!
% 43.81/6.66 % (3730575)------------------------------
% 43.81/6.66 % (3730575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.81/6.66 % (3730575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.81/6.66 % (3730575)CaDiCaL version: 2.1.3
% 43.81/6.66 % (3730575)Termination reason: Instruction limit
% 43.81/6.66 % (3730575)Termination phase: Saturation
% 43.81/6.66 % (3730575)Time elapsed: 0.090 s
% 43.81/6.66 % (3730575)Peak memory usage: 14 MB
% 43.81/6.66 % (3730575)Instructions burned: 133 (million)
% 43.81/6.66 % (3730588)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=938625072:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 43.81/6.66 % (3730576)Instruction limit reached!
% 43.81/6.66 % (3730576)------------------------------
% 43.81/6.66 % (3730576)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.81/6.66 % (3730576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 43.81/6.66 % (3730576)CaDiCaL version: 2.1.3
% 43.81/6.66 % (3730576)Termination reason: Instruction limit
% 43.81/6.66 % (3730576)Termination phase: Saturation
% 43.81/6.66 % (3730576)Time elapsed: 0.141 s
% 43.81/6.66 % (3730576)Peak memory usage: 12 MB
% 43.81/6.66 % (3730576)Instructions burned: 159 (million)
% 43.81/6.66 % (3730599)ott-21_1_sil=16000:fs=off:random_seed=48021878:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 43.81/6.66 % (3730585)Instruction limit reached!
% 43.81/6.66 % (3730585)------------------------------
% 43.81/6.66 % (3730585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 43.81/6.66 % (3730585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730585)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730585)Termination reason: Instruction limit
% 68.34/10.10 % (3730585)Termination phase: Saturation
% 68.34/10.10 % (3730585)Time elapsed: 0.106 s
% 68.34/10.10 % (3730585)Peak memory usage: 12 MB
% 68.34/10.10 % (3730585)Instructions burned: 131 (million)
% 68.34/10.10 % (3730601)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=689007080:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 68.34/10.10 % TRYING [5]
% 68.34/10.10 % (3730599)Instruction limit reached!
% 68.34/10.10 % (3730599)------------------------------
% 68.34/10.10 % (3730599)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730599)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730599)Termination reason: Instruction limit
% 68.34/10.10 % (3730599)Termination phase: Saturation
% 68.34/10.10 % (3730599)Time elapsed: 0.102 s
% 68.34/10.10 % (3730599)Peak memory usage: 12 MB
% 68.34/10.10 % (3730599)Instructions burned: 181 (million)
% 68.34/10.10 % (3730604)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=809279467:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 68.34/10.10 % TRYING [1]
% 68.34/10.10 % TRYING [2]
% 68.34/10.10 % TRYING [3]
% 68.34/10.10 % TRYING [4]
% 68.34/10.10 % TRYING [5]
% 68.34/10.10 % TRYING [5]
% 68.34/10.10 % (3730584)Instruction limit reached!
% 68.34/10.10 % (3730584)------------------------------
% 68.34/10.10 % (3730584)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730584)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730584)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730584)Termination reason: Instruction limit
% 68.34/10.10 % (3730584)Termination phase: Finite model building SAT solving
% 68.34/10.10 % (3730584)Time elapsed: 0.575 s
% 68.34/10.10 % (3730584)Peak memory usage: 16 MB
% 68.34/10.10 % (3730584)Instructions burned: 714 (million)
% 68.34/10.10 % (3730601)Instruction limit reached!
% 68.34/10.10 % (3730601)------------------------------
% 68.34/10.10 % (3730601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730601)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730601)Termination reason: Instruction limit
% 68.34/10.10 % (3730601)Termination phase: Saturation
% 68.34/10.10 % (3730601)Time elapsed: 0.431 s
% 68.34/10.10 % (3730601)Peak memory usage: 13 MB
% 68.34/10.10 % (3730601)Instructions burned: 478 (million)
% 68.34/10.10 % (3730617)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4200913595:i=1179_2993 on theBenchmark for (2993ds/1179Mi)
% 68.34/10.10 % (3730618)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3863507803:i=889:ins=1_2992 on theBenchmark for (2992ds/889Mi)
% 68.34/10.10 % TRYING [14]
% 68.34/10.10 % (3730588)Instruction limit reached!
% 68.34/10.10 % (3730588)------------------------------
% 68.34/10.10 % (3730588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730588)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730588)Termination reason: Instruction limit
% 68.34/10.10 % (3730588)Termination phase: Saturation
% 68.34/10.10 % (3730588)Time elapsed: 0.661 s
% 68.34/10.10 % (3730588)Peak memory usage: 16 MB
% 68.34/10.10 % (3730588)Instructions burned: 684 (million)
% 68.34/10.10 % (3730623)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=1374396667:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2991 on theBenchmark for (2991ds/692Mi)
% 68.34/10.10 % (3730604)Instruction limit reached!
% 68.34/10.10 % (3730604)------------------------------
% 68.34/10.10 % (3730604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730604)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730604)Termination reason: Instruction limit
% 68.34/10.10 % (3730604)Termination phase: Finite model building SAT solving
% 68.34/10.10 % (3730604)Time elapsed: 0.736 s
% 68.34/10.10 % (3730604)Peak memory usage: 13 MB
% 68.34/10.10 % (3730604)Instructions burned: 865 (million)
% 68.34/10.10 % (3730629)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4150290383:i=879:kws=inv_precedence:fsr=off_2988 on theBenchmark for (2988ds/879Mi)
% 68.34/10.10 % (3730618)Instruction limit reached!
% 68.34/10.10 % (3730618)------------------------------
% 68.34/10.10 % (3730618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730618)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730618)Termination reason: Instruction limit
% 68.34/10.10 % (3730618)Termination phase: Finite model building constraint generation
% 68.34/10.10 % (3730618)Time elapsed: 0.467 s
% 68.34/10.10 % (3730618)Peak memory usage: 69 MB
% 68.34/10.10 % (3730618)Instructions burned: 890 (million)
% 68.34/10.10 % (3730634)fmb+10_1_sil=64000:random_seed=811194366:i=22061:nm=2:gsp=on_2987 on theBenchmark for (2987ds/22061Mi)
% 68.34/10.10 % TRYING [1]
% 68.34/10.10 % TRYING [2]
% 68.34/10.10 % TRYING [3]
% 68.34/10.10 % TRYING [4]
% 68.34/10.10 % (3730623)Instruction limit reached!
% 68.34/10.10 % (3730623)------------------------------
% 68.34/10.10 % (3730623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730623)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730623)Termination reason: Instruction limit
% 68.34/10.10 % (3730623)Termination phase: Saturation
% 68.34/10.10 % (3730623)Time elapsed: 0.518 s
% 68.34/10.10 % (3730623)Peak memory usage: 26 MB
% 68.34/10.10 % (3730623)Instructions burned: 692 (million)
% 68.34/10.10 % TRYING [5]
% 68.34/10.10 % (3730638)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=801422669:i=9515:nm=5_2985 on theBenchmark for (2985ds/9515Mi)
% 68.34/10.10 % TRYING [20]
% 68.34/10.10 % (3730617)Instruction limit reached!
% 68.34/10.10 % (3730617)------------------------------
% 68.34/10.10 % (3730617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730617)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730617)Termination reason: Instruction limit
% 68.34/10.10 % (3730617)Termination phase: Saturation
% 68.34/10.10 % (3730617)Time elapsed: 1.122 s
% 68.34/10.10 % (3730617)Peak memory usage: 26 MB
% 68.34/10.10 % (3730617)Instructions burned: 1180 (million)
% 68.34/10.10 % (3730646)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=4170171760:fmbsr=1.7:i=920_2981 on theBenchmark for (2981ds/920Mi)
% 68.34/10.10 % TRYING [8]
% 68.34/10.10 % (3730629)Instruction limit reached!
% 68.34/10.10 % (3730629)------------------------------
% 68.34/10.10 % (3730629)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730629)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730629)Termination reason: Instruction limit
% 68.34/10.10 % (3730629)Termination phase: Saturation
% 68.34/10.10 % (3730629)Time elapsed: 0.807 s
% 68.34/10.10 % (3730629)Peak memory usage: 18 MB
% 68.34/10.10 % (3730629)Instructions burned: 879 (million)
% 68.34/10.10 % (3730649)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=313337578:i=5131_2980 on theBenchmark for (2980ds/5131Mi)
% 68.34/10.10 % TRYING [6]
% 68.34/10.10 % (3730646)Instruction limit reached!
% 68.34/10.10 % (3730646)------------------------------
% 68.34/10.10 % (3730646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730646)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730646)Termination reason: Instruction limit
% 68.34/10.10 % (3730646)Termination phase: Finite model building SAT solving
% 68.34/10.10 % (3730646)Time elapsed: 0.687 s
% 68.34/10.10 % (3730646)Peak memory usage: 51 MB
% 68.34/10.10 % (3730646)Instructions burned: 920 (million)
% 68.34/10.10 % (3730656)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=720329827:i=1472:ins=7:fdi=8:gsp=on_2974 on theBenchmark for (2974ds/1472Mi)
% 68.34/10.10 % TRYING [6]
% 68.34/10.10 % (3730656)Instruction limit reached!
% 68.34/10.10 % (3730656)------------------------------
% 68.34/10.10 % (3730656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730656)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730656)Termination reason: Instruction limit
% 68.34/10.10 % (3730656)Termination phase: Saturation
% 68.34/10.10 % (3730656)Time elapsed: 1.299 s
% 68.34/10.10 % (3730656)Peak memory usage: 31 MB
% 68.34/10.10 % (3730656)Instructions burned: 1472 (million)
% 68.34/10.10 % (3730666)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1260042911:i=6324_2961 on theBenchmark for (2961ds/6324Mi)
% 68.34/10.10 % TRYING [77]
% 68.34/10.10 % (3730649)Instruction limit reached!
% 68.34/10.10 % (3730649)------------------------------
% 68.34/10.10 % (3730649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730649)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730649)Termination reason: Instruction limit
% 68.34/10.10 % (3730649)Termination phase: Saturation
% 68.34/10.10 % (3730649)Time elapsed: 4.278 s
% 68.34/10.10 % (3730649)Peak memory usage: 24 MB
% 68.34/10.10 % (3730649)Instructions burned: 5132 (million)
% 68.34/10.10 % (3730676)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2392252872:fmbsr=2.30978:i=2174_2937 on theBenchmark for (2937ds/2174Mi)
% 68.34/10.10 % TRYING [16]
% 68.34/10.10 % (3730676)Instruction limit reached!
% 68.34/10.10 % (3730676)------------------------------
% 68.34/10.10 % (3730676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730676)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730676)Termination reason: Instruction limit
% 68.34/10.10 % (3730676)Termination phase: Finite model building constraint generation
% 68.34/10.10 % (3730676)Time elapsed: 1.515 s
% 68.34/10.10 % (3730676)Peak memory usage: 132 MB
% 68.34/10.10 % (3730676)Instructions burned: 2174 (million)
% 68.34/10.10 % (3730684)ott-2_1_sil=16000:newcnf=on:random_seed=3807804979:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2921 on theBenchmark for (2921ds/869Mi)
% 68.34/10.10 % (3730638)Instruction limit reached!
% 68.34/10.10 % (3730638)------------------------------
% 68.34/10.10 % (3730638)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730638)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730638)Termination reason: Instruction limit
% 68.34/10.10 % (3730638)Termination phase: Finite model building constraint generation
% 68.34/10.10 % (3730638)Time elapsed: 6.528 s
% 68.34/10.10 % (3730638)Peak memory usage: 557 MB
% 68.34/10.10 % (3730638)Instructions burned: 9515 (million)
% 68.34/10.10 % (3730687)ott+10_1_sil=32000:tgt=ground:random_seed=1844031235:i=5114:av=off_2919 on theBenchmark for (2919ds/5114Mi)
% 68.34/10.10 % (3730666)Instruction limit reached!
% 68.34/10.10 % (3730666)------------------------------
% 68.34/10.10 % (3730666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730666)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730666)Termination reason: Instruction limit
% 68.34/10.10 % (3730666)Termination phase: Finite model building constraint generation
% 68.34/10.10 % (3730666)Time elapsed: 4.412 s
% 68.34/10.10 % (3730666)Peak memory usage: 444 MB
% 68.34/10.10 % (3730666)Instructions burned: 6326 (million)
% 68.34/10.10 % (3730691)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=849669192:i=54282_2915 on theBenchmark for (2915ds/54282Mi)
% 68.34/10.10 % TRYING [1]
% 68.34/10.10 % TRYING [2]
% 68.34/10.10 % TRYING [3]
% 68.34/10.10 % TRYING [4]
% 68.34/10.10 % (3730684)Instruction limit reached!
% 68.34/10.10 % (3730684)------------------------------
% 68.34/10.10 % (3730684)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.10 % (3730684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.10 % (3730684)CaDiCaL version: 2.1.3
% 68.34/10.10 % (3730684)Termination reason: Instruction limit
% 68.34/10.10 % (3730684)Termination phase: Saturation
% 68.34/10.10 % (3730684)Time elapsed: 0.822 s
% 68.34/10.10 % (3730684)Peak memory usage: 15 MB
% 68.34/10.10 % (3730684)Instructions burned: 869 (million)
% 68.34/10.10 % (3730694)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=937238524:i=3512:aac=none_2913 on theBenchmark for (2913ds/3512Mi)
% 68.34/10.10 % TRYING [5]
% 68.34/10.10 % (3730687) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3730565-3730687"...
% 68.34/10.10 % (3730687)...printing done.
% 68.34/10.10 % (3730687)Refutation found. Thanks to Tanya!
% 68.34/10.10 % SZS status Unsatisfiable for theBenchmark
% 68.34/10.10 % SZS output start Proof for theBenchmark
% See solution above
% 68.34/10.11 % (3730687)------------------------------
% 68.34/10.11 % (3730687)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.34/10.11 % (3730687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.34/10.11 % (3730687)CaDiCaL version: 2.1.3
% 68.34/10.11 % (3730687)Termination reason: Refutation
% 68.34/10.11 % (3730687)Time elapsed: 1.554 s
% 68.34/10.11 % (3730687)Peak memory usage: 29 MB
% 68.34/10.11 % (3730687)Instructions burned: 2947 (million)
% 68.34/10.11 % (3730565)Success in time 9.692 s
% 68.34/10.11 % Vampire exiting
%------------------------------------------------------------------------------