%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC063+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 : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:02:16 PM UTC 2026
% Result : Theorem 2.20s 1.40s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 63
% Number of leaves : 16
% Syntax : Number of formulae : 204 ( 20 unt; 0 def)
% Number of atoms : 756 ( 239 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 1003 ( 451 ~; 449 |; 58 &)
% ( 6 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 205 ( 189 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
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(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
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(f27,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,app(X1,X0)) = app(cons(X2,X1),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax27) ).
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(f79,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X2,X1) = app(X0,X1)
=> X2 = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
fof(f80,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X1,X2) = app(X1,X0)
=> X2 = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax80) ).
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(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
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
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X2
| app(X5,cons(X4,nil)) != X3 ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X1,X6)
& segmentP(X0,X6) ) ) ) ) ) ) ),
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
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X2
| app(X5,cons(X4,nil)) != X3 ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X1,X6)
& segmentP(X0,X6) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& app(cons(X4,nil),X5) = X2
& app(X5,cons(X4,nil)) = X3 )
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(X1,X6)
| ~ segmentP(X0,X6) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f106,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X1,X2) != app(X1,X0)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f80]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X1,X2) != app(X1,X0)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f112]) ).
fof(f114,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f115,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f123,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f128,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(f129,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& ( nil = sK2
| nil != sK3 )
& ( ( ssList(sK5)
& sK2 = app(cons(sK4,nil),sK5)
& sK3 = app(sK5,cons(sK4,nil))
& ssItem(sK4) )
| ~ neq(sK3,nil) )
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(sK1,X6)
| ~ segmentP(sK0,X6) ) ) )
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f98]) ).
fof(f132,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,[],[f107]) ).
fof(f133,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,[],[f132]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f137,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,[],[f128]) ).
fof(f138,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,[],[f137]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK10(X0,X1))
& ssList(sK11(X0,X1))
& app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X4,sK10(X0,X1)),skolemize(X5,sK11(X0,X1))],[f138]) ).
fof(f142,plain,
ssList(sK2),
inference(cnf_transformation,[],[f129]) ).
fof(f144,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f145,plain,
! [X6] :
( nil = sK1
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(sK1,X6)
| ~ segmentP(sK0,X6) ),
inference(cnf_transformation,[],[f129]) ).
fof(f146,plain,
( nil = sK1
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f147,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f148,plain,
( sK3 = app(sK5,cons(sK4,nil))
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f149,plain,
( sK2 = app(cons(sK4,nil),sK5)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f150,plain,
( ~ neq(sK3,nil)
| ssList(sK5) ),
inference(cnf_transformation,[],[f129]) ).
fof(f151,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f129]) ).
fof(f152,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f129]) ).
fof(f153,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f154,plain,
ssList(sK3),
inference(cnf_transformation,[],[f129]) ).
fof(f158,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f165,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f166,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f168,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f170,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f171,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f172,plain,
! [X2,X0,X1] :
( app(X1,X2) != app(X1,X0)
| X0 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f173,plain,
! [X2,X0,X1] :
( app(X2,X1) != app(X0,X1)
| X0 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f174,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f175,plain,
! [X2,X0,X1] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f176,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f178,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f181,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f186,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f192,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,[],[f139]) ).
fof(f193,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f146,f153,f153]) ).
fof(f194,plain,
! [X6] :
( ~ segmentP(sK3,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| nil = sK3
| ~ segmentP(sK2,X6) ),
inference(definition_unfolding,[],[f145,f153,f153,f152]) ).
fof(f195,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f144,f152,f153]) ).
fof(f204,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f192]) ).
fof(f208,plain,
( nil = sK3
| ssList(sK5) ),
inference(resolution,[],[f193,f150]) ).
fof(f210,plain,
( sK2 != sK3
| neq(sK3,sK3)
| ssList(sK5) ),
inference(superposition,[],[f195,f208]) ).
fof(f211,plain,
( sK3 != sK3
| sK2 = sK3
| ssList(sK5) ),
inference(superposition,[],[f151,f208]) ).
fof(f212,plain,
( ~ neq(sK3,sK3)
| ssList(sK5)
| ssList(sK5) ),
inference(superposition,[],[f150,f208]) ).
fof(f214,plain,
( ~ neq(sK3,sK3)
| ssList(sK5) ),
inference(duplicate_literal_removal,[],[f212]) ).
fof(f215,plain,
( sK2 = sK3
| ssList(sK5) ),
inference(trivial_inequality_removal,[],[f211]) ).
fof(f293,plain,
( neq(sK3,sK3)
| ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f210,f215]) ).
fof(f294,plain,
ssList(sK5),
inference(forward_subsumption_resolution,[],[f293,f214]) ).
fof(f385,plain,
( sK2 = cons(sK4,sK5)
| ~ neq(sK3,nil)
| ~ ssItem(sK4)
| ~ ssList(sK5) ),
inference(superposition,[],[f149,f171]) ).
fof(f392,plain,
( sK2 = cons(sK4,sK5)
| ~ neq(sK3,nil)
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f385,f147]) ).
fof(f394,plain,
( sK2 = cons(sK4,sK5)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f392,f150]) ).
fof(f397,plain,
( nil != sK2
| ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ neq(sK3,nil) ),
inference(superposition,[],[f158,f394]) ).
fof(f399,plain,
( nil != sK2
| ~ ssList(sK5)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f397,f147]) ).
fof(f401,plain,
( nil != sK2
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f399,f150]) ).
fof(f403,plain,
nil != sK2,
inference(forward_subsumption_resolution,[],[f401,f195]) ).
fof(f437,plain,
! [X0,X1] :
( app(X0,X1) != X0
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(superposition,[],[f172,f166]) ).
fof(f446,plain,
! [X0,X1] :
( app(X0,X1) != X0
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f437]) ).
fof(f453,plain,
! [X0,X1] :
( app(X0,X1) != X0
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f446,f181]) ).
fof(f487,plain,
! [X0,X1] :
( app(X1,X0) != X0
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(superposition,[],[f173,f174]) ).
fof(f491,plain,
! [X0,X1] :
( app(X1,X0) != X0
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f487]) ).
fof(f498,plain,
! [X0,X1] :
( app(X1,X0) != X0
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f491,f181]) ).
fof(f520,plain,
! [X0,X1] :
( app(X0,X1) = app(nil,app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(superposition,[],[f170,f174]) ).
fof(f521,plain,
! [X0] :
( app(sK3,X0) = app(sK5,app(cons(sK4,nil),X0))
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ neq(sK3,nil) ),
inference(superposition,[],[f170,f148]) ).
fof(f525,plain,
! [X2,X0,X1] :
( nil != app(X0,app(X1,X2))
| nil = X2
| ~ ssList(X2)
| ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f168,f170]) ).
fof(f536,plain,
! [X2,X0,X1] :
( nil != app(X0,app(X1,X2))
| nil = X2
| ~ ssList(X2)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f525]) ).
fof(f538,plain,
! [X0,X1] :
( app(X0,X1) = app(nil,app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f520]) ).
fof(f547,plain,
! [X2,X0,X1] :
( nil != app(X0,app(X1,X2))
| nil = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f536,f176]) ).
fof(f551,plain,
! [X0] :
( app(sK3,X0) = app(sK5,app(cons(sK4,nil),X0))
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil))
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f521,f150]) ).
fof(f552,plain,
! [X0,X1] :
( app(X0,X1) = app(nil,app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f538,f181]) ).
fof(f559,plain,
! [X0] :
( app(sK2,X0) = cons(sK4,app(sK5,X0))
| ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ ssList(X0)
| ~ neq(sK3,nil) ),
inference(superposition,[],[f175,f394]) ).
fof(f563,plain,
( sK2 = cons(sK4,app(nil,sK5))
| ~ neq(sK3,nil)
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ ssList(sK5) ),
inference(superposition,[],[f149,f175]) ).
fof(f594,plain,
( sK2 = cons(sK4,app(nil,sK5))
| ~ neq(sK3,nil)
| ~ ssList(nil)
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f563,f147]) ).
fof(f598,plain,
! [X0] :
( app(sK2,X0) = cons(sK4,app(sK5,X0))
| ~ ssList(sK5)
| ~ ssList(X0)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f559,f147]) ).
fof(f602,plain,
( sK2 = cons(sK4,app(nil,sK5))
| ~ neq(sK3,nil)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f594,f150]) ).
fof(f605,plain,
! [X0] :
( app(sK2,X0) = cons(sK4,app(sK5,X0))
| ~ ssList(X0)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f598,f150]) ).
fof(f607,plain,
( sK2 = cons(sK4,app(nil,sK5))
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f602,f181]) ).
fof(f684,plain,
( cons(sK4,sK5) = app(sK2,nil)
| ~ ssList(nil)
| ~ neq(sK3,nil)
| ~ ssList(sK5) ),
inference(superposition,[],[f605,f166]) ).
fof(f702,plain,
( cons(sK4,sK5) = app(sK2,nil)
| ~ ssList(nil)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f684,f150]) ).
fof(f703,plain,
( cons(sK4,sK5) = app(sK2,nil)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f702,f181]) ).
fof(f744,plain,
( ssList(cons(sK4,sK5))
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ neq(sK3,nil) ),
inference(superposition,[],[f176,f703]) ).
fof(f747,plain,
( ssList(cons(sK4,sK5))
| ~ ssList(sK2)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f744,f181]) ).
fof(f755,plain,
( ssList(cons(sK4,sK5))
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f747,f142]) ).
fof(f765,plain,
! [X0] :
( segmentP(app(sK2,X0),sK5)
| ~ ssList(cons(sK4,nil))
| ~ ssList(X0)
| ~ ssList(sK5)
| ~ ssList(app(sK2,X0))
| ~ neq(sK3,nil) ),
inference(superposition,[],[f204,f149]) ).
fof(f770,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0) ),
inference(superposition,[],[f204,f174]) ).
fof(f775,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(app(X0,X1))
| ~ ssList(app(X0,X1)) ),
inference(superposition,[],[f204,f166]) ).
fof(f776,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(app(X0,X1)) ),
inference(duplicate_literal_removal,[],[f775]) ).
fof(f779,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(duplicate_literal_removal,[],[f770]) ).
fof(f785,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f776,f181]) ).
fof(f787,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f779,f181]) ).
fof(f791,plain,
! [X0] :
( segmentP(app(sK2,X0),sK5)
| ~ ssList(cons(sK4,nil))
| ~ ssList(X0)
| ~ ssList(app(sK2,X0))
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f765,f150]) ).
fof(f792,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f785,f176]) ).
fof(f793,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f787,f176]) ).
fof(f808,plain,
( segmentP(sK2,sK5)
| ~ ssList(cons(sK4,nil))
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ neq(sK3,nil)
| ~ ssList(sK2) ),
inference(superposition,[],[f791,f166]) ).
fof(f809,plain,
( segmentP(sK2,sK5)
| ~ ssList(cons(sK4,nil))
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f808]) ).
fof(f812,plain,
( segmentP(sK2,sK5)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK2)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f809,f181]) ).
fof(f815,plain,
( ~ ssList(cons(sK4,nil))
| segmentP(sK2,sK5)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f812,f142]) ).
fof(f817,plain,
( segmentP(sK2,sK5)
| ~ neq(sK3,nil)
| ~ ssItem(sK4)
| ~ ssList(nil) ),
inference(resolution,[],[f815,f165]) ).
fof(f820,plain,
( segmentP(sK2,sK5)
| ~ neq(sK3,nil)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f817,f147]) ).
fof(f821,plain,
( segmentP(sK2,sK5)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f820,f181]) ).
fof(f1045,plain,
( app(sK3,sK5) = app(sK5,sK2)
| ~ ssList(sK5)
| ~ ssList(cons(sK4,nil))
| ~ neq(sK3,nil)
| ~ neq(sK3,nil) ),
inference(superposition,[],[f551,f149]) ).
fof(f1066,plain,
( app(sK3,sK5) = app(sK5,sK2)
| ~ ssList(sK5)
| ~ ssList(cons(sK4,nil))
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f1045]) ).
fof(f1082,plain,
( app(sK3,sK5) = app(sK5,sK2)
| ~ ssList(cons(sK4,nil))
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f1066,f150]) ).
fof(f1275,plain,
( segmentP(sK3,sK5)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ neq(sK3,nil) ),
inference(superposition,[],[f793,f148]) ).
fof(f1285,plain,
( ~ ssList(cons(sK4,nil))
| segmentP(sK3,sK5)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f1275,f150]) ).
fof(f1349,plain,
( segmentP(sK3,sK5)
| ~ neq(sK3,nil)
| ~ ssItem(sK4)
| ~ ssList(nil) ),
inference(resolution,[],[f1285,f165]) ).
fof(f1352,plain,
( segmentP(sK3,sK5)
| ~ neq(sK3,nil)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f1349,f147]) ).
fof(f1353,plain,
( segmentP(sK3,sK5)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f1352,f181]) ).
fof(f1355,plain,
( ~ neq(sK3,nil)
| ~ ssList(sK5)
| ~ neq(sK5,nil)
| nil = sK3
| ~ segmentP(sK2,sK5) ),
inference(resolution,[],[f1353,f194]) ).
fof(f1360,plain,
( ~ neq(sK3,nil)
| ~ neq(sK5,nil)
| nil = sK3
| ~ segmentP(sK2,sK5) ),
inference(forward_subsumption_resolution,[],[f1355,f150]) ).
fof(f1363,plain,
( ~ neq(sK3,nil)
| ~ neq(sK5,nil)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f1360,f821]) ).
fof(f1365,plain,
( ~ neq(sK5,nil)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f1363,f193]) ).
fof(f1367,plain,
( nil = sK3
| nil = sK5
| ~ ssList(nil)
| ~ ssList(sK5) ),
inference(resolution,[],[f1365,f178]) ).
fof(f1368,plain,
( nil = sK3
| nil = sK5
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f1367,f208]) ).
fof(f1369,plain,
( nil = sK5
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f1368,f181]) ).
fof(f1375,plain,
! [X0] :
( app(X0,sK5) = X0
| ~ ssList(X0)
| nil = sK3 ),
inference(superposition,[],[f166,f1369]) ).
fof(f1975,plain,
( sK2 = cons(sK4,nil)
| ~ neq(sK3,nil)
| ~ ssList(nil)
| nil = sK3 ),
inference(superposition,[],[f607,f1375]) ).
fof(f2032,plain,
( sK2 = cons(sK4,nil)
| ~ ssList(nil)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f1975,f193]) ).
fof(f2067,plain,
( sK2 = cons(sK4,nil)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f2032,f181]) ).
fof(f2115,plain,
( sK3 = app(sK5,sK2)
| ~ neq(sK3,nil)
| nil = sK3 ),
inference(superposition,[],[f148,f2067]) ).
fof(f2116,plain,
( sK2 = app(sK2,sK5)
| ~ neq(sK3,nil)
| nil = sK3 ),
inference(superposition,[],[f149,f2067]) ).
fof(f2151,plain,
( sK2 = app(sK2,sK5)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f2116,f193]) ).
fof(f2152,plain,
( sK3 = app(sK5,sK2)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f2115,f193]) ).
fof(f2193,plain,
( sK2 != sK5
| nil = sK2
| ~ ssList(sK2)
| ~ ssList(sK5)
| nil = sK3 ),
inference(superposition,[],[f498,f2151]) ).
fof(f2205,plain,
( sK2 != sK5
| nil = sK2
| ~ ssList(sK2)
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f2193,f151]) ).
fof(f2213,plain,
( sK2 != sK5
| ~ ssList(sK2)
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f2205,f403]) ).
fof(f2221,plain,
( sK2 != sK5
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f2213,f142]) ).
fof(f2222,plain,
sK2 != sK5,
inference(forward_subsumption_resolution,[],[f2221,f294]) ).
fof(f2333,plain,
( sK3 != sK5
| nil = sK2
| ~ ssList(sK2)
| ~ ssList(sK5)
| nil = sK3 ),
inference(superposition,[],[f453,f2152]) ).
fof(f2336,plain,
( sK3 = app(nil,sK3)
| ~ ssList(sK2)
| ~ ssList(sK5)
| nil = sK3 ),
inference(superposition,[],[f552,f2152]) ).
fof(f2350,plain,
( sK3 = app(nil,sK3)
| ~ ssList(sK2)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f2336,f208]) ).
fof(f2352,plain,
( sK3 != sK5
| nil = sK2
| ~ ssList(sK2)
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f2333,f151]) ).
fof(f2367,plain,
( sK3 = app(nil,sK3)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f2350,f142]) ).
fof(f2369,plain,
( sK3 != sK5
| ~ ssList(sK2)
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f2352,f403]) ).
fof(f2379,plain,
( sK3 != sK5
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f2369,f142]) ).
fof(f2380,plain,
sK3 != sK5,
inference(forward_subsumption_resolution,[],[f2379,f294]) ).
fof(f2529,plain,
! [X0] :
( nil != app(X0,sK3)
| nil = sK2
| ~ ssList(sK2)
| ~ ssList(sK5)
| ~ ssList(X0)
| nil = sK3 ),
inference(superposition,[],[f547,f2152]) ).
fof(f2554,plain,
! [X0] :
( nil != app(X0,sK3)
| nil = sK2
| ~ ssList(sK2)
| ~ ssList(sK5)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2529,f151]) ).
fof(f2563,plain,
! [X0] :
( nil != app(X0,sK3)
| ~ ssList(sK2)
| ~ ssList(sK5)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2554,f403]) ).
fof(f2566,plain,
! [X0] :
( nil != app(X0,sK3)
| ~ ssList(sK5)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2563,f142]) ).
fof(f2567,plain,
! [X0] :
( nil != app(X0,sK3)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2566,f294]) ).
fof(f2573,plain,
( nil != sK3
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(superposition,[],[f2567,f174]) ).
fof(f2574,plain,
( nil != sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f2573,f181]) ).
fof(f2576,plain,
nil != sK3,
inference(forward_subsumption_resolution,[],[f2574,f154]) ).
fof(f2583,plain,
sK3 = app(nil,sK3),
inference(forward_subsumption_resolution,[],[f2367,f2576]) ).
fof(f2667,plain,
( sK3 = app(sK5,sK3)
| nil = sK3 ),
inference(superposition,[],[f2583,f1369]) ).
fof(f2696,plain,
sK3 = app(sK5,sK3),
inference(forward_subsumption_resolution,[],[f2667,f2576]) ).
fof(f2786,plain,
( sK3 != sK3
| nil = sK5
| ~ ssList(sK5)
| ~ ssList(sK3) ),
inference(superposition,[],[f498,f2696]) ).
fof(f2798,plain,
( nil = sK5
| ~ ssList(sK5)
| ~ ssList(sK3) ),
inference(trivial_inequality_removal,[],[f2786]) ).
fof(f2805,plain,
( nil = sK5
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f2798,f294]) ).
fof(f2818,plain,
nil = sK5,
inference(forward_subsumption_resolution,[],[f2805,f154]) ).
fof(f2886,plain,
! [X0] :
( app(X0,sK5) = X0
| ~ ssList(X0) ),
inference(superposition,[],[f166,f2818]) ).
fof(f2892,plain,
( neq(sK3,sK5)
| sK3 = sK5 ),
inference(superposition,[],[f193,f2818]) ).
fof(f2951,plain,
neq(sK3,sK5),
inference(forward_subsumption_resolution,[],[f2892,f2380]) ).
fof(f3370,plain,
( sK3 = app(sK5,sK2)
| ~ ssList(cons(sK4,nil))
| ~ neq(sK3,nil)
| ~ ssList(sK3) ),
inference(superposition,[],[f1082,f2886]) ).
fof(f3418,plain,
( sK3 = app(sK5,sK2)
| ~ ssList(cons(sK4,nil))
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f3370,f154]) ).
fof(f3449,plain,
( ~ ssList(cons(sK4,sK5))
| sK3 = app(sK5,sK2)
| ~ neq(sK3,nil) ),
inference(forward_demodulation,[],[f3418,f2818]) ).
fof(f3467,plain,
( sK3 = app(sK5,sK2)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f3449,f755]) ).
fof(f3474,plain,
( ~ neq(sK3,sK5)
| sK3 = app(sK5,sK2) ),
inference(forward_demodulation,[],[f3467,f2818]) ).
fof(f3478,plain,
sK3 = app(sK5,sK2),
inference(forward_subsumption_resolution,[],[f3474,f2951]) ).
fof(f3707,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK5)
| ~ ssList(sK2) ),
inference(superposition,[],[f792,f3478]) ).
fof(f3712,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f3707,f294]) ).
fof(f3731,plain,
segmentP(sK3,sK2),
inference(forward_subsumption_resolution,[],[f3712,f142]) ).
fof(f3760,plain,
( ~ ssList(sK2)
| ~ neq(sK2,nil)
| nil = sK3
| ~ segmentP(sK2,sK2) ),
inference(resolution,[],[f3731,f194]) ).
fof(f3768,plain,
( ~ neq(sK2,nil)
| nil = sK3
| ~ segmentP(sK2,sK2) ),
inference(forward_subsumption_resolution,[],[f3760,f142]) ).
fof(f3772,plain,
( ~ neq(sK2,nil)
| ~ segmentP(sK2,sK2) ),
inference(forward_subsumption_resolution,[],[f3768,f2576]) ).
fof(f3774,plain,
( ~ segmentP(sK2,sK2)
| ~ neq(sK2,sK5) ),
inference(forward_demodulation,[],[f3772,f2818]) ).
fof(f3870,plain,
( ~ neq(sK2,sK5)
| ~ ssList(sK2) ),
inference(resolution,[],[f3774,f186]) ).
fof(f3874,plain,
~ neq(sK2,sK5),
inference(forward_subsumption_resolution,[],[f3870,f142]) ).
fof(f3880,plain,
( sK2 = sK5
| ~ ssList(sK5)
| ~ ssList(sK2) ),
inference(resolution,[],[f3874,f178]) ).
fof(f3881,plain,
( ~ ssList(sK5)
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f3880,f2222]) ).
fof(f3883,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f3881,f294]) ).
fof(f3884,plain,
$false,
inference(forward_subsumption_resolution,[],[f3883,f142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC063+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 % Computer : n011.cluster.edu
% 0.10/0.42 % Model : x86_64 x86_64
% 0.10/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.42 % Memory : 8046.5625MB
% 0.10/0.42 % OS : Linux 6.8.0-71-generic
% 0.10/0.42 % CPULimit : 300
% 0.10/0.42 % WCLimit : 300
% 0.10/0.42 % DateTime : Mon Sep 28 07:40:31 UTC 2026
% 0.10/0.42 % CPUTime :
% 0.10/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.45 Running first-order theorem proving
% 0.10/0.45 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
% 2.20/1.40 % (3232797)Detected formulas, will run a generic FOF schedule.
% 2.20/1.40 % (3232805)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3619074505:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.20/1.40 % (3232803)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=4029316247:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.20/1.40 % (3232802)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=862405284:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.20/1.40 % (3232804)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=3723735711:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.20/1.40 % (3232805)Instruction limit reached!
% 2.20/1.40 % (3232805)------------------------------
% 2.20/1.40 % (3232805)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.20/1.40 % (3232805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/1.40 % (3232805)CaDiCaL version: 2.1.3
% 2.20/1.40 % (3232805)Termination reason: Instruction limit
% 2.20/1.40 % (3232805)Termination phase: Saturation
% 2.20/1.40 % (3232805)Time elapsed: 0.040 s
% 2.20/1.40 % (3232805)Peak memory usage: 89 MB
% 2.20/1.40 % (3232805)Instructions burned: 110 (million)
% 2.20/1.40 % (3232808)dis-21_1_sil=8000:lcm=predicate:random_seed=2571464164: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)
% 2.20/1.40 % (3232807)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3864473691:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.20/1.40 % (3232806)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2584080415:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.20/1.40 % (3232806)First to succeed.
% 2.20/1.40 % (3232806)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3232797"
% 2.20/1.40 % (3232807)Also succeeded, but the first one will report.
% 2.20/1.40 % (3232808)Instruction limit reached!
% 2.20/1.40 % (3232808)------------------------------
% 2.20/1.40 % (3232808)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.20/1.40 % (3232808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/1.40 % (3232808)CaDiCaL version: 2.1.3
% 2.20/1.40 % (3232808)Termination reason: Instruction limit
% 2.20/1.40 % (3232808)Termination phase: Saturation
% 2.20/1.40 % (3232808)Time elapsed: 0.077 s
% 2.20/1.40 % (3232808)Peak memory usage: 90 MB
% 2.20/1.40 % (3232808)Instructions burned: 131 (million)
% 2.20/1.40 % (3232816)lrs+10_1_sil=8000:sp=occurrence:random_seed=90967872:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.20/1.40 % (3232816)Also succeeded, but the first one will report.
% 2.20/1.40 % (3232817)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1139799508:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.20/1.40 % (3232817)Instruction limit reached!
% 2.20/1.40 % (3232817)------------------------------
% 2.20/1.40 % (3232817)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.20/1.40 % (3232817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/1.40 % (3232817)CaDiCaL version: 2.1.3
% 2.20/1.40 % (3232817)Termination reason: Instruction limit
% 2.20/1.40 % (3232817)Termination phase: Saturation
% 2.20/1.40 % (3232817)Time elapsed: 0.078 s
% 2.20/1.40 % (3232817)Peak memory usage: 92 MB
% 2.20/1.40 % (3232817)Instructions burned: 159 (million)
% 2.20/1.40 % (3232806)Refutation found. Thanks to Tanya!
% 2.20/1.40 % SZS status Theorem for theBenchmark
% 2.20/1.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.60 % (3232806)------------------------------
% 0.16/1.60 % (3232806)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.60 % (3232806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.60 % (3232806)CaDiCaL version: 2.1.3
% 0.16/1.60 % (3232806)Termination reason: Refutation
% 0.16/1.60 % (3232806)Time elapsed: 0.067 s
% 0.16/1.60 % (3232806)Peak memory usage: 89 MB
% 0.16/1.60 % (3232806)Instructions burned: 114 (million)
% 0.16/1.60 % (3232806)------------------------------
% 0.16/1.60 % (3232806)------------------------------
% 0.16/1.60 % (3232797)Success in time 0.503 s
% 0.16/1.60 % Vampire exiting
%------------------------------------------------------------------------------