%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL250-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:45 AM UTC 2026
% Result : Unsatisfiable 8.03s 2.17s
% Output : Refutation 8.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 34
% Syntax : Number of formulae : 165 ( 114 unt; 23 def)
% Number of atoms : 267 ( 130 equ)
% Maximal formula atoms : 9 ( 1 avg)
% Number of connectives : 197 ( 95 ~; 89 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 14 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 14 con; 0-4 aty)
% Number of variables : 149 ( 0 sgn 149 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4,plain,
! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f6,plain,
! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f8,plain,
! [X2,X0,X1] : true = axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f10,plain,
! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f12,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f13,plain,
! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
inference(reorient_equations,[],[f12]) ).
fof(f14,axiom,
! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f15,plain,
! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(reorient_equations,[],[f14]) ).
fof(f16,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f17,negated_conjecture,
theorem(implies(implies(q,r),implies(and(p,q),r))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f18,plain,
true != theorem(implies(implies(q,r),implies(and(p,q),r))),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f21,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f22,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f23,plain,
! [X2,X0,X1] : true = axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f10,f11,f11,f11]) ).
fof(f24,plain,
! [X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(definition_unfolding,[],[f15,f11]) ).
fof(f25,plain,
true != theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
inference(definition_unfolding,[],[f18,f11,f11,f11,f16]) ).
fof(f26,definition,
sF0 = not(q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f27,plain,
not(q) = sF0,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF1 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f29,plain,
or(sF0,r) = sF1,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f31,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF3 = not(p),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f33,plain,
not(p) = sF3,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF4 = or(sF3,sF0),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f35,plain,
or(sF3,sF0) = sF4,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF5 = not(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f37,plain,
not(sF4) = sF5,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f39,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF7 = or(sF6,r),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f41,plain,
or(sF6,r) = sF7,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF8 = or(sF2,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f43,plain,
or(sF2,sF7) = sF8,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF9 = theorem(sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f45,plain,
theorem(sF8) = sF9,
inference(reorient_equations,[],[f44]) ).
fof(f46,plain,
true != sF9,
inference(definition_folding,[],[f25,f45,f43,f41,f39,f37,f35,f27,f33,f31,f29,f27]) ).
fof(f48,definition,
( spl10_1
<=> theorem(sF8) = sF9 ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f50,plain,
( theorem(sF8) = sF9
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f51,plain,
spl10_1,
inference(avatar_split_clause,[],[f45,f48]) ).
fof(f55,definition,
( spl10_2
<=> true = sF9 ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f57,plain,
( true != sF9
| spl10_2 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f58,plain,
~ spl10_2,
inference(avatar_split_clause,[],[f46,f55]) ).
fof(f60,definition,
( spl10_3
<=> not(q) = sF0 ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
fof(f62,plain,
( not(q) = sF0
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f63,plain,
spl10_3,
inference(avatar_split_clause,[],[f27,f60]) ).
fof(f74,definition,
( spl10_5
<=> not(sF1) = sF2 ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f76,plain,
( not(sF1) = sF2
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f77,plain,
spl10_5,
inference(avatar_split_clause,[],[f31,f74]) ).
fof(f81,definition,
( spl10_6
<=> not(sF5) = sF6 ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
fof(f83,plain,
( not(sF5) = sF6
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f84,plain,
spl10_6,
inference(avatar_split_clause,[],[f39,f81]) ).
fof(f88,definition,
( spl10_7
<=> not(sF4) = sF5 ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
fof(f90,plain,
( not(sF4) = sF5
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f91,plain,
spl10_7,
inference(avatar_split_clause,[],[f37,f88]) ).
fof(f94,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f21]) ).
fof(f95,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f19]) ).
fof(f96,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),true),
inference(superposition,[],[f13,f22]) ).
fof(f97,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f99,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f97,f1]) ).
fof(f100,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f96,f1]) ).
fof(f101,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(forward_demodulation,[],[f95,f1]) ).
fof(f102,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f94,f1]) ).
fof(f115,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f24,f102]) ).
fof(f121,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f115,f1]) ).
fof(f122,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),true),
inference(superposition,[],[f24,f100]) ).
fof(f128,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f122,f1]) ).
fof(f155,definition,
( spl10_8
<=> or(sF2,sF7) = sF8 ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
fof(f157,plain,
( or(sF2,sF7) = sF8
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f155]) ).
fof(f158,plain,
spl10_8,
inference(avatar_split_clause,[],[f43,f155]) ).
fof(f194,definition,
( spl10_9
<=> or(sF3,sF0) = sF4 ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
fof(f196,plain,
( or(sF3,sF0) = sF4
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f197,plain,
spl10_9,
inference(avatar_split_clause,[],[f35,f194]) ).
fof(f223,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),true),
inference(superposition,[],[f13,f23]) ).
fof(f224,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f223,f1]) ).
fof(f227,definition,
( spl10_10
<=> or(sF0,r) = sF1 ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
fof(f229,plain,
( or(sF0,r) = sF1
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f230,plain,
spl10_10,
inference(avatar_split_clause,[],[f29,f227]) ).
fof(f251,definition,
( spl10_11
<=> or(sF6,r) = sF7 ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
fof(f253,plain,
( or(sF6,r) = sF7
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f254,plain,
spl10_11,
inference(avatar_split_clause,[],[f41,f251]) ).
fof(f284,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),true),
inference(superposition,[],[f24,f224]) ).
fof(f286,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(not(or(not(X0),X1)),or(X2,X1)))),true),
inference(superposition,[],[f128,f224]) ).
fof(f295,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(not(or(not(X0),X1)),or(X2,X1)))),
inference(forward_demodulation,[],[f286,f1]) ).
fof(f296,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),
inference(forward_demodulation,[],[f284,f1]) ).
fof(f306,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f296,f99]) ).
fof(f307,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f296,f102]) ).
fof(f310,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
inference(superposition,[],[f296,f101]) ).
fof(f327,plain,
! [X0,X1] : true = theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
inference(forward_demodulation,[],[f310,f1]) ).
fof(f330,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f307,f1]) ).
fof(f331,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f306,f1]) ).
fof(f342,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),true),
inference(superposition,[],[f24,f331]) ).
fof(f353,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f342,f1]) ).
fof(f366,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),true),
inference(superposition,[],[f24,f327]) ).
fof(f377,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),
inference(forward_demodulation,[],[f366,f1]) ).
fof(f382,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(X0),X0)),true),
inference(superposition,[],[f377,f99]) ).
fof(f407,plain,
! [X0] : true = theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f382,f1]) ).
fof(f422,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
inference(superposition,[],[f121,f407]) ).
fof(f428,plain,
! [X0] : true = theorem(or(X0,not(X0))),
inference(forward_demodulation,[],[f422,f1]) ).
fof(f455,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),true),
inference(superposition,[],[f24,f330]) ).
fof(f470,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f455,f1]) ).
fof(f523,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(not(or(not(X1),X2)),or(X0,X2))),true),true),
inference(superposition,[],[f24,f295]) ).
fof(f539,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(not(or(not(X1),X2)),or(X0,X2))),true),
inference(forward_demodulation,[],[f523,f1]) ).
fof(f559,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF0)),true,theorem(or(X0,sF4)),true)
| ~ spl10_9 ),
inference(superposition,[],[f353,f196]) ).
fof(f623,plain,
( true = theorem(or(q,sF0))
| ~ spl10_3 ),
inference(superposition,[],[f428,f62]) ).
fof(f628,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),true),
inference(superposition,[],[f296,f428]) ).
fof(f644,plain,
! [X0,X1] : true = theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),
inference(forward_demodulation,[],[f628,f1]) ).
fof(f870,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),true),
inference(superposition,[],[f470,f644]) ).
fof(f892,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),
inference(forward_demodulation,[],[f870,f1]) ).
fof(f1038,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(not(not(X1)),X0)),true),true),
inference(superposition,[],[f24,f892]) ).
fof(f1067,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(not(not(X1)),X0)),true),
inference(forward_demodulation,[],[f1038,f1]) ).
fof(f1135,definition,
( spl10_12
<=> true = theorem(or(q,sF0)) ),
introduced(definition,[new_symbols(definition,[spl10_12])],[avatar_definition]) ).
fof(f1137,plain,
( true = theorem(or(q,sF0))
| ~ spl10_12 ),
inference(avatar_component_clause,[],[f1135]) ).
fof(f1138,plain,
( spl10_12
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f623,f60,f1135]) ).
fof(f1139,plain,
( true = ifeq(true,true,theorem(or(q,sF4)),true)
| ~ spl10_9
| ~ spl10_12 ),
inference(superposition,[],[f559,f1137]) ).
fof(f1160,plain,
( true = theorem(or(q,sF4))
| ~ spl10_9
| ~ spl10_12 ),
inference(forward_demodulation,[],[f1139,f1]) ).
fof(f1162,definition,
( spl10_13
<=> true = theorem(or(q,sF4)) ),
introduced(definition,[new_symbols(definition,[spl10_13])],[avatar_definition]) ).
fof(f1164,plain,
( true = theorem(or(q,sF4))
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f1162]) ).
fof(f1165,plain,
( spl10_13
| ~ spl10_9
| ~ spl10_12 ),
inference(avatar_split_clause,[],[f1160,f1135,f194,f1162]) ).
fof(f1175,plain,
( true = ifeq(true,true,theorem(or(not(not(sF4)),q)),true)
| ~ spl10_13 ),
inference(superposition,[],[f1067,f1164]) ).
fof(f1182,plain,
( true = theorem(or(not(not(sF4)),q))
| ~ spl10_13 ),
inference(forward_demodulation,[],[f1175,f1]) ).
fof(f1189,plain,
( true = theorem(or(not(sF5),q))
| ~ spl10_7
| ~ spl10_13 ),
inference(forward_demodulation,[],[f1182,f90]) ).
fof(f1192,plain,
( true = theorem(or(sF6,q))
| ~ spl10_6
| ~ spl10_7
| ~ spl10_13 ),
inference(forward_demodulation,[],[f1189,f83]) ).
fof(f1221,definition,
( spl10_15
<=> true = theorem(or(sF6,q)) ),
introduced(definition,[new_symbols(definition,[spl10_15])],[avatar_definition]) ).
fof(f1223,plain,
( true = theorem(or(sF6,q))
| ~ spl10_15 ),
inference(avatar_component_clause,[],[f1221]) ).
fof(f1224,plain,
( spl10_15
| ~ spl10_6
| ~ spl10_7
| ~ spl10_13 ),
inference(avatar_split_clause,[],[f1192,f1162,f88,f81,f1221]) ).
fof(f1229,plain,
( ! [X0] : true = ifeq(true,true,theorem(or(not(or(not(q),X0)),or(sF6,X0))),true)
| ~ spl10_15 ),
inference(superposition,[],[f539,f1223]) ).
fof(f1242,plain,
( ! [X0] : true = theorem(or(not(or(not(q),X0)),or(sF6,X0)))
| ~ spl10_15 ),
inference(forward_demodulation,[],[f1229,f1]) ).
fof(f1247,plain,
( ! [X0] : true = theorem(or(not(or(sF0,X0)),or(sF6,X0)))
| ~ spl10_3
| ~ spl10_15 ),
inference(forward_demodulation,[],[f1242,f62]) ).
fof(f1248,plain,
( true = theorem(or(not(sF1),or(sF6,r)))
| ~ spl10_3
| ~ spl10_10
| ~ spl10_15 ),
inference(superposition,[],[f1247,f229]) ).
fof(f1285,plain,
( true = theorem(or(not(sF1),sF7))
| ~ spl10_3
| ~ spl10_10
| ~ spl10_11
| ~ spl10_15 ),
inference(forward_demodulation,[],[f1248,f253]) ).
fof(f1287,plain,
( true = theorem(or(sF2,sF7))
| ~ spl10_3
| ~ spl10_5
| ~ spl10_10
| ~ spl10_11
| ~ spl10_15 ),
inference(forward_demodulation,[],[f1285,f76]) ).
fof(f1289,plain,
( true = theorem(sF8)
| ~ spl10_3
| ~ spl10_5
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_15 ),
inference(forward_demodulation,[],[f1287,f157]) ).
fof(f1291,plain,
( true = sF9
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_15 ),
inference(forward_demodulation,[],[f1289,f50]) ).
fof(f1294,plain,
( $false
| ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_5
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_15 ),
inference(forward_subsumption_resolution,[],[f1291,f57]) ).
fof(f1295,plain,
( ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_5
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_15 ),
inference(avatar_contradiction_clause,[],[f1294]) ).
cnf(s1,plain,
spl10_1,
inference(sat_conversion,[],[f51]) ).
cnf(s2,plain,
~ spl10_2,
inference(sat_conversion,[],[f58]) ).
cnf(s3,plain,
spl10_3,
inference(sat_conversion,[],[f63]) ).
cnf(s5,plain,
spl10_5,
inference(sat_conversion,[],[f77]) ).
cnf(s6,plain,
spl10_6,
inference(sat_conversion,[],[f84]) ).
cnf(s7,plain,
spl10_7,
inference(sat_conversion,[],[f91]) ).
cnf(s8,plain,
spl10_8,
inference(sat_conversion,[],[f158]) ).
cnf(s9,plain,
spl10_9,
inference(sat_conversion,[],[f197]) ).
cnf(s10,plain,
spl10_10,
inference(sat_conversion,[],[f230]) ).
cnf(s11,plain,
spl10_11,
inference(sat_conversion,[],[f254]) ).
cnf(s12,plain,
( ~ spl10_3
| spl10_12 ),
inference(sat_conversion,[],[f1138]) ).
cnf(s13,plain,
( ~ spl10_9
| ~ spl10_12
| spl10_13 ),
inference(sat_conversion,[],[f1165]) ).
cnf(s15,plain,
( ~ spl10_6
| ~ spl10_7
| ~ spl10_13
| spl10_15 ),
inference(sat_conversion,[],[f1224]) ).
cnf(s17,plain,
( ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_5
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_15 ),
inference(sat_conversion,[],[f1295]) ).
cnf(s18,plain,
spl10_12,
inference(rat,[],[s12,s3]) ).
cnf(s19,plain,
spl10_13,
inference(rat,[],[s13,s9,s18]) ).
cnf(s20,plain,
spl10_15,
inference(rat,[],[s15,s6,s7,s19]) ).
cnf(s22,plain,
~ spl10_1,
inference(rat,[],[s17,s20,s11,s10,s8,s5,s3,s2]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s1,s22]) ).
fof(f1296,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL250-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n010.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Sun Sep 27 15:30:47 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.03/2.17 % (1100184)Detected a unit-equality problem, will run specialized UEQ schedule.
% 8.03/2.17 % (1100197)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=2605993973:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 8.03/2.17 % (1100203)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1774712460:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 8.03/2.17 % (1100198)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=275518618:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 8.03/2.17 % (1100200)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=794244428:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 8.03/2.17 % (1100202)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2239432657:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 8.03/2.17 % (1100199)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1933661283:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 8.03/2.17 % (1100201)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1601534834:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 8.03/2.17 % (1100200)Instruction limit reached!
% 8.03/2.17 % (1100200)------------------------------
% 8.03/2.17 % (1100200)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.03/2.17 % (1100200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.03/2.17 % (1100200)CaDiCaL version: 2.1.3
% 8.03/2.17 % (1100200)Termination reason: Instruction limit
% 8.03/2.17 % (1100200)Termination phase: Saturation
% 8.03/2.17 % (1100200)Time elapsed: 0.135 s
% 8.03/2.17 % (1100200)Peak memory usage: 89 MB
% 8.03/2.17 % (1100200)Instructions burned: 137 (million)
% 8.03/2.17 % (1100201)Instruction limit reached!
% 8.03/2.17 % (1100201)------------------------------
% 8.03/2.17 % (1100201)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.03/2.17 % (1100201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.03/2.17 % (1100201)CaDiCaL version: 2.1.3
% 8.03/2.17 % (1100201)Termination reason: Instruction limit
% 8.03/2.17 % (1100201)Termination phase: Saturation
% 8.03/2.17 % (1100201)Time elapsed: 0.177 s
% 8.03/2.17 % (1100201)Peak memory usage: 89 MB
% 8.03/2.17 % (1100201)Instructions burned: 182 (million)
% 8.03/2.17 % (1100202)Instruction limit reached!
% 8.03/2.17 % (1100202)------------------------------
% 8.03/2.17 % (1100202)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.03/2.17 % (1100202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.03/2.17 % (1100202)CaDiCaL version: 2.1.3
% 8.03/2.17 % (1100202)Termination reason: Instruction limit
% 8.03/2.17 % (1100202)Termination phase: Saturation
% 8.03/2.17 % (1100202)Time elapsed: 0.248 s
% 8.03/2.17 % (1100202)Peak memory usage: 91 MB
% 8.03/2.17 % (1100202)Instructions burned: 258 (million)
% 8.03/2.17 % (1100213)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3842615866:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2996 on theBenchmark for (2996ds/2051Mi)
% 8.03/2.17 % (1100214)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2504450557:i=4948:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/4948Mi)
% 8.03/2.17 % (1100215)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=3566916490:i=215:ep=RSTC_2995 on theBenchmark for (2995ds/215Mi)
% 8.03/2.17 % (1100215)Instruction limit reached!
% 8.03/2.17 % (1100215)------------------------------
% 8.03/2.17 % (1100215)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.03/2.17 % (1100215)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.03/2.17 % (1100215)CaDiCaL version: 2.1.3
% 8.03/2.17 % (1100215)Termination reason: Instruction limit
% 8.03/2.17 % (1100215)Termination phase: Saturation
% 8.03/2.17 % (1100215)Time elapsed: 0.189 s
% 8.03/2.17 % (1100215)Peak memory usage: 88 MB
% 8.03/2.17 % (1100215)Instructions burned: 215 (million)
% 8.03/2.17 % (1100197)First to succeed.
% 8.03/2.17 % (1100197)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1100184"
% 8.03/2.17 % (1100221)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=2717274389:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2991 on theBenchmark for (2991ds/317Mi)
% 8.03/2.17 % (1100197)Refutation found. Thanks to Tanya!
% 8.03/2.17 % SZS status Unsatisfiable for theBenchmark
% 8.03/2.17 % SZS output start Proof for theBenchmark
% See solution above
% 8.84/2.38 % (1100197)------------------------------
% 8.84/2.38 % (1100197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.84/2.38 % (1100197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.84/2.38 % (1100197)CaDiCaL version: 2.1.3
% 8.84/2.38 % (1100197)Termination reason: Refutation
% 8.84/2.38 % (1100197)Time elapsed: 0.775 s
% 8.84/2.38 % (1100197)Peak memory usage: 133 MB
% 8.84/2.38 % (1100197)Instructions burned: 1298 (million)
% 8.84/2.38 % (1100197)------------------------------
% 8.84/2.38 % (1100197)------------------------------
% 8.84/2.38 % (1100184)Success in time 1.167 s
% 8.84/2.38 % Vampire exiting
%------------------------------------------------------------------------------