%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC112+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 : n017.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:30 PM UTC 2026
% Result : Theorem 2.80s 1.26s
% Output : Refutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 110 ( 21 unt; 9 def)
% Number of atoms : 446 ( 97 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 559 ( 223 ~; 215 |; 90 &)
% ( 11 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 8 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 82 !; 36 ?)
% 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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f54,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( segmentP(X0,X1)
& segmentP(X1,X0) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax54) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& segmentP(X1,X0) ) ) ) ) ) ) ) ),
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)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& segmentP(X1,X0) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f121,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ segmentP(X0,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f126,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ segmentP(X0,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f125]) ).
fof(f129,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(f144,plain,
( sK1 = sK3
& sK0 = sK2
& sK3 = app(app(sK4,sK2),sK5)
& strictorderedP(sK2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != sK5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK2
| ~ lt(X12,X10) ) ) ) )
& ssList(sK5)
& ssList(sK4)
& ( nil = sK3
| nil != sK2 )
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ( ~ neq(sK0,nil)
| ~ segmentP(sK1,sK0) ) ) )
& ssList(sK3)
& 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)],[f99]) ).
fof(f149,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f152,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,[],[f129]) ).
fof(f153,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,[],[f152]) ).
fof(f154,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))],[f153]) ).
fof(f162,plain,
ssList(sK0),
inference(cnf_transformation,[],[f144]) ).
fof(f163,plain,
ssList(sK1),
inference(cnf_transformation,[],[f144]) ).
fof(f167,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f168,plain,
( nil = sK1
| ~ neq(sK0,nil)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f170,plain,
( nil = sK3
| nil != sK2 ),
inference(cnf_transformation,[],[f144]) ).
fof(f171,plain,
ssList(sK4),
inference(cnf_transformation,[],[f144]) ).
fof(f172,plain,
ssList(sK5),
inference(cnf_transformation,[],[f144]) ).
fof(f176,plain,
sK3 = app(app(sK4,sK2),sK5),
inference(cnf_transformation,[],[f144]) ).
fof(f177,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f144]) ).
fof(f178,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f144]) ).
fof(f201,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f202,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f205,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f208,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f211,plain,
! [X0,X1] :
( ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f216,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,[],[f154]) ).
fof(f241,plain,
( nil = sK3
| ~ neq(sK2,nil)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f168,f178,f177,f178,f177]) ).
fof(f242,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f167,f177,f178]) ).
fof(f244,plain,
ssList(sK3),
inference(definition_unfolding,[],[f163,f178]) ).
fof(f245,plain,
ssList(sK2),
inference(definition_unfolding,[],[f162,f177]) ).
fof(f252,definition,
~ sP21(nil),
introduced(definition,[new_symbols(definition,[sP21])],[inequality_splitting_name_introduction]) ).
fof(f253,plain,
( nil = sK3
| sP21(sK2) ),
inference(inequality_splitting,[],[f170,f252]) ).
fof(f254,definition,
~ sP22(nil),
introduced(definition,[new_symbols(definition,[sP22])],[inequality_splitting_name_introduction]) ).
fof(f255,plain,
( sP22(sK2)
| neq(sK3,nil) ),
inference(inequality_splitting,[],[f242,f254]) ).
fof(f275,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f201]) ).
fof(f277,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,[],[f216]) ).
fof(f288,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f275]) ).
fof(f292,definition,
( spl37_1
<=> segmentP(sK3,sK2) ),
introduced(definition,[new_symbols(definition,[spl37_1])],[avatar_definition]) ).
fof(f293,plain,
( segmentP(sK3,sK2)
| ~ spl37_1 ),
inference(avatar_component_clause,[],[f292]) ).
fof(f294,plain,
( ~ segmentP(sK3,sK2)
| spl37_1 ),
inference(avatar_component_clause,[],[f292]) ).
fof(f296,definition,
( spl37_2
<=> neq(sK2,nil) ),
introduced(definition,[new_symbols(definition,[spl37_2])],[avatar_definition]) ).
fof(f298,plain,
( ~ neq(sK2,nil)
| spl37_2 ),
inference(avatar_component_clause,[],[f296]) ).
fof(f305,definition,
( spl37_4
<=> neq(sK3,nil) ),
introduced(definition,[new_symbols(definition,[spl37_4])],[avatar_definition]) ).
fof(f307,plain,
( neq(sK3,nil)
| ~ spl37_4 ),
inference(avatar_component_clause,[],[f305]) ).
fof(f309,definition,
( spl37_5
<=> sP22(sK2) ),
introduced(definition,[new_symbols(definition,[spl37_5])],[avatar_definition]) ).
fof(f311,plain,
( sP22(sK2)
| ~ spl37_5 ),
inference(avatar_component_clause,[],[f309]) ).
fof(f312,plain,
( spl37_4
| spl37_5 ),
inference(avatar_split_clause,[],[f255,f309,f305]) ).
fof(f314,definition,
( spl37_6
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl37_6])],[avatar_definition]) ).
fof(f316,plain,
( nil = sK3
| ~ spl37_6 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f317,plain,
( ~ spl37_1
| ~ spl37_2
| spl37_6 ),
inference(avatar_split_clause,[],[f241,f314,f296,f292]) ).
fof(f320,definition,
( spl37_7
<=> sP21(sK2) ),
introduced(definition,[new_symbols(definition,[spl37_7])],[avatar_definition]) ).
fof(f322,plain,
( sP21(sK2)
| ~ spl37_7 ),
inference(avatar_component_clause,[],[f320]) ).
fof(f323,plain,
( spl37_7
| spl37_6 ),
inference(avatar_split_clause,[],[f253,f314,f320]) ).
fof(f325,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl37_2 ),
inference(resolution,[],[f298,f202]) ).
fof(f326,plain,
( nil = sK2
| ~ ssList(sK2)
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f325,f205]) ).
fof(f336,definition,
( spl37_10
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl37_10])],[avatar_definition]) ).
fof(f337,plain,
( nil != sK2
| spl37_10 ),
inference(avatar_component_clause,[],[f336]) ).
fof(f338,plain,
( nil = sK2
| ~ spl37_10 ),
inference(avatar_component_clause,[],[f336]) ).
fof(f340,plain,
( nil = sK2
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f326,f245]) ).
fof(f341,plain,
( spl37_10
| spl37_2 ),
inference(avatar_split_clause,[],[f340,f296,f336]) ).
fof(f342,plain,
( neq(nil,nil)
| ~ spl37_4
| ~ spl37_6 ),
inference(superposition,[],[f307,f316]) ).
fof(f347,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK5)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[],[f277,f176]) ).
fof(f372,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK5)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f347,f171]) ).
fof(f386,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f372,f172]) ).
fof(f400,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f386,f245]) ).
fof(f421,plain,
segmentP(sK3,sK2),
inference(forward_subsumption_resolution,[],[f400,f244]) ).
fof(f468,plain,
( sP21(nil)
| ~ spl37_7
| ~ spl37_10 ),
inference(forward_demodulation,[],[f322,f338]) ).
fof(f482,plain,
( $false
| ~ spl37_7
| ~ spl37_10 ),
inference(forward_subsumption_resolution,[],[f468,f252]) ).
fof(f483,plain,
( ~ spl37_7
| ~ spl37_10 ),
inference(avatar_contradiction_clause,[],[f482]) ).
fof(f551,plain,
( $false
| spl37_1 ),
inference(forward_subsumption_resolution,[],[f421,f294]) ).
fof(f552,plain,
spl37_1,
inference(avatar_contradiction_clause,[],[f551]) ).
fof(f582,plain,
( ~ segmentP(sK2,sK3)
| sK2 = sK3
| ~ ssList(sK3)
| ~ ssList(sK2)
| ~ spl37_1 ),
inference(resolution,[],[f293,f211]) ).
fof(f583,plain,
( ~ segmentP(sK2,sK3)
| sK2 = sK3
| ~ ssList(sK2)
| ~ spl37_1 ),
inference(forward_subsumption_resolution,[],[f582,f244]) ).
fof(f585,plain,
( ~ segmentP(sK2,sK3)
| sK2 = sK3
| ~ spl37_1 ),
inference(forward_subsumption_resolution,[],[f583,f245]) ).
fof(f587,plain,
( ~ segmentP(sK2,nil)
| sK2 = sK3
| ~ spl37_1
| ~ spl37_6 ),
inference(forward_demodulation,[],[f585,f316]) ).
fof(f589,plain,
( nil = sK2
| ~ segmentP(sK2,nil)
| ~ spl37_1
| ~ spl37_6 ),
inference(forward_demodulation,[],[f587,f316]) ).
fof(f591,plain,
( ~ segmentP(sK2,nil)
| ~ spl37_1
| ~ spl37_6
| spl37_10 ),
inference(forward_subsumption_resolution,[],[f589,f337]) ).
fof(f596,plain,
( ~ ssList(nil)
| ~ spl37_4
| ~ spl37_6 ),
inference(resolution,[],[f342,f288]) ).
fof(f597,plain,
( $false
| ~ spl37_4
| ~ spl37_6 ),
inference(forward_subsumption_resolution,[],[f596,f205]) ).
fof(f598,plain,
( ~ spl37_4
| ~ spl37_6 ),
inference(avatar_contradiction_clause,[],[f597]) ).
fof(f605,plain,
( ~ ssList(sK2)
| ~ spl37_1
| ~ spl37_6
| spl37_10 ),
inference(resolution,[],[f591,f208]) ).
fof(f606,plain,
( $false
| ~ spl37_1
| ~ spl37_6
| spl37_10 ),
inference(forward_subsumption_resolution,[],[f605,f245]) ).
fof(f607,plain,
( ~ spl37_1
| ~ spl37_6
| spl37_10 ),
inference(avatar_contradiction_clause,[],[f606]) ).
fof(f617,plain,
( sP22(nil)
| ~ spl37_5
| ~ spl37_10 ),
inference(superposition,[],[f311,f338]) ).
fof(f619,plain,
( $false
| ~ spl37_5
| ~ spl37_10 ),
inference(forward_subsumption_resolution,[],[f617,f254]) ).
fof(f620,plain,
( ~ spl37_5
| ~ spl37_10 ),
inference(avatar_contradiction_clause,[],[f619]) ).
cnf(s2,plain,
( spl37_4
| spl37_5 ),
inference(sat_conversion,[],[f312]) ).
cnf(s3,plain,
( ~ spl37_1
| ~ spl37_2
| spl37_6 ),
inference(sat_conversion,[],[f317]) ).
cnf(s5,plain,
( spl37_6
| spl37_7 ),
inference(sat_conversion,[],[f323]) ).
cnf(s7,plain,
( spl37_2
| spl37_10 ),
inference(sat_conversion,[],[f341]) ).
cnf(s18,plain,
( ~ spl37_7
| ~ spl37_10 ),
inference(sat_conversion,[],[f483]) ).
cnf(s33,plain,
spl37_1,
inference(sat_conversion,[],[f552]) ).
cnf(s44,plain,
( ~ spl37_4
| ~ spl37_6 ),
inference(sat_conversion,[],[f598]) ).
cnf(s46,plain,
( ~ spl37_1
| ~ spl37_6
| spl37_10 ),
inference(sat_conversion,[],[f607]) ).
cnf(s47,plain,
( ~ spl37_5
| ~ spl37_10 ),
inference(sat_conversion,[],[f620]) ).
cnf(s50,plain,
( ~ spl37_2
| spl37_6 ),
inference(rat,[],[s3,s33]) ).
cnf(s52,plain,
~ spl37_10,
inference(rat,[],[s44,s5,s2,s18,s47]) ).
cnf(s53,plain,
~ spl37_6,
inference(rat,[],[s46,s33,s52]) ).
cnf(s54,plain,
spl37_2,
inference(rat,[],[s7,s52]) ).
cnf(s57,plain,
$false,
inference(rat,[],[s50,s53,s54]) ).
fof(f627,plain,
$false,
inference(avatar_sat_refutation,[],[s57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC112+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.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 07:50:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.80/1.26 % (3383771)Detected formulas, will run a generic FOF schedule.
% 2.80/1.26 % (3383777)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=478033779:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.80/1.26 % (3383781)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2818176498:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.80/1.26 % (3383780)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1806012926:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.80/1.26 % (3383782)dis-21_1_sil=8000:lcm=predicate:random_seed=1121852760: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.80/1.26 % (3383779)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3857062657:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.80/1.26 % (3383778)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=1640554243:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.80/1.26 % (3383776)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=2880128670:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.80/1.26 % (3383779)First to succeed.
% 2.80/1.26 % (3383779)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3383771"
% 2.80/1.26 % (3383780)Also succeeded, but the first one will report.
% 2.80/1.26 % (3383781)Also succeeded, but the first one will report.
% 2.80/1.26 % (3383782)Instruction limit reached!
% 2.80/1.26 % (3383782)------------------------------
% 2.80/1.26 % (3383782)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.26 % (3383782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.26 % (3383782)CaDiCaL version: 2.1.3
% 2.80/1.26 % (3383782)Termination reason: Instruction limit
% 2.80/1.26 % (3383782)Termination phase: Saturation
% 2.80/1.26 % (3383782)Time elapsed: 0.075 s
% 2.80/1.26 % (3383782)Peak memory usage: 90 MB
% 2.80/1.26 % (3383782)Instructions burned: 131 (million)
% 2.80/1.26 % (3383790)lrs+10_1_sil=8000:sp=occurrence:random_seed=949169057:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.80/1.26 % (3383790)Also succeeded, but the first one will report.
% 2.80/1.26 % (3383779)Refutation found. Thanks to Tanya!
% 2.80/1.26 % SZS status Theorem for theBenchmark
% 2.80/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.43/1.36 % (3383779)------------------------------
% 3.43/1.36 % (3383779)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.36 % (3383779)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.36 % (3383779)CaDiCaL version: 2.1.3
% 3.43/1.36 % (3383779)Termination reason: Refutation
% 3.43/1.36 % (3383779)Time elapsed: 0.011 s
% 3.43/1.36 % (3383779)Peak memory usage: 89 MB
% 3.43/1.36 % (3383779)Instructions burned: 15 (million)
% 3.43/1.36 % (3383779)------------------------------
% 3.43/1.36 % (3383779)------------------------------
% 3.43/1.36 % (3383771)Success in time 0.419 s
% 3.43/1.36 % Vampire exiting
%------------------------------------------------------------------------------