%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL220-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 : n001.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:37 AM UTC 2026
% Result : Unsatisfiable 21.30s 4.00s
% Output : Refutation 22.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 42
% Syntax : Number of formulae : 229 ( 125 unt; 32 def)
% Number of atoms : 403 ( 172 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 333 ( 159 ~; 153 |; 0 &)
% ( 21 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 23 ( 21 usr; 22 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 14 con; 0-4 aty)
% Number of variables : 162 ( 0 sgn 162 !; 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(implies(p,q),q),implies(implies(q,p),p))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
true != theorem(implies(implies(implies(p,q),q),implies(implies(q,p),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(or(not(p),q)),q)),or(not(or(not(q),p)),p))),
inference(definition_unfolding,[],[f17,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(sF2,q),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f32,plain,
or(sF2,q) = 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 = not(q),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f36,plain,
not(q) = sF5,
inference(reorient_equations,[],[f35]) ).
fof(f37,definition,
sF6 = or(sF5,p),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f38,plain,
or(sF5,p) = sF6,
inference(reorient_equations,[],[f37]) ).
fof(f39,definition,
sF7 = not(sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f40,plain,
not(sF6) = sF7,
inference(reorient_equations,[],[f39]) ).
fof(f41,definition,
sF8 = or(sF7,p),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f42,plain,
or(sF7,p) = sF8,
inference(reorient_equations,[],[f41]) ).
fof(f43,definition,
sF9 = or(sF4,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f44,plain,
or(sF4,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,f36,f34,f32,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(f53,plain,
( ! [X0] : true = ifeq(theorem(or(not(X0),sF9)),true,ifeq(theorem(X0),true,sF10,true),true)
| ~ spl11_1 ),
inference(superposition,[],[f23,f51]) ).
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(p) = sF0 ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f63,plain,
( not(p) = sF0
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f64,plain,
spl11_3,
inference(avatar_split_clause,[],[f26,f61]) ).
fof(f68,definition,
( spl11_4
<=> not(q) = sF5 ),
introduced(definition,[new_symbols(definition,[spl11_4])],[avatar_definition]) ).
fof(f70,plain,
( not(q) = sF5
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f71,plain,
spl11_4,
inference(avatar_split_clause,[],[f36,f68]) ).
fof(f74,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f75,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f19]) ).
fof(f76,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(f77,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f18]) ).
fof(f79,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(forward_demodulation,[],[f77,f1]) ).
fof(f80,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f76,f1]) ).
fof(f81,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f75,f1]) ).
fof(f82,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f74,f1]) ).
fof(f92,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f23,f82]) ).
fof(f98,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f92,f1]) ).
fof(f100,definition,
( spl11_5
<=> not(sF1) = sF2 ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f102,plain,
( not(sF1) = sF2
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f100]) ).
fof(f103,plain,
spl11_5,
inference(avatar_split_clause,[],[f30,f100]) ).
fof(f108,definition,
( spl11_6
<=> not(sF6) = sF7 ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f110,plain,
( not(sF6) = sF7
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f108]) ).
fof(f111,plain,
spl11_6,
inference(avatar_split_clause,[],[f40,f108]) ).
fof(f116,definition,
( spl11_7
<=> not(sF3) = sF4 ),
introduced(definition,[new_symbols(definition,[spl11_7])],[avatar_definition]) ).
fof(f118,plain,
( not(sF3) = sF4
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f119,plain,
spl11_7,
inference(avatar_split_clause,[],[f34,f116]) ).
fof(f123,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,f80]) ).
fof(f129,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f123,f1]) ).
fof(f145,definition,
( spl11_8
<=> or(sF4,sF8) = sF9 ),
introduced(definition,[new_symbols(definition,[spl11_8])],[avatar_definition]) ).
fof(f147,plain,
( or(sF4,sF8) = sF9
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f148,plain,
spl11_8,
inference(avatar_split_clause,[],[f44,f145]) ).
fof(f195,definition,
( spl11_9
<=> or(sF0,q) = sF1 ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
fof(f197,plain,
( or(sF0,q) = sF1
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f198,plain,
spl11_9,
inference(avatar_split_clause,[],[f28,f195]) ).
fof(f218,definition,
( spl11_10
<=> or(sF2,q) = sF3 ),
introduced(definition,[new_symbols(definition,[spl11_10])],[avatar_definition]) ).
fof(f220,plain,
( or(sF2,q) = sF3
| ~ spl11_10 ),
inference(avatar_component_clause,[],[f218]) ).
fof(f221,plain,
spl11_10,
inference(avatar_split_clause,[],[f32,f218]) ).
fof(f241,definition,
( spl11_11
<=> or(sF5,p) = sF6 ),
introduced(definition,[new_symbols(definition,[spl11_11])],[avatar_definition]) ).
fof(f243,plain,
( or(sF5,p) = sF6
| ~ spl11_11 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f244,plain,
spl11_11,
inference(avatar_split_clause,[],[f38,f241]) ).
fof(f264,definition,
( spl11_12
<=> or(sF7,p) = sF8 ),
introduced(definition,[new_symbols(definition,[spl11_12])],[avatar_definition]) ).
fof(f266,plain,
( or(sF7,p) = sF8
| ~ spl11_12 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f267,plain,
spl11_12,
inference(avatar_split_clause,[],[f42,f264]) ).
fof(f275,plain,
( true = theorem(or(not(p),sF8))
| ~ spl11_12 ),
inference(superposition,[],[f81,f266]) ).
fof(f281,plain,
( ! [X0] : true = ifeq(theorem(or(sF7,or(X0,p))),true,theorem(or(X0,sF8)),true)
| ~ spl11_12 ),
inference(superposition,[],[f129,f266]) ).
fof(f282,plain,
( true = theorem(or(sF0,sF8))
| ~ spl11_3
| ~ spl11_12 ),
inference(forward_demodulation,[],[f275,f63]) ).
fof(f299,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(f300,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f299,f1]) ).
fof(f323,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,f300]) ).
fof(f325,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,[],[f129,f300]) ).
fof(f334,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(not(or(not(X0),X1)),or(X2,X1)))),
inference(forward_demodulation,[],[f325,f1]) ).
fof(f335,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,[],[f323,f1]) ).
fof(f350,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f335,f81]) ).
fof(f351,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f335,f82]) ).
fof(f354,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
inference(superposition,[],[f335,f79]) ).
fof(f356,plain,
( ! [X0] : true = ifeq(theorem(or(not(q),X0)),true,theorem(or(not(sF3),or(sF2,X0))),true)
| ~ spl11_10 ),
inference(superposition,[],[f335,f220]) ).
fof(f373,plain,
( ! [X0] : true = ifeq(theorem(or(not(q),X0)),true,theorem(or(sF4,or(sF2,X0))),true)
| ~ spl11_7
| ~ spl11_10 ),
inference(forward_demodulation,[],[f356,f118]) ).
fof(f375,plain,
! [X0,X1] : true = theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
inference(forward_demodulation,[],[f354,f1]) ).
fof(f378,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f351,f1]) ).
fof(f379,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f350,f1]) ).
fof(f381,plain,
( ! [X0] : true = ifeq(theorem(or(sF5,X0)),true,theorem(or(sF4,or(sF2,X0))),true)
| ~ spl11_4
| ~ spl11_7
| ~ spl11_10 ),
inference(forward_demodulation,[],[f373,f70]) ).
fof(f395,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,f379]) ).
fof(f406,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f395,f1]) ).
fof(f421,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),true),
inference(superposition,[],[f23,f375]) ).
fof(f432,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),
inference(forward_demodulation,[],[f421,f1]) ).
fof(f454,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,f334]) ).
fof(f466,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,[],[f454,f1]) ).
fof(f491,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF8)),true,theorem(or(X0,sF9)),true)
| ~ spl11_8 ),
inference(superposition,[],[f406,f147]) ).
fof(f513,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(X0),X0)),true),
inference(superposition,[],[f432,f81]) ).
fof(f546,plain,
! [X0] : true = theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f513,f1]) ).
fof(f552,plain,
( true = theorem(or(sF7,sF6))
| ~ spl11_6 ),
inference(superposition,[],[f546,f110]) ).
fof(f563,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
inference(superposition,[],[f98,f546]) ).
fof(f569,plain,
! [X0] : true = theorem(or(X0,not(X0))),
inference(forward_demodulation,[],[f563,f1]) ).
fof(f600,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,f378]) ).
fof(f618,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f600,f1]) ).
fof(f625,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true),
inference(superposition,[],[f618,f81]) ).
fof(f660,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X0,X1))),
inference(forward_demodulation,[],[f625,f1]) ).
fof(f661,plain,
( true = theorem(or(p,sF0))
| ~ spl11_3 ),
inference(superposition,[],[f569,f63]) ).
fof(f813,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),true),
inference(superposition,[],[f335,f660]) ).
fof(f840,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),
inference(forward_demodulation,[],[f813,f1]) ).
fof(f937,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,f840]) ).
fof(f961,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X1,X2))),true),
inference(forward_demodulation,[],[f937,f1]) ).
fof(f987,plain,
( ! [X0] : true = ifeq(theorem(or(X0,sF0)),true,theorem(or(X0,sF1)),true)
| ~ spl11_9 ),
inference(superposition,[],[f961,f197]) ).
fof(f1285,plain,
( true = ifeq(theorem(or(sF7,sF6)),true,theorem(or(sF5,sF8)),true)
| ~ spl11_11
| ~ spl11_12 ),
inference(superposition,[],[f281,f243]) ).
fof(f1296,plain,
( true = ifeq(true,true,theorem(or(sF5,sF8)),true)
| ~ spl11_6
| ~ spl11_11
| ~ spl11_12 ),
inference(forward_demodulation,[],[f1285,f552]) ).
fof(f1298,plain,
( true = theorem(or(sF5,sF8))
| ~ spl11_6
| ~ spl11_11
| ~ spl11_12 ),
inference(forward_demodulation,[],[f1296,f1]) ).
fof(f1300,definition,
( spl11_13
<=> true = theorem(or(sF5,sF8)) ),
introduced(definition,[new_symbols(definition,[spl11_13])],[avatar_definition]) ).
fof(f1302,plain,
( true = theorem(or(sF5,sF8))
| ~ spl11_13 ),
inference(avatar_component_clause,[],[f1300]) ).
fof(f1303,plain,
( spl11_13
| ~ spl11_6
| ~ spl11_11
| ~ spl11_12 ),
inference(avatar_split_clause,[],[f1298,f264,f241,f108,f1300]) ).
fof(f1304,plain,
( true = ifeq(true,true,theorem(or(sF4,or(sF2,sF8))),true)
| ~ spl11_4
| ~ spl11_7
| ~ spl11_10
| ~ spl11_13 ),
inference(superposition,[],[f381,f1302]) ).
fof(f1333,plain,
( true = theorem(or(sF4,or(sF2,sF8)))
| ~ spl11_4
| ~ spl11_7
| ~ spl11_10
| ~ spl11_13 ),
inference(forward_demodulation,[],[f1304,f1]) ).
fof(f1419,definition,
( spl11_15
<=> true = theorem(or(p,sF0)) ),
introduced(definition,[new_symbols(definition,[spl11_15])],[avatar_definition]) ).
fof(f1421,plain,
( true = theorem(or(p,sF0))
| ~ spl11_15 ),
inference(avatar_component_clause,[],[f1419]) ).
fof(f1422,plain,
( spl11_15
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f661,f61,f1419]) ).
fof(f1423,plain,
( true = ifeq(true,true,theorem(or(p,sF1)),true)
| ~ spl11_9
| ~ spl11_15 ),
inference(superposition,[],[f987,f1421]) ).
fof(f1446,plain,
( true = theorem(or(p,sF1))
| ~ spl11_9
| ~ spl11_15 ),
inference(forward_demodulation,[],[f1423,f1]) ).
fof(f1448,definition,
( spl11_16
<=> true = theorem(or(p,sF1)) ),
introduced(definition,[new_symbols(definition,[spl11_16])],[avatar_definition]) ).
fof(f1450,plain,
( true = theorem(or(p,sF1))
| ~ spl11_16 ),
inference(avatar_component_clause,[],[f1448]) ).
fof(f1451,plain,
( spl11_16
| ~ spl11_9
| ~ spl11_15 ),
inference(avatar_split_clause,[],[f1446,f1419,f195,f1448]) ).
fof(f1457,plain,
( ! [X0] : true = ifeq(true,true,theorem(or(not(or(not(sF1),X0)),or(p,X0))),true)
| ~ spl11_16 ),
inference(superposition,[],[f466,f1450]) ).
fof(f1472,plain,
( ! [X0] : true = theorem(or(not(or(not(sF1),X0)),or(p,X0)))
| ~ spl11_16 ),
inference(forward_demodulation,[],[f1457,f1]) ).
fof(f1477,plain,
( ! [X0] : true = theorem(or(not(or(sF2,X0)),or(p,X0)))
| ~ spl11_5
| ~ spl11_16 ),
inference(forward_demodulation,[],[f1472,f102]) ).
fof(f1706,definition,
( spl11_19
<=> true = theorem(or(sF0,sF8)) ),
introduced(definition,[new_symbols(definition,[spl11_19])],[avatar_definition]) ).
fof(f1708,plain,
( true = theorem(or(sF0,sF8))
| ~ spl11_19 ),
inference(avatar_component_clause,[],[f1706]) ).
fof(f1709,plain,
( spl11_19
| ~ spl11_3
| ~ spl11_12 ),
inference(avatar_split_clause,[],[f282,f264,f61,f1706]) ).
fof(f1716,plain,
( true = ifeq(true,true,theorem(or(sF0,sF9)),true)
| ~ spl11_8
| ~ spl11_19 ),
inference(superposition,[],[f491,f1708]) ).
fof(f1740,plain,
( true = theorem(or(sF0,sF9))
| ~ spl11_8
| ~ spl11_19 ),
inference(forward_demodulation,[],[f1716,f1]) ).
fof(f1746,definition,
( spl11_20
<=> true = theorem(or(sF0,sF9)) ),
introduced(definition,[new_symbols(definition,[spl11_20])],[avatar_definition]) ).
fof(f1748,plain,
( true = theorem(or(sF0,sF9))
| ~ spl11_20 ),
inference(avatar_component_clause,[],[f1746]) ).
fof(f1749,plain,
( spl11_20
| ~ spl11_8
| ~ spl11_19 ),
inference(avatar_split_clause,[],[f1740,f1706,f145,f1746]) ).
fof(f1763,plain,
( true = ifeq(theorem(or(not(or(sF0,sF9)),sF9)),true,ifeq(true,true,sF10,true),true)
| ~ spl11_1
| ~ spl11_20 ),
inference(superposition,[],[f53,f1748]) ).
fof(f1770,plain,
( true = ifeq(theorem(or(not(or(sF0,sF9)),sF9)),true,sF10,true)
| ~ spl11_1
| ~ spl11_20 ),
inference(forward_demodulation,[],[f1763,f1]) ).
fof(f1937,plain,
( ! [X0] : true = ifeq(true,true,ifeq(theorem(or(sF2,X0)),true,theorem(or(p,X0)),true),true)
| ~ spl11_5
| ~ spl11_16 ),
inference(superposition,[],[f23,f1477]) ).
fof(f1970,plain,
( ! [X0] : true = ifeq(theorem(or(sF2,X0)),true,theorem(or(p,X0)),true)
| ~ spl11_5
| ~ spl11_16 ),
inference(forward_demodulation,[],[f1937,f1]) ).
fof(f5238,definition,
( spl11_58
<=> true = theorem(or(sF4,or(sF2,sF8))) ),
introduced(definition,[new_symbols(definition,[spl11_58])],[avatar_definition]) ).
fof(f5240,plain,
( true = theorem(or(sF4,or(sF2,sF8)))
| ~ spl11_58 ),
inference(avatar_component_clause,[],[f5238]) ).
fof(f5241,plain,
( spl11_58
| ~ spl11_4
| ~ spl11_7
| ~ spl11_10
| ~ spl11_13 ),
inference(avatar_split_clause,[],[f1333,f1300,f218,f116,f68,f5238]) ).
fof(f5246,plain,
( true = ifeq(true,true,theorem(or(sF2,or(sF4,sF8))),true)
| ~ spl11_58 ),
inference(superposition,[],[f129,f5240]) ).
fof(f5279,plain,
( true = theorem(or(sF2,or(sF4,sF8)))
| ~ spl11_58 ),
inference(forward_demodulation,[],[f5246,f1]) ).
fof(f5283,plain,
( true = theorem(or(sF2,sF9))
| ~ spl11_8
| ~ spl11_58 ),
inference(forward_demodulation,[],[f5279,f147]) ).
fof(f5287,definition,
( spl11_59
<=> true = theorem(or(sF2,sF9)) ),
introduced(definition,[new_symbols(definition,[spl11_59])],[avatar_definition]) ).
fof(f5289,plain,
( true = theorem(or(sF2,sF9))
| ~ spl11_59 ),
inference(avatar_component_clause,[],[f5287]) ).
fof(f5290,plain,
( spl11_59
| ~ spl11_8
| ~ spl11_58 ),
inference(avatar_split_clause,[],[f5283,f5238,f145,f5287]) ).
fof(f5294,plain,
( true = ifeq(true,true,theorem(or(p,sF9)),true)
| ~ spl11_5
| ~ spl11_16
| ~ spl11_59 ),
inference(superposition,[],[f1970,f5289]) ).
fof(f5323,plain,
( true = theorem(or(p,sF9))
| ~ spl11_5
| ~ spl11_16
| ~ spl11_59 ),
inference(forward_demodulation,[],[f5294,f1]) ).
fof(f5328,definition,
( spl11_60
<=> true = theorem(or(p,sF9)) ),
introduced(definition,[new_symbols(definition,[spl11_60])],[avatar_definition]) ).
fof(f5330,plain,
( true = theorem(or(p,sF9))
| ~ spl11_60 ),
inference(avatar_component_clause,[],[f5328]) ).
fof(f5331,plain,
( spl11_60
| ~ spl11_5
| ~ spl11_16
| ~ spl11_59 ),
inference(avatar_split_clause,[],[f5323,f5287,f1448,f100,f5328]) ).
fof(f5336,plain,
( true = ifeq(true,true,theorem(or(sF9,p)),true)
| ~ spl11_60 ),
inference(superposition,[],[f98,f5330]) ).
fof(f5358,plain,
( true = theorem(or(sF9,p))
| ~ spl11_60 ),
inference(forward_demodulation,[],[f5336,f1]) ).
fof(f5393,definition,
( spl11_62
<=> true = theorem(or(sF9,p)) ),
introduced(definition,[new_symbols(definition,[spl11_62])],[avatar_definition]) ).
fof(f5395,plain,
( true = theorem(or(sF9,p))
| ~ spl11_62 ),
inference(avatar_component_clause,[],[f5393]) ).
fof(f5396,plain,
( spl11_62
| ~ spl11_60 ),
inference(avatar_split_clause,[],[f5358,f5328,f5393]) ).
fof(f5403,plain,
( ! [X0] : true = ifeq(true,true,theorem(or(not(or(not(p),X0)),or(sF9,X0))),true)
| ~ spl11_62 ),
inference(superposition,[],[f466,f5395]) ).
fof(f5420,plain,
( ! [X0] : true = theorem(or(not(or(not(p),X0)),or(sF9,X0)))
| ~ spl11_62 ),
inference(forward_demodulation,[],[f5403,f1]) ).
fof(f5427,plain,
( ! [X0] : true = theorem(or(not(or(sF0,X0)),or(sF9,X0)))
| ~ spl11_3
| ~ spl11_62 ),
inference(forward_demodulation,[],[f5420,f63]) ).
fof(f5443,plain,
( true = ifeq(true,true,theorem(or(not(or(sF0,sF9)),sF9)),true)
| ~ spl11_3
| ~ spl11_62 ),
inference(superposition,[],[f432,f5427]) ).
fof(f5468,plain,
( true = theorem(or(not(or(sF0,sF9)),sF9))
| ~ spl11_3
| ~ spl11_62 ),
inference(forward_demodulation,[],[f5443,f1]) ).
fof(f5477,plain,
( true = ifeq(true,true,sF10,true)
| ~ spl11_1
| ~ spl11_3
| ~ spl11_20
| ~ spl11_62 ),
inference(backward_demodulation,[],[f1770,f5468]) ).
fof(f5478,plain,
( true = sF10
| ~ spl11_1
| ~ spl11_3
| ~ spl11_20
| ~ spl11_62 ),
inference(forward_demodulation,[],[f5477,f1]) ).
fof(f5479,plain,
( $false
| ~ spl11_1
| spl11_2
| ~ spl11_3
| ~ spl11_20
| ~ spl11_62 ),
inference(forward_subsumption_resolution,[],[f5478,f58]) ).
fof(f5480,plain,
( ~ spl11_1
| spl11_2
| ~ spl11_3
| ~ spl11_20
| ~ spl11_62 ),
inference(avatar_contradiction_clause,[],[f5479]) ).
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(s4,plain,
spl11_4,
inference(sat_conversion,[],[f71]) ).
cnf(s5,plain,
spl11_5,
inference(sat_conversion,[],[f103]) ).
cnf(s6,plain,
spl11_6,
inference(sat_conversion,[],[f111]) ).
cnf(s7,plain,
spl11_7,
inference(sat_conversion,[],[f119]) ).
cnf(s8,plain,
spl11_8,
inference(sat_conversion,[],[f148]) ).
cnf(s9,plain,
spl11_9,
inference(sat_conversion,[],[f198]) ).
cnf(s10,plain,
spl11_10,
inference(sat_conversion,[],[f221]) ).
cnf(s11,plain,
spl11_11,
inference(sat_conversion,[],[f244]) ).
cnf(s12,plain,
spl11_12,
inference(sat_conversion,[],[f267]) ).
cnf(s13,plain,
( ~ spl11_6
| ~ spl11_11
| ~ spl11_12
| spl11_13 ),
inference(sat_conversion,[],[f1303]) ).
cnf(s15,plain,
( ~ spl11_3
| spl11_15 ),
inference(sat_conversion,[],[f1422]) ).
cnf(s16,plain,
( ~ spl11_9
| ~ spl11_15
| spl11_16 ),
inference(sat_conversion,[],[f1451]) ).
cnf(s19,plain,
( ~ spl11_3
| ~ spl11_12
| spl11_19 ),
inference(sat_conversion,[],[f1709]) ).
cnf(s20,plain,
( ~ spl11_8
| ~ spl11_19
| spl11_20 ),
inference(sat_conversion,[],[f1749]) ).
cnf(s58,plain,
( ~ spl11_4
| ~ spl11_7
| ~ spl11_10
| ~ spl11_13
| spl11_58 ),
inference(sat_conversion,[],[f5241]) ).
cnf(s59,plain,
( ~ spl11_8
| ~ spl11_58
| spl11_59 ),
inference(sat_conversion,[],[f5290]) ).
cnf(s60,plain,
( ~ spl11_5
| ~ spl11_16
| ~ spl11_59
| spl11_60 ),
inference(sat_conversion,[],[f5331]) ).
cnf(s62,plain,
( ~ spl11_60
| spl11_62 ),
inference(sat_conversion,[],[f5396]) ).
cnf(s63,plain,
( ~ spl11_1
| spl11_2
| ~ spl11_3
| ~ spl11_20
| ~ spl11_62 ),
inference(sat_conversion,[],[f5480]) ).
cnf(s67,plain,
spl11_13,
inference(rat,[],[s13,s11,s12,s6]) ).
cnf(s78,plain,
spl11_58,
inference(rat,[],[s58,s67,s7,s10,s4]) ).
cnf(s83,plain,
spl11_59,
inference(rat,[],[s59,s8,s78]) ).
cnf(s93,plain,
spl11_19,
inference(rat,[],[s19,s12,s3]) ).
cnf(s94,plain,
spl11_15,
inference(rat,[],[s15,s3]) ).
cnf(s96,plain,
spl11_20,
inference(rat,[],[s20,s8,s93]) ).
cnf(s97,plain,
spl11_16,
inference(rat,[],[s16,s9,s94]) ).
cnf(s99,plain,
spl11_60,
inference(rat,[],[s60,s83,s5,s97]) ).
cnf(s102,plain,
spl11_62,
inference(rat,[],[s62,s99]) ).
cnf(s114,plain,
~ spl11_1,
inference(rat,[],[s63,s102,s96,s3,s2]) ).
cnf(s115,plain,
$false,
inference(rat,[],[s1,s114]) ).
fof(f5481,plain,
$false,
inference(avatar_sat_refutation,[],[s115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL220-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 % Computer : n001.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun Sep 27 15:33:16 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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
% 21.30/3.99 % (3721118)Detected a unit-equality problem, will run specialized UEQ schedule.
% 21.30/3.99 % (3721142)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2920554505:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 21.30/3.99 % (3721141)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2460632705:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 21.30/3.99 % (3721140)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3484898224:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 21.30/3.99 % (3721139)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=1424468952:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 21.30/3.99 % (3721138)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=4043912176:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 21.30/4.00 % (3721142)Instruction limit reached!
% 21.30/4.00 % (3721142)------------------------------
% 21.30/4.00 % (3721142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.30/4.00 % (3721142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.30/4.00 % (3721142)CaDiCaL version: 2.1.3
% 21.30/4.00 % (3721142)Termination reason: Instruction limit
% 21.30/4.00 % (3721142)Termination phase: Saturation
% 21.30/4.00 % (3721142)Time elapsed: 0.082 s
% 21.30/4.00 % (3721142)Peak memory usage: 89 MB
% 21.30/4.00 % (3721142)Instructions burned: 183 (million)
% 21.30/4.00 % (3721143)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1421939532:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 21.30/4.00 % (3721144)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=4248406568:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 21.30/4.00 % (3721141)Instruction limit reached!
% 21.30/4.00 % (3721141)------------------------------
% 21.30/4.00 % (3721141)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.30/4.00 % (3721141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.30/4.00 % (3721141)CaDiCaL version: 2.1.3
% 21.30/4.00 % (3721141)Termination reason: Instruction limit
% 21.30/4.00 % (3721141)Termination phase: Saturation
% 21.30/4.00 % (3721141)Time elapsed: 0.127 s
% 21.30/4.00 % (3721141)Peak memory usage: 89 MB
% 21.30/4.00 % (3721141)Instructions burned: 137 (million)
% 21.30/4.00 % (3721153)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=601226195:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 21.30/4.00 % (3721143)Instruction limit reached!
% 21.30/4.00 % (3721143)------------------------------
% 21.30/4.00 % (3721143)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.30/4.00 % (3721143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.30/4.00 % (3721143)CaDiCaL version: 2.1.3
% 21.30/4.00 % (3721143)Termination reason: Instruction limit
% 21.30/4.00 % (3721143)Termination phase: Saturation
% 21.30/4.00 % (3721143)Time elapsed: 0.261 s
% 21.30/4.00 % (3721143)Peak memory usage: 90 MB
% 21.30/4.00 % (3721143)Instructions burned: 257 (million)
% 21.30/4.00 % (3721156)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1931563427:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 21.30/4.00 % (3721160)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=2906990736:i=215:ep=RSTC_2995 on theBenchmark for (2995ds/215Mi)
% 21.30/4.00 % (3721160)Instruction limit reached!
% 21.30/4.00 % (3721160)------------------------------
% 21.30/4.00 % (3721160)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.30/4.00 % (3721160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.30/4.00 % (3721160)CaDiCaL version: 2.1.3
% 21.30/4.00 % (3721160)Termination reason: Instruction limit
% 21.30/4.00 % (3721160)Termination phase: Saturation
% 21.30/4.00 % (3721160)Time elapsed: 0.141 s
% 21.30/4.00 % (3721160)Peak memory usage: 88 MB
% 21.30/4.00 % (3721160)Instructions burned: 215 (million)
% 21.30/4.00 % (3721165)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=4010552982:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2991 on theBenchmark for (2991ds/317Mi)
% 21.30/4.00 % (3721144)Instruction limit reached!
% 21.30/4.00 % (3721144)------------------------------
% 21.30/4.00 % (3721144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.30/4.00 % (3721144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.30/4.00 % (3721144)CaDiCaL version: 2.1.3
% 21.30/4.00 % (3721144)Termination reason: Instruction limit
% 21.30/4.00 % (3721144)Termination phase: Saturation
% 21.30/4.00 % (3721144)Time elapsed: 1.124 s
% 21.30/4.00 % (3721144)Peak memory usage: 101 MB
% 21.30/4.00 % (3721144)Instructions burned: 1187 (million)
% 21.30/4.00 % (3721165)Instruction limit reached!
% 21.30/4.00 % (3721165)------------------------------
% 21.30/4.00 % (3721165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.30/4.00 % (3721165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.30/4.00 % (3721165)CaDiCaL version: 2.1.3
% 21.30/4.00 % (3721165)Termination reason: Instruction limit
% 21.30/4.00 % (3721165)Termination phase: Saturation
% 21.30/4.00 % (3721165)Time elapsed: 0.316 s
% 21.30/4.00 % (3721165)Peak memory usage: 94 MB
% 21.30/4.00 % (3721165)Instructions burned: 317 (million)
% 21.30/4.00 % (3721153)Instruction limit reached!
% 21.30/4.00 % (3721153)------------------------------
% 21.30/4.00 % (3721153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.30/4.00 % (3721153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.30/4.00 % (3721153)CaDiCaL version: 2.1.3
% 21.30/4.00 % (3721153)Termination reason: Instruction limit
% 21.30/4.00 % (3721153)Termination phase: Saturation
% 21.30/4.00 % (3721153)Time elapsed: 1.046 s
% 21.30/4.00 % (3721153)Peak memory usage: 143 MB
% 21.30/4.00 % (3721153)Instructions burned: 2052 (million)
% 21.30/4.00 % (3721174)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=2756852886:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2985 on theBenchmark for (2985ds/14534Mi)
% 21.30/4.00 % (3721173)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=3008677642:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2986 on theBenchmark for (2986ds/2836Mi)
% 21.30/4.00 % (3721172)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=1112255665:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2986 on theBenchmark for (2986ds/12125Mi)
% 21.30/4.00 % (3721138)First to succeed.
% 21.30/4.00 % (3721138)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3721118"
% 21.30/4.00 % (3721138)Refutation found. Thanks to Tanya!
% 21.30/4.00 % SZS status Unsatisfiable for theBenchmark
% 21.30/4.00 % SZS output start Proof for theBenchmark
% See solution above
% 22.16/4.23 % (3721138)------------------------------
% 22.16/4.23 % (3721138)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 22.16/4.23 % (3721138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.16/4.23 % (3721138)CaDiCaL version: 2.1.3
% 22.16/4.23 % (3721138)Termination reason: Refutation
% 22.16/4.23 % (3721138)Time elapsed: 2.376 s
% 22.16/4.23 % (3721138)Peak memory usage: 142 MB
% 22.16/4.23 % (3721138)Instructions burned: 2171 (million)
% 22.16/4.23 % (3721138)------------------------------
% 22.16/4.23 % (3721138)------------------------------
% 22.16/4.23 % (3721118)Success in time 3.016 s
% 22.16/4.23 % Vampire exiting
%------------------------------------------------------------------------------