%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL195-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 : n003.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:30 AM UTC 2026
% Result : Unsatisfiable 10.80s 2.89s
% Output : Refutation 12.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 38
% Syntax : Number of formulae : 202 ( 111 unt; 28 def)
% Number of atoms : 339 ( 149 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 261 ( 124 ~; 118 |; 0 &)
% ( 19 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 21 ( 19 usr; 20 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-4 aty)
% Number of variables : 144 ( 0 sgn 144 !; 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,negated_conjecture,
theorem(implies(implies(q,r),implies(or(q,p),or(r,p)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
true != theorem(implies(implies(q,r),implies(or(q,p),or(r,p)))),
inference(reorient_equations,[],[f16]) ).
fof(f18,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f19,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f21,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f22,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(f23,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(f24,plain,
true != theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))),
inference(definition_unfolding,[],[f17,f11,f11,f11]) ).
fof(f25,definition,
sF0 = not(q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f26,plain,
not(q) = sF0,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF1 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f28,plain,
or(sF0,r) = sF1,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f30,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF3 = or(q,p),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f32,plain,
or(q,p) = sF3,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f34,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f33]) ).
fof(f35,definition,
sF5 = or(r,p),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f36,plain,
or(r,p) = sF5,
inference(reorient_equations,[],[f35]) ).
fof(f37,definition,
sF6 = or(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f38,plain,
or(sF4,sF5) = sF6,
inference(reorient_equations,[],[f37]) ).
fof(f39,definition,
sF7 = or(sF2,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f40,plain,
or(sF2,sF6) = sF7,
inference(reorient_equations,[],[f39]) ).
fof(f41,definition,
sF8 = theorem(sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f42,plain,
theorem(sF7) = sF8,
inference(reorient_equations,[],[f41]) ).
fof(f43,plain,
true != sF8,
inference(definition_folding,[],[f24,f42,f40,f38,f36,f34,f32,f30,f28,f26]) ).
fof(f45,definition,
( spl9_1
<=> theorem(sF7) = sF8 ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f47,plain,
( theorem(sF7) = sF8
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f48,plain,
spl9_1,
inference(avatar_split_clause,[],[f42,f45]) ).
fof(f52,definition,
( spl9_2
<=> true = sF8 ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f54,plain,
( true != sF8
| spl9_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f55,plain,
~ spl9_2,
inference(avatar_split_clause,[],[f43,f52]) ).
fof(f57,definition,
( spl9_3
<=> not(q) = sF0 ),
introduced(definition,[new_symbols(definition,[spl9_3])],[avatar_definition]) ).
fof(f59,plain,
( not(q) = sF0
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f60,plain,
spl9_3,
inference(avatar_split_clause,[],[f26,f57]) ).
fof(f64,definition,
( spl9_4
<=> not(sF3) = sF4 ),
introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition]) ).
fof(f66,plain,
( not(sF3) = sF4
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
spl9_4,
inference(avatar_split_clause,[],[f34,f64]) ).
fof(f71,definition,
( spl9_5
<=> not(sF1) = sF2 ),
introduced(definition,[new_symbols(definition,[spl9_5])],[avatar_definition]) ).
fof(f73,plain,
( not(sF1) = sF2
| ~ spl9_5 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f74,plain,
spl9_5,
inference(avatar_split_clause,[],[f30,f71]) ).
fof(f78,definition,
( spl9_6
<=> or(sF2,sF6) = sF7 ),
introduced(definition,[new_symbols(definition,[spl9_6])],[avatar_definition]) ).
fof(f80,plain,
( or(sF2,sF6) = sF7
| ~ spl9_6 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f81,plain,
spl9_6,
inference(avatar_split_clause,[],[f40,f78]) ).
fof(f87,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f88,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f19]) ).
fof(f89,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,f21]) ).
fof(f90,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f18]) ).
fof(f92,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(forward_demodulation,[],[f90,f1]) ).
fof(f93,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f89,f1]) ).
fof(f94,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f88,f1]) ).
fof(f95,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f87,f1]) ).
fof(f109,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f23,f95]) ).
fof(f115,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f109,f1]) ).
fof(f118,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,[],[f23,f93]) ).
fof(f124,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f118,f1]) ).
fof(f142,definition,
( spl9_7
<=> or(sF4,sF5) = sF6 ),
introduced(definition,[new_symbols(definition,[spl9_7])],[avatar_definition]) ).
fof(f144,plain,
( or(sF4,sF5) = sF6
| ~ spl9_7 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f145,plain,
spl9_7,
inference(avatar_split_clause,[],[f38,f142]) ).
fof(f158,plain,
! [X0] : true = ifeq(true,true,ifeq(theorem(or(X0,X0)),true,theorem(X0),true),true),
inference(superposition,[],[f23,f92]) ).
fof(f167,plain,
! [X0] : true = ifeq(theorem(or(X0,X0)),true,theorem(X0),true),
inference(forward_demodulation,[],[f158,f1]) ).
fof(f170,definition,
( spl9_8
<=> or(q,p) = sF3 ),
introduced(definition,[new_symbols(definition,[spl9_8])],[avatar_definition]) ).
fof(f172,plain,
( or(q,p) = sF3
| ~ spl9_8 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f173,plain,
spl9_8,
inference(avatar_split_clause,[],[f32,f170]) ).
fof(f189,definition,
( spl9_9
<=> or(r,p) = sF5 ),
introduced(definition,[new_symbols(definition,[spl9_9])],[avatar_definition]) ).
fof(f191,plain,
( or(r,p) = sF5
| ~ spl9_9 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f192,plain,
spl9_9,
inference(avatar_split_clause,[],[f36,f189]) ).
fof(f216,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,f22]) ).
fof(f217,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f216,f1]) ).
fof(f220,definition,
( spl9_10
<=> or(sF0,r) = sF1 ),
introduced(definition,[new_symbols(definition,[spl9_10])],[avatar_definition]) ).
fof(f222,plain,
( or(sF0,r) = sF1
| ~ spl9_10 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f223,plain,
spl9_10,
inference(avatar_split_clause,[],[f28,f220]) ).
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,[],[f23,f217]) ).
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,[],[f124,f217]) ).
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(f304,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f296,f94]) ).
fof(f305,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,f95]) ).
fof(f330,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f305,f1]) ).
fof(f331,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f304,f1]) ).
fof(f338,plain,
( ! [X0] : true = theorem(or(not(or(X0,p)),or(X0,sF5)))
| ~ spl9_9 ),
inference(superposition,[],[f331,f191]) ).
fof(f344,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),true),
inference(superposition,[],[f23,f331]) ).
fof(f355,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f344,f1]) ).
fof(f374,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,[],[f23,f330]) ).
fof(f385,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f374,f1]) ).
fof(f428,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,[],[f23,f295]) ).
fof(f440,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,[],[f428,f1]) ).
fof(f518,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true),
inference(superposition,[],[f385,f94]) ).
fof(f553,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X0,X1))),
inference(forward_demodulation,[],[f518,f1]) ).
fof(f589,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF6)),true,theorem(or(X0,sF7)),true)
| ~ spl9_6 ),
inference(superposition,[],[f355,f80]) ).
fof(f590,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF5)),true,theorem(or(X0,sF6)),true)
| ~ spl9_7 ),
inference(superposition,[],[f355,f144]) ).
fof(f674,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),true),
inference(superposition,[],[f296,f553]) ).
fof(f702,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),
inference(forward_demodulation,[],[f674,f1]) ).
fof(f737,plain,
( true = ifeq(theorem(or(sF7,sF7)),true,sF8,true)
| ~ spl9_1 ),
inference(superposition,[],[f167,f47]) ).
fof(f798,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X1,X2))),true),true),
inference(superposition,[],[f23,f702]) ).
fof(f822,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X1,X2))),true),
inference(forward_demodulation,[],[f798,f1]) ).
fof(f847,plain,
( ! [X0] : true = ifeq(theorem(or(X0,r)),true,theorem(or(X0,sF5)),true)
| ~ spl9_9 ),
inference(superposition,[],[f822,f191]) ).
fof(f1094,plain,
( true = theorem(or(not(sF3),or(q,sF5)))
| ~ spl9_8
| ~ spl9_9 ),
inference(superposition,[],[f338,f172]) ).
fof(f1132,plain,
( true = theorem(or(sF4,or(q,sF5)))
| ~ spl9_4
| ~ spl9_8
| ~ spl9_9 ),
inference(forward_demodulation,[],[f1094,f66]) ).
fof(f1349,definition,
( spl9_13
<=> true = theorem(or(sF4,or(q,sF5))) ),
introduced(definition,[new_symbols(definition,[spl9_13])],[avatar_definition]) ).
fof(f1351,plain,
( true = theorem(or(sF4,or(q,sF5)))
| ~ spl9_13 ),
inference(avatar_component_clause,[],[f1349]) ).
fof(f1352,plain,
( spl9_13
| ~ spl9_4
| ~ spl9_8
| ~ spl9_9 ),
inference(avatar_split_clause,[],[f1132,f189,f170,f64,f1349]) ).
fof(f1360,plain,
( true = ifeq(true,true,theorem(or(q,or(sF4,sF5))),true)
| ~ spl9_13 ),
inference(superposition,[],[f124,f1351]) ).
fof(f1383,plain,
( true = theorem(or(q,or(sF4,sF5)))
| ~ spl9_13 ),
inference(forward_demodulation,[],[f1360,f1]) ).
fof(f1386,plain,
( true = theorem(or(q,sF6))
| ~ spl9_7
| ~ spl9_13 ),
inference(forward_demodulation,[],[f1383,f144]) ).
fof(f1388,definition,
( spl9_14
<=> true = theorem(or(q,sF6)) ),
introduced(definition,[new_symbols(definition,[spl9_14])],[avatar_definition]) ).
fof(f1390,plain,
( true = theorem(or(q,sF6))
| ~ spl9_14 ),
inference(avatar_component_clause,[],[f1388]) ).
fof(f1391,plain,
( spl9_14
| ~ spl9_7
| ~ spl9_13 ),
inference(avatar_split_clause,[],[f1386,f1349,f142,f1388]) ).
fof(f1396,plain,
( true = ifeq(true,true,theorem(or(sF6,q)),true)
| ~ spl9_14 ),
inference(superposition,[],[f115,f1390]) ).
fof(f1416,plain,
( true = theorem(or(sF6,q))
| ~ spl9_14 ),
inference(forward_demodulation,[],[f1396,f1]) ).
fof(f1448,definition,
( spl9_16
<=> true = theorem(or(sF6,q)) ),
introduced(definition,[new_symbols(definition,[spl9_16])],[avatar_definition]) ).
fof(f1450,plain,
( true = theorem(or(sF6,q))
| ~ spl9_16 ),
inference(avatar_component_clause,[],[f1448]) ).
fof(f1451,plain,
( spl9_16
| ~ spl9_14 ),
inference(avatar_split_clause,[],[f1416,f1388,f1448]) ).
fof(f1456,plain,
( ! [X0] : true = ifeq(true,true,theorem(or(not(or(not(q),X0)),or(sF6,X0))),true)
| ~ spl9_16 ),
inference(superposition,[],[f440,f1450]) ).
fof(f1471,plain,
( ! [X0] : true = theorem(or(not(or(not(q),X0)),or(sF6,X0)))
| ~ spl9_16 ),
inference(forward_demodulation,[],[f1456,f1]) ).
fof(f1476,plain,
( ! [X0] : true = theorem(or(not(or(sF0,X0)),or(sF6,X0)))
| ~ spl9_3
| ~ spl9_16 ),
inference(forward_demodulation,[],[f1471,f59]) ).
fof(f1477,plain,
( true = theorem(or(not(sF1),or(sF6,r)))
| ~ spl9_3
| ~ spl9_10
| ~ spl9_16 ),
inference(superposition,[],[f1476,f222]) ).
fof(f1514,plain,
( true = theorem(or(sF2,or(sF6,r)))
| ~ spl9_3
| ~ spl9_5
| ~ spl9_10
| ~ spl9_16 ),
inference(forward_demodulation,[],[f1477,f73]) ).
fof(f1530,definition,
( spl9_17
<=> true = theorem(or(sF2,or(sF6,r))) ),
introduced(definition,[new_symbols(definition,[spl9_17])],[avatar_definition]) ).
fof(f1532,plain,
( true = theorem(or(sF2,or(sF6,r)))
| ~ spl9_17 ),
inference(avatar_component_clause,[],[f1530]) ).
fof(f1533,plain,
( spl9_17
| ~ spl9_3
| ~ spl9_5
| ~ spl9_10
| ~ spl9_16 ),
inference(avatar_split_clause,[],[f1514,f1448,f220,f71,f57,f1530]) ).
fof(f1537,plain,
( true = ifeq(true,true,theorem(or(sF2,or(r,sF6))),true)
| ~ spl9_17 ),
inference(superposition,[],[f385,f1532]) ).
fof(f1563,plain,
( true = theorem(or(sF2,or(r,sF6)))
| ~ spl9_17 ),
inference(forward_demodulation,[],[f1537,f1]) ).
fof(f3797,definition,
( spl9_44
<=> true = theorem(or(sF2,or(r,sF6))) ),
introduced(definition,[new_symbols(definition,[spl9_44])],[avatar_definition]) ).
fof(f3799,plain,
( true = theorem(or(sF2,or(r,sF6)))
| ~ spl9_44 ),
inference(avatar_component_clause,[],[f3797]) ).
fof(f3800,plain,
( spl9_44
| ~ spl9_17 ),
inference(avatar_split_clause,[],[f1563,f1530,f3797]) ).
fof(f3804,plain,
( true = ifeq(true,true,theorem(or(r,or(sF2,sF6))),true)
| ~ spl9_44 ),
inference(superposition,[],[f124,f3799]) ).
fof(f3837,plain,
( true = theorem(or(r,or(sF2,sF6)))
| ~ spl9_44 ),
inference(forward_demodulation,[],[f3804,f1]) ).
fof(f3841,plain,
( true = theorem(or(r,sF7))
| ~ spl9_6
| ~ spl9_44 ),
inference(forward_demodulation,[],[f3837,f80]) ).
fof(f3844,definition,
( spl9_45
<=> true = theorem(or(r,sF7)) ),
introduced(definition,[new_symbols(definition,[spl9_45])],[avatar_definition]) ).
fof(f3846,plain,
( true = theorem(or(r,sF7))
| ~ spl9_45 ),
inference(avatar_component_clause,[],[f3844]) ).
fof(f3847,plain,
( spl9_45
| ~ spl9_6
| ~ spl9_44 ),
inference(avatar_split_clause,[],[f3841,f3797,f78,f3844]) ).
fof(f3852,plain,
( true = ifeq(true,true,theorem(or(sF7,r)),true)
| ~ spl9_45 ),
inference(superposition,[],[f115,f3846]) ).
fof(f3874,plain,
( true = theorem(or(sF7,r))
| ~ spl9_45 ),
inference(forward_demodulation,[],[f3852,f1]) ).
fof(f3877,definition,
( spl9_46
<=> true = theorem(or(sF7,r)) ),
introduced(definition,[new_symbols(definition,[spl9_46])],[avatar_definition]) ).
fof(f3879,plain,
( true = theorem(or(sF7,r))
| ~ spl9_46 ),
inference(avatar_component_clause,[],[f3877]) ).
fof(f3880,plain,
( spl9_46
| ~ spl9_45 ),
inference(avatar_split_clause,[],[f3874,f3844,f3877]) ).
fof(f3882,plain,
( true = ifeq(true,true,theorem(or(sF7,sF5)),true)
| ~ spl9_9
| ~ spl9_46 ),
inference(superposition,[],[f847,f3879]) ).
fof(f3909,plain,
( true = theorem(or(sF7,sF5))
| ~ spl9_9
| ~ spl9_46 ),
inference(forward_demodulation,[],[f3882,f1]) ).
fof(f3911,definition,
( spl9_47
<=> true = theorem(or(sF7,sF5)) ),
introduced(definition,[new_symbols(definition,[spl9_47])],[avatar_definition]) ).
fof(f3913,plain,
( true = theorem(or(sF7,sF5))
| ~ spl9_47 ),
inference(avatar_component_clause,[],[f3911]) ).
fof(f3914,plain,
( spl9_47
| ~ spl9_9
| ~ spl9_46 ),
inference(avatar_split_clause,[],[f3909,f3877,f189,f3911]) ).
fof(f3919,plain,
( true = ifeq(true,true,theorem(or(sF7,sF6)),true)
| ~ spl9_7
| ~ spl9_47 ),
inference(superposition,[],[f590,f3913]) ).
fof(f3944,plain,
( true = theorem(or(sF7,sF6))
| ~ spl9_7
| ~ spl9_47 ),
inference(forward_demodulation,[],[f3919,f1]) ).
fof(f3946,definition,
( spl9_48
<=> true = theorem(or(sF7,sF6)) ),
introduced(definition,[new_symbols(definition,[spl9_48])],[avatar_definition]) ).
fof(f3948,plain,
( true = theorem(or(sF7,sF6))
| ~ spl9_48 ),
inference(avatar_component_clause,[],[f3946]) ).
fof(f3949,plain,
( spl9_48
| ~ spl9_7
| ~ spl9_47 ),
inference(avatar_split_clause,[],[f3944,f3911,f142,f3946]) ).
fof(f3958,plain,
( true = ifeq(true,true,theorem(or(sF7,sF7)),true)
| ~ spl9_6
| ~ spl9_48 ),
inference(superposition,[],[f589,f3948]) ).
fof(f3984,plain,
( true = theorem(or(sF7,sF7))
| ~ spl9_6
| ~ spl9_48 ),
inference(forward_demodulation,[],[f3958,f1]) ).
fof(f3985,plain,
( true = ifeq(true,true,sF8,true)
| ~ spl9_1
| ~ spl9_6
| ~ spl9_48 ),
inference(backward_demodulation,[],[f737,f3984]) ).
fof(f3986,plain,
( true = sF8
| ~ spl9_1
| ~ spl9_6
| ~ spl9_48 ),
inference(forward_demodulation,[],[f3985,f1]) ).
fof(f3987,plain,
( $false
| ~ spl9_1
| spl9_2
| ~ spl9_6
| ~ spl9_48 ),
inference(forward_subsumption_resolution,[],[f3986,f54]) ).
fof(f3988,plain,
( ~ spl9_1
| spl9_2
| ~ spl9_6
| ~ spl9_48 ),
inference(avatar_contradiction_clause,[],[f3987]) ).
cnf(s1,plain,
spl9_1,
inference(sat_conversion,[],[f48]) ).
cnf(s2,plain,
~ spl9_2,
inference(sat_conversion,[],[f55]) ).
cnf(s3,plain,
spl9_3,
inference(sat_conversion,[],[f60]) ).
cnf(s4,plain,
spl9_4,
inference(sat_conversion,[],[f67]) ).
cnf(s5,plain,
spl9_5,
inference(sat_conversion,[],[f74]) ).
cnf(s6,plain,
spl9_6,
inference(sat_conversion,[],[f81]) ).
cnf(s7,plain,
spl9_7,
inference(sat_conversion,[],[f145]) ).
cnf(s8,plain,
spl9_8,
inference(sat_conversion,[],[f173]) ).
cnf(s9,plain,
spl9_9,
inference(sat_conversion,[],[f192]) ).
cnf(s10,plain,
spl9_10,
inference(sat_conversion,[],[f223]) ).
cnf(s13,plain,
( ~ spl9_4
| ~ spl9_8
| ~ spl9_9
| spl9_13 ),
inference(sat_conversion,[],[f1352]) ).
cnf(s14,plain,
( ~ spl9_7
| ~ spl9_13
| spl9_14 ),
inference(sat_conversion,[],[f1391]) ).
cnf(s16,plain,
( ~ spl9_14
| spl9_16 ),
inference(sat_conversion,[],[f1451]) ).
cnf(s17,plain,
( ~ spl9_3
| ~ spl9_5
| ~ spl9_10
| ~ spl9_16
| spl9_17 ),
inference(sat_conversion,[],[f1533]) ).
cnf(s44,plain,
( ~ spl9_17
| spl9_44 ),
inference(sat_conversion,[],[f3800]) ).
cnf(s45,plain,
( ~ spl9_6
| ~ spl9_44
| spl9_45 ),
inference(sat_conversion,[],[f3847]) ).
cnf(s46,plain,
( ~ spl9_45
| spl9_46 ),
inference(sat_conversion,[],[f3880]) ).
cnf(s47,plain,
( ~ spl9_9
| ~ spl9_46
| spl9_47 ),
inference(sat_conversion,[],[f3914]) ).
cnf(s48,plain,
( ~ spl9_7
| ~ spl9_47
| spl9_48 ),
inference(sat_conversion,[],[f3949]) ).
cnf(s50,plain,
( ~ spl9_1
| spl9_2
| ~ spl9_6
| ~ spl9_48 ),
inference(sat_conversion,[],[f3988]) ).
cnf(s62,plain,
spl9_13,
inference(rat,[],[s13,s8,s9,s4]) ).
cnf(s64,plain,
spl9_14,
inference(rat,[],[s14,s7,s62]) ).
cnf(s66,plain,
spl9_16,
inference(rat,[],[s16,s64]) ).
cnf(s71,plain,
spl9_17,
inference(rat,[],[s17,s66,s5,s10,s3]) ).
cnf(s75,plain,
spl9_44,
inference(rat,[],[s44,s71]) ).
cnf(s81,plain,
spl9_45,
inference(rat,[],[s45,s6,s75]) ).
cnf(s85,plain,
spl9_46,
inference(rat,[],[s46,s81]) ).
cnf(s87,plain,
spl9_47,
inference(rat,[],[s47,s9,s85]) ).
cnf(s89,plain,
spl9_48,
inference(rat,[],[s48,s7,s87]) ).
cnf(s90,plain,
~ spl9_1,
inference(rat,[],[s50,s89,s6,s2]) ).
cnf(s91,plain,
$false,
inference(rat,[],[s1,s90]) ).
fof(f3989,plain,
$false,
inference(avatar_sat_refutation,[],[s91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL195-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.48 % Computer : n003.cluster.edu
% 0.20/0.48 % Model : x86_64 x86_64
% 0.20/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.48 % Memory : 8046.5625MB
% 0.20/0.48 % OS : Linux 6.8.0-71-generic
% 0.20/0.48 % CPULimit : 300
% 0.20/0.48 % WCLimit : 300
% 0.20/0.48 % DateTime : Sun Sep 27 15:27:57 UTC 2026
% 0.20/0.48 % CPUTime :
% 0.20/0.48 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.54 Running first-order theorem proving
% 0.26/0.54 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
% 10.80/2.89 % (705548)Detected a unit-equality problem, will run specialized UEQ schedule.
% 10.80/2.89 % (705554)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=2674170403:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 10.80/2.89 % (705555)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=3131405960:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 10.80/2.89 % (705558)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3370977328:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 10.80/2.89 % (705557)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1315359712:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 10.80/2.89 % (705556)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1346900432:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 10.80/2.89 % (705560)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2730370897:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 10.80/2.89 % (705559)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1067295614:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 10.80/2.89 % (705557)Instruction limit reached!
% 10.80/2.89 % (705557)------------------------------
% 10.80/2.89 % (705557)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.80/2.89 % (705557)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.80/2.89 % (705557)CaDiCaL version: 2.1.3
% 10.80/2.89 % (705557)Termination reason: Instruction limit
% 10.80/2.89 % (705557)Termination phase: Saturation
% 10.80/2.89 % (705557)Time elapsed: 0.137 s
% 10.80/2.89 % (705557)Peak memory usage: 89 MB
% 10.80/2.89 % (705557)Instructions burned: 136 (million)
% 10.80/2.89 % (705558)Instruction limit reached!
% 10.80/2.89 % (705558)------------------------------
% 10.80/2.89 % (705558)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.80/2.89 % (705558)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.80/2.89 % (705558)CaDiCaL version: 2.1.3
% 10.80/2.89 % (705558)Termination reason: Instruction limit
% 10.80/2.89 % (705558)Termination phase: Saturation
% 10.80/2.89 % (705558)Time elapsed: 0.169 s
% 10.80/2.89 % (705558)Peak memory usage: 89 MB
% 10.80/2.89 % (705558)Instructions burned: 181 (million)
% 10.80/2.89 % (705559)Instruction limit reached!
% 10.80/2.89 % (705559)------------------------------
% 10.80/2.89 % (705559)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.80/2.89 % (705559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.80/2.89 % (705559)CaDiCaL version: 2.1.3
% 10.80/2.89 % (705559)Termination reason: Instruction limit
% 10.80/2.89 % (705559)Termination phase: Saturation
% 10.80/2.89 % (705559)Time elapsed: 0.249 s
% 10.80/2.89 % (705559)Peak memory usage: 91 MB
% 10.80/2.89 % (705559)Instructions burned: 261 (million)
% 10.80/2.89 % (705569)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3054957425:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 10.80/2.89 % (705568)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=560111456:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2995 on theBenchmark for (2995ds/2051Mi)
% 10.80/2.89 % (705570)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=2504161365:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 10.80/2.89 % (705570)Instruction limit reached!
% 10.80/2.89 % (705570)------------------------------
% 10.80/2.89 % (705570)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.80/2.89 % (705570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.80/2.89 % (705570)CaDiCaL version: 2.1.3
% 10.80/2.89 % (705570)Termination reason: Instruction limit
% 10.80/2.89 % (705570)Termination phase: Saturation
% 10.80/2.89 % (705570)Time elapsed: 0.178 s
% 10.80/2.89 % (705570)Peak memory usage: 88 MB
% 10.80/2.89 % (705570)Instructions burned: 216 (million)
% 10.80/2.89 % (705574)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=2530885204:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2989 on theBenchmark for (2989ds/317Mi)
% 10.80/2.89 % (705554)First to succeed.
% 10.80/2.89 % (705554)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-705548"
% 10.80/2.89 % (705560)Instruction limit reached!
% 10.80/2.89 % (705560)------------------------------
% 10.80/2.89 % (705560)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.80/2.89 % (705560)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.80/2.89 % (705560)CaDiCaL version: 2.1.3
% 10.80/2.89 % (705560)Termination reason: Instruction limit
% 10.80/2.89 % (705560)Termination phase: Saturation
% 10.80/2.89 % (705560)Time elapsed: 1.102 s
% 10.80/2.89 % (705560)Peak memory usage: 101 MB
% 10.80/2.89 % (705560)Instructions burned: 1188 (million)
% 10.80/2.89 % (705554)Refutation found. Thanks to Tanya!
% 10.80/2.89 % SZS status Unsatisfiable for theBenchmark
% 10.80/2.89 % SZS output start Proof for theBenchmark
% See solution above
% 12.32/3.28 % (705554)------------------------------
% 12.32/3.28 % (705554)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.32/3.28 % (705554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.32/3.28 % (705554)CaDiCaL version: 2.1.3
% 12.32/3.28 % (705554)Termination reason: Refutation
% 12.32/3.28 % (705554)Time elapsed: 1.129 s
% 12.32/3.28 % (705554)Peak memory usage: 139 MB
% 12.32/3.28 % (705554)Instructions burned: 1909 (million)
% 12.32/3.28 % (705554)------------------------------
% 12.32/3.28 % (705554)------------------------------
% 12.32/3.28 % (705548)Success in time 1.592 s
% 12.32/3.28 % Vampire exiting
%------------------------------------------------------------------------------