%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL265-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:51:49 AM UTC 2026
% Result : Unsatisfiable 15.19s 3.39s
% Output : Refutation 16.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 35
% Syntax : Number of formulae : 175 ( 109 unt; 23 def)
% Number of atoms : 337 ( 141 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 317 ( 155 ~; 149 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 14 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-4 aty)
% Number of variables : 141 ( 0 sgn 141 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f12,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f17,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f18,negated_conjecture,
theorem(equivalent(p,not(not(p)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f19,plain,
true != theorem(equivalent(p,not(not(p)))),
inference(reorient_equations,[],[f18]) ).
fof(f20,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f17,f16,f11,f11]) ).
fof(f21,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f22,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f23,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f24,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f25,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(f26,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(f27,plain,
true != theorem(not(or(not(or(not(p),not(not(p)))),not(or(not(not(not(p))),p))))),
inference(definition_unfolding,[],[f19,f20]) ).
fof(f28,definition,
sF0 = not(p),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f29,plain,
not(p) = sF0,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF1 = not(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f31,plain,
not(sF0) = sF1,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF2 = or(sF0,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f33,plain,
or(sF0,sF1) = sF2,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF3 = not(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f35,plain,
not(sF2) = sF3,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF4 = not(sF1),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f37,plain,
not(sF1) = sF4,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF5 = or(sF4,p),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f39,plain,
or(sF4,p) = sF5,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f41,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF7 = or(sF3,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f43,plain,
or(sF3,sF6) = sF7,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF8 = not(sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f45,plain,
not(sF7) = sF8,
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
sF9 = theorem(sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f47,plain,
theorem(sF8) = sF9,
inference(reorient_equations,[],[f46]) ).
fof(f48,plain,
true != sF9,
inference(definition_folding,[],[f27,f47,f45,f43,f41,f39,f37,f31,f29,f35,f33,f31,f29,f29]) ).
fof(f50,definition,
( spl10_1
<=> theorem(sF8) = sF9 ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f52,plain,
( theorem(sF8) = sF9
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f53,plain,
spl10_1,
inference(avatar_split_clause,[],[f47,f50]) ).
fof(f57,definition,
( spl10_2
<=> true = sF9 ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f59,plain,
( true != sF9
| spl10_2 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f60,plain,
~ spl10_2,
inference(avatar_split_clause,[],[f48,f57]) ).
fof(f62,definition,
( spl10_3
<=> not(p) = sF0 ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
fof(f64,plain,
( not(p) = sF0
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f65,plain,
spl10_3,
inference(avatar_split_clause,[],[f29,f62]) ).
fof(f69,definition,
( spl10_4
<=> not(sF0) = sF1 ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
fof(f71,plain,
( not(sF0) = sF1
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f72,plain,
spl10_4,
inference(avatar_split_clause,[],[f31,f69]) ).
fof(f76,definition,
( spl10_5
<=> not(sF1) = sF4 ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f78,plain,
( not(sF1) = sF4
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f79,plain,
spl10_5,
inference(avatar_split_clause,[],[f37,f76]) ).
fof(f83,definition,
( spl10_6
<=> not(sF2) = sF3 ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
fof(f85,plain,
( not(sF2) = sF3
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f86,plain,
spl10_6,
inference(avatar_split_clause,[],[f35,f83]) ).
fof(f87,plain,
( ! [X0] : true = ifeq(theorem(or(sF3,X0)),true,ifeq(theorem(sF2),true,theorem(X0),true),true)
| ~ spl10_6 ),
inference(superposition,[],[f26,f85]) ).
fof(f90,definition,
( spl10_7
<=> not(sF7) = sF8 ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
fof(f92,plain,
( not(sF7) = sF8
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f93,plain,
spl10_7,
inference(avatar_split_clause,[],[f45,f90]) ).
fof(f96,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f23]) ).
fof(f97,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,f24]) ).
fof(f98,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f22]) ).
fof(f99,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f21]) ).
fof(f101,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(forward_demodulation,[],[f99,f1]) ).
fof(f102,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f98,f1]) ).
fof(f103,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f97,f1]) ).
fof(f104,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f96,f1]) ).
fof(f118,definition,
( spl10_8
<=> not(sF5) = sF6 ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
fof(f120,plain,
( not(sF5) = sF6
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f121,plain,
spl10_8,
inference(avatar_split_clause,[],[f41,f118]) ).
fof(f123,plain,
( ! [X0] : true = ifeq(theorem(or(sF6,X0)),true,ifeq(theorem(sF5),true,theorem(X0),true),true)
| ~ spl10_8 ),
inference(superposition,[],[f26,f120]) ).
fof(f126,definition,
( spl10_9
<=> or(sF0,sF1) = sF2 ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
fof(f128,plain,
( or(sF0,sF1) = sF2
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f129,plain,
spl10_9,
inference(avatar_split_clause,[],[f33,f126]) ).
fof(f141,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,[],[f26,f103]) ).
fof(f147,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f141,f1]) ).
fof(f162,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f26,f104]) ).
fof(f171,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f162,f1]) ).
fof(f175,definition,
( spl10_10
<=> or(sF3,sF6) = sF7 ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
fof(f177,plain,
( or(sF3,sF6) = sF7
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f175]) ).
fof(f178,plain,
spl10_10,
inference(avatar_split_clause,[],[f43,f175]) ).
fof(f205,definition,
( spl10_11
<=> or(sF4,p) = sF5 ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
fof(f207,plain,
( or(sF4,p) = sF5
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f205]) ).
fof(f208,plain,
spl10_11,
inference(avatar_split_clause,[],[f39,f205]) ).
fof(f237,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,f25]) ).
fof(f238,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f237,f1]) ).
fof(f251,plain,
( true = ifeq(theorem(or(sF1,sF0)),true,theorem(sF2),true)
| ~ spl10_9 ),
inference(superposition,[],[f171,f128]) ).
fof(f253,plain,
( true = ifeq(theorem(or(p,sF4)),true,theorem(sF5),true)
| ~ spl10_11 ),
inference(superposition,[],[f171,f207]) ).
fof(f280,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,[],[f26,f238]) ).
fof(f292,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,[],[f280,f1]) ).
fof(f308,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f292,f104]) ).
fof(f310,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
inference(superposition,[],[f292,f101]) ).
fof(f312,plain,
( ! [X0] : true = ifeq(theorem(or(not(sF6),X0)),true,theorem(or(not(sF7),or(sF3,X0))),true)
| ~ spl10_10 ),
inference(superposition,[],[f292,f177]) ).
fof(f324,plain,
( ! [X0] : true = ifeq(theorem(or(not(sF6),X0)),true,theorem(or(sF8,or(sF3,X0))),true)
| ~ spl10_7
| ~ spl10_10 ),
inference(forward_demodulation,[],[f312,f92]) ).
fof(f326,plain,
! [X0,X1] : true = theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
inference(forward_demodulation,[],[f310,f1]) ).
fof(f328,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f308,f1]) ).
fof(f365,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),true),
inference(superposition,[],[f26,f326]) ).
fof(f376,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),
inference(forward_demodulation,[],[f365,f1]) ).
fof(f381,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(X0),X0)),true),
inference(superposition,[],[f376,f102]) ).
fof(f404,plain,
! [X0] : true = theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f381,f1]) ).
fof(f414,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,[],[f26,f328]) ).
fof(f428,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f414,f1]) ).
fof(f436,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true),
inference(superposition,[],[f428,f102]) ).
fof(f465,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X0,X1))),
inference(forward_demodulation,[],[f436,f1]) ).
fof(f474,plain,
( true = theorem(or(sF1,sF0))
| ~ spl10_4 ),
inference(superposition,[],[f404,f71]) ).
fof(f489,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
inference(superposition,[],[f171,f404]) ).
fof(f495,plain,
! [X0] : true = theorem(or(X0,not(X0))),
inference(forward_demodulation,[],[f489,f1]) ).
fof(f505,plain,
( true = ifeq(true,true,theorem(sF2),true)
| ~ spl10_4
| ~ spl10_9 ),
inference(backward_demodulation,[],[f251,f474]) ).
fof(f509,plain,
( true = theorem(sF2)
| ~ spl10_4
| ~ spl10_9 ),
inference(forward_demodulation,[],[f505,f1]) ).
fof(f519,plain,
( ! [X0] : true = ifeq(theorem(or(sF3,X0)),true,ifeq(true,true,theorem(X0),true),true)
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9 ),
inference(backward_demodulation,[],[f87,f509]) ).
fof(f520,plain,
( ! [X0] : true = ifeq(theorem(or(sF3,X0)),true,theorem(X0),true)
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9 ),
inference(forward_demodulation,[],[f519,f1]) ).
fof(f521,plain,
( true = theorem(or(p,sF0))
| ~ spl10_3 ),
inference(superposition,[],[f495,f64]) ).
fof(f527,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),true),
inference(superposition,[],[f292,f495]) ).
fof(f539,plain,
! [X0,X1] : true = theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),
inference(forward_demodulation,[],[f527,f1]) ).
fof(f739,plain,
( ! [X0] : true = theorem(or(not(or(X0,sF0)),or(X0,not(sF1))))
| ~ spl10_4 ),
inference(superposition,[],[f539,f71]) ).
fof(f771,plain,
( ! [X0] : true = theorem(or(not(or(X0,sF0)),or(X0,sF4)))
| ~ spl10_4
| ~ spl10_5 ),
inference(forward_demodulation,[],[f739,f78]) ).
fof(f873,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(X0,or(not(X0),X1))),true),
inference(superposition,[],[f147,f465]) ).
fof(f889,plain,
! [X0,X1] : true = theorem(or(X0,or(not(X0),X1))),
inference(forward_demodulation,[],[f873,f1]) ).
fof(f998,plain,
( true = ifeq(theorem(or(sF3,sF8)),true,sF9,true)
| ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9 ),
inference(superposition,[],[f520,f52]) ).
fof(f1160,plain,
( ! [X0] : true = ifeq(true,true,ifeq(theorem(or(X0,sF0)),true,theorem(or(X0,sF4)),true),true)
| ~ spl10_4
| ~ spl10_5 ),
inference(superposition,[],[f26,f771]) ).
fof(f1188,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF0)),true,theorem(or(X0,sF4)),true)
| ~ spl10_4
| ~ spl10_5 ),
inference(forward_demodulation,[],[f1160,f1]) ).
fof(f1312,definition,
( spl10_14
<=> true = theorem(or(p,sF0)) ),
introduced(definition,[new_symbols(definition,[spl10_14])],[avatar_definition]) ).
fof(f1314,plain,
( true = theorem(or(p,sF0))
| ~ spl10_14 ),
inference(avatar_component_clause,[],[f1312]) ).
fof(f1315,plain,
( spl10_14
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f521,f62,f1312]) ).
fof(f1316,plain,
( true = ifeq(true,true,theorem(or(p,sF4)),true)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_14 ),
inference(superposition,[],[f1188,f1314]) ).
fof(f1335,plain,
( true = theorem(or(p,sF4))
| ~ spl10_4
| ~ spl10_5
| ~ spl10_14 ),
inference(forward_demodulation,[],[f1316,f1]) ).
fof(f1338,plain,
( true = ifeq(true,true,theorem(sF5),true)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_11
| ~ spl10_14 ),
inference(backward_demodulation,[],[f253,f1335]) ).
fof(f1339,plain,
( true = theorem(sF5)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_demodulation,[],[f1338,f1]) ).
fof(f1340,plain,
( ! [X0] : true = ifeq(theorem(or(sF6,X0)),true,ifeq(true,true,theorem(X0),true),true)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_8
| ~ spl10_11
| ~ spl10_14 ),
inference(backward_demodulation,[],[f123,f1339]) ).
fof(f1349,plain,
( ! [X0] : true = ifeq(theorem(or(sF6,X0)),true,theorem(X0),true)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_8
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_demodulation,[],[f1340,f1]) ).
fof(f1492,plain,
( ! [X0] : true = ifeq(true,true,theorem(or(not(sF6),X0)),true)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_8
| ~ spl10_11
| ~ spl10_14 ),
inference(superposition,[],[f1349,f889]) ).
fof(f1525,plain,
( ! [X0] : true = theorem(or(not(sF6),X0))
| ~ spl10_4
| ~ spl10_5
| ~ spl10_8
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_demodulation,[],[f1492,f1]) ).
fof(f1528,plain,
( ! [X0] : true = ifeq(true,true,theorem(or(sF8,or(sF3,X0))),true)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14 ),
inference(backward_demodulation,[],[f324,f1525]) ).
fof(f1529,plain,
( ! [X0] : true = theorem(or(sF8,or(sF3,X0)))
| ~ spl10_4
| ~ spl10_5
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_demodulation,[],[f1528,f1]) ).
fof(f1537,plain,
( true = ifeq(true,true,theorem(or(sF8,sF3)),true)
| ~ spl10_4
| ~ spl10_5
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14 ),
inference(superposition,[],[f376,f1529]) ).
fof(f1557,plain,
( true = theorem(or(sF8,sF3))
| ~ spl10_4
| ~ spl10_5
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_demodulation,[],[f1537,f1]) ).
fof(f1717,definition,
( spl10_17
<=> true = theorem(or(sF8,sF3)) ),
introduced(definition,[new_symbols(definition,[spl10_17])],[avatar_definition]) ).
fof(f1719,plain,
( true = theorem(or(sF8,sF3))
| ~ spl10_17 ),
inference(avatar_component_clause,[],[f1717]) ).
fof(f1720,plain,
( spl10_17
| ~ spl10_4
| ~ spl10_5
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14 ),
inference(avatar_split_clause,[],[f1557,f1312,f205,f175,f118,f90,f76,f69,f1717]) ).
fof(f1722,plain,
( true = ifeq(true,true,theorem(or(sF3,sF8)),true)
| ~ spl10_17 ),
inference(superposition,[],[f171,f1719]) ).
fof(f1740,plain,
( true = theorem(or(sF3,sF8))
| ~ spl10_17 ),
inference(forward_demodulation,[],[f1722,f1]) ).
fof(f1741,plain,
( true = ifeq(true,true,sF9,true)
| ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9
| ~ spl10_17 ),
inference(backward_demodulation,[],[f998,f1740]) ).
fof(f1742,plain,
( true = sF9
| ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9
| ~ spl10_17 ),
inference(forward_demodulation,[],[f1741,f1]) ).
fof(f1743,plain,
( $false
| ~ spl10_1
| spl10_2
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9
| ~ spl10_17 ),
inference(forward_subsumption_resolution,[],[f1742,f59]) ).
fof(f1744,plain,
( ~ spl10_1
| spl10_2
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9
| ~ spl10_17 ),
inference(avatar_contradiction_clause,[],[f1743]) ).
cnf(s1,plain,
spl10_1,
inference(sat_conversion,[],[f53]) ).
cnf(s2,plain,
~ spl10_2,
inference(sat_conversion,[],[f60]) ).
cnf(s3,plain,
spl10_3,
inference(sat_conversion,[],[f65]) ).
cnf(s4,plain,
spl10_4,
inference(sat_conversion,[],[f72]) ).
cnf(s5,plain,
spl10_5,
inference(sat_conversion,[],[f79]) ).
cnf(s6,plain,
spl10_6,
inference(sat_conversion,[],[f86]) ).
cnf(s7,plain,
spl10_7,
inference(sat_conversion,[],[f93]) ).
cnf(s8,plain,
spl10_8,
inference(sat_conversion,[],[f121]) ).
cnf(s9,plain,
spl10_9,
inference(sat_conversion,[],[f129]) ).
cnf(s10,plain,
spl10_10,
inference(sat_conversion,[],[f178]) ).
cnf(s11,plain,
spl10_11,
inference(sat_conversion,[],[f208]) ).
cnf(s14,plain,
( ~ spl10_3
| spl10_14 ),
inference(sat_conversion,[],[f1315]) ).
cnf(s17,plain,
( ~ spl10_4
| ~ spl10_5
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14
| spl10_17 ),
inference(sat_conversion,[],[f1720]) ).
cnf(s18,plain,
( ~ spl10_1
| spl10_2
| ~ spl10_4
| ~ spl10_6
| ~ spl10_9
| ~ spl10_17 ),
inference(sat_conversion,[],[f1744]) ).
cnf(s20,plain,
spl10_14,
inference(rat,[],[s14,s3]) ).
cnf(s22,plain,
spl10_17,
inference(rat,[],[s17,s4,s5,s11,s10,s8,s7,s20]) ).
cnf(s25,plain,
~ spl10_1,
inference(rat,[],[s18,s22,s9,s6,s4,s2]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s1,s25]) ).
fof(f1745,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL265-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n026.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Sun Sep 27 15:34:41 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.19/3.39 % (3007857)Detected a unit-equality problem, will run specialized UEQ schedule.
% 15.19/3.39 % (3007873)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=857153365:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 15.19/3.39 % (3007871)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=2497296874:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 15.19/3.39 % (3007870)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=3951465906:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 15.19/3.39 % (3007872)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=279090025:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 15.19/3.39 % (3007874)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2587099992:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 15.19/3.39 % (3007873)Instruction limit reached!
% 15.19/3.39 % (3007873)------------------------------
% 15.19/3.39 % (3007873)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.19/3.39 % (3007873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/3.39 % (3007873)CaDiCaL version: 2.1.3
% 15.19/3.39 % (3007873)Termination reason: Instruction limit
% 15.19/3.39 % (3007873)Termination phase: Saturation
% 15.19/3.39 % (3007873)Time elapsed: 0.073 s
% 15.19/3.39 % (3007873)Peak memory usage: 89 MB
% 15.19/3.39 % (3007873)Instructions burned: 138 (million)
% 15.19/3.39 % (3007876)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1173754286:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 15.19/3.39 % (3007875)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3603485251:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 15.19/3.39 % (3007874)Instruction limit reached!
% 15.19/3.39 % (3007874)------------------------------
% 15.19/3.39 % (3007874)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.19/3.39 % (3007874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/3.39 % (3007874)CaDiCaL version: 2.1.3
% 15.19/3.39 % (3007874)Termination reason: Instruction limit
% 15.19/3.39 % (3007874)Termination phase: Saturation
% 15.19/3.39 % (3007874)Time elapsed: 0.200 s
% 15.19/3.39 % (3007874)Peak memory usage: 89 MB
% 15.19/3.39 % (3007874)Instructions burned: 182 (million)
% 15.19/3.39 % (3007882)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=2375551343:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 15.19/3.39 % (3007875)Instruction limit reached!
% 15.19/3.39 % (3007875)------------------------------
% 15.19/3.39 % (3007875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.19/3.39 % (3007875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/3.39 % (3007875)CaDiCaL version: 2.1.3
% 15.19/3.39 % (3007875)Termination reason: Instruction limit
% 15.19/3.39 % (3007875)Termination phase: Saturation
% 15.19/3.39 % (3007875)Time elapsed: 0.256 s
% 15.19/3.39 % (3007875)Peak memory usage: 91 MB
% 15.19/3.39 % (3007875)Instructions burned: 257 (million)
% 15.19/3.39 % (3007885)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=540465242:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 15.19/3.39 % (3007887)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=2454878067:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 15.19/3.39 % (3007887)Instruction limit reached!
% 15.19/3.39 % (3007887)------------------------------
% 15.19/3.39 % (3007887)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.19/3.39 % (3007887)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/3.39 % (3007887)CaDiCaL version: 2.1.3
% 15.19/3.39 % (3007887)Termination reason: Instruction limit
% 15.19/3.39 % (3007887)Termination phase: Saturation
% 15.19/3.39 % (3007887)Time elapsed: 0.184 s
% 15.19/3.39 % (3007887)Peak memory usage: 88 MB
% 15.19/3.39 % (3007887)Instructions burned: 216 (million)
% 15.19/3.39 % (3007890)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=905792138:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2990 on theBenchmark for (2990ds/317Mi)
% 15.19/3.39 % (3007876)Instruction limit reached!
% 15.19/3.39 % (3007876)------------------------------
% 15.19/3.39 % (3007876)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.19/3.39 % (3007876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/3.39 % (3007876)CaDiCaL version: 2.1.3
% 15.19/3.39 % (3007876)Termination reason: Instruction limit
% 15.19/3.39 % (3007876)Termination phase: Saturation
% 15.19/3.39 % (3007876)Time elapsed: 1.090 s
% 15.19/3.39 % (3007876)Peak memory usage: 101 MB
% 15.19/3.39 % (3007876)Instructions burned: 1187 (million)
% 15.19/3.39 % (3007890)Instruction limit reached!
% 15.19/3.39 % (3007890)------------------------------
% 15.19/3.39 % (3007890)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.19/3.39 % (3007890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/3.39 % (3007890)CaDiCaL version: 2.1.3
% 15.19/3.39 % (3007890)Termination reason: Instruction limit
% 15.19/3.39 % (3007890)Termination phase: Saturation
% 15.19/3.39 % (3007890)Time elapsed: 0.321 s
% 15.19/3.39 % (3007890)Peak memory usage: 93 MB
% 15.19/3.39 % (3007890)Instructions burned: 318 (million)
% 15.19/3.39 % (3007892)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=4132948840:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2986 on theBenchmark for (2986ds/12125Mi)
% 15.19/3.39 % (3007870)First to succeed.
% 15.19/3.39 % (3007870)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3007857"
% 15.19/3.39 % (3007893)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=3608202042:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2984 on theBenchmark for (2984ds/2836Mi)
% 15.19/3.39 % (3007872)Also succeeded, but the first one will report.
% 15.19/3.39 % (3007870)Refutation found. Thanks to Tanya!
% 15.19/3.39 % SZS status Unsatisfiable for theBenchmark
% 15.19/3.39 % SZS output start Proof for theBenchmark
% See solution above
% 16.12/3.73 % (3007870)------------------------------
% 16.12/3.73 % (3007870)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.12/3.73 % (3007870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.12/3.73 % (3007870)CaDiCaL version: 2.1.3
% 16.12/3.73 % (3007870)Termination reason: Refutation
% 16.12/3.73 % (3007870)Time elapsed: 1.472 s
% 16.12/3.73 % (3007870)Peak memory usage: 133 MB
% 16.12/3.73 % (3007870)Instructions burned: 1343 (million)
% 16.12/3.73 % (3007870)------------------------------
% 16.12/3.73 % (3007870)------------------------------
% 16.12/3.73 % (3007857)Success in time 2.145 s
% 16.12/3.73 % Vampire exiting
%------------------------------------------------------------------------------