%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL262-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:48 AM UTC 2026
% Result : Unsatisfiable 5.87s 2.31s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 28
% Syntax : Number of formulae : 160 ( 81 unt; 17 def)
% Number of atoms : 267 ( 30 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 213 ( 106 ~; 103 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 15 con; 0-2 aty)
% Number of variables : 132 ( 0 sgn 132 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(p,q),implies(not(q),not(p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q)))))),
inference(definition_unfolding,[],[f11,f12,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 = 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,sF0),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(sF4,sF0) = 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(sF5),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
not(sF5) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = or(sF8,sF1),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
or(sF8,sF1) = 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(sF7,sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
or(sF7,sF10) = 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,plain,
~ theorem(sF12),
inference(definition_folding,[],[f19,f45,f43,f41,f39,f23,f21,f37,f31,f21,f29,f27,f35,f33,f31,f21,f29,f27,f25,f23,f21]) ).
fof(f47,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f7,f17]) ).
fof(f48,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f7,f16]) ).
fof(f61,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f73,plain,
theorem(or(not(sF1),or(q,sF0))),
inference(superposition,[],[f61,f23]) ).
fof(f74,plain,
theorem(or(sF2,or(q,sF0))),
inference(forward_demodulation,[],[f73,f25]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f18,f48]) ).
fof(f81,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f18,f47]) ).
fof(f82,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f18,f61]) ).
fof(f88,plain,
! [X0] :
( ~ theorem(or(sF10,X0))
| theorem(X0)
| ~ theorem(sF9) ),
inference(superposition,[],[f18,f41]) ).
fof(f90,definition,
( spl13_1
<=> theorem(sF9) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f92,plain,
( ~ theorem(sF9)
| spl13_1 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f94,definition,
( spl13_2
<=> ! [X0] :
( ~ theorem(or(sF10,X0))
| theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f95,plain,
( ! [X0] :
( ~ theorem(or(sF10,X0))
| theorem(X0) )
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f96,plain,
( ~ spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f88,f94,f90]) ).
fof(f169,plain,
theorem(or(not(sF11),or(sF10,sF7))),
inference(superposition,[],[f61,f43]) ).
fof(f171,plain,
theorem(or(sF12,or(sF10,sF7))),
inference(forward_demodulation,[],[f169,f45]) ).
fof(f208,plain,
theorem(or(not(sF9),or(sF1,sF8))),
inference(superposition,[],[f61,f39]) ).
fof(f210,plain,
theorem(or(sF10,or(sF1,sF8))),
inference(forward_demodulation,[],[f208,f41]) ).
fof(f235,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f262,plain,
theorem(or(not(q),sF1)),
inference(superposition,[],[f235,f23]) ).
fof(f263,plain,
theorem(or(not(sF5),sF6)),
inference(superposition,[],[f235,f33]) ).
fof(f264,plain,
theorem(or(not(sF0),sF5)),
inference(superposition,[],[f235,f31]) ).
fof(f268,plain,
theorem(or(sF8,sF6)),
inference(forward_demodulation,[],[f263,f37]) ).
fof(f269,plain,
theorem(or(sF3,sF1)),
inference(forward_demodulation,[],[f262,f27]) ).
fof(f279,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f280,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f279,f18]) ).
fof(f283,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f81,f18]) ).
fof(f288,plain,
! [X0] :
( theorem(or(not(sF5),or(sF4,X0)))
| ~ theorem(or(not(sF0),X0)) ),
inference(superposition,[],[f81,f31]) ).
fof(f298,plain,
! [X0] :
( theorem(or(sF8,or(sF4,X0)))
| ~ theorem(or(not(sF0),X0)) ),
inference(forward_demodulation,[],[f288,f37]) ).
fof(f304,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X2,or(X1,X3))))
| theorem(or(X0,or(X1,or(X2,X3)))) ),
inference(resolution,[],[f283,f48]) ).
fof(f306,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f283,f61]) ).
fof(f307,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f283,f81]) ).
fof(f309,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f283,f279]) ).
fof(f313,plain,
! [X0,X1] :
( ~ theorem(or(sF4,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF3)) ),
inference(superposition,[],[f283,f29]) ).
fof(f314,plain,
! [X0,X1] :
( ~ theorem(or(sF8,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF5)) ),
inference(superposition,[],[f283,f37]) ).
fof(f315,plain,
! [X0,X1] :
( ~ theorem(or(sF7,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF6)) ),
inference(superposition,[],[f283,f35]) ).
fof(f316,plain,
! [X0,X1] :
( ~ theorem(or(sF10,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF9)) ),
inference(superposition,[],[f283,f41]) ).
fof(f321,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f309,f235]) ).
fof(f327,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f306,f235]) ).
fof(f339,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f321,f82]) ).
fof(f346,plain,
theorem(or(sF10,sF9)),
inference(superposition,[],[f321,f41]) ).
fof(f391,plain,
theorem(or(sF10,or(sF12,sF7))),
inference(resolution,[],[f171,f80]) ).
fof(f394,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,[],[f307,f48]) ).
fof(f397,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f307,f61]) ).
fof(f412,plain,
theorem(or(sF10,or(sF7,sF12))),
inference(resolution,[],[f391,f306]) ).
fof(f455,plain,
! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
inference(resolution,[],[f304,f61]) ).
fof(f467,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f397,f18]) ).
fof(f471,plain,
! [X0,X1] :
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f397,f309]) ).
fof(f494,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(X3,X2))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f394,f18]) ).
fof(f530,plain,
theorem(or(sF1,sF3)),
inference(resolution,[],[f269,f82]) ).
fof(f618,plain,
theorem(or(not(sF0),sF1)),
inference(superposition,[],[f327,f23]) ).
fof(f619,plain,
theorem(or(not(sF2),sF6)),
inference(superposition,[],[f327,f33]) ).
fof(f620,plain,
theorem(or(not(sF4),sF5)),
inference(superposition,[],[f327,f31]) ).
fof(f624,plain,
! [X0] :
( theorem(or(X0,or(sF7,sF12)))
| ~ theorem(or(X0,sF9)) ),
inference(resolution,[],[f316,f412]) ).
fof(f642,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[],[f467,f339]) ).
fof(f768,definition,
( spl13_30
<=> theorem(or(sF4,sF9)) ),
introduced(definition,[new_symbols(definition,[spl13_30])],[avatar_definition]) ).
fof(f769,plain,
( theorem(or(sF4,sF9))
| ~ spl13_30 ),
inference(avatar_component_clause,[],[f768]) ).
fof(f770,plain,
( ~ theorem(or(sF4,sF9))
| spl13_30 ),
inference(avatar_component_clause,[],[f768]) ).
fof(f774,definition,
( spl13_31
<=> theorem(or(sF7,sF12)) ),
introduced(definition,[new_symbols(definition,[spl13_31])],[avatar_definition]) ).
fof(f775,plain,
( ~ theorem(or(sF7,sF12))
| spl13_31 ),
inference(avatar_component_clause,[],[f774]) ).
fof(f776,plain,
( theorem(or(sF7,sF12))
| ~ spl13_31 ),
inference(avatar_component_clause,[],[f774]) ).
fof(f786,plain,
( ! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF12)) )
| ~ spl13_31 ),
inference(resolution,[],[f776,f315]) ).
fof(f790,plain,
( theorem(or(sF8,sF12))
| ~ spl13_31 ),
inference(resolution,[],[f786,f268]) ).
fof(f957,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(X0,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f494,f279]) ).
fof(f959,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,or(X0,X1)))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ),
inference(resolution,[],[f494,f471]) ).
fof(f970,plain,
! [X0,X1] :
( ~ theorem(or(not(sF9),X0))
| theorem(or(X1,X0))
| ~ theorem(or(sF8,or(X1,sF1))) ),
inference(superposition,[],[f494,f39]) ).
fof(f971,plain,
! [X0,X1] :
( ~ theorem(or(sF8,or(X1,sF1)))
| theorem(or(X1,X0))
| ~ theorem(or(sF10,X0)) ),
inference(forward_demodulation,[],[f970,f41]) ).
fof(f1089,plain,
! [X2,X0,X1] :
( ~ theorem(or(or(X0,X2),X1))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f455,f18]) ).
fof(f1787,plain,
! [X0] :
( theorem(or(X0,not(sF3)))
| ~ theorem(or(q,X0)) ),
inference(superposition,[],[f642,f27]) ).
fof(f1794,plain,
! [X0] :
( ~ theorem(or(q,X0))
| theorem(or(X0,sF4)) ),
inference(forward_demodulation,[],[f1787,f29]) ).
fof(f1866,plain,
! [X0] :
( theorem(or(sF4,X0))
| ~ theorem(or(sF10,X0))
| ~ theorem(or(not(sF0),sF1)) ),
inference(resolution,[],[f971,f298]) ).
fof(f1876,plain,
! [X0] :
( ~ theorem(or(sF10,X0))
| theorem(or(sF4,X0)) ),
inference(forward_subsumption_resolution,[],[f1866,f618]) ).
fof(f1877,plain,
theorem(or(sF4,or(sF1,sF8))),
inference(resolution,[],[f1876,f210]) ).
fof(f1916,plain,
theorem(or(sF4,or(sF8,sF1))),
inference(resolution,[],[f1877,f306]) ).
fof(f1919,plain,
theorem(or(sF4,sF9)),
inference(forward_demodulation,[],[f1916,f39]) ).
fof(f1925,plain,
( $false
| spl13_30 ),
inference(forward_subsumption_resolution,[],[f1919,f770]) ).
fof(f1926,plain,
spl13_30,
inference(avatar_contradiction_clause,[],[f1925]) ).
fof(f1950,plain,
( ! [X0] :
( ~ theorem(or(X0,sF3))
| theorem(or(X0,sF9)) )
| ~ spl13_30 ),
inference(resolution,[],[f769,f313]) ).
fof(f2175,plain,
( ~ theorem(or(sF1,sF9))
| theorem(sF9) ),
inference(superposition,[],[f957,f39]) ).
fof(f2176,plain,
( ~ theorem(or(sF1,sF9))
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f2175,f92]) ).
fof(f2257,plain,
( theorem(or(sF1,sF9))
| ~ spl13_30 ),
inference(resolution,[],[f1950,f530]) ).
fof(f2258,plain,
( $false
| spl13_1
| ~ spl13_30 ),
inference(forward_subsumption_resolution,[],[f2257,f2176]) ).
fof(f2259,plain,
( spl13_1
| ~ spl13_30 ),
inference(avatar_contradiction_clause,[],[f2258]) ).
fof(f2280,plain,
( theorem(or(sF7,sF12))
| ~ theorem(or(sF10,sF9))
| ~ spl13_2 ),
inference(resolution,[],[f95,f624]) ).
fof(f2286,plain,
( ~ theorem(or(sF10,sF9))
| ~ spl13_2
| spl13_31 ),
inference(forward_subsumption_resolution,[],[f2280,f775]) ).
fof(f2291,plain,
( $false
| ~ spl13_2
| spl13_31 ),
inference(forward_subsumption_resolution,[],[f2286,f346]) ).
fof(f2292,plain,
( ~ spl13_2
| spl13_31 ),
inference(avatar_contradiction_clause,[],[f2291]) ).
fof(f2296,plain,
( ! [X0] :
( ~ theorem(or(X0,sF5))
| theorem(or(X0,sF12)) )
| ~ spl13_31 ),
inference(resolution,[],[f790,f314]) ).
fof(f2298,plain,
( ! [X0] :
( ~ theorem(or(X0,sF6))
| theorem(or(X0,sF12)) )
| ~ spl13_31 ),
inference(resolution,[],[f776,f315]) ).
fof(f2300,plain,
( theorem(or(not(sF2),sF12))
| ~ spl13_31 ),
inference(resolution,[],[f2298,f619]) ).
fof(f2317,plain,
( theorem(or(not(sF0),sF12))
| ~ spl13_31 ),
inference(resolution,[],[f2296,f264]) ).
fof(f2318,plain,
( theorem(or(not(sF4),sF12))
| ~ spl13_31 ),
inference(resolution,[],[f2296,f620]) ).
fof(f2329,plain,
( ! [X0] :
( ~ theorem(or(X0,sF4))
| theorem(or(X0,sF12)) )
| ~ spl13_31 ),
inference(resolution,[],[f2318,f283]) ).
fof(f2375,plain,
( ! [X0] :
( ~ theorem(or(sF2,X0))
| theorem(or(X0,sF12)) )
| ~ spl13_31 ),
inference(resolution,[],[f2300,f467]) ).
fof(f2389,plain,
( theorem(or(or(q,sF0),sF12))
| ~ spl13_31 ),
inference(resolution,[],[f2375,f74]) ).
fof(f2441,plain,
( theorem(or(q,or(sF12,sF0)))
| ~ spl13_31 ),
inference(resolution,[],[f2389,f1089]) ).
fof(f2458,plain,
( theorem(or(q,or(sF0,sF12)))
| ~ spl13_31 ),
inference(resolution,[],[f2441,f306]) ).
fof(f2466,plain,
( theorem(or(sF0,or(q,sF12)))
| ~ spl13_31 ),
inference(resolution,[],[f2458,f80]) ).
fof(f2480,plain,
( theorem(or(q,sF12))
| ~ theorem(or(not(sF0),sF12))
| ~ spl13_31 ),
inference(resolution,[],[f2466,f959]) ).
fof(f2485,plain,
( theorem(or(q,sF12))
| ~ spl13_31 ),
inference(forward_subsumption_resolution,[],[f2480,f2317]) ).
fof(f2486,plain,
( theorem(or(sF12,sF4))
| ~ spl13_31 ),
inference(resolution,[],[f2485,f1794]) ).
fof(f2491,plain,
( theorem(or(sF12,sF12))
| ~ spl13_31 ),
inference(resolution,[],[f2486,f2329]) ).
fof(f2495,plain,
( theorem(sF12)
| ~ spl13_31 ),
inference(resolution,[],[f2491,f280]) ).
fof(f2497,plain,
( $false
| ~ spl13_31 ),
inference(forward_subsumption_resolution,[],[f2495,f46]) ).
fof(f2498,plain,
~ spl13_31,
inference(avatar_contradiction_clause,[],[f2497]) ).
cnf(s1,plain,
( ~ spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f96]) ).
cnf(s62,plain,
spl13_30,
inference(sat_conversion,[],[f1926]) ).
cnf(s66,plain,
( spl13_1
| ~ spl13_30 ),
inference(sat_conversion,[],[f2259]) ).
cnf(s72,plain,
( ~ spl13_2
| spl13_31 ),
inference(sat_conversion,[],[f2292]) ).
cnf(s80,plain,
~ spl13_31,
inference(sat_conversion,[],[f2498]) ).
cnf(s83,plain,
~ spl13_2,
inference(rat,[],[s72,s80]) ).
cnf(s85,plain,
spl13_1,
inference(rat,[],[s66,s62]) ).
cnf(s92,plain,
$false,
inference(rat,[],[s1,s83,s85]) ).
fof(f2499,plain,
$false,
inference(avatar_sat_refutation,[],[s92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL262-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:31:45 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.87/2.31 % (2563575)Input is clausal, will run a generic CNF schedule.
% 5.87/2.31 % (2563585)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3807559091:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 5.87/2.31 % (2563580)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=1360347743:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 5.87/2.31 % (2563584)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3561033902:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 5.87/2.31 % (2563586)dis-21_1_sil=8000:lcm=predicate:random_seed=2203339004: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)
% 5.87/2.31 % (2563583)lrs+10_1_sil=8000:sp=occurrence:random_seed=1822324644:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 5.87/2.31 % (2563582)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=742785799:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 5.87/2.31 % (2563581)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1236432477:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 5.87/2.31 % (2563585)Instruction limit reached!
% 5.87/2.31 % (2563585)------------------------------
% 5.87/2.31 % (2563585)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563585)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563585)Termination reason: Instruction limit
% 5.87/2.31 % (2563585)Termination phase: Saturation
% 5.87/2.31 % (2563585)Time elapsed: 0.061 s
% 5.87/2.31 % (2563585)Peak memory usage: 90 MB
% 5.87/2.31 % (2563585)Instructions burned: 182 (million)
% 5.87/2.31 % (2563586)Instruction limit reached!
% 5.87/2.31 % (2563586)------------------------------
% 5.87/2.31 % (2563586)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563586)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563586)Termination reason: Instruction limit
% 5.87/2.31 % (2563586)Termination phase: Saturation
% 5.87/2.31 % (2563586)Time elapsed: 0.057 s
% 5.87/2.31 % (2563586)Peak memory usage: 87 MB
% 5.87/2.31 % (2563586)Instructions burned: 118 (million)
% 5.87/2.31 % (2563583)Instruction limit reached!
% 5.87/2.31 % (2563583)------------------------------
% 5.87/2.31 % (2563583)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563583)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563583)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563583)Termination reason: Instruction limit
% 5.87/2.31 % (2563583)Termination phase: Saturation
% 5.87/2.31 % (2563583)Time elapsed: 0.070 s
% 5.87/2.31 % (2563583)Peak memory usage: 89 MB
% 5.87/2.31 % (2563583)Instructions burned: 107 (million)
% 5.87/2.31 % (2563584)Instruction limit reached!
% 5.87/2.31 % (2563584)------------------------------
% 5.87/2.31 % (2563584)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563584)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563584)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563584)Termination reason: Instruction limit
% 5.87/2.31 % (2563584)Termination phase: Saturation
% 5.87/2.31 % (2563584)Time elapsed: 0.072 s
% 5.87/2.31 % (2563584)Peak memory usage: 88 MB
% 5.87/2.31 % (2563584)Instructions burned: 115 (million)
% 5.87/2.31 % (2563594)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=2034659828:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 5.87/2.31 % (2563594)Refutation not found, incomplete strategy
% 5.87/2.31 % (2563594)------------------------------
% 5.87/2.31 % (2563594)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563594)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563594)Termination reason: Refutation not found, incomplete strategy
% 5.87/2.31 % (2563594)Time elapsed: 0.001 s
% 5.87/2.31 % (2563594)Peak memory usage: 88 MB
% 5.87/2.31 % (2563595)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2840742572:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 5.87/2.31 % (2563595)Refutation not found, incomplete strategy
% 5.87/2.31 % (2563595)------------------------------
% 5.87/2.31 % (2563595)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563595)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563595)Termination reason: Refutation not found, incomplete strategy
% 5.87/2.31 % (2563595)Time elapsed: 0.001 s
% 5.87/2.31 % (2563595)Peak memory usage: 87 MB
% 5.87/2.31 % (2563596)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2844180321:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 5.87/2.31 % (2563597)lrs+10_64_to=lpo:sil=8000:random_seed=3212412215:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 5.87/2.31 % (2563596)Refutation not found, incomplete strategy
% 5.87/2.31 % (2563596)------------------------------
% 5.87/2.31 % (2563596)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563596)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563596)Termination reason: Refutation not found, incomplete strategy
% 5.87/2.31 % (2563596)Time elapsed: 0.001 s
% 5.87/2.31 % (2563596)Peak memory usage: 87 MB
% 5.87/2.31 % (2563594)------------------------------
% 5.87/2.31 % (2563594)------------------------------
% 5.87/2.31 % (2563597)Instruction limit reached!
% 5.87/2.31 % (2563597)------------------------------
% 5.87/2.31 % (2563597)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563597)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563597)Termination reason: Instruction limit
% 5.87/2.31 % (2563597)Termination phase: Saturation
% 5.87/2.31 % (2563597)Time elapsed: 0.074 s
% 5.87/2.31 % (2563597)Peak memory usage: 88 MB
% 5.87/2.31 % (2563597)Instructions burned: 127 (million)
% 5.87/2.31 % (2563602)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=638262043:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 5.87/2.31 % (2563595)------------------------------
% 5.87/2.31 % (2563595)------------------------------
% 5.87/2.31 % (2563603)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=1334075692:i=157:gtg=all_2995 on theBenchmark for (2995ds/157Mi)
% 5.87/2.31 % (2563596)------------------------------
% 5.87/2.31 % (2563596)------------------------------
% 5.87/2.31 % (2563602)Instruction limit reached!
% 5.87/2.31 % (2563602)------------------------------
% 5.87/2.31 % (2563602)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563602)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563602)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563602)Termination reason: Instruction limit
% 5.87/2.31 % (2563602)Termination phase: Saturation
% 5.87/2.31 % (2563602)Time elapsed: 0.069 s
% 5.87/2.31 % (2563602)Peak memory usage: 90 MB
% 5.87/2.31 % (2563602)Instructions burned: 196 (million)
% 5.87/2.31 % (2563603)Instruction limit reached!
% 5.87/2.31 % (2563603)------------------------------
% 5.87/2.31 % (2563603)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563603)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563603)Termination reason: Instruction limit
% 5.87/2.31 % (2563603)Termination phase: Saturation
% 5.87/2.31 % (2563603)Time elapsed: 0.105 s
% 5.87/2.31 % (2563603)Peak memory usage: 91 MB
% 5.87/2.31 % (2563603)Instructions burned: 157 (million)
% 5.87/2.31 % (2563607)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=104817618:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 5.87/2.31 % (2563605)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2076915172:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 5.87/2.31 % (2563607)Instruction limit reached!
% 5.87/2.31 % (2563607)------------------------------
% 5.87/2.31 % (2563607)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563607)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563607)Termination reason: Instruction limit
% 5.87/2.31 % (2563607)Termination phase: Saturation
% 5.87/2.31 % (2563607)Time elapsed: 0.029 s
% 5.87/2.31 % (2563607)Peak memory usage: 89 MB
% 5.87/2.31 % (2563607)Instructions burned: 106 (million)
% 5.87/2.31 % (2563608)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=3058101288:i=107_2993 on theBenchmark for (2993ds/107Mi)
% 5.87/2.31 % (2563608)Refutation not found, incomplete strategy
% 5.87/2.31 % (2563608)------------------------------
% 5.87/2.31 % (2563608)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563608)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563608)Termination reason: Refutation not found, incomplete strategy
% 5.87/2.31 % (2563608)Time elapsed: 0.001 s
% 5.87/2.31 % (2563608)Peak memory usage: 87 MB
% 5.87/2.31 % (2563609)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2630159336:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2992 on theBenchmark for (2992ds/242Mi)
% 5.87/2.31 % (2563612)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=377899355:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 5.87/2.31 % (2563608)------------------------------
% 5.87/2.31 % (2563608)------------------------------
% 5.87/2.31 % (2563609)Instruction limit reached!
% 5.87/2.31 % (2563609)------------------------------
% 5.87/2.31 % (2563609)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563609)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563609)Termination reason: Instruction limit
% 5.87/2.31 % (2563609)Termination phase: Saturation
% 5.87/2.31 % (2563609)Time elapsed: 0.149 s
% 5.87/2.31 % (2563609)Peak memory usage: 90 MB
% 5.87/2.31 % (2563609)Instructions burned: 243 (million)
% 5.87/2.31 % (2563580)First to succeed.
% 5.87/2.31 % (2563580)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2563575"
% 5.87/2.31 % (2563616)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=3015480570:i=134:sd=2:doe=on:ss=axioms:sgt=14_2989 on theBenchmark for (2989ds/134Mi)
% 5.87/2.31 % (2563617)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=1137928931:i=499:bd=all_2989 on theBenchmark for (2989ds/499Mi)
% 5.87/2.31 % (2563616)Instruction limit reached!
% 5.87/2.31 % (2563616)------------------------------
% 5.87/2.31 % (2563616)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.87/2.31 % (2563616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.87/2.31 % (2563616)CaDiCaL version: 2.1.3
% 5.87/2.31 % (2563616)Termination reason: Instruction limit
% 5.87/2.31 % (2563616)Termination phase: Saturation
% 5.87/2.31 % (2563616)Time elapsed: 0.083 s
% 5.87/2.31 % (2563616)Peak memory usage: 90 MB
% 5.87/2.31 % (2563616)Instructions burned: 134 (million)
% 5.87/2.31 % (2563580)Refutation found. Thanks to Tanya!
% 5.87/2.31 % SZS status Unsatisfiable for theBenchmark
% 5.87/2.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/2.51 % (2563580)------------------------------
% 0.18/2.51 % (2563580)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/2.51 % (2563580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/2.51 % (2563580)CaDiCaL version: 2.1.3
% 0.18/2.51 % (2563580)Termination reason: Refutation
% 0.18/2.51 % (2563580)Time elapsed: 1.024 s
% 0.18/2.51 % (2563580)Peak memory usage: 132 MB
% 0.18/2.51 % (2563580)Instructions burned: 1541 (million)
% 0.18/2.51 % (2563580)------------------------------
% 0.18/2.51 % (2563580)------------------------------
% 0.18/2.51 % (2563575)Success in time 1.449 s
% 0.18/2.51 % Vampire exiting
%------------------------------------------------------------------------------