%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC045+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 : n012.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:11 PM UTC 2026
% Result : Theorem 0.60s 0.84s
% Output : Refutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 9
% Syntax : Number of formulae : 84 ( 10 unt; 0 def)
% Number of atoms : 382 ( 105 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 503 ( 205 ~; 201 |; 61 &)
% ( 6 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 141 ( 119 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
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(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
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(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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ? [X4] :
( ssItem(X4)
& ( ( ~ memberP(X2,X4)
& ? [X5] :
( ssList(X5)
& segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
| ( ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& memberP(X2,X4) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ? [X4] :
( ssItem(X4)
& ( ( ~ memberP(X2,X4)
& ? [X5] :
( ssList(X5)
& segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
| ( ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& memberP(X2,X4) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ? [X4] :
( ssItem(X4)
& ( ( ~ memberP(X2,X4)
& ? [X5] :
( ssList(X5)
& segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
| ( ! [X6] :
( ssList(X6)
=> ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil))) )
& memberP(X2,X4) ) ) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ( ( memberP(X2,X4)
| ! [X5] :
( ~ ssList(X5)
| ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
& ( ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| ~ memberP(X2,X4) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ( ( memberP(X2,X4)
| ! [X5] :
( ~ ssList(X5)
| ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
& ( ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| ~ memberP(X2,X4) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f102,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f103,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f102]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f123,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f133,plain,
( nil = sK1
& sK1 = sK3
& sK0 = sK2
& nil != sK0
& ! [X4] :
( ~ ssItem(X4)
| ( ( memberP(sK2,X4)
| ! [X5] :
( ~ ssList(X5)
| ~ segmentP(sK3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
& ( ( segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil)))
& ssList(sK4(X4)) )
| ~ memberP(sK2,X4) ) ) )
& 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(X6,sK4(X4))],[f100]) ).
fof(f135,plain,
! [X0] :
( nil = X0
| ( ssList(sK7(X0))
& ssItem(sK8(X0))
& cons(sK8(X0),sK7(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X1,sK7(X0)),skolemize(X2,sK8(X0))],[f103]) ).
fof(f136,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,[],[f109]) ).
fof(f137,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,[],[f136]) ).
fof(f138,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f138]) ).
fof(f145,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f123]) ).
fof(f151,plain,
ssList(sK2),
inference(cnf_transformation,[],[f133]) ).
fof(f152,plain,
ssList(sK3),
inference(cnf_transformation,[],[f133]) ).
fof(f153,plain,
! [X4] :
( ssList(sK4(X4))
| ~ ssItem(X4)
| ~ memberP(sK2,X4) ),
inference(cnf_transformation,[],[f133]) ).
fof(f154,plain,
! [X4] :
( ~ ssItem(X4)
| segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil)))
| ~ memberP(sK2,X4) ),
inference(cnf_transformation,[],[f133]) ).
fof(f156,plain,
nil != sK0,
inference(cnf_transformation,[],[f133]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f133]) ).
fof(f158,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f133]) ).
fof(f159,plain,
nil = sK1,
inference(cnf_transformation,[],[f133]) ).
fof(f163,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f164,plain,
! [X0] :
( nil = X0
| cons(sK8(X0),sK7(X0)) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f165,plain,
! [X0] :
( nil = X0
| ssItem(sK8(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f166,plain,
! [X0] :
( nil = X0
| ssList(sK7(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f170,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f173,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f176,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f181,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f186,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f194,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f205,plain,
nil = sK3,
inference(definition_unfolding,[],[f159,f158]) ).
fof(f206,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f156,f205,f157]) ).
fof(f208,plain,
! [X4] :
( segmentP(sK3,app(app(cons(X4,sK3),sK4(X4)),cons(X4,sK3)))
| ~ ssItem(X4)
| ~ memberP(sK2,X4) ),
inference(definition_unfolding,[],[f154,f205,f205]) ).
fof(f211,plain,
! [X0,X1] :
( cons(X1,X0) != sK3
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f163,f205]) ).
fof(f212,plain,
! [X0] :
( ssList(sK7(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f166,f205]) ).
fof(f213,plain,
! [X0] :
( ssItem(sK8(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f165,f205]) ).
fof(f214,plain,
! [X0] :
( cons(sK8(X0),sK7(X0)) = X0
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f164,f205]) ).
fof(f217,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| sK3 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f173,f205,f205]) ).
fof(f219,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,sK3),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f176,f205]) ).
fof(f224,plain,
! [X0] :
( ~ segmentP(sK3,X0)
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f194,f205,f205]) ).
fof(f228,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f186]) ).
fof(f232,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f228]) ).
fof(f246,plain,
! [X0] :
( segmentP(sK3,app(cons(X0,sK4(X0)),cons(X0,sK3)))
| ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(sK4(X0)) ),
inference(superposition,[],[f208,f219]) ).
fof(f247,plain,
! [X0] :
( segmentP(sK3,app(cons(X0,sK4(X0)),cons(X0,sK3)))
| ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ ssList(sK4(X0)) ),
inference(duplicate_literal_removal,[],[f246]) ).
fof(f248,plain,
! [X0] :
( segmentP(sK3,app(cons(X0,sK4(X0)),cons(X0,sK3)))
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(forward_subsumption_resolution,[],[f247,f153]) ).
fof(f249,plain,
! [X0] :
( sK3 = app(cons(X0,sK4(X0)),cons(X0,sK3))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(app(cons(X0,sK4(X0)),cons(X0,sK3))) ),
inference(resolution,[],[f248,f224]) ).
fof(f270,plain,
! [X0] :
( sK3 != sK3
| sK3 = cons(X0,sK3)
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(app(cons(X0,sK4(X0)),cons(X0,sK3))) ),
inference(superposition,[],[f217,f249]) ).
fof(f271,plain,
! [X0] :
( ~ ssList(app(cons(X0,sK4(X0)),cons(X0,sK3)))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| sK3 = cons(X0,sK3) ),
inference(trivial_inequality_removal,[],[f270]) ).
fof(f296,plain,
! [X0] :
( ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| sK3 = cons(X0,sK3) ),
inference(resolution,[],[f181,f271]) ).
fof(f307,plain,
! [X0] :
( ~ ssList(cons(X0,sK4(X0)))
| ~ ssList(cons(X0,sK3))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| sK3 = cons(X0,sK3) ),
inference(duplicate_literal_removal,[],[f296]) ).
fof(f316,plain,
! [X0] :
( memberP(X0,sK8(X0))
| ~ ssList(sK7(X0))
| ~ ssItem(sK8(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(superposition,[],[f232,f214]) ).
fof(f317,plain,
! [X0] :
( memberP(X0,sK8(X0))
| ~ ssItem(sK8(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f316,f212]) ).
fof(f318,plain,
! [X0] :
( memberP(X0,sK8(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f317,f213]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(cons(X0,sK3))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| sK3 = cons(X0,sK3)
| ~ ssItem(X0)
| ~ ssList(sK4(X0)) ),
inference(resolution,[],[f307,f170]) ).
fof(f321,plain,
! [X0] :
( ~ ssList(cons(X0,sK3))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| sK3 = cons(X0,sK3)
| ~ ssList(sK4(X0)) ),
inference(duplicate_literal_removal,[],[f320]) ).
fof(f322,plain,
! [X0] :
( sK3 = cons(X0,sK3)
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(cons(X0,sK3)) ),
inference(forward_subsumption_resolution,[],[f321,f153]) ).
fof(f339,plain,
! [X0] :
( sK3 != sK3
| ~ ssItem(X0)
| ~ ssList(sK3)
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(cons(X0,sK3)) ),
inference(superposition,[],[f211,f322]) ).
fof(f341,plain,
! [X0] :
( sK3 != sK3
| ~ ssItem(X0)
| ~ ssList(sK3)
| ~ memberP(sK2,X0)
| ~ ssList(cons(X0,sK3)) ),
inference(duplicate_literal_removal,[],[f339]) ).
fof(f342,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssList(sK3)
| ~ memberP(sK2,X0)
| ~ ssList(cons(X0,sK3)) ),
inference(trivial_inequality_removal,[],[f341]) ).
fof(f360,plain,
! [X0] :
( ~ ssList(cons(X0,sK3))
| ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f342,f152]) ).
fof(f364,plain,
! [X0] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(sK3) ),
inference(resolution,[],[f360,f170]) ).
fof(f367,plain,
! [X0] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f364]) ).
fof(f368,plain,
! [X0] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f367,f152]) ).
fof(f369,plain,
( ~ ssItem(sK8(sK2))
| sK2 = sK3
| ~ ssList(sK2) ),
inference(resolution,[],[f368,f318]) ).
fof(f370,plain,
( sK2 = sK3
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f369,f213]) ).
fof(f371,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f370,f206]) ).
fof(f372,plain,
$false,
inference(forward_subsumption_resolution,[],[f371,f151]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC045+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Mon Sep 28 07:35:04 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.33 Running first-order theorem proving
% 0.09/0.33 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
% 0.60/0.84 % (3217567)Detected formulas, will run a generic FOF schedule.
% 0.60/0.84 % (3217575)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2128149745:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.60/0.84 % (3217577)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4096358702:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.60/0.84 % (3217578)dis-21_1_sil=8000:lcm=predicate:random_seed=4170792554: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)
% 0.60/0.84 % (3217574)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=2669164329:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.60/0.84 % (3217573)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=4125041155:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.60/0.84 % (3217576)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1328998925:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.60/0.84 % (3217572)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=3953770168:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.60/0.84 % (3217576)First to succeed.
% 0.60/0.84 % (3217576)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3217567"
% 0.60/0.84 % (3217577)Also succeeded, but the first one will report.
% 0.60/0.84 % (3217575)Instruction limit reached!
% 0.60/0.84 % (3217575)------------------------------
% 0.60/0.84 % (3217575)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.60/0.84 % (3217575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.84 % (3217575)CaDiCaL version: 2.1.3
% 0.60/0.84 % (3217575)Termination reason: Instruction limit
% 0.60/0.84 % (3217575)Termination phase: Saturation
% 0.60/0.84 % (3217575)Time elapsed: 0.036 s
% 0.60/0.84 % (3217575)Peak memory usage: 89 MB
% 0.60/0.84 % (3217575)Instructions burned: 112 (million)
% 0.60/0.84 % (3217578)Instruction limit reached!
% 0.60/0.84 % (3217578)------------------------------
% 0.60/0.84 % (3217578)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.60/0.84 % (3217578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.84 % (3217578)CaDiCaL version: 2.1.3
% 0.60/0.84 % (3217578)Termination reason: Instruction limit
% 0.60/0.84 % (3217578)Termination phase: Saturation
% 0.60/0.84 % (3217578)Time elapsed: 0.039 s
% 0.60/0.84 % (3217578)Peak memory usage: 89 MB
% 0.60/0.84 % (3217578)Instructions burned: 131 (million)
% 0.60/0.84 % (3217576)Refutation found. Thanks to Tanya!
% 0.60/0.84 % SZS status Theorem for theBenchmark
% 0.60/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 2.39/0.93 % (3217576)------------------------------
% 2.39/0.93 % (3217576)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.39/0.93 % (3217576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.39/0.93 % (3217576)CaDiCaL version: 2.1.3
% 2.39/0.93 % (3217576)Termination reason: Refutation
% 2.39/0.93 % (3217576)Time elapsed: 0.004 s
% 2.39/0.93 % (3217576)Peak memory usage: 88 MB
% 2.39/0.93 % (3217576)Instructions burned: 10 (million)
% 2.39/0.93 % (3217576)------------------------------
% 2.39/0.93 % (3217576)------------------------------
% 2.39/0.93 % (3217567)Success in time 0.305 s
% 2.39/0.93 % Vampire exiting
%------------------------------------------------------------------------------