%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC078+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:20 PM UTC 2026
% Result : Theorem 6.67s 1.96s
% Output : Refutation 8.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 19
% Syntax : Number of formulae : 142 ( 18 unt; 7 def)
% Number of atoms : 544 ( 101 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 693 ( 291 ~; 289 |; 70 &)
% ( 13 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 163 ( 0 sgn 135 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax56) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ssItem(X5) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ssItem(X5) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f115,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f115]) ).
fof(f117,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f123,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f126,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f131,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
( sK1 = sK3
& sK0 = sK2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK1,X4)
| ~ segmentP(sK0,X4) )
& ( nil != sK1
| nil != sK0 )
& ( ( sK2 = cons(sK4,nil)
& memberP(sK3,sK4)
& ssItem(sK4) )
| ( nil = sK3
& nil = sK2 ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4)],[f99]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f107]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f144,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(X4,cons(X1,X5)) = X0 ) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f143]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ( ssList(sK9(X0,X1))
& ssList(sK10(X0,X1))
& app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0 )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X4,sK9(X0,X1)),skolemize(X5,sK10(X0,X1))],[f144]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f147]) ).
fof(f149,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK11(X0,X1))
& ssList(sK12(X0,X1))
& app(app(sK11(X0,X1),X1),sK12(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X4,sK11(X0,X1)),skolemize(X5,sK12(X0,X1))],[f148]) ).
fof(f152,plain,
ssList(sK0),
inference(cnf_transformation,[],[f134]) ).
fof(f153,plain,
ssList(sK1),
inference(cnf_transformation,[],[f134]) ).
fof(f156,plain,
( ssItem(sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f157,plain,
( ssItem(sK4)
| nil = sK3 ),
inference(cnf_transformation,[],[f134]) ).
fof(f158,plain,
( memberP(sK3,sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f160,plain,
( sK2 = cons(sK4,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f161,plain,
( sK2 = cons(sK4,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f134]) ).
fof(f162,plain,
( nil != sK1
| nil != sK0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f163,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK1,X4)
| ~ segmentP(sK0,X4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f164,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
fof(f165,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f169,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f178,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f181,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f189,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ memberP(X0,X1)
| app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f190,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ memberP(X0,X1)
| ssList(sK10(X0,X1))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f191,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ memberP(X0,X1)
| ssList(sK9(X0,X1))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f196,plain,
! [X2,X3,X0,X1] :
( ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f197,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f203,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f204,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f123]) ).
fof(f209,plain,
! [X0,X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f212,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f214,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f133]) ).
fof(f215,plain,
! [X4] :
( ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ segmentP(sK2,X4) ),
inference(definition_unfolding,[],[f163,f165,f164]) ).
fof(f216,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f162,f165,f164]) ).
fof(f217,plain,
ssList(sK3),
inference(definition_unfolding,[],[f153,f165]) ).
fof(f218,plain,
ssList(sK2),
inference(definition_unfolding,[],[f152,f164]) ).
fof(f224,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f203]) ).
fof(f230,definition,
( spl13_1
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f233,definition,
( spl13_2
<=> ssItem(sK4) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f234,plain,
( ssItem(sK4)
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f235,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f156,f233,f230]) ).
fof(f237,definition,
( spl13_3
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f239,plain,
( spl13_3
| spl13_2 ),
inference(avatar_split_clause,[],[f157,f233,f237]) ).
fof(f241,definition,
( spl13_4
<=> memberP(sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl13_4])],[avatar_definition]) ).
fof(f242,plain,
( memberP(sK3,sK4)
| ~ spl13_4 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f243,plain,
( spl13_1
| spl13_4 ),
inference(avatar_split_clause,[],[f158,f241,f230]) ).
fof(f246,definition,
( spl13_5
<=> sK2 = cons(sK4,nil) ),
introduced(definition,[new_symbols(definition,[spl13_5])],[avatar_definition]) ).
fof(f247,plain,
( sK2 = cons(sK4,nil)
| ~ spl13_5 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f248,plain,
( spl13_1
| spl13_5 ),
inference(avatar_split_clause,[],[f160,f246,f230]) ).
fof(f249,plain,
( spl13_3
| spl13_5 ),
inference(avatar_split_clause,[],[f161,f246,f237]) ).
fof(f250,plain,
( nil != sK2
| spl13_1 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f252,plain,
( ~ spl13_1
| ~ spl13_3 ),
inference(avatar_split_clause,[],[f216,f237,f230]) ).
fof(f253,plain,
( nil != sK2
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl13_5 ),
inference(superposition,[],[f169,f247]) ).
fof(f254,plain,
( nil != sK2
| ~ ssList(nil)
| ~ spl13_2
| ~ spl13_5 ),
inference(forward_subsumption_resolution,[],[f253,f234]) ).
fof(f255,plain,
( nil != sK2
| ~ spl13_2
| ~ spl13_5 ),
inference(forward_subsumption_resolution,[],[f254,f181]) ).
fof(f256,plain,
( ~ spl13_1
| ~ spl13_2
| ~ spl13_5 ),
inference(avatar_split_clause,[],[f255,f246,f233,f230]) ).
fof(f271,plain,
sK2 = app(nil,sK2),
inference(resolution,[],[f212,f218]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(sK2)
| segmentP(app(sK2,X0),sK2) ),
inference(superposition,[],[f224,f271]) ).
fof(f274,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(sK2)
| segmentP(app(sK2,X0),sK2) ),
inference(forward_subsumption_resolution,[],[f273,f181]) ).
fof(f275,plain,
! [X0] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(forward_subsumption_resolution,[],[f274,f218]) ).
fof(f282,plain,
sK3 = app(sK3,nil),
inference(resolution,[],[f204,f217]) ).
fof(f287,plain,
( ! [X0] :
( ~ memberP(X0,sK4)
| app(sK9(X0,sK4),cons(sK4,sK10(X0,sK4))) = X0
| ~ ssList(X0) )
| ~ spl13_2 ),
inference(resolution,[],[f189,f234]) ).
fof(f288,plain,
( sK3 = app(sK9(sK3,sK4),cons(sK4,sK10(sK3,sK4)))
| ~ ssList(sK3)
| ~ spl13_2
| ~ spl13_4 ),
inference(resolution,[],[f287,f242]) ).
fof(f289,plain,
( sK3 = app(sK9(sK3,sK4),cons(sK4,sK10(sK3,sK4)))
| ~ spl13_2
| ~ spl13_4 ),
inference(forward_subsumption_resolution,[],[f288,f217]) ).
fof(f303,plain,
! [X0] :
( ssList(app(sK2,X0))
| ~ ssList(X0) ),
inference(resolution,[],[f214,f218]) ).
fof(f305,plain,
( ! [X0] :
( cons(sK4,X0) = app(cons(sK4,nil),X0)
| ~ ssList(X0) )
| ~ spl13_2 ),
inference(resolution,[],[f209,f234]) ).
fof(f306,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(sK4,X0) = app(sK2,X0) )
| ~ spl13_2
| ~ spl13_5 ),
inference(forward_demodulation,[],[f305,f247]) ).
fof(f312,plain,
( ! [X0] :
( ~ memberP(X0,sK4)
| ssList(sK10(X0,sK4))
| ~ ssList(X0) )
| ~ spl13_2 ),
inference(resolution,[],[f190,f234]) ).
fof(f313,plain,
( ssList(sK10(sK3,sK4))
| ~ ssList(sK3)
| ~ spl13_2
| ~ spl13_4 ),
inference(resolution,[],[f312,f242]) ).
fof(f314,plain,
( ssList(sK10(sK3,sK4))
| ~ spl13_2
| ~ spl13_4 ),
inference(forward_subsumption_resolution,[],[f313,f217]) ).
fof(f315,plain,
( cons(sK4,sK10(sK3,sK4)) = app(sK2,sK10(sK3,sK4))
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(resolution,[],[f314,f306]) ).
fof(f326,plain,
( ! [X0] :
( ~ memberP(X0,sK4)
| ssList(sK9(X0,sK4))
| ~ ssList(X0) )
| ~ spl13_2 ),
inference(resolution,[],[f191,f234]) ).
fof(f330,plain,
( ssList(sK9(sK3,sK4))
| ~ ssList(sK3)
| ~ spl13_2
| ~ spl13_4 ),
inference(resolution,[],[f326,f242]) ).
fof(f331,plain,
( ssList(sK9(sK3,sK4))
| ~ spl13_2
| ~ spl13_4 ),
inference(forward_subsumption_resolution,[],[f330,f217]) ).
fof(f355,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(sK2)
| ~ ssList(app(sK2,X1))
| ~ ssList(X1)
| ~ ssList(app(sK2,X1)) ),
inference(resolution,[],[f196,f275]) ).
fof(f358,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(sK2)
| ~ ssList(app(sK2,X1))
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f355]) ).
fof(f361,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(app(sK2,X1))
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f358,f218]) ).
fof(f363,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f361,f303]) ).
fof(f428,plain,
( sK3 = app(sK9(sK3,sK4),app(sK2,sK10(sK3,sK4)))
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(superposition,[],[f289,f315]) ).
fof(f435,plain,
( ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(X0)
| ~ ssList(sK9(sK3,sK4))
| ~ ssList(sK10(sK3,sK4)) )
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(superposition,[],[f363,f428]) ).
fof(f437,plain,
( ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(X0)
| ~ ssList(sK10(sK3,sK4)) )
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(forward_subsumption_resolution,[],[f435,f331]) ).
fof(f438,plain,
( ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(X0) )
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(forward_subsumption_resolution,[],[f437,f314]) ).
fof(f440,plain,
( segmentP(sK3,sK2)
| ~ ssList(nil)
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(superposition,[],[f438,f282]) ).
fof(f441,plain,
( segmentP(sK3,sK2)
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(forward_subsumption_resolution,[],[f440,f181]) ).
fof(f444,plain,
( ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ segmentP(sK2,sK2)
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(resolution,[],[f441,f215]) ).
fof(f447,plain,
( ~ neq(sK2,nil)
| ~ segmentP(sK2,sK2)
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(forward_subsumption_resolution,[],[f444,f218]) ).
fof(f450,definition,
( spl13_16
<=> segmentP(sK2,sK2) ),
introduced(definition,[new_symbols(definition,[spl13_16])],[avatar_definition]) ).
fof(f451,plain,
( ~ segmentP(sK2,sK2)
| spl13_16 ),
inference(avatar_component_clause,[],[f450]) ).
fof(f453,definition,
( spl13_17
<=> neq(sK2,nil) ),
introduced(definition,[new_symbols(definition,[spl13_17])],[avatar_definition]) ).
fof(f454,plain,
( ~ neq(sK2,nil)
| spl13_17 ),
inference(avatar_component_clause,[],[f453]) ).
fof(f455,plain,
( ~ spl13_16
| ~ spl13_17
| ~ spl13_2
| ~ spl13_4
| ~ spl13_5 ),
inference(avatar_split_clause,[],[f447,f246,f241,f233,f453,f450]) ).
fof(f457,plain,
( ~ ssList(sK2)
| spl13_16 ),
inference(resolution,[],[f451,f197]) ).
fof(f459,plain,
( $false
| spl13_16 ),
inference(forward_subsumption_resolution,[],[f457,f218]) ).
fof(f460,plain,
spl13_16,
inference(avatar_contradiction_clause,[],[f459]) ).
fof(f463,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl13_17 ),
inference(resolution,[],[f454,f178]) ).
fof(f465,plain,
( ~ ssList(nil)
| ~ ssList(sK2)
| spl13_1
| spl13_17 ),
inference(forward_subsumption_resolution,[],[f463,f250]) ).
fof(f467,plain,
( ~ ssList(sK2)
| spl13_1
| spl13_17 ),
inference(forward_subsumption_resolution,[],[f465,f181]) ).
fof(f475,plain,
( $false
| spl13_1
| spl13_17 ),
inference(forward_subsumption_resolution,[],[f467,f218]) ).
fof(f476,plain,
( spl13_1
| spl13_17 ),
inference(avatar_contradiction_clause,[],[f475]) ).
cnf(s1,plain,
( spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f235]) ).
cnf(s2,plain,
( spl13_2
| spl13_3 ),
inference(sat_conversion,[],[f239]) ).
cnf(s3,plain,
( spl13_1
| spl13_4 ),
inference(sat_conversion,[],[f243]) ).
cnf(s5,plain,
( spl13_1
| spl13_5 ),
inference(sat_conversion,[],[f248]) ).
cnf(s6,plain,
( spl13_3
| spl13_5 ),
inference(sat_conversion,[],[f249]) ).
cnf(s7,plain,
( ~ spl13_1
| ~ spl13_3 ),
inference(sat_conversion,[],[f252]) ).
cnf(s8,plain,
( ~ spl13_1
| ~ spl13_2
| ~ spl13_5 ),
inference(sat_conversion,[],[f256]) ).
cnf(s21,plain,
( ~ spl13_2
| ~ spl13_4
| ~ spl13_5
| ~ spl13_16
| ~ spl13_17 ),
inference(sat_conversion,[],[f455]) ).
cnf(s23,plain,
spl13_16,
inference(sat_conversion,[],[f460]) ).
cnf(s26,plain,
( spl13_1
| spl13_17 ),
inference(sat_conversion,[],[f476]) ).
cnf(s27,plain,
( ~ spl13_2
| ~ spl13_4
| ~ spl13_5
| ~ spl13_17 ),
inference(rat,[],[s21,s23]) ).
cnf(s28,plain,
spl13_1,
inference(rat,[],[s27,s1,s3,s5,s26]) ).
cnf(s29,plain,
~ spl13_3,
inference(rat,[],[s7,s28]) ).
cnf(s30,plain,
spl13_5,
inference(rat,[],[s6,s29]) ).
cnf(s32,plain,
spl13_2,
inference(rat,[],[s2,s29]) ).
cnf(s33,plain,
$false,
inference(rat,[],[s8,s28,s30,s32]) ).
fof(f477,plain,
$false,
inference(avatar_sat_refutation,[],[s33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC078+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 07:45:06 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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
% 6.67/1.96 % (1007473)Detected formulas, will run a generic FOF schedule.
% 6.67/1.96 % (1007500)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1381737925:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.67/1.96 % (1007500)Instruction limit reached!
% 6.67/1.96 % (1007500)------------------------------
% 6.67/1.96 % (1007500)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007500)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007500)Termination reason: Instruction limit
% 6.67/1.96 % (1007500)Termination phase: Saturation
% 6.67/1.96 % (1007500)Time elapsed: 0.039 s
% 6.67/1.96 % (1007500)Peak memory usage: 89 MB
% 6.67/1.96 % (1007500)Instructions burned: 120 (million)
% 6.67/1.96 % (1007498)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=4208195539:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.67/1.96 % (1007496)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=2876328430:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.67/1.96 % (1007499)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=508972510:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.67/1.96 % (1007497)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=3335243032:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.67/1.96 % (1007502)dis-21_1_sil=8000:lcm=predicate:random_seed=4234324788: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)
% 6.67/1.96 % (1007501)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=778275072:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.67/1.96 % (1007499)Refutation not found, incomplete strategy
% 6.67/1.96 % (1007499)------------------------------
% 6.67/1.96 % (1007499)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007499)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007499)Termination reason: Refutation not found, incomplete strategy
% 6.67/1.96 % (1007499)Time elapsed: 0.004 s
% 6.67/1.96 % (1007499)Peak memory usage: 88 MB
% 6.67/1.96 % (1007499)Instructions burned: 5 (million)
% 6.67/1.96 % (1007502)Instruction limit reached!
% 6.67/1.96 % (1007502)------------------------------
% 6.67/1.96 % (1007502)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007502)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007502)Termination reason: Instruction limit
% 6.67/1.96 % (1007502)Termination phase: Saturation
% 6.67/1.96 % (1007502)Time elapsed: 0.076 s
% 6.67/1.96 % (1007502)Peak memory usage: 90 MB
% 6.67/1.96 % (1007502)Instructions burned: 130 (million)
% 6.67/1.96 % (1007501)Instruction limit reached!
% 6.67/1.96 % (1007501)------------------------------
% 6.67/1.96 % (1007501)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007501)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007501)Termination reason: Instruction limit
% 6.67/1.96 % (1007501)Termination phase: Saturation
% 6.67/1.96 % (1007501)Time elapsed: 0.095 s
% 6.67/1.96 % (1007501)Peak memory usage: 90 MB
% 6.67/1.96 % (1007501)Instructions burned: 139 (million)
% 6.67/1.96 % (1007510)lrs+10_1_sil=8000:sp=occurrence:random_seed=363979544:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.67/1.96 % (1007510)Instruction limit reached!
% 6.67/1.96 % (1007510)------------------------------
% 6.67/1.96 % (1007510)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007510)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007510)Termination reason: Instruction limit
% 6.67/1.96 % (1007510)Termination phase: Saturation
% 6.67/1.96 % (1007510)Time elapsed: 0.095 s
% 6.67/1.96 % (1007510)Peak memory usage: 93 MB
% 6.67/1.96 % (1007510)Instructions burned: 287 (million)
% 6.67/1.96 % (1007511)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4030513635:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.67/1.96 % (1007499)------------------------------
% 6.67/1.96 % (1007499)------------------------------
% 6.67/1.96 % (1007512)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2700483776:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.67/1.96 % (1007511)Instruction limit reached!
% 6.67/1.96 % (1007511)------------------------------
% 6.67/1.96 % (1007511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007511)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007511)Termination reason: Instruction limit
% 6.67/1.96 % (1007511)Termination phase: Saturation
% 6.67/1.96 % (1007511)Time elapsed: 0.078 s
% 6.67/1.96 % (1007511)Peak memory usage: 91 MB
% 6.67/1.96 % (1007511)Instructions burned: 159 (million)
% 6.67/1.96 % (1007515)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=4290132722:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 6.67/1.96 % (1007516)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2977764844:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.67/1.96 % (1007515)Instruction limit reached!
% 6.67/1.96 % (1007515)------------------------------
% 6.67/1.96 % (1007515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007515)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007515)Termination reason: Instruction limit
% 6.67/1.96 % (1007515)Termination phase: Saturation
% 6.67/1.96 % (1007515)Time elapsed: 0.064 s
% 6.67/1.96 % (1007515)Peak memory usage: 93 MB
% 6.67/1.96 % (1007515)Instructions burned: 250 (million)
% 6.67/1.96 % (1007512)Instruction limit reached!
% 6.67/1.96 % (1007512)------------------------------
% 6.67/1.96 % (1007512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007512)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007512)Termination reason: Instruction limit
% 6.67/1.96 % (1007512)Termination phase: Saturation
% 6.67/1.96 % (1007512)Time elapsed: 0.203 s
% 6.67/1.96 % (1007512)Peak memory usage: 92 MB
% 6.67/1.96 % (1007512)Instructions burned: 326 (million)
% 6.67/1.96 % (1007518)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=4194697236:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.67/1.96 % (1007521)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1065988301:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 6.67/1.96 % (1007521)Instruction limit reached!
% 6.67/1.96 % (1007521)------------------------------
% 6.67/1.96 % (1007521)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007521)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007521)Termination reason: Instruction limit
% 6.67/1.96 % (1007521)Termination phase: Saturation
% 6.67/1.96 % (1007521)Time elapsed: 0.043 s
% 6.67/1.96 % (1007521)Peak memory usage: 90 MB
% 6.67/1.96 % (1007521)Instructions burned: 116 (million)
% 6.67/1.96 % (1007516)Instruction limit reached!
% 6.67/1.96 % (1007516)------------------------------
% 6.67/1.96 % (1007516)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007516)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007516)Termination reason: Instruction limit
% 6.67/1.96 % (1007516)Termination phase: Saturation
% 6.67/1.96 % (1007516)Time elapsed: 0.184 s
% 6.67/1.96 % (1007516)Peak memory usage: 90 MB
% 6.67/1.96 % (1007516)Instructions burned: 294 (million)
% 6.67/1.96 % (1007522)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1247815443:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 6.67/1.96 % (1007497)First to succeed.
% 6.67/1.96 % (1007497)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1007473"
% 6.67/1.96 % (1007496)Also succeeded, but the first one will report.
% 6.67/1.96 % (1007522)Instruction limit reached!
% 6.67/1.96 % (1007522)------------------------------
% 6.67/1.96 % (1007522)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007522)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007522)Termination reason: Instruction limit
% 6.67/1.96 % (1007522)Termination phase: Saturation
% 6.67/1.96 % (1007522)Time elapsed: 0.063 s
% 6.67/1.96 % (1007522)Peak memory usage: 89 MB
% 6.67/1.96 % (1007522)Instructions burned: 128 (million)
% 6.67/1.96 % (1007525)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=4062012830:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 6.67/1.96 % (1007526)lrs+10_1_sil=8000:sp=occurrence:random_seed=765996868:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 6.67/1.96 % (1007525)Instruction limit reached!
% 6.67/1.96 % (1007525)------------------------------
% 6.67/1.96 % (1007525)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.67/1.96 % (1007525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.96 % (1007525)CaDiCaL version: 2.1.3
% 6.67/1.96 % (1007525)Termination reason: Instruction limit
% 6.67/1.96 % (1007525)Termination phase: Saturation
% 6.67/1.96 % (1007525)Time elapsed: 0.069 s
% 6.67/1.96 % (1007525)Peak memory usage: 90 MB
% 6.67/1.96 % (1007525)Instructions burned: 116 (million)
% 6.67/1.96 % (1007528)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1763003198:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 6.67/1.96 % (1007497)Refutation found. Thanks to Tanya!
% 6.67/1.96 % SZS status Theorem for theBenchmark
% 6.67/1.96 % SZS output start Proof for theBenchmark
% See solution above
% 8.37/2.16 % (1007497)------------------------------
% 8.37/2.16 % (1007497)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.37/2.16 % (1007497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.37/2.16 % (1007497)CaDiCaL version: 2.1.3
% 8.37/2.16 % (1007497)Termination reason: Refutation
% 8.37/2.16 % (1007497)Time elapsed: 0.668 s
% 8.37/2.16 % (1007497)Peak memory usage: 128 MB
% 8.37/2.16 % (1007497)Instructions burned: 982 (million)
% 8.37/2.16 % (1007497)------------------------------
% 8.37/2.16 % (1007497)------------------------------
% 8.37/2.16 % (1007473)Success in time 1.103 s
% 8.37/2.16 % Vampire exiting
%------------------------------------------------------------------------------