%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL313-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:51:57 AM UTC 2026
% Result : Unsatisfiable 12.19s 2.85s
% Output : Refutation 14.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 32
% Syntax : Number of formulae : 200 ( 94 unt; 21 def)
% Number of atoms : 344 ( 36 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 287 ( 143 ~; 139 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 18 con; 0-2 aty)
% Number of variables : 149 ( 0 sgn 149 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(and(implies(p,q),implies(p,not(q))),not(p))),
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(not(or(not(or(not(not(or(not(or(not(p),q)),not(or(not(p),not(q)))))),not(p))),not(or(not(not(p)),not(or(not(or(not(p),q)),not(or(not(p),not(q)))))))))),
inference(definition_unfolding,[],[f11,f12,f9,f6,f6]) ).
fof(f20,definition,
sF0 = not(p),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
not(p) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = or(sF0,q),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
or(sF0,q) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = not(q),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
not(q) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = or(sF0,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
or(sF0,sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = not(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
not(sF4) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = or(sF2,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
or(sF2,sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = not(sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
not(sF6) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = not(sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
not(sF7) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = or(sF8,sF0),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
or(sF8,sF0) = 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 = not(sF0),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
not(sF0) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF12 = or(sF11,sF7),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
or(sF11,sF7) = 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 = or(sF10,sF13),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f49,plain,
or(sF10,sF13) = sF14,
inference(reorient_equations,[],[f48]) ).
fof(f50,definition,
sF15 = not(sF14),
introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).
fof(f51,plain,
not(sF14) = sF15,
inference(reorient_equations,[],[f50]) ).
fof(f52,plain,
~ theorem(sF15),
inference(definition_folding,[],[f19,f51,f49,f47,f45,f35,f33,f31,f29,f27,f21,f25,f23,f21,f43,f21,f41,f39,f21,f37,f35,f33,f31,f29,f27,f21,f25,f23,f21]) ).
fof(f53,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f7,f17]) ).
fof(f54,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f7,f16]) ).
fof(f71,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f18,f54]) ).
fof(f73,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f18,f53]) ).
fof(f74,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f18,f71]) ).
fof(f82,plain,
! [X0] :
( ~ theorem(or(sF13,X0))
| theorem(X0)
| ~ theorem(sF12) ),
inference(superposition,[],[f18,f47]) ).
fof(f84,definition,
( spl16_1
<=> theorem(sF12) ),
introduced(definition,[new_symbols(definition,[spl16_1])],[avatar_definition]) ).
fof(f86,plain,
( ~ theorem(sF12)
| spl16_1 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f88,definition,
( spl16_2
<=> ! [X0] :
( ~ theorem(or(sF13,X0))
| theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl16_2])],[avatar_definition]) ).
fof(f89,plain,
( ! [X0] :
( ~ theorem(or(sF13,X0))
| theorem(X0) )
| ~ spl16_2 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f90,plain,
( ~ spl16_1
| spl16_2 ),
inference(avatar_split_clause,[],[f82,f88,f84]) ).
fof(f161,plain,
theorem(or(not(sF1),or(q,sF0))),
inference(superposition,[],[f71,f23]) ).
fof(f163,plain,
theorem(or(sF2,or(q,sF0))),
inference(forward_demodulation,[],[f161,f25]) ).
fof(f199,plain,
theorem(or(not(sF4),or(sF3,sF0))),
inference(superposition,[],[f71,f29]) ).
fof(f201,plain,
theorem(or(sF5,or(sF3,sF0))),
inference(forward_demodulation,[],[f199,f31]) ).
fof(f244,plain,
theorem(or(not(sF12),or(sF7,sF11))),
inference(superposition,[],[f71,f45]) ).
fof(f247,plain,
theorem(or(sF13,or(sF7,sF11))),
inference(forward_demodulation,[],[f244,f47]) ).
fof(f264,plain,
theorem(or(not(sF6),or(sF5,sF2))),
inference(superposition,[],[f71,f33]) ).
fof(f267,plain,
theorem(or(sF7,or(sF5,sF2))),
inference(forward_demodulation,[],[f264,f35]) ).
fof(f282,plain,
theorem(or(not(sF14),or(sF13,sF10))),
inference(superposition,[],[f71,f49]) ).
fof(f285,plain,
theorem(or(sF15,or(sF13,sF10))),
inference(forward_demodulation,[],[f282,f51]) ).
fof(f289,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f324,plain,
theorem(or(not(sF5),sF6)),
inference(superposition,[],[f289,f33]) ).
fof(f325,plain,
theorem(or(not(sF0),sF9)),
inference(superposition,[],[f289,f39]) ).
fof(f329,plain,
theorem(or(sF11,sF9)),
inference(forward_demodulation,[],[f325,f43]) ).
fof(f331,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f332,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f73,f18]) ).
fof(f356,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X2,or(X1,X3))))
| theorem(or(X0,or(X1,or(X2,X3)))) ),
inference(resolution,[],[f332,f54]) ).
fof(f358,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f332,f71]) ).
fof(f359,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f332,f73]) ).
fof(f360,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f332,f289]) ).
fof(f362,plain,
! [X0,X1] :
( ~ theorem(or(sF3,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,q)) ),
inference(superposition,[],[f332,f27]) ).
fof(f366,plain,
! [X0,X1] :
( ~ theorem(or(sF7,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF6)) ),
inference(superposition,[],[f332,f35]) ).
fof(f368,plain,
! [X0,X1] :
( ~ theorem(or(sF10,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF9)) ),
inference(superposition,[],[f332,f41]) ).
fof(f369,plain,
! [X0,X1] :
( ~ theorem(or(sF13,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF12)) ),
inference(superposition,[],[f332,f47]) ).
fof(f375,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f358,f289]) ).
fof(f382,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f331,f332]) ).
fof(f383,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f331,f18]) ).
fof(f390,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f382,f289]) ).
fof(f450,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f359,f71]) ).
fof(f453,plain,
! [X2,X3,X0,X1] :
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ),
inference(resolution,[],[f359,f54]) ).
fof(f469,plain,
theorem(or(sF13,or(sF15,sF10))),
inference(resolution,[],[f285,f72]) ).
fof(f477,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f360,f358]) ).
fof(f491,plain,
! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
inference(resolution,[],[f356,f71]) ).
fof(f503,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f450,f18]) ).
fof(f507,plain,
! [X0,X1] :
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f450,f382]) ).
fof(f531,plain,
theorem(or(sF13,or(sF10,sF15))),
inference(resolution,[],[f469,f358]) ).
fof(f545,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f390,f74]) ).
fof(f554,plain,
theorem(or(sF13,sF12)),
inference(superposition,[],[f390,f47]) ).
fof(f570,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(X3,X2))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f453,f18]) ).
fof(f600,plain,
! [X0] :
( ~ theorem(or(X0,sF8))
| theorem(or(X0,sF9)) ),
inference(superposition,[],[f477,f39]) ).
fof(f649,plain,
! [X0] :
( theorem(or(X0,not(sF7)))
| ~ theorem(or(X0,sF6)) ),
inference(resolution,[],[f366,f545]) ).
fof(f650,plain,
! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF8)) ),
inference(forward_demodulation,[],[f649,f37]) ).
fof(f675,plain,
! [X0] :
( theorem(or(X0,or(sF10,sF15)))
| ~ theorem(or(X0,sF12)) ),
inference(resolution,[],[f369,f531]) ).
fof(f693,plain,
theorem(or(sF5,or(sF7,sF2))),
inference(resolution,[],[f267,f72]) ).
fof(f844,plain,
! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
inference(resolution,[],[f375,f72]) ).
fof(f860,plain,
theorem(or(not(sF2),sF6)),
inference(superposition,[],[f375,f33]) ).
fof(f920,definition,
( spl16_51
<=> theorem(or(sF10,sF15)) ),
introduced(definition,[new_symbols(definition,[spl16_51])],[avatar_definition]) ).
fof(f921,plain,
( ~ theorem(or(sF10,sF15))
| spl16_51 ),
inference(avatar_component_clause,[],[f920]) ).
fof(f922,plain,
( theorem(or(sF10,sF15))
| ~ spl16_51 ),
inference(avatar_component_clause,[],[f920]) ).
fof(f927,plain,
( ! [X0] :
( ~ theorem(or(X0,sF9))
| theorem(or(X0,sF15)) )
| ~ spl16_51 ),
inference(resolution,[],[f922,f368]) ).
fof(f932,plain,
( theorem(or(sF11,sF15))
| ~ spl16_51 ),
inference(resolution,[],[f927,f329]) ).
fof(f1029,plain,
theorem(or(sF5,or(sF2,sF7))),
inference(resolution,[],[f693,f358]) ).
fof(f1094,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(X0,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f570,f331]) ).
fof(f1096,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,or(X0,X1)))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ),
inference(resolution,[],[f570,f507]) ).
fof(f1103,plain,
! [X0,X1] :
( ~ theorem(or(not(sF1),X0))
| theorem(or(X1,X0))
| ~ theorem(or(sF0,or(X1,q))) ),
inference(superposition,[],[f570,f23]) ).
fof(f1104,plain,
! [X0,X1] :
( ~ theorem(or(not(sF4),X0))
| theorem(or(X1,X0))
| ~ theorem(or(sF0,or(X1,sF3))) ),
inference(superposition,[],[f570,f29]) ).
fof(f1108,plain,
! [X0,X1] :
( ~ theorem(or(not(sF12),X0))
| theorem(or(X1,X0))
| ~ theorem(or(sF11,or(X1,sF7))) ),
inference(superposition,[],[f570,f45]) ).
fof(f1109,plain,
! [X0,X1] :
( ~ theorem(or(sF11,or(X1,sF7)))
| theorem(or(X1,X0))
| ~ theorem(or(sF13,X0)) ),
inference(forward_demodulation,[],[f1108,f47]) ).
fof(f1113,plain,
! [X0,X1] :
( ~ theorem(or(sF0,or(X1,sF3)))
| theorem(or(X1,X0))
| ~ theorem(or(sF5,X0)) ),
inference(forward_demodulation,[],[f1104,f31]) ).
fof(f1114,plain,
! [X0,X1] :
( ~ theorem(or(sF0,or(X1,q)))
| theorem(or(X1,X0))
| ~ theorem(or(sF2,X0)) ),
inference(forward_demodulation,[],[f1103,f25]) ).
fof(f1130,plain,
! [X2,X0,X1] :
( ~ theorem(or(or(X0,X2),X1))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f491,f18]) ).
fof(f1269,plain,
! [X0] :
( theorem(or(not(sF0),X0))
| ~ theorem(or(sF2,X0)) ),
inference(resolution,[],[f1114,f844]) ).
fof(f1273,plain,
! [X0] :
( ~ theorem(or(sF2,X0))
| theorem(or(sF11,X0)) ),
inference(forward_demodulation,[],[f1269,f43]) ).
fof(f1345,plain,
theorem(or(not(sF5),sF8)),
inference(resolution,[],[f324,f650]) ).
fof(f1351,plain,
theorem(or(not(sF5),sF9)),
inference(resolution,[],[f1345,f600]) ).
fof(f1356,plain,
( theorem(or(not(sF5),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f1351,f927]) ).
fof(f1358,plain,
( ! [X0] :
( ~ theorem(or(sF5,X0))
| theorem(or(X0,sF15)) )
| ~ spl16_51 ),
inference(resolution,[],[f1356,f503]) ).
fof(f1367,plain,
( theorem(or(or(sF7,sF2),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f1358,f693]) ).
fof(f1663,plain,
( theorem(or(sF7,or(sF15,sF2)))
| ~ spl16_51 ),
inference(resolution,[],[f1130,f1367]) ).
fof(f1698,plain,
( theorem(or(sF7,or(sF2,sF15)))
| ~ spl16_51 ),
inference(resolution,[],[f1663,f358]) ).
fof(f1704,plain,
( theorem(or(sF2,or(sF7,sF15)))
| ~ spl16_51 ),
inference(resolution,[],[f1698,f72]) ).
fof(f1743,plain,
theorem(or(not(sF2),sF8)),
inference(resolution,[],[f860,f650]) ).
fof(f1749,plain,
theorem(or(not(sF2),sF9)),
inference(resolution,[],[f1743,f600]) ).
fof(f1754,plain,
( theorem(or(not(sF2),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f1749,f927]) ).
fof(f1756,plain,
( ! [X0] :
( ~ theorem(or(sF2,X0))
| theorem(or(X0,sF15)) )
| ~ spl16_51 ),
inference(resolution,[],[f1754,f503]) ).
fof(f1765,plain,
( theorem(or(or(sF7,sF15),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f1756,f1704]) ).
fof(f1778,plain,
( theorem(or(sF7,or(sF15,sF15)))
| ~ spl16_51 ),
inference(resolution,[],[f1765,f1130]) ).
fof(f1784,plain,
( theorem(or(sF7,sF15))
| ~ spl16_51 ),
inference(resolution,[],[f1778,f382]) ).
fof(f2037,definition,
( spl16_81
<=> theorem(or(sF7,sF11)) ),
introduced(definition,[new_symbols(definition,[spl16_81])],[avatar_definition]) ).
fof(f2039,plain,
( theorem(or(sF7,sF11))
| ~ spl16_81 ),
inference(avatar_component_clause,[],[f2037]) ).
fof(f2601,plain,
! [X0] :
( theorem(or(not(sF0),X0))
| ~ theorem(or(sF5,X0)) ),
inference(resolution,[],[f1113,f844]) ).
fof(f2605,plain,
! [X0] :
( ~ theorem(or(sF5,X0))
| theorem(or(sF11,X0)) ),
inference(forward_demodulation,[],[f2601,f43]) ).
fof(f2608,plain,
theorem(or(sF11,or(sF2,sF7))),
inference(resolution,[],[f2605,f1029]) ).
fof(f2624,plain,
! [X0] :
( ~ theorem(or(sF13,X0))
| theorem(or(sF2,X0)) ),
inference(resolution,[],[f2608,f1109]) ).
fof(f3234,plain,
( ! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF15)) )
| ~ spl16_51 ),
inference(resolution,[],[f1784,f366]) ).
fof(f3236,plain,
( theorem(or(not(sF5),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f3234,f324]) ).
fof(f3237,plain,
( theorem(or(not(sF2),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f3234,f860]) ).
fof(f3243,plain,
( ! [X0] :
( ~ theorem(or(sF2,X0))
| theorem(or(X0,sF15)) )
| ~ spl16_51 ),
inference(resolution,[],[f3237,f503]) ).
fof(f3252,plain,
( ! [X0] :
( ~ theorem(or(sF5,X0))
| theorem(or(X0,sF15)) )
| ~ spl16_51 ),
inference(resolution,[],[f3236,f503]) ).
fof(f3262,plain,
( theorem(or(or(q,sF0),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f3243,f163]) ).
fof(f3283,plain,
( theorem(or(q,or(sF15,sF0)))
| ~ spl16_51 ),
inference(resolution,[],[f3262,f1130]) ).
fof(f3287,plain,
( theorem(or(q,or(sF0,sF15)))
| ~ spl16_51 ),
inference(resolution,[],[f3283,f358]) ).
fof(f3295,plain,
( theorem(or(sF0,or(q,sF15)))
| ~ spl16_51 ),
inference(resolution,[],[f3287,f72]) ).
fof(f3298,plain,
( theorem(or(q,sF15))
| ~ theorem(or(not(sF0),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f3295,f1096]) ).
fof(f3303,plain,
( ~ theorem(or(sF11,sF15))
| theorem(or(q,sF15))
| ~ spl16_51 ),
inference(forward_demodulation,[],[f3298,f43]) ).
fof(f3310,plain,
( theorem(or(or(sF3,sF0),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f3252,f201]) ).
fof(f3329,plain,
( theorem(or(sF3,or(sF15,sF0)))
| ~ spl16_51 ),
inference(resolution,[],[f3310,f1130]) ).
fof(f3334,plain,
( theorem(or(sF3,or(sF0,sF15)))
| ~ spl16_51 ),
inference(resolution,[],[f3329,f358]) ).
fof(f3342,plain,
( theorem(or(sF0,or(sF3,sF15)))
| ~ spl16_51 ),
inference(resolution,[],[f3334,f72]) ).
fof(f3345,plain,
( theorem(or(sF3,sF15))
| ~ theorem(or(not(sF0),sF15))
| ~ spl16_51 ),
inference(resolution,[],[f3342,f1096]) ).
fof(f3372,plain,
( theorem(or(q,sF15))
| ~ spl16_51 ),
inference(forward_subsumption_resolution,[],[f3303,f932]) ).
fof(f3382,plain,
( ~ theorem(or(sF11,sF15))
| theorem(or(sF3,sF15))
| ~ spl16_51 ),
inference(forward_demodulation,[],[f3345,f43]) ).
fof(f3384,definition,
( spl16_212
<=> theorem(or(sF3,sF15)) ),
introduced(definition,[new_symbols(definition,[spl16_212])],[avatar_definition]) ).
fof(f3385,plain,
( theorem(or(sF3,sF15))
| ~ spl16_212 ),
inference(avatar_component_clause,[],[f3384]) ).
fof(f3388,plain,
( theorem(or(sF3,sF15))
| ~ spl16_51 ),
inference(forward_subsumption_resolution,[],[f3382,f932]) ).
fof(f3389,plain,
( spl16_212
| ~ spl16_51 ),
inference(avatar_split_clause,[],[f3388,f920,f3384]) ).
fof(f3390,plain,
( theorem(or(sF15,q))
| ~ spl16_51 ),
inference(resolution,[],[f3372,f74]) ).
fof(f3391,plain,
( ! [X0] :
( ~ theorem(or(X0,q))
| theorem(or(X0,sF15)) )
| ~ spl16_212 ),
inference(resolution,[],[f3385,f362]) ).
fof(f3406,plain,
( theorem(or(sF15,sF15))
| ~ spl16_51
| ~ spl16_212 ),
inference(resolution,[],[f3390,f3391]) ).
fof(f3409,plain,
( theorem(sF15)
| ~ spl16_51
| ~ spl16_212 ),
inference(resolution,[],[f3406,f383]) ).
fof(f3411,plain,
( $false
| ~ spl16_51
| ~ spl16_212 ),
inference(forward_subsumption_resolution,[],[f3409,f52]) ).
fof(f3412,plain,
( ~ spl16_51
| ~ spl16_212 ),
inference(avatar_contradiction_clause,[],[f3411]) ).
fof(f3957,plain,
theorem(or(sF2,or(sF7,sF11))),
inference(resolution,[],[f2624,f247]) ).
fof(f3998,plain,
theorem(or(sF11,or(sF7,sF11))),
inference(resolution,[],[f3957,f1273]) ).
fof(f4020,plain,
theorem(or(sF7,sF11)),
inference(resolution,[],[f3998,f1094]) ).
fof(f4028,plain,
spl16_81,
inference(avatar_split_clause,[],[f4020,f2037]) ).
fof(f4031,plain,
( theorem(or(sF11,sF7))
| ~ spl16_81 ),
inference(resolution,[],[f2039,f74]) ).
fof(f4032,plain,
( theorem(sF12)
| ~ spl16_81 ),
inference(forward_demodulation,[],[f4031,f45]) ).
fof(f4035,plain,
( $false
| spl16_1
| ~ spl16_81 ),
inference(forward_subsumption_resolution,[],[f4032,f86]) ).
fof(f4036,plain,
( spl16_1
| ~ spl16_81 ),
inference(avatar_contradiction_clause,[],[f4035]) ).
fof(f4054,plain,
( theorem(or(sF10,sF15))
| ~ theorem(or(sF13,sF12))
| ~ spl16_2 ),
inference(resolution,[],[f89,f675]) ).
fof(f4060,plain,
( ~ theorem(or(sF13,sF12))
| ~ spl16_2
| spl16_51 ),
inference(forward_subsumption_resolution,[],[f4054,f921]) ).
fof(f4066,plain,
( $false
| ~ spl16_2
| spl16_51 ),
inference(forward_subsumption_resolution,[],[f4060,f554]) ).
fof(f4067,plain,
( ~ spl16_2
| spl16_51 ),
inference(avatar_contradiction_clause,[],[f4066]) ).
cnf(s1,plain,
( ~ spl16_1
| spl16_2 ),
inference(sat_conversion,[],[f90]) ).
cnf(s146,plain,
( ~ spl16_51
| spl16_212 ),
inference(sat_conversion,[],[f3389]) ).
cnf(s147,plain,
( ~ spl16_51
| ~ spl16_212 ),
inference(sat_conversion,[],[f3412]) ).
cnf(s192,plain,
spl16_81,
inference(sat_conversion,[],[f4028]) ).
cnf(s195,plain,
( spl16_1
| ~ spl16_81 ),
inference(sat_conversion,[],[f4036]) ).
cnf(s198,plain,
( ~ spl16_2
| spl16_51 ),
inference(sat_conversion,[],[f4067]) ).
cnf(s200,plain,
spl16_1,
inference(rat,[],[s195,s192]) ).
cnf(s211,plain,
spl16_2,
inference(rat,[],[s1,s200]) ).
cnf(s212,plain,
spl16_51,
inference(rat,[],[s198,s211]) ).
cnf(s214,plain,
~ spl16_212,
inference(rat,[],[s147,s212]) ).
cnf(s215,plain,
$false,
inference(rat,[],[s146,s214,s212]) ).
fof(f4069,plain,
$false,
inference(avatar_sat_refutation,[],[s215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL313-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n009.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Sun Sep 27 15:34:00 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/0.52 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.19/2.85 % (2181742)Input is clausal, will run a generic CNF schedule.
% 12.19/2.85 % (2181752)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=192254597:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 12.19/2.85 % (2181748)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=570634121:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 12.19/2.85 % (2181749)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2092017066:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 12.19/2.85 % (2181750)lrs+10_1_sil=8000:sp=occurrence:random_seed=3319314382:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 12.19/2.85 % (2181753)dis-21_1_sil=8000:lcm=predicate:random_seed=2104411750:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 12.19/2.85 % (2181747)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1888394935:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 12.19/2.85 % (2181751)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=322453744:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 12.19/2.85 % (2181752)Instruction limit reached!
% 12.19/2.85 % (2181752)------------------------------
% 12.19/2.85 % (2181752)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181752)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181752)Termination reason: Instruction limit
% 12.19/2.85 % (2181752)Termination phase: Saturation
% 12.19/2.85 % (2181752)Time elapsed: 0.092 s
% 12.19/2.85 % (2181752)Peak memory usage: 90 MB
% 12.19/2.85 % (2181752)Instructions burned: 182 (million)
% 12.19/2.85 % (2181753)Instruction limit reached!
% 12.19/2.85 % (2181753)------------------------------
% 12.19/2.85 % (2181753)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181753)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181753)Termination reason: Instruction limit
% 12.19/2.85 % (2181753)Termination phase: Saturation
% 12.19/2.85 % (2181753)Time elapsed: 0.089 s
% 12.19/2.85 % (2181753)Peak memory usage: 87 MB
% 12.19/2.85 % (2181753)Instructions burned: 117 (million)
% 12.19/2.85 % (2181750)Instruction limit reached!
% 12.19/2.85 % (2181750)------------------------------
% 12.19/2.85 % (2181750)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181750)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181750)Termination reason: Instruction limit
% 12.19/2.85 % (2181750)Termination phase: Saturation
% 12.19/2.85 % (2181750)Time elapsed: 0.104 s
% 12.19/2.85 % (2181750)Peak memory usage: 89 MB
% 12.19/2.85 % (2181750)Instructions burned: 107 (million)
% 12.19/2.85 % (2181751)Instruction limit reached!
% 12.19/2.85 % (2181751)------------------------------
% 12.19/2.85 % (2181751)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181751)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181751)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181751)Termination reason: Instruction limit
% 12.19/2.85 % (2181751)Termination phase: Saturation
% 12.19/2.85 % (2181751)Time elapsed: 0.111 s
% 12.19/2.85 % (2181751)Peak memory usage: 89 MB
% 12.19/2.85 % (2181751)Instructions burned: 114 (million)
% 12.19/2.85 % (2181762)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3609943747:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 12.19/2.85 % (2181762)Refutation not found, incomplete strategy
% 12.19/2.85 % (2181762)------------------------------
% 12.19/2.85 % (2181762)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181762)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181762)Termination reason: Refutation not found, incomplete strategy
% 12.19/2.85 % (2181762)Time elapsed: 0.002 s
% 12.19/2.85 % (2181762)Peak memory usage: 87 MB
% 12.19/2.85 % (2181764)lrs+10_64_to=lpo:sil=8000:random_seed=3337907291:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 12.19/2.85 % (2181763)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2045740576:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 12.19/2.85 % (2181761)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1683729414:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 12.19/2.85 % (2181761)Refutation not found, incomplete strategy
% 12.19/2.85 % (2181761)------------------------------
% 12.19/2.85 % (2181761)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181761)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181761)Termination reason: Refutation not found, incomplete strategy
% 12.19/2.85 % (2181761)Time elapsed: 0.002 s
% 12.19/2.85 % (2181761)Peak memory usage: 87 MB
% 12.19/2.85 % (2181763)Refutation not found, incomplete strategy
% 12.19/2.85 % (2181763)------------------------------
% 12.19/2.85 % (2181763)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181763)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181763)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181763)Termination reason: Refutation not found, incomplete strategy
% 12.19/2.85 % (2181763)Time elapsed: 0.002 s
% 12.19/2.85 % (2181763)Peak memory usage: 87 MB
% 12.19/2.85 % (2181763)Instructions burned: 1 (million)
% 12.19/2.85 % (2181764)Instruction limit reached!
% 12.19/2.85 % (2181764)------------------------------
% 12.19/2.85 % (2181764)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181764)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181764)Termination reason: Instruction limit
% 12.19/2.85 % (2181764)Termination phase: Saturation
% 12.19/2.85 % (2181764)Time elapsed: 0.062 s
% 12.19/2.85 % (2181764)Peak memory usage: 89 MB
% 12.19/2.85 % (2181764)Instructions burned: 128 (million)
% 12.19/2.85 % (2181762)------------------------------
% 12.19/2.85 % (2181762)------------------------------
% 12.19/2.85 % (2181761)------------------------------
% 12.19/2.85 % (2181761)------------------------------
% 12.19/2.85 % (2181763)------------------------------
% 12.19/2.85 % (2181763)------------------------------
% 12.19/2.85 % (2181769)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2458340413:avsq=on:i=194:fgj=on:bd=preordered_2993 on theBenchmark for (2993ds/194Mi)
% 12.19/2.85 % (2181769)Instruction limit reached!
% 12.19/2.85 % (2181769)------------------------------
% 12.19/2.85 % (2181769)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181769)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181769)Termination reason: Instruction limit
% 12.19/2.85 % (2181769)Termination phase: Saturation
% 12.19/2.85 % (2181769)Time elapsed: 0.202 s
% 12.19/2.85 % (2181769)Peak memory usage: 90 MB
% 12.19/2.85 % (2181769)Instructions burned: 195 (million)
% 12.19/2.85 % (2181770)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=2697229022:i=157:gtg=all_2989 on theBenchmark for (2989ds/157Mi)
% 12.19/2.85 % (2181772)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2729601826:i=3394:sd=4:ss=included:sgt=64_2989 on theBenchmark for (2989ds/3394Mi)
% 12.19/2.85 % (2181773)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=1196729247:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2989 on theBenchmark for (2989ds/106Mi)
% 12.19/2.85 % (2181773)Instruction limit reached!
% 12.19/2.85 % (2181773)------------------------------
% 12.19/2.85 % (2181773)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181773)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181773)Termination reason: Instruction limit
% 12.19/2.85 % (2181773)Termination phase: Saturation
% 12.19/2.85 % (2181773)Time elapsed: 0.089 s
% 12.19/2.85 % (2181773)Peak memory usage: 89 MB
% 12.19/2.85 % (2181773)Instructions burned: 107 (million)
% 12.19/2.85 % (2181770)Instruction limit reached!
% 12.19/2.85 % (2181770)------------------------------
% 12.19/2.85 % (2181770)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181770)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181770)Termination reason: Instruction limit
% 12.19/2.85 % (2181770)Termination phase: Saturation
% 12.19/2.85 % (2181770)Time elapsed: 0.171 s
% 12.19/2.85 % (2181770)Peak memory usage: 91 MB
% 12.19/2.85 % (2181770)Instructions burned: 158 (million)
% 12.19/2.85 % (2181775)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1793568528:i=107_2987 on theBenchmark for (2987ds/107Mi)
% 12.19/2.85 % (2181775)Refutation not found, incomplete strategy
% 12.19/2.85 % (2181775)------------------------------
% 12.19/2.85 % (2181775)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.85 % (2181775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.85 % (2181775)CaDiCaL version: 2.1.3
% 12.19/2.85 % (2181775)Termination reason: Refutation not found, incomplete strategy
% 12.19/2.85 % (2181775)Time elapsed: 0.002 s
% 12.19/2.85 % (2181775)Peak memory usage: 87 MB
% 12.19/2.85 % (2181747)First to succeed.
% 12.19/2.85 % (2181747)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2181742"
% 12.19/2.85 % (2181779)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=4132739164:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2985 on theBenchmark for (2985ds/242Mi)
% 12.19/2.85 % (2181780)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1384381812:cond=fast:i=5208:av=off_2985 on theBenchmark for (2985ds/5208Mi)
% 12.19/2.85 % (2181747)Refutation found. Thanks to Tanya!
% 12.19/2.85 % SZS status Unsatisfiable for theBenchmark
% 12.19/2.85 % SZS output start Proof for theBenchmark
% See solution above
% 14.28/3.19 % (2181747)------------------------------
% 14.28/3.19 % (2181747)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.28/3.19 % (2181747)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.28/3.19 % (2181747)CaDiCaL version: 2.1.3
% 14.28/3.19 % (2181747)Termination reason: Refutation
% 14.28/3.19 % (2181747)Time elapsed: 1.393 s
% 14.28/3.19 % (2181747)Peak memory usage: 136 MB
% 14.28/3.19 % (2181747)Instructions burned: 1793 (million)
% 14.28/3.19 % (2181747)------------------------------
% 14.28/3.19 % (2181747)------------------------------
% 14.28/3.19 % (2181742)Success in time 1.928 s
% 14.28/3.19 % Vampire exiting
%------------------------------------------------------------------------------