%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC418+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 : n018.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:03:54 PM UTC 2026
% Result : Theorem 2.99s 1.12s
% Output : Refutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 11
% Syntax : Number of formulae : 80 ( 11 unt; 0 def)
% Number of atoms : 426 ( 141 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 620 ( 274 ~; 260 |; 60 &)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 127 ( 105 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
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(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ( nil != X2
& nil = X3 )
| ( ? [X7] :
( ssList(X7)
& X2 != X7
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& tl(X3) = X8
& app(X8,X9) = X7
& ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X9
& hd(X3) = X10
& neq(nil,X3) )
& neq(nil,X3) ) ) )
& neq(X3,nil) ) ) ) ) ) ),
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
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ( nil != X2
& nil = X3 )
| ( ? [X7] :
( ssList(X7)
& X2 != X7
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& tl(X3) = X8
& app(X8,X9) = X7
& ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X9
& hd(X3) = X10
& neq(nil,X3) )
& neq(nil,X3) ) ) )
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ( nil = X2
| nil != X3 )
& ( ! [X7] :
( ~ ssList(X7)
| X2 = X7
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| tl(X3) != X8
| app(X8,X9) != X7
| ! [X10] :
( ~ ssItem(X10)
| cons(X10,nil) != X9
| hd(X3) != X10
| ~ neq(nil,X3) )
| ~ neq(nil,X3) ) ) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ( nil = X2
| nil != X3 )
& ( ! [X7] :
( ~ ssList(X7)
| X2 = X7
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| tl(X3) != X8
| app(X8,X9) != X7
| ! [X10] :
( ~ ssItem(X10)
| cons(X10,nil) != X9
| hd(X3) != X10
| ~ neq(nil,X3) )
| ~ neq(nil,X3) ) ) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f125,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f125]) ).
fof(f129,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f130,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f136,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f137,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f136]) ).
fof(f138,plain,
( sK1 = sK3
& sK0 = sK2
& neq(sK1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK1
| app(app(X6,cons(X4,nil)),X5) != sK0 ) ) )
& ( nil = sK2
| nil != sK3 )
& ( ! [X7] :
( ~ ssList(X7)
| sK2 = X7
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| tl(sK3) != X8
| app(X8,X9) != X7
| ! [X10] :
( ~ ssItem(X10)
| cons(X10,nil) != X9
| hd(sK3) != X10
| ~ neq(nil,sK3) )
| ~ neq(nil,sK3) ) ) )
| ~ neq(sK3,nil) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f150,plain,
ssList(sK3),
inference(cnf_transformation,[],[f138]) ).
fof(f151,plain,
! [X10,X8,X9,X7] :
( ~ ssList(X7)
| sK2 = X7
| ~ ssList(X8)
| ~ ssList(X9)
| tl(sK3) != X8
| app(X8,X9) != X7
| ~ ssItem(X10)
| cons(X10,nil) != X9
| hd(sK3) != X10
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f138]) ).
fof(f153,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK1
| app(app(X6,cons(X4,nil)),X5) != sK0 ),
inference(cnf_transformation,[],[f138]) ).
fof(f154,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f138]) ).
fof(f155,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f156,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f167,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f168,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f173,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f176,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f178,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f179,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f180,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f183,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f188,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f190,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f195,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f196,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f154,f156]) ).
fof(f197,plain,
! [X6,X4,X5] :
( app(app(X6,cons(X4,nil)),X5) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK3
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f153,f156,f155]) ).
fof(f200,plain,
! [X10,X9,X7] :
( ~ ssList(X7)
| sK2 = X7
| ~ ssList(tl(sK3))
| ~ ssList(X9)
| app(tl(sK3),X9) != X7
| ~ ssItem(X10)
| cons(X10,nil) != X9
| hd(sK3) != X10
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f151]) ).
fof(f201,plain,
! [X10,X9] :
( ~ ssList(app(tl(sK3),X9))
| sK2 = app(tl(sK3),X9)
| ~ ssList(tl(sK3))
| ~ ssList(X9)
| ~ ssItem(X10)
| cons(X10,nil) != X9
| hd(sK3) != X10
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f200]) ).
fof(f202,plain,
! [X10] :
( ~ ssList(app(tl(sK3),cons(X10,nil)))
| sK2 = app(tl(sK3),cons(X10,nil))
| ~ ssList(tl(sK3))
| ~ ssList(cons(X10,nil))
| ~ ssItem(X10)
| hd(sK3) != X10
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f201]) ).
fof(f203,plain,
( ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| sK2 = app(tl(sK3),cons(hd(sK3),nil))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(equality_resolution,[],[f202]) ).
fof(f206,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f179]) ).
fof(f209,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f206]) ).
fof(f211,plain,
( ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| sK2 = app(tl(sK3),cons(hd(sK3),nil))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3)
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f203]) ).
fof(f212,plain,
( sK2 = app(tl(sK3),cons(hd(sK3),nil))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f211,f196]) ).
fof(f218,plain,
! [X0,X1] :
( sK2 != app(X0,cons(X1,nil))
| ~ ssList(nil)
| ~ ssList(X0)
| sK3 != app(app(nil,cons(X1,nil)),X0)
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(superposition,[],[f197,f168]) ).
fof(f219,plain,
! [X0,X1] :
( sK3 != app(app(nil,cons(X1,nil)),X0)
| ~ ssList(X0)
| sK2 != app(X0,cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(forward_subsumption_resolution,[],[f218,f183]) ).
fof(f233,plain,
! [X0,X1] :
( sK3 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| sK2 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f219,f176]) ).
fof(f387,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f233,f173]) ).
fof(f415,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f387]) ).
fof(f420,plain,
! [X0,X1] :
( sK2 != app(X1,cons(X0,nil))
| ~ ssList(X1)
| cons(X0,X1) != sK3
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f415,f178]) ).
fof(f423,plain,
( sK2 != sK2
| ~ ssList(tl(sK3))
| sK3 != cons(hd(sK3),tl(sK3))
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3))
| ~ neq(nil,sK3) ),
inference(superposition,[],[f420,f212]) ).
fof(f424,plain,
( sK2 != sK2
| ~ ssList(tl(sK3))
| sK3 != cons(hd(sK3),tl(sK3))
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ neq(nil,sK3) ),
inference(duplicate_literal_removal,[],[f423]) ).
fof(f425,plain,
( ~ ssList(tl(sK3))
| sK3 != cons(hd(sK3),tl(sK3))
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil)))
| ~ neq(nil,sK3) ),
inference(trivial_inequality_removal,[],[f424]) ).
fof(f428,plain,
( sK3 != cons(hd(sK3),tl(sK3))
| ~ ssList(tl(sK3))
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3) ),
inference(forward_subsumption_resolution,[],[f425,f178]) ).
fof(f446,plain,
( sK3 != sK3
| ~ ssList(tl(sK3))
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(superposition,[],[f428,f190]) ).
fof(f447,plain,
( ~ ssList(tl(sK3))
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(trivial_inequality_removal,[],[f446]) ).
fof(f448,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f447,f195]) ).
fof(f451,plain,
( ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f448,f188]) ).
fof(f454,plain,
( ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f451,f150]) ).
fof(f457,plain,
( ~ neq(nil,sK3)
| nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(nil) ),
inference(resolution,[],[f454,f167]) ).
fof(f461,plain,
( ~ neq(nil,sK3)
| nil = sK3
| ~ ssItem(hd(sK3)) ),
inference(forward_subsumption_resolution,[],[f457,f183]) ).
fof(f487,plain,
( nil = sK3
| ~ ssItem(hd(sK3))
| nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(resolution,[],[f461,f180]) ).
fof(f488,plain,
( nil = sK3
| ~ ssItem(hd(sK3))
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f487]) ).
fof(f490,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f488,f188]) ).
fof(f491,plain,
( nil = sK3
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f490,f150]) ).
fof(f492,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f491,f183]) ).
fof(f522,plain,
neq(sK3,sK3),
inference(superposition,[],[f196,f492]) ).
fof(f546,plain,
~ ssList(sK3),
inference(resolution,[],[f522,f209]) ).
fof(f548,plain,
$false,
inference(forward_subsumption_resolution,[],[f546,f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC418+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n018.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 09:35:39 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 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
% 2.99/1.12 % (3253622)Detected formulas, will run a generic FOF schedule.
% 2.99/1.12 % (3253628)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=2649314763:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.99/1.12 % (3253627)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=3465027001:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.99/1.12 % (3253629)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=1016429279:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.99/1.12 % (3253631)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2460237455:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.99/1.12 % (3253632)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2922404052:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.99/1.12 % (3253630)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1668850990:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.99/1.12 % (3253633)dis-21_1_sil=8000:lcm=predicate:random_seed=3599927634: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.99/1.12 % (3253631)First to succeed.
% 2.99/1.12 % (3253631)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3253622"
% 2.99/1.12 % (3253632)Also succeeded, but the first one will report.
% 2.99/1.12 % (3253630)Instruction limit reached!
% 2.99/1.12 % (3253630)------------------------------
% 2.99/1.12 % (3253630)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.12 % (3253630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.12 % (3253630)CaDiCaL version: 2.1.3
% 2.99/1.12 % (3253630)Termination reason: Instruction limit
% 2.99/1.12 % (3253630)Termination phase: Saturation
% 2.99/1.12 % (3253630)Time elapsed: 0.062 s
% 2.99/1.12 % (3253630)Peak memory usage: 89 MB
% 2.99/1.12 % (3253630)Instructions burned: 109 (million)
% 2.99/1.12 % (3253633)Instruction limit reached!
% 2.99/1.12 % (3253633)------------------------------
% 2.99/1.12 % (3253633)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.12 % (3253633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.12 % (3253633)CaDiCaL version: 2.1.3
% 2.99/1.12 % (3253633)Termination reason: Instruction limit
% 2.99/1.12 % (3253633)Termination phase: Saturation
% 2.99/1.12 % (3253633)Time elapsed: 0.073 s
% 2.99/1.12 % (3253633)Peak memory usage: 90 MB
% 2.99/1.12 % (3253633)Instructions burned: 129 (million)
% 2.99/1.12 % (3253642)lrs+10_1_sil=32000:urr=on:br=off:random_seed=93324039:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.99/1.12 % (3253641)lrs+10_1_sil=8000:sp=occurrence:random_seed=2733975780:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.99/1.12 % (3253631)Refutation found. Thanks to Tanya!
% 2.99/1.12 % SZS status Theorem for theBenchmark
% 2.99/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 3.80/1.31 % (3253631)------------------------------
% 3.80/1.31 % (3253631)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.80/1.31 % (3253631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.80/1.31 % (3253631)CaDiCaL version: 2.1.3
% 3.80/1.31 % (3253631)Termination reason: Refutation
% 3.80/1.31 % (3253631)Time elapsed: 0.013 s
% 3.80/1.31 % (3253631)Peak memory usage: 88 MB
% 3.80/1.31 % (3253631)Instructions burned: 20 (million)
% 3.80/1.31 % (3253631)------------------------------
% 3.80/1.31 % (3253631)------------------------------
% 3.80/1.31 % (3253622)Success in time 0.446 s
% 3.80/1.31 % Vampire exiting
%------------------------------------------------------------------------------