%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL231-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:41 AM UTC 2026
% Result : Unsatisfiable 16.83s 3.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 41
% Syntax : Number of formulae : 221 ( 125 unt; 31 def)
% Number of atoms : 375 ( 166 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 294 ( 140 ~; 134 |; 0 &)
% ( 20 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 21 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 15 con; 0-4 aty)
% Number of variables : 161 ( 0 sgn 161 !; 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,negated_conjecture,
theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
true != theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))),
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(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
inference(definition_unfolding,[],[f17,f11,f11,f11,f11,f11,f11]) ).
fof(f25,definition,
sF0 = not(p),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f26,plain,
not(p) = sF0,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF1 = or(sF0,q),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f28,plain,
or(sF0,q) = 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(sF0,r),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f32,plain,
or(sF0,r) = sF3,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF4 = or(sF2,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f34,plain,
or(sF2,sF3) = sF4,
inference(reorient_equations,[],[f33]) ).
fof(f35,definition,
sF5 = not(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f36,plain,
not(sF4) = sF5,
inference(reorient_equations,[],[f35]) ).
fof(f37,definition,
sF6 = not(q),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f38,plain,
not(q) = sF6,
inference(reorient_equations,[],[f37]) ).
fof(f39,definition,
sF7 = or(sF6,r),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f40,plain,
or(sF6,r) = sF7,
inference(reorient_equations,[],[f39]) ).
fof(f41,definition,
sF8 = or(sF0,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f42,plain,
or(sF0,sF7) = sF8,
inference(reorient_equations,[],[f41]) ).
fof(f43,definition,
sF9 = or(sF5,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f44,plain,
or(sF5,sF8) = sF9,
inference(reorient_equations,[],[f43]) ).
fof(f45,definition,
sF10 = theorem(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f46,plain,
theorem(sF9) = sF10,
inference(reorient_equations,[],[f45]) ).
fof(f47,plain,
true != sF10,
inference(definition_folding,[],[f24,f46,f44,f42,f40,f38,f26,f36,f34,f32,f26,f30,f28,f26]) ).
fof(f49,definition,
( spl11_1
<=> theorem(sF9) = sF10 ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f51,plain,
( theorem(sF9) = sF10
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f52,plain,
spl11_1,
inference(avatar_split_clause,[],[f46,f49]) ).
fof(f56,definition,
( spl11_2
<=> true = sF10 ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f58,plain,
( true != sF10
| spl11_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f59,plain,
~ spl11_2,
inference(avatar_split_clause,[],[f47,f56]) ).
fof(f61,definition,
( spl11_3
<=> not(q) = sF6 ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f63,plain,
( not(q) = sF6
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f64,plain,
spl11_3,
inference(avatar_split_clause,[],[f38,f61]) ).
fof(f75,definition,
( spl11_5
<=> not(sF1) = sF2 ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f77,plain,
( not(sF1) = sF2
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f78,plain,
spl11_5,
inference(avatar_split_clause,[],[f30,f75]) ).
fof(f81,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f82,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f19]) ).
fof(f83,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(f84,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f18]) ).
fof(f86,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(forward_demodulation,[],[f84,f1]) ).
fof(f87,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f83,f1]) ).
fof(f88,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f82,f1]) ).
fof(f89,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f81,f1]) ).
fof(f90,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f23,f89]) ).
fof(f96,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f90,f1]) ).
fof(f97,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,f87]) ).
fof(f103,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f97,f1]) ).
fof(f129,definition,
( spl11_6
<=> not(sF4) = sF5 ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f131,plain,
( not(sF4) = sF5
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f132,plain,
spl11_6,
inference(avatar_split_clause,[],[f36,f129]) ).
fof(f140,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(f141,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f140,f1]) ).
fof(f143,definition,
( spl11_7
<=> or(sF5,sF8) = sF9 ),
introduced(definition,[new_symbols(definition,[spl11_7])],[avatar_definition]) ).
fof(f145,plain,
( or(sF5,sF8) = sF9
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f146,plain,
spl11_7,
inference(avatar_split_clause,[],[f44,f143]) ).
fof(f161,plain,
! [X0] : true = ifeq(true,true,ifeq(theorem(or(X0,X0)),true,theorem(X0),true),true),
inference(superposition,[],[f23,f86]) ).
fof(f170,plain,
! [X0] : true = ifeq(theorem(or(X0,X0)),true,theorem(X0),true),
inference(forward_demodulation,[],[f161,f1]) ).
fof(f173,definition,
( spl11_8
<=> or(sF2,sF3) = sF4 ),
introduced(definition,[new_symbols(definition,[spl11_8])],[avatar_definition]) ).
fof(f175,plain,
( or(sF2,sF3) = sF4
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f176,plain,
spl11_8,
inference(avatar_split_clause,[],[f34,f173]) ).
fof(f195,definition,
( spl11_9
<=> or(sF0,sF7) = sF8 ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
fof(f197,plain,
( or(sF0,sF7) = sF8
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f198,plain,
spl11_9,
inference(avatar_split_clause,[],[f42,f195]) ).
fof(f214,definition,
( spl11_10
<=> or(sF0,q) = sF1 ),
introduced(definition,[new_symbols(definition,[spl11_10])],[avatar_definition]) ).
fof(f216,plain,
( or(sF0,q) = sF1
| ~ spl11_10 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f217,plain,
spl11_10,
inference(avatar_split_clause,[],[f28,f214]) ).
fof(f239,definition,
( spl11_11
<=> or(sF0,r) = sF3 ),
introduced(definition,[new_symbols(definition,[spl11_11])],[avatar_definition]) ).
fof(f241,plain,
( or(sF0,r) = sF3
| ~ spl11_11 ),
inference(avatar_component_clause,[],[f239]) ).
fof(f242,plain,
spl11_11,
inference(avatar_split_clause,[],[f32,f239]) ).
fof(f258,definition,
( spl11_12
<=> or(sF6,r) = sF7 ),
introduced(definition,[new_symbols(definition,[spl11_12])],[avatar_definition]) ).
fof(f260,plain,
( or(sF6,r) = sF7
| ~ spl11_12 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f261,plain,
spl11_12,
inference(avatar_split_clause,[],[f40,f258]) ).
fof(f292,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,f141]) ).
fof(f294,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,[],[f103,f141]) ).
fof(f300,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(not(or(not(X0),X1)),or(X2,X1)))),
inference(forward_demodulation,[],[f294,f1]) ).
fof(f301,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,[],[f292,f1]) ).
fof(f310,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f301,f89]) ).
fof(f312,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f301,f88]) ).
fof(f314,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
inference(superposition,[],[f301,f86]) ).
fof(f318,plain,
( ! [X0] : true = ifeq(theorem(or(not(sF3),X0)),true,theorem(or(not(sF4),or(sF2,X0))),true)
| ~ spl11_8 ),
inference(superposition,[],[f301,f175]) ).
fof(f333,plain,
( ! [X0] : true = ifeq(theorem(or(not(sF3),X0)),true,theorem(or(sF5,or(sF2,X0))),true)
| ~ spl11_6
| ~ spl11_8 ),
inference(forward_demodulation,[],[f318,f131]) ).
fof(f335,plain,
! [X0,X1] : true = theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
inference(forward_demodulation,[],[f314,f1]) ).
fof(f337,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f312,f1]) ).
fof(f339,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f310,f1]) ).
fof(f349,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),true),
inference(superposition,[],[f23,f335]) ).
fof(f357,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),
inference(forward_demodulation,[],[f349,f1]) ).
fof(f372,plain,
( ! [X0] : true = theorem(or(not(or(X0,r)),or(X0,sF7)))
| ~ spl11_12 ),
inference(superposition,[],[f337,f260]) ).
fof(f375,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,f337]) ).
fof(f383,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f375,f1]) ).
fof(f403,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,f339]) ).
fof(f411,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f403,f1]) ).
fof(f433,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,f300]) ).
fof(f442,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,[],[f433,f1]) ).
fof(f501,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(X0),X0)),true),
inference(superposition,[],[f357,f88]) ).
fof(f528,plain,
! [X0] : true = theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f501,f1]) ).
fof(f544,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
inference(superposition,[],[f96,f528]) ).
fof(f550,plain,
! [X0] : true = theorem(or(X0,not(X0))),
inference(forward_demodulation,[],[f544,f1]) ).
fof(f577,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true),
inference(superposition,[],[f411,f88]) ).
fof(f609,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X0,X1))),
inference(forward_demodulation,[],[f577,f1]) ).
fof(f628,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF7)),true,theorem(or(X0,sF8)),true)
| ~ spl11_9 ),
inference(superposition,[],[f383,f197]) ).
fof(f629,plain,
( ! [X0] : true = ifeq(theorem(or(X0,q)),true,theorem(or(X0,sF1)),true)
| ~ spl11_10 ),
inference(superposition,[],[f383,f216]) ).
fof(f632,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF8)),true,theorem(or(X0,sF9)),true)
| ~ spl11_7 ),
inference(superposition,[],[f383,f145]) ).
fof(f701,plain,
( true = theorem(or(q,sF6))
| ~ spl11_3 ),
inference(superposition,[],[f550,f63]) ).
fof(f743,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),true),
inference(superposition,[],[f301,f609]) ).
fof(f769,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),
inference(forward_demodulation,[],[f743,f1]) ).
fof(f804,plain,
( true = ifeq(theorem(or(sF9,sF9)),true,sF10,true)
| ~ spl11_1 ),
inference(superposition,[],[f170,f51]) ).
fof(f868,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,f769]) ).
fof(f892,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X1,X2))),true),
inference(forward_demodulation,[],[f868,f1]) ).
fof(f922,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF6)),true,theorem(or(X0,sF7)),true)
| ~ spl11_12 ),
inference(superposition,[],[f892,f260]) ).
fof(f1563,plain,
( true = theorem(or(not(or(sF0,r)),sF8))
| ~ spl11_9
| ~ spl11_12 ),
inference(superposition,[],[f372,f197]) ).
fof(f1601,plain,
( true = theorem(or(not(sF3),sF8))
| ~ spl11_9
| ~ spl11_11
| ~ spl11_12 ),
inference(forward_demodulation,[],[f1563,f241]) ).
fof(f1604,definition,
( spl11_21
<=> true = theorem(or(not(sF3),sF8)) ),
introduced(definition,[new_symbols(definition,[spl11_21])],[avatar_definition]) ).
fof(f1606,plain,
( true = theorem(or(not(sF3),sF8))
| ~ spl11_21 ),
inference(avatar_component_clause,[],[f1604]) ).
fof(f1607,plain,
( spl11_21
| ~ spl11_9
| ~ spl11_11
| ~ spl11_12 ),
inference(avatar_split_clause,[],[f1601,f258,f239,f195,f1604]) ).
fof(f1608,plain,
( true = ifeq(true,true,theorem(or(sF5,or(sF2,sF8))),true)
| ~ spl11_6
| ~ spl11_8
| ~ spl11_21 ),
inference(superposition,[],[f333,f1606]) ).
fof(f1639,plain,
( true = theorem(or(sF5,or(sF2,sF8)))
| ~ spl11_6
| ~ spl11_8
| ~ spl11_21 ),
inference(forward_demodulation,[],[f1608,f1]) ).
fof(f1824,definition,
( spl11_22
<=> true = theorem(or(q,sF6)) ),
introduced(definition,[new_symbols(definition,[spl11_22])],[avatar_definition]) ).
fof(f1826,plain,
( true = theorem(or(q,sF6))
| ~ spl11_22 ),
inference(avatar_component_clause,[],[f1824]) ).
fof(f1827,plain,
( spl11_22
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f701,f61,f1824]) ).
fof(f1828,plain,
( true = ifeq(true,true,theorem(or(q,sF7)),true)
| ~ spl11_12
| ~ spl11_22 ),
inference(superposition,[],[f922,f1826]) ).
fof(f1851,plain,
( true = theorem(or(q,sF7))
| ~ spl11_12
| ~ spl11_22 ),
inference(forward_demodulation,[],[f1828,f1]) ).
fof(f1853,definition,
( spl11_23
<=> true = theorem(or(q,sF7)) ),
introduced(definition,[new_symbols(definition,[spl11_23])],[avatar_definition]) ).
fof(f1855,plain,
( true = theorem(or(q,sF7))
| ~ spl11_23 ),
inference(avatar_component_clause,[],[f1853]) ).
fof(f1856,plain,
( spl11_23
| ~ spl11_12
| ~ spl11_22 ),
inference(avatar_split_clause,[],[f1851,f1824,f258,f1853]) ).
fof(f1859,plain,
( true = ifeq(true,true,theorem(or(q,sF8)),true)
| ~ spl11_9
| ~ spl11_23 ),
inference(superposition,[],[f628,f1855]) ).
fof(f1882,plain,
( true = theorem(or(q,sF8))
| ~ spl11_9
| ~ spl11_23 ),
inference(forward_demodulation,[],[f1859,f1]) ).
fof(f1884,definition,
( spl11_24
<=> true = theorem(or(q,sF8)) ),
introduced(definition,[new_symbols(definition,[spl11_24])],[avatar_definition]) ).
fof(f1886,plain,
( true = theorem(or(q,sF8))
| ~ spl11_24 ),
inference(avatar_component_clause,[],[f1884]) ).
fof(f1887,plain,
( spl11_24
| ~ spl11_9
| ~ spl11_23 ),
inference(avatar_split_clause,[],[f1882,f1853,f195,f1884]) ).
fof(f1889,plain,
( true = ifeq(true,true,theorem(or(q,sF9)),true)
| ~ spl11_7
| ~ spl11_24 ),
inference(superposition,[],[f632,f1886]) ).
fof(f1914,plain,
( true = theorem(or(q,sF9))
| ~ spl11_7
| ~ spl11_24 ),
inference(forward_demodulation,[],[f1889,f1]) ).
fof(f1916,definition,
( spl11_25
<=> true = theorem(or(q,sF9)) ),
introduced(definition,[new_symbols(definition,[spl11_25])],[avatar_definition]) ).
fof(f1918,plain,
( true = theorem(or(q,sF9))
| ~ spl11_25 ),
inference(avatar_component_clause,[],[f1916]) ).
fof(f1919,plain,
( spl11_25
| ~ spl11_7
| ~ spl11_24 ),
inference(avatar_split_clause,[],[f1914,f1884,f143,f1916]) ).
fof(f1922,plain,
( true = ifeq(true,true,theorem(or(sF9,q)),true)
| ~ spl11_25 ),
inference(superposition,[],[f96,f1918]) ).
fof(f1943,plain,
( true = theorem(or(sF9,q))
| ~ spl11_25 ),
inference(forward_demodulation,[],[f1922,f1]) ).
fof(f1977,definition,
( spl11_27
<=> true = theorem(or(sF9,q)) ),
introduced(definition,[new_symbols(definition,[spl11_27])],[avatar_definition]) ).
fof(f1979,plain,
( true = theorem(or(sF9,q))
| ~ spl11_27 ),
inference(avatar_component_clause,[],[f1977]) ).
fof(f1980,plain,
( spl11_27
| ~ spl11_25 ),
inference(avatar_split_clause,[],[f1943,f1916,f1977]) ).
fof(f1981,plain,
( true = ifeq(true,true,theorem(or(sF9,sF1)),true)
| ~ spl11_10
| ~ spl11_27 ),
inference(superposition,[],[f629,f1979]) ).
fof(f2004,plain,
( true = theorem(or(sF9,sF1))
| ~ spl11_10
| ~ spl11_27 ),
inference(forward_demodulation,[],[f1981,f1]) ).
fof(f2757,definition,
( spl11_33
<=> true = theorem(or(sF9,sF1)) ),
introduced(definition,[new_symbols(definition,[spl11_33])],[avatar_definition]) ).
fof(f2759,plain,
( true = theorem(or(sF9,sF1))
| ~ spl11_33 ),
inference(avatar_component_clause,[],[f2757]) ).
fof(f2760,plain,
( spl11_33
| ~ spl11_10
| ~ spl11_27 ),
inference(avatar_split_clause,[],[f2004,f1977,f214,f2757]) ).
fof(f3161,plain,
( ! [X0] : true = ifeq(true,true,theorem(or(not(or(not(sF1),X0)),or(sF9,X0))),true)
| ~ spl11_33 ),
inference(superposition,[],[f442,f2759]) ).
fof(f3177,plain,
( ! [X0] : true = theorem(or(not(or(not(sF1),X0)),or(sF9,X0)))
| ~ spl11_33 ),
inference(forward_demodulation,[],[f3161,f1]) ).
fof(f3182,plain,
( ! [X0] : true = theorem(or(not(or(sF2,X0)),or(sF9,X0)))
| ~ spl11_5
| ~ spl11_33 ),
inference(forward_demodulation,[],[f3177,f77]) ).
fof(f3185,plain,
( ! [X0] : true = ifeq(true,true,ifeq(theorem(or(sF2,X0)),true,theorem(or(sF9,X0)),true),true)
| ~ spl11_5
| ~ spl11_33 ),
inference(superposition,[],[f23,f3182]) ).
fof(f3222,plain,
( ! [X0] : true = ifeq(theorem(or(sF2,X0)),true,theorem(or(sF9,X0)),true)
| ~ spl11_5
| ~ spl11_33 ),
inference(forward_demodulation,[],[f3185,f1]) ).
fof(f3862,definition,
( spl11_44
<=> true = theorem(or(sF5,or(sF2,sF8))) ),
introduced(definition,[new_symbols(definition,[spl11_44])],[avatar_definition]) ).
fof(f3864,plain,
( true = theorem(or(sF5,or(sF2,sF8)))
| ~ spl11_44 ),
inference(avatar_component_clause,[],[f3862]) ).
fof(f3865,plain,
( spl11_44
| ~ spl11_6
| ~ spl11_8
| ~ spl11_21 ),
inference(avatar_split_clause,[],[f1639,f1604,f173,f129,f3862]) ).
fof(f3869,plain,
( true = ifeq(true,true,theorem(or(sF2,or(sF5,sF8))),true)
| ~ spl11_44 ),
inference(superposition,[],[f103,f3864]) ).
fof(f3902,plain,
( true = theorem(or(sF2,or(sF5,sF8)))
| ~ spl11_44 ),
inference(forward_demodulation,[],[f3869,f1]) ).
fof(f3905,plain,
( true = theorem(or(sF2,sF9))
| ~ spl11_7
| ~ spl11_44 ),
inference(forward_demodulation,[],[f3902,f145]) ).
fof(f3909,definition,
( spl11_45
<=> true = theorem(or(sF2,sF9)) ),
introduced(definition,[new_symbols(definition,[spl11_45])],[avatar_definition]) ).
fof(f3911,plain,
( true = theorem(or(sF2,sF9))
| ~ spl11_45 ),
inference(avatar_component_clause,[],[f3909]) ).
fof(f3912,plain,
( spl11_45
| ~ spl11_7
| ~ spl11_44 ),
inference(avatar_split_clause,[],[f3905,f3862,f143,f3909]) ).
fof(f3913,plain,
( true = ifeq(true,true,theorem(or(sF9,sF9)),true)
| ~ spl11_5
| ~ spl11_33
| ~ spl11_45 ),
inference(superposition,[],[f3222,f3911]) ).
fof(f3948,plain,
( true = theorem(or(sF9,sF9))
| ~ spl11_5
| ~ spl11_33
| ~ spl11_45 ),
inference(forward_demodulation,[],[f3913,f1]) ).
fof(f3951,plain,
( true = ifeq(true,true,sF10,true)
| ~ spl11_1
| ~ spl11_5
| ~ spl11_33
| ~ spl11_45 ),
inference(backward_demodulation,[],[f804,f3948]) ).
fof(f3954,plain,
( true = sF10
| ~ spl11_1
| ~ spl11_5
| ~ spl11_33
| ~ spl11_45 ),
inference(forward_demodulation,[],[f3951,f1]) ).
fof(f3957,plain,
( $false
| ~ spl11_1
| spl11_2
| ~ spl11_5
| ~ spl11_33
| ~ spl11_45 ),
inference(forward_subsumption_resolution,[],[f3954,f58]) ).
fof(f3958,plain,
( ~ spl11_1
| spl11_2
| ~ spl11_5
| ~ spl11_33
| ~ spl11_45 ),
inference(avatar_contradiction_clause,[],[f3957]) ).
cnf(s1,plain,
spl11_1,
inference(sat_conversion,[],[f52]) ).
cnf(s2,plain,
~ spl11_2,
inference(sat_conversion,[],[f59]) ).
cnf(s3,plain,
spl11_3,
inference(sat_conversion,[],[f64]) ).
cnf(s5,plain,
spl11_5,
inference(sat_conversion,[],[f78]) ).
cnf(s6,plain,
spl11_6,
inference(sat_conversion,[],[f132]) ).
cnf(s7,plain,
spl11_7,
inference(sat_conversion,[],[f146]) ).
cnf(s8,plain,
spl11_8,
inference(sat_conversion,[],[f176]) ).
cnf(s9,plain,
spl11_9,
inference(sat_conversion,[],[f198]) ).
cnf(s10,plain,
spl11_10,
inference(sat_conversion,[],[f217]) ).
cnf(s11,plain,
spl11_11,
inference(sat_conversion,[],[f242]) ).
cnf(s12,plain,
spl11_12,
inference(sat_conversion,[],[f261]) ).
cnf(s21,plain,
( ~ spl11_9
| ~ spl11_11
| ~ spl11_12
| spl11_21 ),
inference(sat_conversion,[],[f1607]) ).
cnf(s22,plain,
( ~ spl11_3
| spl11_22 ),
inference(sat_conversion,[],[f1827]) ).
cnf(s23,plain,
( ~ spl11_12
| ~ spl11_22
| spl11_23 ),
inference(sat_conversion,[],[f1856]) ).
cnf(s24,plain,
( ~ spl11_9
| ~ spl11_23
| spl11_24 ),
inference(sat_conversion,[],[f1887]) ).
cnf(s25,plain,
( ~ spl11_7
| ~ spl11_24
| spl11_25 ),
inference(sat_conversion,[],[f1919]) ).
cnf(s27,plain,
( ~ spl11_25
| spl11_27 ),
inference(sat_conversion,[],[f1980]) ).
cnf(s33,plain,
( ~ spl11_10
| ~ spl11_27
| spl11_33 ),
inference(sat_conversion,[],[f2760]) ).
cnf(s44,plain,
( ~ spl11_6
| ~ spl11_8
| ~ spl11_21
| spl11_44 ),
inference(sat_conversion,[],[f3865]) ).
cnf(s45,plain,
( ~ spl11_7
| ~ spl11_44
| spl11_45 ),
inference(sat_conversion,[],[f3912]) ).
cnf(s47,plain,
( ~ spl11_1
| spl11_2
| ~ spl11_5
| ~ spl11_33
| ~ spl11_45 ),
inference(sat_conversion,[],[f3958]) ).
cnf(s51,plain,
spl11_21,
inference(rat,[],[s21,s11,s12,s9]) ).
cnf(s53,plain,
spl11_44,
inference(rat,[],[s44,s8,s51,s6]) ).
cnf(s54,plain,
spl11_45,
inference(rat,[],[s45,s7,s53]) ).
cnf(s65,plain,
spl11_22,
inference(rat,[],[s22,s3]) ).
cnf(s67,plain,
spl11_23,
inference(rat,[],[s23,s12,s65]) ).
cnf(s70,plain,
spl11_24,
inference(rat,[],[s24,s9,s67]) ).
cnf(s74,plain,
spl11_25,
inference(rat,[],[s25,s7,s70]) ).
cnf(s78,plain,
spl11_27,
inference(rat,[],[s27,s74]) ).
cnf(s80,plain,
spl11_33,
inference(rat,[],[s33,s10,s78]) ).
cnf(s81,plain,
~ spl11_1,
inference(rat,[],[s47,s54,s80,s5,s2]) ).
cnf(s82,plain,
$false,
inference(rat,[],[s1,s81]) ).
fof(f3959,plain,
$false,
inference(avatar_sat_refutation,[],[s82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL231-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 % Computer : n011.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 15:28:45 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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
% 16.83/3.29 % (2558626)Detected a unit-equality problem, will run specialized UEQ schedule.
% 16.83/3.29 % (2558737)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1427595892:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 16.83/3.29 % (2558735)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3994862900:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 16.83/3.29 % (2558736)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2394849669:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 16.83/3.29 % (2558733)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=3818443665:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 16.83/3.29 % (2558732)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=402241495:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 16.83/3.29 % (2558734)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=152359693:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 16.83/3.29 % (2558738)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3263688168:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 16.83/3.29 % (2558737)Instruction limit reached!
% 16.83/3.29 % (2558737)------------------------------
% 16.83/3.29 % (2558737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.83/3.29 % (2558737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/3.29 % (2558737)CaDiCaL version: 2.1.3
% 16.83/3.29 % (2558737)Termination reason: Instruction limit
% 16.83/3.29 % (2558737)Termination phase: Saturation
% 16.83/3.29 % (2558737)Time elapsed: 0.082 s
% 16.83/3.29 % (2558737)Peak memory usage: 90 MB
% 16.83/3.29 % (2558737)Instructions burned: 261 (million)
% 16.83/3.29 % (2558735)Instruction limit reached!
% 16.83/3.29 % (2558735)------------------------------
% 16.83/3.29 % (2558735)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.83/3.29 % (2558735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/3.29 % (2558735)CaDiCaL version: 2.1.3
% 16.83/3.29 % (2558735)Termination reason: Instruction limit
% 16.83/3.29 % (2558735)Termination phase: Saturation
% 16.83/3.29 % (2558735)Time elapsed: 0.086 s
% 16.83/3.29 % (2558735)Peak memory usage: 89 MB
% 16.83/3.29 % (2558735)Instructions burned: 137 (million)
% 16.83/3.29 % (2558736)Instruction limit reached!
% 16.83/3.29 % (2558736)------------------------------
% 16.83/3.29 % (2558736)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.83/3.29 % (2558736)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/3.29 % (2558736)CaDiCaL version: 2.1.3
% 16.83/3.29 % (2558736)Termination reason: Instruction limit
% 16.83/3.29 % (2558736)Termination phase: Saturation
% 16.83/3.29 % (2558736)Time elapsed: 0.104 s
% 16.83/3.29 % (2558736)Peak memory usage: 89 MB
% 16.83/3.29 % (2558736)Instructions burned: 181 (million)
% 16.83/3.29 % (2558747)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3766286547:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 16.83/3.29 % (2558756)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1997318583:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 16.83/3.29 % (2558758)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=758669180:i=215:ep=RSTC_2997 on theBenchmark for (2997ds/215Mi)
% 16.83/3.29 % (2558758)Instruction limit reached!
% 16.83/3.29 % (2558758)------------------------------
% 16.83/3.29 % (2558758)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.83/3.29 % (2558758)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/3.29 % (2558758)CaDiCaL version: 2.1.3
% 16.83/3.29 % (2558758)Termination reason: Instruction limit
% 16.83/3.29 % (2558758)Termination phase: Saturation
% 16.83/3.29 % (2558758)Time elapsed: 0.177 s
% 16.83/3.29 % (2558758)Peak memory usage: 88 MB
% 16.83/3.29 % (2558758)Instructions burned: 215 (million)
% 16.83/3.29 % (2558863)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=1975763647:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2992 on theBenchmark for (2992ds/317Mi)
% 16.83/3.29 % (2558738)Instruction limit reached!
% 16.83/3.29 % (2558738)------------------------------
% 16.83/3.29 % (2558738)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.83/3.29 % (2558738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/3.29 % (2558738)CaDiCaL version: 2.1.3
% 16.83/3.29 % (2558738)Termination reason: Instruction limit
% 16.83/3.29 % (2558738)Termination phase: Saturation
% 16.83/3.29 % (2558738)Time elapsed: 1.010 s
% 16.83/3.29 % (2558738)Peak memory usage: 101 MB
% 16.83/3.29 % (2558738)Instructions burned: 1188 (million)
% 16.83/3.29 % (2558863)Instruction limit reached!
% 16.83/3.29 % (2558863)------------------------------
% 16.83/3.29 % (2558863)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.83/3.29 % (2558863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/3.29 % (2558863)CaDiCaL version: 2.1.3
% 16.83/3.29 % (2558863)Termination reason: Instruction limit
% 16.83/3.29 % (2558863)Termination phase: Saturation
% 16.83/3.29 % (2558863)Time elapsed: 0.310 s
% 16.83/3.29 % (2558863)Peak memory usage: 94 MB
% 16.83/3.29 % (2558863)Instructions burned: 317 (million)
% 16.83/3.29 % (2558747)Instruction limit reached!
% 16.83/3.29 % (2558747)------------------------------
% 16.83/3.29 % (2558747)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.83/3.29 % (2558747)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/3.29 % (2558747)CaDiCaL version: 2.1.3
% 16.83/3.29 % (2558747)Termination reason: Instruction limit
% 16.83/3.29 % (2558747)Termination phase: Saturation
% 16.83/3.29 % (2558747)Time elapsed: 1.089 s
% 16.83/3.29 % (2558747)Peak memory usage: 142 MB
% 16.83/3.29 % (2558747)Instructions burned: 2051 (million)
% 16.83/3.29 % (2558905)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=1739072253:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2988 on theBenchmark for (2988ds/12125Mi)
% 16.83/3.29 % (2558908)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1652737863:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2987 on theBenchmark for (2987ds/2836Mi)
% 16.83/3.29 % (2558926)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=4113230867:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2985 on theBenchmark for (2985ds/14534Mi)
% 16.83/3.29 % (2558732)First to succeed.
% 16.83/3.29 % (2558732)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2558626"
% 16.83/3.29 % (2558926)Also succeeded, but the first one will report.
% 16.83/3.29 % (2558732)Refutation found. Thanks to Tanya!
% 16.83/3.29 % SZS status Unsatisfiable for theBenchmark
% 16.83/3.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/3.61 % (2558732)------------------------------
% 0.19/3.61 % (2558732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/3.61 % (2558732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/3.61 % (2558732)CaDiCaL version: 2.1.3
% 0.19/3.61 % (2558732)Termination reason: Refutation
% 0.19/3.61 % (2558732)Time elapsed: 1.897 s
% 0.19/3.61 % (2558732)Peak memory usage: 139 MB
% 0.19/3.61 % (2558732)Instructions burned: 1951 (million)
% 0.19/3.61 % (2558732)------------------------------
% 0.19/3.61 % (2558732)------------------------------
% 0.19/3.61 % (2558626)Success in time 2.409 s
% 0.19/3.61 % Vampire exiting
%------------------------------------------------------------------------------