%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC166+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:02:45 PM UTC 2026
% Result : Theorem 8.69s 2.09s
% Output : Refutation 9.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 30
% Syntax : Number of formulae : 200 ( 43 unt; 16 def)
% Number of atoms : 717 ( 146 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 923 ( 406 ~; 382 |; 72 &)
% ( 20 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 12 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 14 con; 0-2 aty)
% Number of variables : 181 ( 0 sgn 151 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f13,axiom,
! [X0] :
( ssList(X0)
=> ( duplicatefreeP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> X1 != X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax13) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax25) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f71,axiom,
! [X0] :
( ssItem(X0)
=> duplicatefreeP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax71) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f86,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil != X0
=> tl(app(X0,X1)) = app(tl(X0),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax86) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ singletonP(X2)
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X0
| neq(X4,X5) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ singletonP(X2)
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X0
| neq(X4,X5) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f114,plain,
! [X0] :
( ( duplicatefreeP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f115,plain,
! [X0] :
( ( duplicatefreeP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f114]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f131,plain,
! [X0] :
( ! [X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f184,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f71]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f204,plain,
! [X0] :
( ! [X1] :
( tl(app(X0,X1)) = app(tl(X0),X1)
| nil = X0
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f205,plain,
! [X0] :
( ! [X1] :
( tl(app(X0,X1)) = app(tl(X0),X1)
| nil = X0
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f204]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& singletonP(X2)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ~ neq(X4,X5)
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& singletonP(X2)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ~ neq(X4,X5)
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f232,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f98]) ).
fof(f237,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f238,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f237]) ).
fof(f239,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK10(X0))
& cons(sK10(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0))],[f238]) ).
fof(f267,plain,
! [X0] :
( ( ( duplicatefreeP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( X1 = X2
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ duplicatefreeP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f115]) ).
fof(f268,plain,
! [X0] :
( ( ( duplicatefreeP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( X1 = X2
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( X6 != X7
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ duplicatefreeP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f267]) ).
fof(f269,plain,
! [X0] :
( ( ( duplicatefreeP(X0)
| ( sK40(X0) = sK41(X0)
& app(app(sK42(X0),cons(sK40(X0),sK43(X0))),cons(sK41(X0),sK44(X0))) = X0
& ssList(sK44(X0))
& ssList(sK43(X0))
& ssList(sK42(X0))
& ssItem(sK41(X0))
& ssItem(sK40(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( X6 != X7
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ duplicatefreeP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK40,sK41,sK42,sK43,sK44]),skolemize(X1,sK40(X0)),skolemize(X2,sK41(X0)),skolemize(X3,sK42(X0)),skolemize(X4,sK43(X0)),skolemize(X5,sK44(X0))],[f268]) ).
fof(f292,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f293,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f292]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& singletonP(sK55)
& sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60)
& ~ neq(sK57,sK58)
& ssList(sK60)
& ssList(sK59)
& ssItem(sK58)
& ssItem(sK57)
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57),skolemize(X5,sK58),skolemize(X6,sK59),skolemize(X7,sK60)],[f222]) ).
fof(f298,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f232]) ).
fof(f306,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK10(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f307,plain,
! [X0] :
( ssItem(sK10(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f371,plain,
! [X10,X0,X8,X6,X9,X7] :
( X6 != X7
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f269]) ).
fof(f388,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f396,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f399,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f400,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f465,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f184]) ).
fof(f480,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f293]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f484,plain,
! [X0,X1] :
( ~ ssList(X1)
| nil = X0
| tl(app(X0,X1)) = app(tl(X0),X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f205]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
ssItem(sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
ssList(sK59),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
ssList(sK60),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
~ neq(sK57,sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
singletonP(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK55 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60),
inference(definition_unfolding,[],[f505,f507]) ).
fof(f511,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f507]) ).
fof(f523,plain,
! [X10,X0,X8,X9,X7] :
( app(app(X8,cons(X7,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X7)
| ~ duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f371]) ).
fof(f524,plain,
! [X10,X8,X9,X7] :
( ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X7)
| ~ duplicatefreeP(app(app(X8,cons(X7,X9)),cons(X7,X10)))
| ~ ssList(app(app(X8,cons(X7,X9)),cons(X7,X10))) ),
inference(equality_resolution,[],[f523]) ).
fof(f539,definition,
sF61 = cons(sK57,nil),
introduced(definition,[new_symbols(definition,[sF61])],[function_definition]) ).
fof(f540,plain,
cons(sK57,nil) = sF61,
inference(reorient_equations,[],[f539]) ).
fof(f541,definition,
sF62 = app(sK59,sF61),
introduced(definition,[new_symbols(definition,[sF62])],[function_definition]) ).
fof(f542,plain,
app(sK59,sF61) = sF62,
inference(reorient_equations,[],[f541]) ).
fof(f543,definition,
sF63 = cons(sK58,nil),
introduced(definition,[new_symbols(definition,[sF63])],[function_definition]) ).
fof(f544,plain,
cons(sK58,nil) = sF63,
inference(reorient_equations,[],[f543]) ).
fof(f545,definition,
sF64 = app(sF62,sF63),
introduced(definition,[new_symbols(definition,[sF64])],[function_definition]) ).
fof(f546,plain,
app(sF62,sF63) = sF64,
inference(reorient_equations,[],[f545]) ).
fof(f547,definition,
sF65 = app(sF64,sK60),
introduced(definition,[new_symbols(definition,[sF65])],[function_definition]) ).
fof(f548,plain,
app(sF64,sK60) = sF65,
inference(reorient_equations,[],[f547]) ).
fof(f549,plain,
sK55 = sF65,
inference(definition_folding,[],[f509,f548,f546,f544,f542,f540]) ).
fof(f555,plain,
! [X10,X8,X9,X7] :
( ~ duplicatefreeP(app(app(X8,cons(X7,X9)),cons(X7,X10)))
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssList(X10)
| ~ ssList(app(app(X8,cons(X7,X9)),cons(X7,X10))) ),
inference(duplicate_literal_removal,[],[f524]) ).
fof(f558,definition,
( spl66_1
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl66_1])],[avatar_definition]) ).
fof(f559,plain,
( ssList(nil)
| ~ spl66_1 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f586,plain,
spl66_1,
inference(avatar_split_clause,[],[f389,f558]) ).
fof(f589,plain,
sK55 = app(sF64,sK60),
inference(forward_demodulation,[],[f548,f549]) ).
fof(f590,plain,
( sK57 = sK58
| ~ ssItem(sK58)
| ~ ssItem(sK57) ),
inference(resolution,[],[f504,f298]) ).
fof(f601,definition,
( spl66_9
<=> sK57 = sK58 ),
introduced(definition,[new_symbols(definition,[spl66_9])],[avatar_definition]) ).
fof(f603,plain,
( sK57 = sK58
| ~ spl66_9 ),
inference(avatar_component_clause,[],[f601]) ).
fof(f605,plain,
( sK57 = sK58
| ~ ssItem(sK57) ),
inference(forward_subsumption_resolution,[],[f590,f501]) ).
fof(f606,plain,
sK57 = sK58,
inference(forward_subsumption_resolution,[],[f605,f500]) ).
fof(f607,plain,
spl66_9,
inference(avatar_split_clause,[],[f606,f601]) ).
fof(f610,plain,
( cons(sK57,nil) = sF63
| ~ spl66_9 ),
inference(superposition,[],[f544,f603]) ).
fof(f611,plain,
( sF61 = sF63
| ~ spl66_9 ),
inference(forward_demodulation,[],[f610,f540]) ).
fof(f612,plain,
( sF64 = app(sF62,sF61)
| ~ spl66_9 ),
inference(superposition,[],[f546,f611]) ).
fof(f613,plain,
( ssList(sF62)
| ~ ssList(sF61)
| ~ ssList(sK59) ),
inference(superposition,[],[f401,f542]) ).
fof(f615,plain,
( ssList(sF64)
| ~ ssList(sF63)
| ~ ssList(sF62) ),
inference(superposition,[],[f401,f546]) ).
fof(f616,plain,
( ~ ssList(sF61)
| ssList(sF64)
| ~ ssList(sF62)
| ~ spl66_9 ),
inference(forward_demodulation,[],[f615,f611]) ).
fof(f617,plain,
( ssList(sF62)
| ~ ssList(sF61) ),
inference(forward_subsumption_resolution,[],[f613,f502]) ).
fof(f619,definition,
( spl66_10
<=> ssList(sF62) ),
introduced(definition,[new_symbols(definition,[spl66_10])],[avatar_definition]) ).
fof(f620,plain,
( ssList(sF62)
| ~ spl66_10 ),
inference(avatar_component_clause,[],[f619]) ).
fof(f623,definition,
( spl66_11
<=> ssList(sF64) ),
introduced(definition,[new_symbols(definition,[spl66_11])],[avatar_definition]) ).
fof(f625,plain,
( ssList(sF64)
| ~ spl66_11 ),
inference(avatar_component_clause,[],[f623]) ).
fof(f627,definition,
( spl66_12
<=> ssList(sF61) ),
introduced(definition,[new_symbols(definition,[spl66_12])],[avatar_definition]) ).
fof(f628,plain,
( ssList(sF61)
| ~ spl66_12 ),
inference(avatar_component_clause,[],[f627]) ).
fof(f629,plain,
( ~ ssList(sF61)
| spl66_12 ),
inference(avatar_component_clause,[],[f627]) ).
fof(f630,plain,
( ~ spl66_10
| spl66_11
| ~ spl66_12
| ~ spl66_9 ),
inference(avatar_split_clause,[],[f616,f601,f627,f623,f619]) ).
fof(f631,plain,
( ~ spl66_12
| spl66_10 ),
inference(avatar_split_clause,[],[f617,f619,f627]) ).
fof(f633,plain,
( ssList(sF63)
| ~ ssItem(sK58)
| ~ ssList(nil) ),
inference(superposition,[],[f388,f544]) ).
fof(f634,plain,
( ssList(sF63)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f633,f501]) ).
fof(f636,plain,
( ssList(sF63)
| ~ spl66_1 ),
inference(forward_subsumption_resolution,[],[f634,f559]) ).
fof(f638,plain,
( ssList(sF61)
| ~ spl66_1
| ~ spl66_9 ),
inference(forward_demodulation,[],[f636,f611]) ).
fof(f641,plain,
( $false
| ~ spl66_1
| ~ spl66_9
| spl66_12 ),
inference(forward_subsumption_resolution,[],[f638,f629]) ).
fof(f642,plain,
( ~ spl66_1
| ~ spl66_9
| spl66_12 ),
inference(avatar_contradiction_clause,[],[f641]) ).
fof(f656,plain,
( sF64 = app(sF64,nil)
| ~ spl66_11 ),
inference(resolution,[],[f482,f625]) ).
fof(f686,plain,
( nil != sF61
| ~ ssItem(sK57)
| ~ ssList(nil) ),
inference(superposition,[],[f396,f540]) ).
fof(f689,plain,
( nil != sF61
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f686,f500]) ).
fof(f691,plain,
( nil != sF61
| ~ spl66_1 ),
inference(forward_subsumption_resolution,[],[f689,f559]) ).
fof(f824,plain,
( ! [X0] :
( ~ ssItem(X0)
| nil = tl(cons(X0,nil)) )
| ~ spl66_1 ),
inference(resolution,[],[f400,f559]) ).
fof(f837,plain,
! [X0,X1] :
( ~ duplicatefreeP(app(app(X0,sF61),cons(sK57,X1)))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(X1)
| ~ ssList(app(app(X0,sF61),cons(sK57,X1))) ),
inference(superposition,[],[f555,f540]) ).
fof(f853,plain,
( ! [X0,X1] :
( ~ duplicatefreeP(app(app(X0,sF61),cons(sK57,X1)))
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(X1)
| ~ ssList(app(app(X0,sF61),cons(sK57,X1))) )
| ~ spl66_1 ),
inference(forward_subsumption_resolution,[],[f837,f559]) ).
fof(f861,plain,
( ! [X0,X1] :
( ~ duplicatefreeP(app(app(X0,sF61),cons(sK57,X1)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(app(X0,sF61),cons(sK57,X1))) )
| ~ spl66_1 ),
inference(forward_subsumption_resolution,[],[f853,f500]) ).
fof(f904,plain,
( nil != sF64
| nil = sF61
| ~ ssList(sF61)
| ~ ssList(sF62)
| ~ spl66_9 ),
inference(superposition,[],[f480,f612]) ).
fof(f911,plain,
( nil != sF64
| ~ ssList(sF61)
| ~ ssList(sF62)
| ~ spl66_1
| ~ spl66_9 ),
inference(forward_subsumption_resolution,[],[f904,f691]) ).
fof(f921,plain,
( nil != sF64
| ~ ssList(sF62)
| ~ spl66_1
| ~ spl66_9
| ~ spl66_12 ),
inference(forward_subsumption_resolution,[],[f911,f628]) ).
fof(f929,definition,
( spl66_13
<=> nil = sK60 ),
introduced(definition,[new_symbols(definition,[spl66_13])],[avatar_definition]) ).
fof(f930,plain,
( nil != sK60
| spl66_13 ),
inference(avatar_component_clause,[],[f929]) ).
fof(f931,plain,
( nil = sK60
| ~ spl66_13 ),
inference(avatar_component_clause,[],[f929]) ).
fof(f951,plain,
( nil != sF64
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_12 ),
inference(forward_subsumption_resolution,[],[f921,f620]) ).
fof(f976,plain,
! [X0] :
( ~ ssList(X0)
| tl(app(X0,sK60)) = app(tl(X0),sK60)
| nil = X0 ),
inference(resolution,[],[f484,f503]) ).
fof(f1020,plain,
( sK55 = app(sF64,nil)
| ~ spl66_13 ),
inference(superposition,[],[f589,f931]) ).
fof(f1021,plain,
( sK55 = sF64
| ~ spl66_11
| ~ spl66_13 ),
inference(forward_demodulation,[],[f1020,f656]) ).
fof(f1115,plain,
( tl(app(sF64,sK60)) = app(tl(sF64),sK60)
| nil = sF64
| ~ spl66_11 ),
inference(resolution,[],[f976,f625]) ).
fof(f1116,plain,
( tl(app(sF64,sK60)) = app(tl(sF64),sK60)
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12 ),
inference(forward_subsumption_resolution,[],[f1115,f951]) ).
fof(f1168,plain,
( sK55 = cons(sK10(sK55),nil)
| ~ ssList(sK55) ),
inference(resolution,[],[f506,f306]) ).
fof(f1169,plain,
( singletonP(sF64)
| ~ spl66_11
| ~ spl66_13 ),
inference(superposition,[],[f506,f1021]) ).
fof(f1170,plain,
sK55 = cons(sK10(sK55),nil),
inference(forward_subsumption_resolution,[],[f1168,f511]) ).
fof(f1171,plain,
( sF64 = cons(sK10(sF64),nil)
| ~ spl66_11
| ~ spl66_13 ),
inference(forward_demodulation,[],[f1170,f1021]) ).
fof(f1527,plain,
( duplicatefreeP(sF64)
| ~ ssItem(sK10(sF64))
| ~ spl66_11
| ~ spl66_13 ),
inference(superposition,[],[f465,f1171]) ).
fof(f1537,definition,
( spl66_25
<=> ssItem(sK10(sF64)) ),
introduced(definition,[new_symbols(definition,[spl66_25])],[avatar_definition]) ).
fof(f1539,plain,
( ~ ssItem(sK10(sF64))
| spl66_25 ),
inference(avatar_component_clause,[],[f1537]) ).
fof(f1541,definition,
( spl66_26
<=> duplicatefreeP(sF64) ),
introduced(definition,[new_symbols(definition,[spl66_26])],[avatar_definition]) ).
fof(f1543,plain,
( duplicatefreeP(sF64)
| ~ spl66_26 ),
inference(avatar_component_clause,[],[f1541]) ).
fof(f1544,plain,
( ~ spl66_25
| spl66_26
| ~ spl66_11
| ~ spl66_13 ),
inference(avatar_split_clause,[],[f1527,f929,f623,f1541,f1537]) ).
fof(f1557,plain,
( ~ singletonP(sF64)
| ~ ssList(sF64)
| spl66_25 ),
inference(resolution,[],[f1539,f307]) ).
fof(f1558,plain,
( ~ ssList(sF64)
| ~ spl66_11
| ~ spl66_13
| spl66_25 ),
inference(forward_subsumption_resolution,[],[f1557,f1169]) ).
fof(f1559,plain,
( $false
| ~ spl66_11
| ~ spl66_13
| spl66_25 ),
inference(forward_subsumption_resolution,[],[f1558,f625]) ).
fof(f1560,plain,
( ~ spl66_11
| ~ spl66_13
| spl66_25 ),
inference(avatar_contradiction_clause,[],[f1559]) ).
fof(f1565,plain,
( tl(sK55) = app(tl(sF64),sK60)
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12 ),
inference(forward_demodulation,[],[f1116,f589]) ).
fof(f1594,plain,
( nil != tl(sK55)
| nil = sK60
| ~ ssList(sK60)
| ~ ssList(tl(sF64))
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12 ),
inference(superposition,[],[f480,f1565]) ).
fof(f1597,plain,
( nil != tl(sK55)
| ~ ssList(sK60)
| ~ ssList(tl(sF64))
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12
| spl66_13 ),
inference(forward_subsumption_resolution,[],[f1594,f930]) ).
fof(f1600,definition,
( spl66_30
<=> ssList(tl(sF64)) ),
introduced(definition,[new_symbols(definition,[spl66_30])],[avatar_definition]) ).
fof(f1602,plain,
( ~ ssList(tl(sF64))
| spl66_30 ),
inference(avatar_component_clause,[],[f1600]) ).
fof(f1608,plain,
( nil != tl(sK55)
| ~ ssList(tl(sF64))
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12
| spl66_13 ),
inference(forward_subsumption_resolution,[],[f1597,f503]) ).
fof(f1614,definition,
( spl66_33
<=> nil = tl(sK55) ),
introduced(definition,[new_symbols(definition,[spl66_33])],[avatar_definition]) ).
fof(f1618,plain,
( ~ spl66_30
| ~ spl66_33
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12
| spl66_13 ),
inference(avatar_split_clause,[],[f1608,f929,f627,f623,f619,f601,f558,f1614,f1600]) ).
fof(f1630,definition,
( spl66_34
<=> ssItem(sK10(sK55)) ),
introduced(definition,[new_symbols(definition,[spl66_34])],[avatar_definition]) ).
fof(f1631,plain,
( ssItem(sK10(sK55))
| ~ spl66_34 ),
inference(avatar_component_clause,[],[f1630]) ).
fof(f1632,plain,
( ~ ssItem(sK10(sK55))
| spl66_34 ),
inference(avatar_component_clause,[],[f1630]) ).
fof(f1650,plain,
( ~ singletonP(sK55)
| ~ ssList(sK55)
| spl66_34 ),
inference(resolution,[],[f1632,f307]) ).
fof(f1651,plain,
( ~ ssList(sK55)
| spl66_34 ),
inference(forward_subsumption_resolution,[],[f1650,f506]) ).
fof(f1652,plain,
( $false
| spl66_34 ),
inference(forward_subsumption_resolution,[],[f1651,f511]) ).
fof(f1653,plain,
spl66_34,
inference(avatar_contradiction_clause,[],[f1652]) ).
fof(f1659,plain,
( nil = tl(cons(sK10(sK55),nil))
| ~ spl66_1
| ~ spl66_34 ),
inference(resolution,[],[f1631,f824]) ).
fof(f1666,plain,
( nil = tl(sK55)
| ~ spl66_1
| ~ spl66_34 ),
inference(forward_demodulation,[],[f1659,f1170]) ).
fof(f1672,plain,
( spl66_33
| ~ spl66_1
| ~ spl66_34 ),
inference(avatar_split_clause,[],[f1666,f1630,f558,f1614]) ).
fof(f2247,plain,
( nil = sF64
| ~ ssList(sF64)
| spl66_30 ),
inference(resolution,[],[f399,f1602]) ).
fof(f2288,plain,
( ~ ssList(sF64)
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_12
| spl66_30 ),
inference(forward_subsumption_resolution,[],[f2247,f951]) ).
fof(f2293,plain,
( $false
| ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12
| spl66_30 ),
inference(forward_subsumption_resolution,[],[f2288,f625]) ).
fof(f2294,plain,
( ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12
| spl66_30 ),
inference(avatar_contradiction_clause,[],[f2293]) ).
fof(f2667,plain,
( ! [X0] :
( ~ duplicatefreeP(app(app(X0,sF61),sF61))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(app(app(X0,sF61),sF61)) )
| ~ spl66_1 ),
inference(superposition,[],[f861,f540]) ).
fof(f2670,plain,
( ! [X0] :
( ~ duplicatefreeP(app(app(X0,sF61),sF61))
| ~ ssList(X0)
| ~ ssList(app(app(X0,sF61),sF61)) )
| ~ spl66_1 ),
inference(forward_subsumption_resolution,[],[f2667,f559]) ).
fof(f2675,plain,
( ~ duplicatefreeP(app(sF62,sF61))
| ~ ssList(sK59)
| ~ ssList(app(sF62,sF61))
| ~ spl66_1 ),
inference(superposition,[],[f2670,f542]) ).
fof(f2678,plain,
( ~ duplicatefreeP(app(sF62,sF61))
| ~ ssList(app(sF62,sF61))
| ~ spl66_1 ),
inference(forward_subsumption_resolution,[],[f2675,f502]) ).
fof(f2688,plain,
( ~ duplicatefreeP(sF64)
| ~ ssList(app(sF62,sF61))
| ~ spl66_1
| ~ spl66_9 ),
inference(forward_demodulation,[],[f2678,f612]) ).
fof(f2689,plain,
( ~ ssList(app(sF62,sF61))
| ~ spl66_1
| ~ spl66_9
| ~ spl66_26 ),
inference(forward_subsumption_resolution,[],[f2688,f1543]) ).
fof(f2690,plain,
( ~ ssList(sF64)
| ~ spl66_1
| ~ spl66_9
| ~ spl66_26 ),
inference(forward_demodulation,[],[f2689,f612]) ).
fof(f2691,plain,
( $false
| ~ spl66_1
| ~ spl66_9
| ~ spl66_11
| ~ spl66_26 ),
inference(forward_subsumption_resolution,[],[f2690,f625]) ).
fof(f2692,plain,
( ~ spl66_1
| ~ spl66_9
| ~ spl66_11
| ~ spl66_26 ),
inference(avatar_contradiction_clause,[],[f2691]) ).
cnf(s8,plain,
spl66_1,
inference(sat_conversion,[],[f586]) ).
cnf(s10,plain,
spl66_9,
inference(sat_conversion,[],[f607]) ).
cnf(s11,plain,
( ~ spl66_9
| ~ spl66_10
| spl66_11
| ~ spl66_12 ),
inference(sat_conversion,[],[f630]) ).
cnf(s12,plain,
( spl66_10
| ~ spl66_12 ),
inference(sat_conversion,[],[f631]) ).
cnf(s14,plain,
( ~ spl66_1
| ~ spl66_9
| spl66_12 ),
inference(sat_conversion,[],[f642]) ).
cnf(s25,plain,
( ~ spl66_11
| ~ spl66_13
| ~ spl66_25
| spl66_26 ),
inference(sat_conversion,[],[f1544]) ).
cnf(s29,plain,
( ~ spl66_11
| ~ spl66_13
| spl66_25 ),
inference(sat_conversion,[],[f1560]) ).
cnf(s32,plain,
( ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12
| spl66_13
| ~ spl66_30
| ~ spl66_33 ),
inference(sat_conversion,[],[f1618]) ).
cnf(s37,plain,
spl66_34,
inference(sat_conversion,[],[f1653]) ).
cnf(s38,plain,
( ~ spl66_1
| spl66_33
| ~ spl66_34 ),
inference(sat_conversion,[],[f1672]) ).
cnf(s40,plain,
( ~ spl66_1
| ~ spl66_9
| ~ spl66_10
| ~ spl66_11
| ~ spl66_12
| spl66_30 ),
inference(sat_conversion,[],[f2294]) ).
cnf(s45,plain,
( ~ spl66_1
| ~ spl66_9
| ~ spl66_11
| ~ spl66_26 ),
inference(sat_conversion,[],[f2692]) ).
cnf(s50,plain,
spl66_33,
inference(rat,[],[s38,s37,s8]) ).
cnf(s54,plain,
spl66_12,
inference(rat,[],[s14,s10,s8]) ).
cnf(s55,plain,
spl66_10,
inference(rat,[],[s12,s54]) ).
cnf(s56,plain,
spl66_11,
inference(rat,[],[s11,s54,s10,s55]) ).
cnf(s57,plain,
~ spl66_26,
inference(rat,[],[s45,s8,s10,s56]) ).
cnf(s58,plain,
spl66_30,
inference(rat,[],[s40,s55,s54,s8,s10,s56]) ).
cnf(s59,plain,
spl66_13,
inference(rat,[],[s32,s50,s58,s55,s54,s8,s10,s56]) ).
cnf(s62,plain,
spl66_25,
inference(rat,[],[s29,s56,s59]) ).
cnf(s63,plain,
$false,
inference(rat,[],[s25,s57,s56,s62,s59]) ).
fof(f2693,plain,
$false,
inference(avatar_sat_refutation,[],[s63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC166+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:15:17 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.69/2.08 % (1764448)Detected formulas, will run a generic FOF schedule.
% 8.69/2.08 % (1764455)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=17294560:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 8.69/2.08 % (1764454)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2078779310:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 8.69/2.08 % (1764453)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3456899814:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 8.69/2.08 % (1764457)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1654510748:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 8.69/2.08 % (1764459)dis-21_1_sil=8000:lcm=predicate:random_seed=2402446321:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 8.69/2.09 % (1764456)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2282662237:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 8.69/2.09 % (1764458)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1614318610:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 8.69/2.09 % (1764457)Instruction limit reached!
% 8.69/2.09 % (1764457)------------------------------
% 8.69/2.09 % (1764457)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764457)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764457)Termination reason: Instruction limit
% 8.69/2.09 % (1764457)Termination phase: Saturation
% 8.69/2.09 % (1764457)Time elapsed: 0.067 s
% 8.69/2.09 % (1764457)Peak memory usage: 88 MB
% 8.69/2.09 % (1764457)Instructions burned: 121 (million)
% 8.69/2.09 % (1764456)Instruction limit reached!
% 8.69/2.09 % (1764456)------------------------------
% 8.69/2.09 % (1764456)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764456)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764456)Termination reason: Instruction limit
% 8.69/2.09 % (1764456)Termination phase: Saturation
% 8.69/2.09 % (1764456)Time elapsed: 0.067 s
% 8.69/2.09 % (1764456)Peak memory usage: 89 MB
% 8.69/2.09 % (1764456)Instructions burned: 111 (million)
% 8.69/2.09 % (1764459)Instruction limit reached!
% 8.69/2.09 % (1764459)------------------------------
% 8.69/2.09 % (1764459)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764459)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764459)Termination reason: Instruction limit
% 8.69/2.09 % (1764459)Termination phase: Saturation
% 8.69/2.09 % (1764459)Time elapsed: 0.073 s
% 8.69/2.09 % (1764459)Peak memory usage: 90 MB
% 8.69/2.09 % (1764459)Instructions burned: 130 (million)
% 8.69/2.09 % (1764458)Instruction limit reached!
% 8.69/2.09 % (1764458)------------------------------
% 8.69/2.09 % (1764458)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764458)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764458)Termination reason: Instruction limit
% 8.69/2.09 % (1764458)Termination phase: Saturation
% 8.69/2.09 % (1764458)Time elapsed: 0.091 s
% 8.69/2.09 % (1764458)Peak memory usage: 90 MB
% 8.69/2.09 % (1764458)Instructions burned: 139 (million)
% 8.69/2.09 % (1764468)lrs+10_1_sil=32000:urr=on:br=off:random_seed=543309682:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 8.69/2.09 % (1764469)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3136537192:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 8.69/2.09 % (1764467)lrs+10_1_sil=8000:sp=occurrence:random_seed=167416684:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 8.69/2.09 % (1764470)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=368404741:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 8.69/2.09 % (1764468)Instruction limit reached!
% 8.69/2.09 % (1764468)------------------------------
% 8.69/2.09 % (1764468)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764468)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764468)Termination reason: Instruction limit
% 8.69/2.09 % (1764468)Termination phase: Saturation
% 8.69/2.09 % (1764468)Time elapsed: 0.072 s
% 8.69/2.09 % (1764468)Peak memory usage: 91 MB
% 8.69/2.09 % (1764468)Instructions burned: 158 (million)
% 8.69/2.09 % (1764470)Instruction limit reached!
% 8.69/2.09 % (1764470)------------------------------
% 8.69/2.09 % (1764470)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764470)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764470)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764470)Termination reason: Instruction limit
% 8.69/2.09 % (1764470)Termination phase: Saturation
% 8.69/2.09 % (1764470)Time elapsed: 0.114 s
% 8.69/2.09 % (1764470)Peak memory usage: 94 MB
% 8.69/2.09 % (1764470)Instructions burned: 249 (million)
% 8.69/2.09 % (1764467)Instruction limit reached!
% 8.69/2.09 % (1764467)------------------------------
% 8.69/2.09 % (1764467)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764467)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764467)Termination reason: Instruction limit
% 8.69/2.09 % (1764467)Termination phase: Saturation
% 8.69/2.09 % (1764467)Time elapsed: 0.157 s
% 8.69/2.09 % (1764467)Peak memory usage: 92 MB
% 8.69/2.09 % (1764467)Instructions burned: 285 (million)
% 8.69/2.09 % (1764469)Instruction limit reached!
% 8.69/2.09 % (1764469)------------------------------
% 8.69/2.09 % (1764469)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764469)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764469)Termination reason: Instruction limit
% 8.69/2.09 % (1764469)Termination phase: Saturation
% 8.69/2.09 % (1764469)Time elapsed: 0.197 s
% 8.69/2.09 % (1764469)Peak memory usage: 92 MB
% 8.69/2.09 % (1764469)Instructions burned: 326 (million)
% 8.69/2.09 % (1764477)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2293559862:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 8.69/2.09 % (1764478)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2900457820:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 8.69/2.09 % (1764479)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=235248675:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 8.69/2.09 % (1764480)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3112940938:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 8.69/2.09 % (1764479)Instruction limit reached!
% 8.69/2.09 % (1764479)------------------------------
% 8.69/2.09 % (1764479)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764479)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764479)Termination reason: Instruction limit
% 8.69/2.09 % (1764479)Termination phase: Saturation
% 8.69/2.09 % (1764479)Time elapsed: 0.076 s
% 8.69/2.09 % (1764479)Peak memory usage: 90 MB
% 8.69/2.09 % (1764479)Instructions burned: 113 (million)
% 8.69/2.09 % (1764477)Instruction limit reached!
% 8.69/2.09 % (1764477)------------------------------
% 8.69/2.09 % (1764477)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764477)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764477)Termination reason: Instruction limit
% 8.69/2.09 % (1764477)Termination phase: Saturation
% 8.69/2.09 % (1764477)Time elapsed: 0.174 s
% 8.69/2.09 % (1764477)Peak memory usage: 90 MB
% 8.69/2.09 % (1764477)Instructions burned: 296 (million)
% 8.69/2.09 % (1764480)Instruction limit reached!
% 8.69/2.09 % (1764480)------------------------------
% 8.69/2.09 % (1764480)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764480)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764480)Termination reason: Instruction limit
% 8.69/2.09 % (1764480)Termination phase: Saturation
% 8.69/2.09 % (1764480)Time elapsed: 0.063 s
% 8.69/2.09 % (1764480)Peak memory usage: 90 MB
% 8.69/2.09 % (1764480)Instructions burned: 128 (million)
% 8.69/2.09 % (1764485)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=4031965427:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 8.69/2.09 % (1764486)lrs+10_1_sil=8000:sp=occurrence:random_seed=2252273703:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 8.69/2.09 % (1764453)First to succeed.
% 8.69/2.09 % (1764487)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=3595232239:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 8.69/2.09 % (1764453)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1764448"
% 8.69/2.09 % (1764485)Instruction limit reached!
% 8.69/2.09 % (1764485)------------------------------
% 8.69/2.09 % (1764485)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764485)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764485)Termination reason: Instruction limit
% 8.69/2.09 % (1764485)Termination phase: Saturation
% 8.69/2.09 % (1764485)Time elapsed: 0.067 s
% 8.69/2.09 % (1764485)Peak memory usage: 89 MB
% 8.69/2.09 % (1764485)Instructions burned: 115 (million)
% 8.69/2.09 % (1764491)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2823277258:i=5202:ss=axioms:sgt=16_2990 on theBenchmark for (2990ds/5202Mi)
% 8.69/2.09 % (1764487)Instruction limit reached!
% 8.69/2.09 % (1764487)------------------------------
% 8.69/2.09 % (1764487)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.69/2.09 % (1764487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.69/2.09 % (1764487)CaDiCaL version: 2.1.3
% 8.69/2.09 % (1764487)Termination reason: Instruction limit
% 8.69/2.09 % (1764487)Termination phase: Saturation
% 8.69/2.09 % (1764487)Time elapsed: 0.250 s
% 8.69/2.09 % (1764487)Peak memory usage: 93 MB
% 8.69/2.09 % (1764487)Instructions burned: 437 (million)
% 8.69/2.09 % (1764453)Refutation found. Thanks to Tanya!
% 8.69/2.09 % SZS status Theorem for theBenchmark
% 8.69/2.09 % SZS output start Proof for theBenchmark
% See solution above
% 9.21/2.28 % (1764453)------------------------------
% 9.21/2.28 % (1764453)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.28 % (1764453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.28 % (1764453)CaDiCaL version: 2.1.3
% 9.21/2.28 % (1764453)Termination reason: Refutation
% 9.21/2.28 % (1764453)Time elapsed: 0.814 s
% 9.21/2.28 % (1764453)Peak memory usage: 133 MB
% 9.21/2.28 % (1764453)Instructions burned: 1251 (million)
% 9.21/2.28 % (1764453)------------------------------
% 9.21/2.28 % (1764453)------------------------------
% 9.21/2.28 % (1764448)Success in time 1.228 s
% 9.21/2.28 % Vampire exiting
%------------------------------------------------------------------------------