%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL276-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 : n026.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:16 AM UTC 2026
% Result : Unsatisfiable 6.08s 1.35s
% Output : Refutation 6.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 32
% Syntax : Number of formulae : 171 ( 91 unt; 21 def)
% Number of atoms : 272 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 196 ( 95 ~; 92 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 8 ( 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 : 109 ( 0 sgn 109 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(or(r,or(p,q)),or(p,or(q,r)))),
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(r,or(p,q))),or(p,or(q,r)))),not(or(not(or(p,or(q,r))),or(r,or(p,q))))))),
inference(definition_unfolding,[],[f11,f12]) ).
fof(f20,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = or(r,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
or(r,sF0) = 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 = or(q,r),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
or(q,r) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = or(p,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
or(p,sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(sF2,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(sF2,sF4) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = not(sF4),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
not(sF4) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = or(sF7,sF1),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
or(sF7,sF1) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = not(sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
not(sF8) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = or(sF6,sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
or(sF6,sF9) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = not(sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
not(sF10) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,plain,
~ theorem(sF11),
inference(definition_folding,[],[f19,f43,f41,f39,f37,f23,f21,f35,f29,f27,f33,f31,f29,f27,f25,f23,f21]) ).
fof(f45,plain,
~ theorem(not(sF10)),
inference(superposition,[],[f44,f43]) ).
fof(f46,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f47,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f61,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f65,plain,
axiom(or(not(sF3),or(r,q))),
inference(superposition,[],[f15,f27]) ).
fof(f72,plain,
axiom(or(not(or(r,q)),sF3)),
inference(superposition,[],[f15,f27]) ).
fof(f86,definition,
( spl12_1
<=> theorem(sF8) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f87,plain,
( theorem(sF8)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f88,plain,
( ~ theorem(sF8)
| spl12_1 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f94,definition,
( spl12_3
<=> theorem(sF5) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f95,plain,
( theorem(sF5)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f96,plain,
( ~ theorem(sF5)
| spl12_3 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f117,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f126,plain,
! [X0] : axiom(or(not(or(p,or(X0,q))),or(X0,sF0))),
inference(superposition,[],[f16,f21]) ).
fof(f127,plain,
! [X0] : axiom(or(not(or(p,or(X0,sF3))),or(X0,sF4))),
inference(superposition,[],[f16,f29]) ).
fof(f128,plain,
! [X0] : axiom(or(not(or(q,or(X0,r))),or(X0,sF3))),
inference(superposition,[],[f16,f27]) ).
fof(f129,plain,
! [X0] : axiom(or(not(or(sF2,or(X0,sF4))),or(X0,sF5))),
inference(superposition,[],[f16,f31]) ).
fof(f132,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f137,plain,
! [X0] : axiom(or(not(or(not(sF0),X0)),or(not(sF1),or(r,X0)))),
inference(superposition,[],[f17,f23]) ).
fof(f138,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
inference(superposition,[],[f17,f21]) ).
fof(f139,plain,
! [X0] : axiom(or(not(or(not(sF3),X0)),or(not(sF4),or(p,X0)))),
inference(superposition,[],[f17,f29]) ).
fof(f142,plain,
! [X0] : axiom(or(not(or(not(sF9),X0)),or(not(sF10),or(sF6,X0)))),
inference(superposition,[],[f17,f41]) ).
fof(f153,plain,
! [X0] : axiom(or(not(or(not(sF3),X0)),or(sF7,or(p,X0)))),
inference(forward_demodulation,[],[f139,f35]) ).
fof(f154,plain,
! [X0] : axiom(or(not(or(not(sF0),X0)),or(sF2,or(r,X0)))),
inference(forward_demodulation,[],[f137,f25]) ).
fof(f191,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f46,f18]) ).
fof(f192,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f47,f18]) ).
fof(f209,plain,
theorem(or(not(sF3),or(r,q))),
inference(resolution,[],[f65,f7]) ).
fof(f214,plain,
theorem(or(not(or(r,q)),sF3)),
inference(resolution,[],[f72,f7]) ).
fof(f228,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f61,f18]) ).
fof(f289,plain,
axiom(or(not(or(p,or(r,q))),sF1)),
inference(superposition,[],[f126,f23]) ).
fof(f291,plain,
! [X0] : theorem(or(not(or(p,or(X0,sF3))),or(X0,sF4))),
inference(resolution,[],[f127,f7]) ).
fof(f296,plain,
! [X0] : theorem(or(not(or(q,or(X0,r))),or(X0,sF3))),
inference(resolution,[],[f128,f7]) ).
fof(f300,plain,
! [X0] : theorem(or(not(or(sF2,or(X0,sF4))),or(X0,sF5))),
inference(resolution,[],[f129,f7]) ).
fof(f321,plain,
! [X0] : theorem(or(not(or(not(sF3),X0)),or(sF7,or(p,X0)))),
inference(resolution,[],[f153,f7]) ).
fof(f324,plain,
! [X0] : theorem(or(not(or(not(sF0),X0)),or(sF2,or(r,X0)))),
inference(resolution,[],[f154,f7]) ).
fof(f328,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f117,f18]) ).
fof(f346,plain,
axiom(or(not(or(not(q),sF3)),or(not(sF0),sF4))),
inference(superposition,[],[f138,f29]) ).
fof(f349,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f228,f192]) ).
fof(f386,plain,
! [X0] : theorem(or(not(or(not(sF9),X0)),or(not(sF10),or(sF6,X0)))),
inference(resolution,[],[f142,f7]) ).
fof(f576,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f132,f18]) ).
fof(f646,plain,
theorem(or(not(or(p,or(r,q))),sF1)),
inference(resolution,[],[f289,f7]) ).
fof(f727,plain,
! [X0] :
( ~ theorem(or(p,or(X0,sF3)))
| theorem(or(X0,sF4)) ),
inference(resolution,[],[f291,f18]) ).
fof(f733,plain,
! [X0] :
( ~ theorem(or(q,or(X0,r)))
| theorem(or(X0,sF3)) ),
inference(resolution,[],[f296,f18]) ).
fof(f739,plain,
! [X0] :
( ~ theorem(or(sF2,or(X0,sF4)))
| theorem(or(X0,sF5)) ),
inference(resolution,[],[f300,f18]) ).
fof(f772,plain,
theorem(or(not(or(not(q),sF3)),or(not(sF0),sF4))),
inference(resolution,[],[f346,f7]) ).
fof(f795,plain,
! [X0] :
( theorem(or(sF7,or(p,X0)))
| ~ theorem(or(not(sF3),X0)) ),
inference(resolution,[],[f321,f18]) ).
fof(f801,plain,
! [X0] :
( theorem(or(sF2,or(r,X0)))
| ~ theorem(or(not(sF0),X0)) ),
inference(resolution,[],[f324,f18]) ).
fof(f808,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f328,f192]) ).
fof(f809,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f328,f47]) ).
fof(f977,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f809,f191]) ).
fof(f985,definition,
( spl12_19
<=> ! [X0] : theorem(or(not(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl12_19])],[avatar_definition]) ).
fof(f986,plain,
( ! [X0] : theorem(or(not(X0),X0))
| ~ spl12_19 ),
inference(avatar_component_clause,[],[f985]) ).
fof(f988,plain,
spl12_19,
inference(avatar_split_clause,[],[f977,f985]) ).
fof(f989,plain,
! [X0] :
( theorem(or(not(sF10),or(sF6,X0)))
| ~ theorem(or(not(sF9),X0)) ),
inference(resolution,[],[f386,f18]) ).
fof(f994,plain,
( ! [X0] : theorem(or(X0,not(X0)))
| ~ spl12_19 ),
inference(resolution,[],[f986,f228]) ).
fof(f1009,plain,
( ! [X0] :
( theorem(not(not(X0)))
| ~ theorem(X0) )
| ~ spl12_19 ),
inference(resolution,[],[f994,f18]) ).
fof(f1027,plain,
( theorem(not(sF6))
| ~ theorem(sF5)
| ~ spl12_19 ),
inference(superposition,[],[f1009,f33]) ).
fof(f1028,plain,
( theorem(not(sF9))
| ~ theorem(sF8)
| ~ spl12_19 ),
inference(superposition,[],[f1009,f39]) ).
fof(f1157,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f576,f18]) ).
fof(f1343,plain,
! [X0] :
( ~ theorem(or(X0,sF3))
| theorem(or(X0,sF4)) ),
inference(resolution,[],[f727,f192]) ).
fof(f1351,plain,
! [X0] :
( ~ theorem(or(X0,r))
| theorem(or(X0,sF3)) ),
inference(resolution,[],[f733,f192]) ).
fof(f1424,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f808,f191]) ).
fof(f1554,plain,
( theorem(or(not(sF0),sF4))
| ~ theorem(or(not(q),sF3)) ),
inference(resolution,[],[f772,f18]) ).
fof(f1558,definition,
( spl12_20
<=> theorem(or(not(q),sF3)) ),
introduced(definition,[new_symbols(definition,[spl12_20])],[avatar_definition]) ).
fof(f1560,plain,
( ~ theorem(or(not(q),sF3))
| spl12_20 ),
inference(avatar_component_clause,[],[f1558]) ).
fof(f1562,definition,
( spl12_21
<=> theorem(or(not(sF0),sF4)) ),
introduced(definition,[new_symbols(definition,[spl12_21])],[avatar_definition]) ).
fof(f1565,plain,
( ~ spl12_20
| spl12_21 ),
inference(avatar_split_clause,[],[f1554,f1562,f1558]) ).
fof(f1607,plain,
( ~ theorem(or(not(sF0),sF4))
| theorem(or(r,sF5)) ),
inference(resolution,[],[f801,f739]) ).
fof(f1612,definition,
( spl12_24
<=> theorem(or(r,sF5)) ),
introduced(definition,[new_symbols(definition,[spl12_24])],[avatar_definition]) ).
fof(f1614,plain,
( theorem(or(r,sF5))
| ~ spl12_24 ),
inference(avatar_component_clause,[],[f1612]) ).
fof(f1615,plain,
( spl12_24
| ~ spl12_21 ),
inference(avatar_split_clause,[],[f1607,f1562,f1612]) ).
fof(f2486,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f1157,f46]) ).
fof(f2597,plain,
! [X0] :
( ~ theorem(or(X0,or(p,or(r,q))))
| theorem(or(X0,sF1)) ),
inference(resolution,[],[f1157,f646]) ).
fof(f2604,plain,
! [X0] :
( ~ theorem(or(X0,or(r,q)))
| theorem(or(X0,sF3)) ),
inference(resolution,[],[f1157,f214]) ).
fof(f2626,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ),
inference(resolution,[],[f1157,f349]) ).
fof(f3603,plain,
( ~ theorem(or(sF5,sF4))
| theorem(sF5) ),
inference(superposition,[],[f1424,f31]) ).
fof(f3608,plain,
( ~ theorem(or(sF5,sF4))
| spl12_3 ),
inference(forward_subsumption_resolution,[],[f3603,f96]) ).
fof(f4141,plain,
( theorem(or(not(sF10),sF6))
| ~ theorem(or(not(sF9),sF6)) ),
inference(resolution,[],[f2486,f989]) ).
fof(f4169,definition,
( spl12_69
<=> theorem(or(not(sF9),sF6)) ),
introduced(definition,[new_symbols(definition,[spl12_69])],[avatar_definition]) ).
fof(f4171,plain,
( ~ theorem(or(not(sF9),sF6))
| spl12_69 ),
inference(avatar_component_clause,[],[f4169]) ).
fof(f4173,definition,
( spl12_70
<=> theorem(or(not(sF10),sF6)) ),
introduced(definition,[new_symbols(definition,[spl12_70])],[avatar_definition]) ).
fof(f4175,plain,
( theorem(or(not(sF10),sF6))
| ~ spl12_70 ),
inference(avatar_component_clause,[],[f4173]) ).
fof(f4176,plain,
( ~ spl12_69
| spl12_70 ),
inference(avatar_split_clause,[],[f4141,f4173,f4169]) ).
fof(f4350,plain,
theorem(or(not(q),sF3)),
inference(resolution,[],[f2604,f47]) ).
fof(f4365,plain,
( $false
| spl12_20 ),
inference(forward_subsumption_resolution,[],[f4350,f1560]) ).
fof(f4366,plain,
spl12_20,
inference(avatar_contradiction_clause,[],[f4365]) ).
fof(f4379,plain,
( theorem(or(sF5,r))
| ~ spl12_24 ),
inference(resolution,[],[f1614,f228]) ).
fof(f4477,plain,
( theorem(or(sF5,sF3))
| ~ spl12_24 ),
inference(resolution,[],[f4379,f1351]) ).
fof(f4875,plain,
( theorem(or(sF5,sF4))
| ~ spl12_24 ),
inference(resolution,[],[f4477,f1343]) ).
fof(f4878,plain,
( $false
| spl12_3
| ~ spl12_24 ),
inference(forward_subsumption_resolution,[],[f4875,f3608]) ).
fof(f4879,plain,
( spl12_3
| ~ spl12_24 ),
inference(avatar_contradiction_clause,[],[f4878]) ).
fof(f4881,plain,
( theorem(not(sF6))
| ~ spl12_3
| ~ spl12_19 ),
inference(forward_subsumption_resolution,[],[f1027,f95]) ).
fof(f5229,plain,
( ~ theorem(not(sF9))
| spl12_69 ),
inference(resolution,[],[f4171,f349]) ).
fof(f6795,definition,
( spl12_262
<=> ! [X0] : theorem(or(not(sF10),X0)) ),
introduced(definition,[new_symbols(definition,[spl12_262])],[avatar_definition]) ).
fof(f6796,plain,
( ! [X0] : theorem(or(not(sF10),X0))
| ~ spl12_262 ),
inference(avatar_component_clause,[],[f6795]) ).
fof(f7886,plain,
( ~ theorem(sF8)
| ~ spl12_19
| spl12_69 ),
inference(forward_subsumption_resolution,[],[f1028,f5229]) ).
fof(f8047,plain,
( $false
| ~ spl12_1
| ~ spl12_19
| spl12_69 ),
inference(forward_subsumption_resolution,[],[f7886,f87]) ).
fof(f8048,plain,
( ~ spl12_1
| ~ spl12_19
| spl12_69 ),
inference(avatar_contradiction_clause,[],[f8047]) ).
fof(f13389,plain,
( theorem(not(sF10))
| ~ spl12_262 ),
inference(resolution,[],[f6796,f191]) ).
fof(f13414,plain,
( $false
| ~ spl12_262 ),
inference(forward_subsumption_resolution,[],[f13389,f45]) ).
fof(f13415,plain,
~ spl12_262,
inference(avatar_contradiction_clause,[],[f13414]) ).
fof(f13781,plain,
( ! [X0] :
( theorem(or(not(sF10),X0))
| ~ theorem(not(sF6)) )
| ~ spl12_70 ),
inference(resolution,[],[f4175,f2626]) ).
fof(f13785,plain,
( ! [X0] : theorem(or(not(sF10),X0))
| ~ spl12_3
| ~ spl12_19
| ~ spl12_70 ),
inference(forward_subsumption_resolution,[],[f13781,f4881]) ).
fof(f13786,plain,
( spl12_262
| ~ spl12_3
| ~ spl12_19
| ~ spl12_70 ),
inference(avatar_split_clause,[],[f13785,f4173,f985,f94,f6795]) ).
fof(f14562,plain,
( theorem(or(sF7,sF1))
| ~ theorem(or(not(sF3),or(r,q))) ),
inference(resolution,[],[f2597,f795]) ).
fof(f14563,plain,
theorem(or(sF7,sF1)),
inference(forward_subsumption_resolution,[],[f14562,f209]) ).
fof(f14602,plain,
theorem(sF8),
inference(forward_demodulation,[],[f14563,f37]) ).
fof(f14604,plain,
( $false
| spl12_1 ),
inference(forward_subsumption_resolution,[],[f14602,f88]) ).
fof(f14605,plain,
spl12_1,
inference(avatar_contradiction_clause,[],[f14604]) ).
cnf(s41,plain,
spl12_19,
inference(sat_conversion,[],[f988]) ).
cnf(s42,plain,
( ~ spl12_20
| spl12_21 ),
inference(sat_conversion,[],[f1565]) ).
cnf(s44,plain,
( ~ spl12_21
| spl12_24 ),
inference(sat_conversion,[],[f1615]) ).
cnf(s67,plain,
( ~ spl12_69
| spl12_70 ),
inference(sat_conversion,[],[f4176]) ).
cnf(s74,plain,
spl12_20,
inference(sat_conversion,[],[f4366]) ).
cnf(s86,plain,
( spl12_3
| ~ spl12_24 ),
inference(sat_conversion,[],[f4879]) ).
cnf(s603,plain,
( ~ spl12_1
| ~ spl12_19
| spl12_69 ),
inference(sat_conversion,[],[f8048]) ).
cnf(s1686,plain,
~ spl12_262,
inference(sat_conversion,[],[f13415]) ).
cnf(s1720,plain,
( ~ spl12_3
| ~ spl12_19
| ~ spl12_70
| spl12_262 ),
inference(sat_conversion,[],[f13786]) ).
cnf(s1725,plain,
spl12_1,
inference(sat_conversion,[],[f14605]) ).
cnf(s1737,plain,
( ~ spl12_19
| spl12_69 ),
inference(rat,[],[s603,s1725]) ).
cnf(s1746,plain,
spl12_21,
inference(rat,[],[s42,s74]) ).
cnf(s1747,plain,
spl12_24,
inference(rat,[],[s44,s1746]) ).
cnf(s1748,plain,
spl12_3,
inference(rat,[],[s86,s1747]) ).
cnf(s1752,plain,
~ spl12_70,
inference(rat,[],[s1720,s1686,s1748,s41]) ).
cnf(s1754,plain,
spl12_69,
inference(rat,[],[s1737,s41]) ).
cnf(s1756,plain,
$false,
inference(rat,[],[s67,s1752,s1754]) ).
fof(f14606,plain,
$false,
inference(avatar_sat_refutation,[],[s1756]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL276-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:35:11 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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
% 6.08/1.35 % (3009026)Will run a generic schedule for satisfiability detection.
% 6.08/1.35 % (3009040)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=546451330:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.08/1.35 % (3009039)% WARNING: option uhcvi not known.
% 6.08/1.35 % (3009039)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3325925923:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.08/1.35 % (3009038)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=539683620_2999 on theBenchmark for (2999ds/0Mi)
% 6.08/1.35 % (3009041)dis+10_1_sil=32000:sp=arity:random_seed=180851105:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.08/1.35 % (3009042)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2163116538:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.08/1.35 % (3009043)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=920591231:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.08/1.35 % (3009045)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=527678171:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.08/1.35 % TRYING [1]
% 6.08/1.35 % TRYING [2]
% 6.08/1.35 % TRYING [3]
% 6.08/1.35 % TRYING [4]
% 6.08/1.35 % (3009042)Instruction limit reached!
% 6.08/1.35 % (3009042)------------------------------
% 6.08/1.35 % (3009042)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009042)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009042)Termination reason: Instruction limit
% 6.08/1.35 % (3009042)Termination phase: Saturation
% 6.08/1.35 % (3009042)Time elapsed: 0.054 s
% 6.08/1.35 % (3009042)Peak memory usage: 11 MB
% 6.08/1.35 % (3009042)Instructions burned: 116 (million)
% 6.08/1.35 % (3009041)Instruction limit reached!
% 6.08/1.35 % (3009041)------------------------------
% 6.08/1.35 % (3009041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009041)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009041)Termination reason: Instruction limit
% 6.08/1.35 % (3009041)Termination phase: Saturation
% 6.08/1.35 % (3009041)Time elapsed: 0.064 s
% 6.08/1.35 % (3009041)Peak memory usage: 12 MB
% 6.08/1.35 % (3009041)Instructions burned: 103 (million)
% 6.08/1.35 % (3009072)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3312707050:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.08/1.35 % TRYING [1]
% 6.08/1.35 % TRYING [2]
% 6.08/1.35 % TRYING [3]
% 6.08/1.35 % (3009043)Instruction limit reached!
% 6.08/1.35 % (3009043)------------------------------
% 6.08/1.35 % (3009043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009043)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009043)Termination reason: Instruction limit
% 6.08/1.35 % (3009043)Termination phase: Saturation
% 6.08/1.35 % (3009043)Time elapsed: 0.081 s
% 6.08/1.35 % (3009043)Peak memory usage: 13 MB
% 6.08/1.35 % (3009043)Instructions burned: 131 (million)
% 6.08/1.35 % (3009075)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1391606615:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 6.08/1.35 % (3009045)Instruction limit reached!
% 6.08/1.35 % (3009045)------------------------------
% 6.08/1.35 % (3009045)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009045)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009045)Termination reason: Instruction limit
% 6.08/1.35 % (3009045)Termination phase: Saturation
% 6.08/1.35 % (3009045)Time elapsed: 0.097 s
% 6.08/1.35 % (3009045)Peak memory usage: 13 MB
% 6.08/1.35 % (3009045)Instructions burned: 161 (million)
% 6.08/1.35 % (3009082)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=2499530764:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.08/1.35 % TRYING [4]
% 6.08/1.35 % (3009092)ott-21_1_sil=16000:fs=off:random_seed=3231291078:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.08/1.35 % (3009075)Instruction limit reached!
% 6.08/1.35 % (3009075)------------------------------
% 6.08/1.35 % (3009075)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009075)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009075)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009075)Termination reason: Instruction limit
% 6.08/1.35 % (3009075)Termination phase: Saturation
% 6.08/1.35 % (3009075)Time elapsed: 0.080 s
% 6.08/1.35 % (3009075)Peak memory usage: 13 MB
% 6.08/1.35 % (3009075)Instructions burned: 131 (million)
% 6.08/1.35 % (3009112)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1163917476:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 6.08/1.35 % (3009092)Instruction limit reached!
% 6.08/1.35 % (3009092)------------------------------
% 6.08/1.35 % (3009092)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009092)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009092)Termination reason: Instruction limit
% 6.08/1.35 % (3009092)Termination phase: Saturation
% 6.08/1.35 % (3009092)Time elapsed: 0.091 s
% 6.08/1.35 % (3009092)Peak memory usage: 13 MB
% 6.08/1.35 % (3009092)Instructions burned: 182 (million)
% 6.08/1.35 % (3009122)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1478666018:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.08/1.35 % TRYING [1]
% 6.08/1.35 % TRYING [2]
% 6.08/1.35 % TRYING [3]
% 6.08/1.35 % TRYING [4]
% 6.08/1.35 % (3009112)Instruction limit reached!
% 6.08/1.35 % (3009112)------------------------------
% 6.08/1.35 % (3009112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009112)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009112)Termination reason: Instruction limit
% 6.08/1.35 % (3009112)Termination phase: Saturation
% 6.08/1.35 % (3009112)Time elapsed: 0.282 s
% 6.08/1.35 % (3009112)Peak memory usage: 12 MB
% 6.08/1.35 % (3009112)Instructions burned: 478 (million)
% 6.08/1.35 % TRYING [5]
% 6.08/1.35 % (3009072)Instruction limit reached!
% 6.08/1.35 % (3009072)------------------------------
% 6.08/1.35 % (3009072)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009072)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009072)Termination reason: Instruction limit
% 6.08/1.35 % (3009072)Termination phase: Finite model building SAT solving
% 6.08/1.35 % (3009072)Time elapsed: 0.406 s
% 6.08/1.35 % (3009072)Peak memory usage: 13 MB
% 6.08/1.35 % (3009072)Instructions burned: 714 (million)
% 6.08/1.35 % (3009143)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=154316777:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 6.08/1.35 % (3009082)Instruction limit reached!
% 6.08/1.35 % (3009082)------------------------------
% 6.08/1.35 % (3009082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009082)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009082)Termination reason: Instruction limit
% 6.08/1.35 % (3009082)Termination phase: Saturation
% 6.08/1.35 % (3009082)Time elapsed: 0.390 s
% 6.08/1.35 % (3009082)Peak memory usage: 16 MB
% 6.08/1.35 % (3009082)Instructions burned: 684 (million)
% 6.08/1.35 % (3009144)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=485067652:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 6.08/1.35 % (3009146)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=1750272699: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)
% 6.08/1.35 % TRYING [14]
% 6.08/1.35 % TRYING [5]
% 6.08/1.35 % (3009122)Instruction limit reached!
% 6.08/1.35 % (3009122)------------------------------
% 6.08/1.35 % (3009122)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009122)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009122)Termination reason: Instruction limit
% 6.08/1.35 % (3009122)Termination phase: Finite model building SAT solving
% 6.08/1.35 % (3009122)Time elapsed: 0.537 s
% 6.08/1.35 % (3009122)Peak memory usage: 13 MB
% 6.08/1.35 % (3009122)Instructions burned: 865 (million)
% 6.08/1.35 % (3009180)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1119581716:i=879:kws=inv_precedence:fsr=off_2991 on theBenchmark for (2991ds/879Mi)
% 6.08/1.35 % (3009143) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3009026-3009143"...
% 6.08/1.35 % (3009143)...printing done.
% 6.08/1.35 % (3009143)Refutation found. Thanks to Tanya!
% 6.08/1.35 % SZS status Unsatisfiable for theBenchmark
% 6.08/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 6.08/1.35 % (3009143)------------------------------
% 6.08/1.35 % (3009143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.08/1.35 % (3009143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.35 % (3009143)CaDiCaL version: 2.1.3
% 6.08/1.35 % (3009143)Termination reason: Refutation
% 6.08/1.35 % (3009143)Time elapsed: 0.380 s
% 6.08/1.35 % (3009143)Peak memory usage: 18 MB
% 6.08/1.35 % (3009143)Instructions burned: 461 (million)
% 6.08/1.35 % (3009026)Success in time 0.924 s
% 6.08/1.35 % Vampire exiting
%------------------------------------------------------------------------------