%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL300-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 : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:58:19 AM UTC 2026
% Result : Unsatisfiable 2.33s 1.04s
% Output : Refutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 33
% Syntax : Number of formulae : 172 ( 96 unt; 22 def)
% Number of atoms : 268 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 191 ( 95 ~; 87 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 10 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 15 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 110 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(not(p),not(q)),or(p,not(q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(or(not(not(p)),not(q))),or(p,not(q)))),not(or(not(or(p,not(q))),or(not(not(p)),not(q))))))),
inference(definition_unfolding,[],[f11,f12,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 = 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(q),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
not(q) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = or(sF1,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
or(sF1,sF2) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(p,sF2),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(p,sF2) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = or(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
or(sF4,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,sF3),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
or(sF8,sF3) = 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,f27,f25,f23,f21,f37,f31,f25,f35,f33,f31,f25,f29,f27,f25,f23,f21]) ).
fof(f47,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f48,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f49,plain,
! [X0] : axiom(or(sF0,or(X0,p))),
inference(superposition,[],[f14,f21]) ).
fof(f51,plain,
! [X0] : axiom(or(sF1,or(X0,sF0))),
inference(superposition,[],[f14,f23]) ).
fof(f56,plain,
! [X0] : axiom(or(sF12,or(X0,sF11))),
inference(superposition,[],[f14,f45]) ).
fof(f64,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f66,plain,
axiom(or(not(sF5),or(sF2,p))),
inference(superposition,[],[f15,f31]) ).
fof(f78,plain,
axiom(or(sF8,or(sF2,p))),
inference(forward_demodulation,[],[f66,f37]) ).
fof(f86,plain,
! [X0] :
( ~ theorem(or(sF7,X0))
| theorem(X0)
| ~ theorem(sF6) ),
inference(superposition,[],[f18,f35]) ).
fof(f98,definition,
( spl13_3
<=> theorem(sF9) ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f99,plain,
( theorem(sF9)
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f100,plain,
( ~ theorem(sF9)
| spl13_3 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f106,definition,
( spl13_5
<=> theorem(sF6) ),
introduced(definition,[new_symbols(definition,[spl13_5])],[avatar_definition]) ).
fof(f108,plain,
( ~ theorem(sF6)
| spl13_5 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f110,definition,
( spl13_6
<=> ! [X0] :
( ~ theorem(or(sF7,X0))
| theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl13_6])],[avatar_definition]) ).
fof(f111,plain,
( ! [X0] :
( ~ theorem(or(sF7,X0))
| theorem(X0) )
| ~ spl13_6 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f112,plain,
( ~ spl13_5
| spl13_6 ),
inference(avatar_split_clause,[],[f86,f110,f106]) ).
fof(f153,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f158,plain,
! [X0] : axiom(or(not(or(X0,sF11)),or(sF7,or(X0,sF10)))),
inference(superposition,[],[f16,f43]) ).
fof(f159,plain,
! [X0] : axiom(or(not(or(sF1,or(X0,sF2))),or(X0,sF3))),
inference(superposition,[],[f16,f27]) ).
fof(f164,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f179,plain,
! [X0] : axiom(or(not(or(not(X0),sF2)),or(not(or(p,X0)),sF5))),
inference(superposition,[],[f17,f31]) ).
fof(f180,plain,
! [X0] : axiom(or(not(or(not(X0),sF3)),or(not(or(sF8,X0)),sF9))),
inference(superposition,[],[f17,f39]) ).
fof(f196,plain,
! [X0] : theorem(or(sF0,or(X0,p))),
inference(resolution,[],[f49,f7]) ).
fof(f199,plain,
! [X0] : theorem(or(sF1,or(X0,sF0))),
inference(resolution,[],[f51,f7]) ).
fof(f208,plain,
! [X0] : theorem(or(sF12,or(X0,sF11))),
inference(resolution,[],[f56,f7]) ).
fof(f212,plain,
theorem(or(sF8,or(sF2,p))),
inference(resolution,[],[f78,f7]) ).
fof(f214,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f47,f18]) ).
fof(f215,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f48,f18]) ).
fof(f238,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f64,f18]) ).
fof(f268,plain,
! [X0] : theorem(or(not(or(X0,sF11)),or(sF7,or(X0,sF10)))),
inference(resolution,[],[f158,f7]) ).
fof(f270,plain,
! [X0] : theorem(or(not(or(sF1,or(X0,sF2))),or(X0,sF3))),
inference(resolution,[],[f159,f7]) ).
fof(f316,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f153,f18]) ).
fof(f343,plain,
axiom(or(not(or(sF1,sF2)),or(not(or(p,sF0)),sF5))),
inference(superposition,[],[f179,f23]) ).
fof(f351,plain,
axiom(or(not(sF3),or(not(or(p,sF0)),sF5))),
inference(forward_demodulation,[],[f343,f27]) ).
fof(f352,plain,
axiom(or(sF4,or(not(or(p,sF0)),sF5))),
inference(forward_demodulation,[],[f351,f29]) ).
fof(f355,plain,
! [X0] : theorem(or(not(or(not(X0),sF3)),or(not(or(sF8,X0)),sF9))),
inference(resolution,[],[f180,f7]) ).
fof(f398,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f238,f215]) ).
fof(f400,plain,
! [X0] : theorem(or(X0,not(or(X0,X0)))),
inference(resolution,[],[f238,f47]) ).
fof(f571,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f164,f18]) ).
fof(f644,plain,
! [X0] :
( theorem(not(or(not(X0),not(X0))))
| ~ theorem(X0) ),
inference(resolution,[],[f400,f18]) ).
fof(f647,plain,
theorem(or(sF4,or(not(or(p,sF0)),sF5))),
inference(resolution,[],[f352,f7]) ).
fof(f677,plain,
! [X0] :
( ~ theorem(or(X0,sF11))
| theorem(or(sF7,or(X0,sF10))) ),
inference(resolution,[],[f268,f18]) ).
fof(f681,plain,
! [X0] :
( ~ theorem(or(sF1,or(X0,sF2)))
| theorem(or(X0,sF3)) ),
inference(resolution,[],[f270,f18]) ).
fof(f784,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f316,f215]) ).
fof(f812,plain,
! [X0] : theorem(or(X0,or(sF0,p))),
inference(resolution,[],[f316,f196]) ).
fof(f822,plain,
theorem(or(sF2,or(sF8,p))),
inference(resolution,[],[f316,f212]) ).
fof(f827,plain,
! [X0] : theorem(or(X0,or(sF12,sF11))),
inference(resolution,[],[f316,f208]) ).
fof(f835,plain,
theorem(or(sF0,p)),
inference(resolution,[],[f812,f214]) ).
fof(f842,definition,
( spl13_22
<=> theorem(or(sF0,p)) ),
introduced(definition,[new_symbols(definition,[spl13_22])],[avatar_definition]) ).
fof(f844,plain,
( theorem(or(sF0,p))
| ~ spl13_22 ),
inference(avatar_component_clause,[],[f842]) ).
fof(f846,plain,
spl13_22,
inference(avatar_split_clause,[],[f835,f842]) ).
fof(f848,plain,
( theorem(or(p,sF0))
| ~ spl13_22 ),
inference(resolution,[],[f844,f238]) ).
fof(f934,plain,
theorem(or(or(sF8,p),sF2)),
inference(resolution,[],[f822,f238]) ).
fof(f955,plain,
theorem(or(sF12,sF11)),
inference(resolution,[],[f827,f214]) ).
fof(f959,definition,
( spl13_29
<=> theorem(or(sF12,sF11)) ),
introduced(definition,[new_symbols(definition,[spl13_29])],[avatar_definition]) ).
fof(f961,plain,
( theorem(or(sF12,sF11))
| ~ spl13_29 ),
inference(avatar_component_clause,[],[f959]) ).
fof(f963,plain,
spl13_29,
inference(avatar_split_clause,[],[f955,f959]) ).
fof(f1020,plain,
! [X0] :
( theorem(or(not(or(sF8,X0)),sF9))
| ~ theorem(or(not(X0),sF3)) ),
inference(resolution,[],[f355,f18]) ).
fof(f1193,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f571,f18]) ).
fof(f1246,plain,
theorem(or(not(or(p,sF0)),or(sF4,sF5))),
inference(resolution,[],[f647,f316]) ).
fof(f1248,plain,
theorem(or(not(or(p,sF0)),sF6)),
inference(forward_demodulation,[],[f1246,f33]) ).
fof(f1249,plain,
( theorem(sF6)
| ~ theorem(or(p,sF0)) ),
inference(resolution,[],[f1248,f18]) ).
fof(f1251,plain,
( ~ theorem(or(p,sF0))
| spl13_5 ),
inference(forward_subsumption_resolution,[],[f1249,f108]) ).
fof(f1252,plain,
( $false
| spl13_5
| ~ spl13_22 ),
inference(forward_subsumption_resolution,[],[f1251,f848]) ).
fof(f1253,plain,
( spl13_5
| ~ spl13_22 ),
inference(avatar_contradiction_clause,[],[f1252]) ).
fof(f1428,plain,
( theorem(or(sF7,or(sF12,sF10)))
| ~ spl13_29 ),
inference(resolution,[],[f677,f961]) ).
fof(f1438,plain,
! [X0] :
( ~ theorem(or(X0,sF2))
| theorem(or(X0,sF3)) ),
inference(resolution,[],[f681,f215]) ).
fof(f1524,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f784,f214]) ).
fof(f1532,plain,
( ! [X0,X1] :
( ~ theorem(or(sF7,X0))
| theorem(or(X1,X0)) )
| ~ spl13_6 ),
inference(resolution,[],[f784,f111]) ).
fof(f1891,plain,
theorem(or(or(sF8,p),sF3)),
inference(resolution,[],[f1438,f934]) ).
fof(f2013,plain,
theorem(or(sF3,or(sF8,p))),
inference(resolution,[],[f1891,f238]) ).
fof(f2052,definition,
( spl13_47
<=> theorem(or(sF0,sF3)) ),
introduced(definition,[new_symbols(definition,[spl13_47])],[avatar_definition]) ).
fof(f2053,plain,
( theorem(or(sF0,sF3))
| ~ spl13_47 ),
inference(avatar_component_clause,[],[f2052]) ).
fof(f2054,plain,
( ~ theorem(or(sF0,sF3))
| spl13_47 ),
inference(avatar_component_clause,[],[f2052]) ).
fof(f2659,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f1193,f64]) ).
fof(f2744,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(sF8,X1)))
| theorem(or(X0,sF9))
| ~ theorem(or(not(X1),sF3)) ),
inference(resolution,[],[f1193,f1020]) ).
fof(f2762,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ),
inference(resolution,[],[f1193,f398]) ).
fof(f3356,plain,
( ! [X0] : theorem(or(X0,or(sF12,sF10)))
| ~ spl13_6
| ~ spl13_29 ),
inference(resolution,[],[f1532,f1428]) ).
fof(f3451,plain,
( ! [X0] : theorem(or(sF12,or(X0,sF10)))
| ~ spl13_6
| ~ spl13_29 ),
inference(resolution,[],[f3356,f316]) ).
fof(f3673,plain,
( theorem(not(or(sF10,sF10)))
| ~ theorem(sF9) ),
inference(superposition,[],[f644,f41]) ).
fof(f4173,plain,
( ~ theorem(or(sF9,sF3))
| theorem(sF9) ),
inference(superposition,[],[f1524,f39]) ).
fof(f6331,plain,
( ! [X0,X1] :
( theorem(or(sF12,X0))
| ~ theorem(not(or(X1,sF10))) )
| ~ spl13_6
| ~ spl13_29 ),
inference(resolution,[],[f2762,f3451]) ).
fof(f6362,definition,
( spl13_116
<=> ! [X0] : theorem(or(sF12,X0)) ),
introduced(definition,[new_symbols(definition,[spl13_116])],[avatar_definition]) ).
fof(f6363,plain,
( ! [X0] : theorem(or(sF12,X0))
| ~ spl13_116 ),
inference(avatar_component_clause,[],[f6362]) ).
fof(f6436,definition,
( spl13_132
<=> ! [X1] : ~ theorem(not(or(X1,sF10))) ),
introduced(definition,[new_symbols(definition,[spl13_132])],[avatar_definition]) ).
fof(f6437,plain,
( ! [X1] : ~ theorem(not(or(X1,sF10)))
| ~ spl13_132 ),
inference(avatar_component_clause,[],[f6436]) ).
fof(f6438,plain,
( spl13_132
| spl13_116
| ~ spl13_6
| ~ spl13_29 ),
inference(avatar_split_clause,[],[f6331,f959,f110,f6362,f6436]) ).
fof(f7967,plain,
( ~ theorem(sF9)
| ~ spl13_132 ),
inference(forward_subsumption_resolution,[],[f3673,f6437]) ).
fof(f7979,plain,
( $false
| ~ spl13_3
| ~ spl13_132 ),
inference(forward_subsumption_resolution,[],[f7967,f99]) ).
fof(f7980,plain,
( ~ spl13_3
| ~ spl13_132 ),
inference(avatar_contradiction_clause,[],[f7979]) ).
fof(f8234,plain,
( ~ theorem(or(sF9,sF3))
| spl13_3 ),
inference(forward_subsumption_resolution,[],[f4173,f100]) ).
fof(f12477,plain,
! [X0] : theorem(or(sF1,or(sF0,X0))),
inference(resolution,[],[f2659,f199]) ).
fof(f17372,plain,
theorem(or(sF0,sF3)),
inference(resolution,[],[f12477,f681]) ).
fof(f17390,plain,
( $false
| spl13_47 ),
inference(forward_subsumption_resolution,[],[f17372,f2054]) ).
fof(f17391,plain,
spl13_47,
inference(avatar_contradiction_clause,[],[f17390]) ).
fof(f20169,plain,
( theorem(sF12)
| ~ spl13_116 ),
inference(resolution,[],[f6363,f214]) ).
fof(f20229,plain,
( $false
| ~ spl13_116 ),
inference(forward_subsumption_resolution,[],[f20169,f46]) ).
fof(f20230,plain,
~ spl13_116,
inference(avatar_contradiction_clause,[],[f20229]) ).
fof(f20956,plain,
( theorem(or(sF3,sF9))
| ~ theorem(or(not(p),sF3)) ),
inference(resolution,[],[f2744,f2013]) ).
fof(f20993,definition,
( spl13_888
<=> theorem(or(sF3,sF9)) ),
introduced(definition,[new_symbols(definition,[spl13_888])],[avatar_definition]) ).
fof(f20995,plain,
( theorem(or(sF3,sF9))
| ~ spl13_888 ),
inference(avatar_component_clause,[],[f20993]) ).
fof(f20997,plain,
( ~ theorem(or(sF0,sF3))
| theorem(or(sF3,sF9)) ),
inference(forward_demodulation,[],[f20956,f21]) ).
fof(f21021,plain,
( theorem(or(sF3,sF9))
| ~ spl13_47 ),
inference(forward_subsumption_resolution,[],[f20997,f2053]) ).
fof(f21030,plain,
( spl13_888
| ~ spl13_47 ),
inference(avatar_split_clause,[],[f21021,f2052,f20993]) ).
fof(f21322,plain,
( theorem(or(sF9,sF3))
| ~ spl13_888 ),
inference(resolution,[],[f20995,f238]) ).
fof(f21323,plain,
( $false
| spl13_3
| ~ spl13_888 ),
inference(forward_subsumption_resolution,[],[f21322,f8234]) ).
fof(f21324,plain,
( spl13_3
| ~ spl13_888 ),
inference(avatar_contradiction_clause,[],[f21323]) ).
cnf(s3,plain,
( ~ spl13_5
| spl13_6 ),
inference(sat_conversion,[],[f112]) ).
cnf(s33,plain,
spl13_22,
inference(sat_conversion,[],[f846]) ).
cnf(s47,plain,
spl13_29,
inference(sat_conversion,[],[f963]) ).
cnf(s50,plain,
( spl13_5
| ~ spl13_22 ),
inference(sat_conversion,[],[f1253]) ).
cnf(s110,plain,
( ~ spl13_6
| ~ spl13_29
| spl13_116
| spl13_132 ),
inference(sat_conversion,[],[f6438]) ).
cnf(s417,plain,
( ~ spl13_3
| ~ spl13_132 ),
inference(sat_conversion,[],[f7980]) ).
cnf(s978,plain,
spl13_47,
inference(sat_conversion,[],[f17391]) ).
cnf(s1221,plain,
~ spl13_116,
inference(sat_conversion,[],[f20230]) ).
cnf(s1277,plain,
( ~ spl13_47
| spl13_888 ),
inference(sat_conversion,[],[f21030]) ).
cnf(s1303,plain,
( spl13_3
| ~ spl13_888 ),
inference(sat_conversion,[],[f21324]) ).
cnf(s1306,plain,
spl13_888,
inference(rat,[],[s1277,s978]) ).
cnf(s1310,plain,
spl13_3,
inference(rat,[],[s1303,s1306]) ).
cnf(s1329,plain,
~ spl13_132,
inference(rat,[],[s417,s1310]) ).
cnf(s1333,plain,
( ~ spl13_6
| ~ spl13_29 ),
inference(rat,[],[s110,s1329,s1221]) ).
cnf(s1358,plain,
~ spl13_6,
inference(rat,[],[s1333,s47]) ).
cnf(s1360,plain,
spl13_5,
inference(rat,[],[s50,s33]) ).
cnf(s1362,plain,
$false,
inference(rat,[],[s3,s1358,s1360]) ).
fof(f21327,plain,
$false,
inference(avatar_sat_refutation,[],[s1362]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL300-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.37 % Computer : n006.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Sun Sep 27 15:32:55 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 Running first-order model finding
% 0.13/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/1.04 % (3110191)Will run a generic schedule for satisfiability detection.
% 2.33/1.04 % (3110199)dis+10_1_sil=32000:sp=arity:random_seed=2071923247:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.33/1.04 % (3110197)% WARNING: option uhcvi not known.
% 2.33/1.04 % (3110200)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4127891362:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.33/1.04 % (3110196)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=813662392_2999 on theBenchmark for (2999ds/0Mi)
% 2.33/1.04 % (3110197)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=321727355:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.33/1.04 % (3110198)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=860521252:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.33/1.04 % TRYING [1]
% 2.33/1.04 % TRYING [2]
% 2.33/1.04 % TRYING [3]
% 2.33/1.04 % (3110201)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3581909381:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.33/1.04 % (3110202)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2092148081:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.33/1.04 % TRYING [4]
% 2.33/1.04 % (3110199)Instruction limit reached!
% 2.33/1.04 % (3110199)------------------------------
% 2.33/1.04 % (3110199)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110199)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110199)Termination reason: Instruction limit
% 2.33/1.04 % (3110199)Termination phase: Saturation
% 2.33/1.04 % (3110199)Time elapsed: 0.035 s
% 2.33/1.04 % (3110199)Peak memory usage: 12 MB
% 2.33/1.04 % (3110199)Instructions burned: 106 (million)
% 2.33/1.04 % (3110210)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=36405431:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.33/1.04 % TRYING [1]
% 2.33/1.04 % TRYING [2]
% 2.33/1.04 % TRYING [3]
% 2.33/1.04 % (3110200)Instruction limit reached!
% 2.33/1.04 % (3110200)------------------------------
% 2.33/1.04 % (3110200)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110200)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110200)Termination reason: Instruction limit
% 2.33/1.04 % (3110200)Termination phase: Saturation
% 2.33/1.04 % (3110200)Time elapsed: 0.053 s
% 2.33/1.04 % (3110200)Peak memory usage: 11 MB
% 2.33/1.04 % (3110200)Instructions burned: 116 (million)
% 2.33/1.04 % TRYING [4]
% 2.33/1.04 % (3110212)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3505130050:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.33/1.04 % (3110201)Instruction limit reached!
% 2.33/1.04 % (3110201)------------------------------
% 2.33/1.04 % (3110201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110201)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110201)Termination reason: Instruction limit
% 2.33/1.04 % (3110201)Termination phase: Saturation
% 2.33/1.04 % (3110201)Time elapsed: 0.086 s
% 2.33/1.04 % (3110201)Peak memory usage: 13 MB
% 2.33/1.04 % (3110201)Instructions burned: 131 (million)
% 2.33/1.04 % (3110202)Instruction limit reached!
% 2.33/1.04 % (3110202)------------------------------
% 2.33/1.04 % (3110202)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110202)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110202)Termination reason: Instruction limit
% 2.33/1.04 % (3110202)Termination phase: Saturation
% 2.33/1.04 % (3110202)Time elapsed: 0.087 s
% 2.33/1.04 % (3110202)Peak memory usage: 13 MB
% 2.33/1.04 % (3110202)Instructions burned: 159 (million)
% 2.33/1.04 % (3110226)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=3141338801:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.33/1.04 % (3110227)ott-21_1_sil=16000:fs=off:random_seed=3082157854:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.33/1.04 % (3110212)Instruction limit reached!
% 2.33/1.04 % (3110212)------------------------------
% 2.33/1.04 % (3110212)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110212)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110212)Termination reason: Instruction limit
% 2.33/1.04 % (3110212)Termination phase: Saturation
% 2.33/1.04 % (3110212)Time elapsed: 0.079 s
% 2.33/1.04 % (3110212)Peak memory usage: 12 MB
% 2.33/1.04 % (3110212)Instructions burned: 131 (million)
% 2.33/1.04 % TRYING [5]
% 2.33/1.04 % (3110244)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2295943943:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.33/1.04 % (3110227)Instruction limit reached!
% 2.33/1.04 % (3110227)------------------------------
% 2.33/1.04 % (3110227)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110227)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110227)Termination reason: Instruction limit
% 2.33/1.04 % (3110227)Termination phase: Saturation
% 2.33/1.04 % (3110227)Time elapsed: 0.090 s
% 2.33/1.04 % (3110227)Peak memory usage: 13 MB
% 2.33/1.04 % (3110227)Instructions burned: 180 (million)
% 2.33/1.04 % TRYING [5]
% 2.33/1.04 % (3110275)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=726342264:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.33/1.04 % TRYING [1]
% 2.33/1.04 % TRYING [2]
% 2.33/1.04 % TRYING [3]
% 2.33/1.04 % TRYING [4]
% 2.33/1.04 % (3110210)Instruction limit reached!
% 2.33/1.04 % (3110210)------------------------------
% 2.33/1.04 % (3110210)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110210)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110210)Termination reason: Instruction limit
% 2.33/1.04 % (3110210)Termination phase: Finite model building SAT solving
% 2.33/1.04 % (3110210)Time elapsed: 0.223 s
% 2.33/1.04 % (3110210)Peak memory usage: 17 MB
% 2.33/1.04 % (3110210)Instructions burned: 717 (million)
% 2.33/1.04 % (3110291)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=339960303:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.33/1.04 % TRYING [5]
% 2.33/1.04 % (3110244)Instruction limit reached!
% 2.33/1.04 % (3110244)------------------------------
% 2.33/1.04 % (3110244)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110244)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110244)Termination reason: Instruction limit
% 2.33/1.04 % (3110244)Termination phase: Saturation
% 2.33/1.04 % (3110244)Time elapsed: 0.281 s
% 2.33/1.04 % (3110244)Peak memory usage: 13 MB
% 2.33/1.04 % (3110244)Instructions burned: 479 (million)
% 2.33/1.04 % (3110325)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2823649741:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.33/1.04 % TRYING [14]
% 2.33/1.04 % (3110226)Instruction limit reached!
% 2.33/1.04 % (3110226)------------------------------
% 2.33/1.04 % (3110226)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110226)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110226)Termination reason: Instruction limit
% 2.33/1.04 % (3110226)Termination phase: Saturation
% 2.33/1.04 % (3110226)Time elapsed: 0.401 s
% 2.33/1.04 % (3110226)Peak memory usage: 16 MB
% 2.33/1.04 % (3110226)Instructions burned: 684 (million)
% 2.33/1.04 % (3110327)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=3672004069:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 2.33/1.04 % (3110291) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3110191-3110291"...
% 2.33/1.04 % (3110291)...printing done.
% 2.33/1.04 % (3110291)Refutation found. Thanks to Tanya!
% 2.33/1.04 % SZS status Unsatisfiable for theBenchmark
% 2.33/1.04 % SZS output start Proof for theBenchmark
% See solution above
% 2.33/1.04 % (3110291)------------------------------
% 2.33/1.04 % (3110291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.33/1.04 % (3110291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.33/1.04 % (3110291)CaDiCaL version: 2.1.3
% 2.33/1.04 % (3110291)Termination reason: Refutation
% 2.33/1.04 % (3110291)Time elapsed: 0.287 s
% 2.33/1.04 % (3110291)Peak memory usage: 22 MB
% 2.33/1.04 % (3110291)Instructions burned: 755 (million)
% 2.33/1.04 % (3110191)Success in time 0.619 s
% 2.33/1.04 % Vampire exiting
%------------------------------------------------------------------------------