%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC311+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:05:29 PM UTC 2026
% Result : Theorem 3.37s 0.77s
% Output : Refutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of formulae : 139 ( 18 unt; 11 def)
% Number of atoms : 515 ( 136 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 628 ( 252 ~; 289 |; 52 &)
% ( 13 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 12 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn 86 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ? [X4] :
( ssList(X4)
& X2 != X4
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& tl(X3) = X5
& app(X5,X6) = X4
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X3) = X7
& neq(nil,X3) )
& neq(nil,X3) ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X1
& app(X9,cons(X8,nil)) = 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
| ( nil != X2
& nil = X3 )
| ( ? [X4] :
( ssList(X4)
& X2 != X4
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& tl(X3) = X5
& app(X5,X6) = X4
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X3) = X7
& neq(nil,X3) )
& neq(nil,X3) ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X1
& app(X9,cons(X8,nil)) = X0 ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f192]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(X3) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(X3) != X7
| ~ neq(nil,X3) )
| ~ neq(nil,X3) ) ) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X1
| app(X9,cons(X8,nil)) != X0 ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| tl(X3) != X5
| app(X5,X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(X3) != X7
| ~ neq(nil,X3) )
| ~ neq(nil,X3) ) ) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X1
| app(X9,cons(X8,nil)) != X0 ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f314,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f127]) ).
fof(f316,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f389,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f193]) ).
fof(f392,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f411,plain,
! [X6,X7,X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| hd(sK50) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7)
| app(X5,X6) != X4
| tl(sK50) != X5
| ~ ssList(X6)
| ~ ssList(X5)
| sK49 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
! [X8,X9] :
( app(X9,cons(X8,nil)) != sK47
| app(cons(X8,nil),X9) != sK48
| ~ ssList(X9)
| ~ ssItem(X8)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( neq(sK48,nil)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
( neq(sK50,nil)
| nil = sK50 ),
inference(definition_unfolding,[],[f415,f419,f419]) ).
fof(f426,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f414,f419,f418]) ).
fof(f427,plain,
! [X8,X9] :
( app(X9,cons(X8,nil)) != sK49
| app(cons(X8,nil),X9) != sK50
| ~ ssList(X9)
| ~ ssItem(X8)
| nil = sK50 ),
inference(definition_unfolding,[],[f413,f418,f419,f419]) ).
fof(f443,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f454,plain,
! [X6,X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| cons(hd(sK50),nil) != X6
| ~ ssItem(hd(sK50))
| app(X5,X6) != X4
| tl(sK50) != X5
| ~ ssList(X6)
| ~ ssList(X5)
| sK49 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f411]) ).
fof(f455,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| app(X5,cons(hd(sK50),nil)) != X4
| tl(sK50) != X5
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(X5)
| sK49 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f454]) ).
fof(f456,plain,
! [X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| tl(sK50) != X5
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(X5)
| sK49 = app(X5,cons(hd(sK50),nil))
| ~ ssList(app(X5,cons(hd(sK50),nil))) ),
inference(equality_resolution,[],[f455]) ).
fof(f457,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| sK49 = app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
inference(equality_resolution,[],[f456]) ).
fof(f509,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ssItem(X1)
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f305]) ).
fof(f515,plain,
! [X0] :
( ~ ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f314]) ).
fof(f558,plain,
! [X0,X1] :
( ~ ssList(X0)
| ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(consistent_polarity_flipping,[],[f392]) ).
fof(f570,plain,
! [X8,X9] :
( app(X9,cons(X8,nil)) != sK49
| app(cons(X8,nil),X9) != sK50
| ~ ssList(X9)
| ssItem(X8)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f427]) ).
fof(f572,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| sK49 = app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
inference(consistent_polarity_flipping,[],[f457]) ).
fof(f577,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f443]) ).
fof(f581,definition,
( spl51_1
<=> ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f583,plain,
( ~ ssList(app(tl(sK50),cons(hd(sK50),nil)))
| spl51_1 ),
inference(avatar_component_clause,[],[f581]) ).
fof(f585,definition,
( spl51_2
<=> sK49 = app(tl(sK50),cons(hd(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f587,plain,
( sK49 = app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f585]) ).
fof(f589,definition,
( spl51_3
<=> ssList(tl(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f590,plain,
( ssList(tl(sK50))
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f589]) ).
fof(f591,plain,
( ~ ssList(tl(sK50))
| spl51_3 ),
inference(avatar_component_clause,[],[f589]) ).
fof(f593,definition,
( spl51_4
<=> ssList(cons(hd(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f595,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_4 ),
inference(avatar_component_clause,[],[f593]) ).
fof(f597,definition,
( spl51_5
<=> ssItem(hd(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f598,plain,
( ~ ssItem(hd(sK50))
| spl51_5 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f599,plain,
( ssItem(hd(sK50))
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f601,definition,
( spl51_6
<=> neq(nil,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f603,plain,
( ~ neq(nil,sK50)
| spl51_6 ),
inference(avatar_component_clause,[],[f601]) ).
fof(f605,definition,
( spl51_7
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).
fof(f606,plain,
( neq(sK50,nil)
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f608,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3
| ~ spl51_4
| spl51_5
| ~ spl51_6
| ~ spl51_7 ),
inference(avatar_split_clause,[],[f572,f605,f601,f597,f593,f589,f585,f581]) ).
fof(f610,definition,
( spl51_8
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_8])],[avatar_definition]) ).
fof(f614,definition,
( spl51_9
<=> ! [X9,X8] :
( app(X9,cons(X8,nil)) != sK49
| ssItem(X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK50 ) ),
introduced(definition,[new_symbols(definition,[spl51_9])],[avatar_definition]) ).
fof(f615,plain,
( ! [X8,X9] :
( app(cons(X8,nil),X9) != sK50
| ssItem(X8)
| ~ ssList(X9)
| app(X9,cons(X8,nil)) != sK49 )
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f614]) ).
fof(f618,definition,
( spl51_10
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f619,plain,
( nil != sK50
| spl51_10 ),
inference(avatar_component_clause,[],[f618]) ).
fof(f620,plain,
( nil = sK50
| ~ spl51_10 ),
inference(avatar_component_clause,[],[f618]) ).
fof(f621,plain,
( spl51_10
| spl51_9 ),
inference(avatar_split_clause,[],[f570,f614,f618]) ).
fof(f622,plain,
( ~ spl51_8
| spl51_7 ),
inference(avatar_split_clause,[],[f426,f605,f610]) ).
fof(f623,plain,
( spl51_10
| spl51_7 ),
inference(avatar_split_clause,[],[f425,f605,f618]) ).
fof(f624,plain,
( spl51_8
| ~ spl51_10 ),
inference(avatar_split_clause,[],[f416,f618,f610]) ).
fof(f630,definition,
( spl51_12
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_12])],[avatar_definition]) ).
fof(f631,plain,
( ssList(nil)
| ~ spl51_12 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f659,plain,
spl51_12,
inference(avatar_split_clause,[],[f306,f630]) ).
fof(f692,plain,
( ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| spl51_1 ),
inference(resolution,[],[f318,f583]) ).
fof(f701,plain,
( ~ spl51_3
| ~ spl51_4
| spl51_1 ),
inference(avatar_split_clause,[],[f692,f581,f593,f589]) ).
fof(f702,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_3 ),
inference(resolution,[],[f591,f316]) ).
fof(f706,plain,
( nil = sK50
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f702,f417]) ).
fof(f707,plain,
( spl51_10
| spl51_3 ),
inference(avatar_split_clause,[],[f706,f589,f618]) ).
fof(f714,plain,
( neq(nil,nil)
| ~ spl51_7
| ~ spl51_10 ),
inference(superposition,[],[f606,f620]) ).
fof(f738,plain,
( ~ ssList(nil)
| ~ spl51_7
| ~ spl51_10 ),
inference(resolution,[],[f714,f577]) ).
fof(f739,plain,
( $false
| ~ spl51_7
| ~ spl51_10
| ~ spl51_12 ),
inference(forward_subsumption_resolution,[],[f738,f631]) ).
fof(f740,plain,
( ~ spl51_7
| ~ spl51_10
| ~ spl51_12 ),
inference(avatar_contradiction_clause,[],[f739]) ).
fof(f743,plain,
( ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_4 ),
inference(resolution,[],[f595,f509]) ).
fof(f744,plain,
( ssItem(hd(sK50))
| spl51_4
| ~ spl51_12 ),
inference(forward_subsumption_resolution,[],[f743,f631]) ).
fof(f745,plain,
( spl51_5
| spl51_4
| ~ spl51_12 ),
inference(avatar_split_clause,[],[f744,f630,f593,f597]) ).
fof(f768,plain,
( ~ ssList(sK50)
| nil = sK50
| ~ ssList(nil)
| spl51_6 ),
inference(resolution,[],[f303,f603]) ).
fof(f771,plain,
( nil = sK50
| ~ ssList(nil)
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f768,f417]) ).
fof(f772,plain,
( ~ ssList(nil)
| spl51_6
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f771,f619]) ).
fof(f773,plain,
( $false
| spl51_6
| spl51_10
| ~ spl51_12 ),
inference(forward_subsumption_resolution,[],[f772,f631]) ).
fof(f774,plain,
( spl51_6
| spl51_10
| ~ spl51_12 ),
inference(avatar_contradiction_clause,[],[f773]) ).
fof(f776,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ spl51_5 ),
inference(resolution,[],[f599,f515]) ).
fof(f777,plain,
( ~ ssList(sK50)
| ~ spl51_5
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f776,f619]) ).
fof(f778,plain,
( $false
| ~ spl51_5
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f777,f417]) ).
fof(f779,plain,
( ~ spl51_5
| spl51_10 ),
inference(avatar_contradiction_clause,[],[f778]) ).
fof(f1142,plain,
( nil = sK50
| sK50 = cons(hd(sK50),tl(sK50)) ),
inference(resolution,[],[f389,f417]) ).
fof(f1143,plain,
( sK50 = cons(hd(sK50),tl(sK50))
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f1142,f619]) ).
fof(f1332,plain,
( ! [X0] :
( ssItem(X0)
| cons(X0,tl(sK50)) = app(cons(X0,nil),tl(sK50)) )
| ~ spl51_3 ),
inference(resolution,[],[f558,f590]) ).
fof(f3713,plain,
( cons(hd(sK50),tl(sK50)) = app(cons(hd(sK50),nil),tl(sK50))
| ~ spl51_3
| spl51_5 ),
inference(resolution,[],[f1332,f598]) ).
fof(f3736,plain,
( sK50 = app(cons(hd(sK50),nil),tl(sK50))
| ~ spl51_3
| spl51_5
| spl51_10 ),
inference(forward_demodulation,[],[f3713,f1143]) ).
fof(f43436,plain,
( sK50 != sK50
| ssItem(hd(sK50))
| ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_3
| spl51_5
| ~ spl51_9
| spl51_10 ),
inference(superposition,[],[f615,f3736]) ).
fof(f43460,plain,
( ssItem(hd(sK50))
| ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_3
| spl51_5
| ~ spl51_9
| spl51_10 ),
inference(trivial_inequality_removal,[],[f43436]) ).
fof(f43476,plain,
( ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_3
| spl51_5
| ~ spl51_9
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f43460,f598]) ).
fof(f43492,plain,
( sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ spl51_3
| spl51_5
| ~ spl51_9
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f43476,f590]) ).
fof(f43495,plain,
( $false
| ~ spl51_2
| ~ spl51_3
| spl51_5
| ~ spl51_9
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f43492,f587]) ).
fof(f43496,plain,
( ~ spl51_2
| ~ spl51_3
| spl51_5
| ~ spl51_9
| spl51_10 ),
inference(avatar_contradiction_clause,[],[f43495]) ).
cnf(s1,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3
| ~ spl51_4
| spl51_5
| ~ spl51_6
| ~ spl51_7 ),
inference(sat_conversion,[],[f608]) ).
cnf(s3,plain,
( spl51_9
| spl51_10 ),
inference(sat_conversion,[],[f621]) ).
cnf(s4,plain,
( spl51_7
| ~ spl51_8 ),
inference(sat_conversion,[],[f622]) ).
cnf(s5,plain,
( spl51_7
| spl51_10 ),
inference(sat_conversion,[],[f623]) ).
cnf(s6,plain,
( spl51_8
| ~ spl51_10 ),
inference(sat_conversion,[],[f624]) ).
cnf(s15,plain,
spl51_12,
inference(sat_conversion,[],[f659]) ).
cnf(s16,plain,
( spl51_1
| ~ spl51_3
| ~ spl51_4 ),
inference(sat_conversion,[],[f701]) ).
cnf(s18,plain,
( spl51_3
| spl51_10 ),
inference(sat_conversion,[],[f707]) ).
cnf(s19,plain,
( ~ spl51_7
| ~ spl51_10
| ~ spl51_12 ),
inference(sat_conversion,[],[f740]) ).
cnf(s20,plain,
( spl51_4
| spl51_5
| ~ spl51_12 ),
inference(sat_conversion,[],[f745]) ).
cnf(s22,plain,
( spl51_6
| spl51_10
| ~ spl51_12 ),
inference(sat_conversion,[],[f774]) ).
cnf(s25,plain,
( ~ spl51_5
| spl51_10 ),
inference(sat_conversion,[],[f779]) ).
cnf(s4548,plain,
( ~ spl51_2
| ~ spl51_3
| spl51_5
| ~ spl51_9
| spl51_10 ),
inference(sat_conversion,[],[f43496]) ).
cnf(s4807,plain,
~ spl51_10,
inference(rat,[],[s4,s6,s19,s15]) ).
cnf(s4815,plain,
~ spl51_5,
inference(rat,[],[s25,s4807]) ).
cnf(s4816,plain,
spl51_6,
inference(rat,[],[s22,s15,s4807]) ).
cnf(s4817,plain,
spl51_3,
inference(rat,[],[s18,s4807]) ).
cnf(s4818,plain,
spl51_7,
inference(rat,[],[s5,s4807]) ).
cnf(s4819,plain,
spl51_9,
inference(rat,[],[s3,s4807]) ).
cnf(s4935,plain,
spl51_4,
inference(rat,[],[s20,s15,s4815]) ).
cnf(s4941,plain,
~ spl51_2,
inference(rat,[],[s4548,s4807,s4819,s4815,s4817]) ).
cnf(s4942,plain,
spl51_1,
inference(rat,[],[s16,s4935,s4817]) ).
cnf(s4961,plain,
$false,
inference(rat,[],[s1,s4818,s4816,s4815,s4935,s4817,s4942,s4941]) ).
fof(f43498,plain,
$false,
inference(avatar_sat_refutation,[],[s4961]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC311+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n017.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 08:55:51 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.37/0.77 % (3412599)Will run a generic schedule for satisfiability detection.
% 3.37/0.77 % (3412607)dis+10_1_sil=32000:sp=arity:random_seed=2714048602:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.37/0.77 % (3412604)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1681954151_2999 on theBenchmark for (2999ds/0Mi)
% 3.37/0.77 % (3412610)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4021577130:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.37/0.77 % (3412606)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1098520530:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.37/0.77 % (3412608)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3187700569:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.37/0.77 % (3412609)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1576231173:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.37/0.77 % (3412605)% WARNING: option uhcvi not known.
% 3.37/0.77 % (3412605)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2498089672:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.37/0.77 % TRYING [1]
% 3.37/0.77 % TRYING [2]
% 3.37/0.77 % TRYING [3]
% 3.37/0.77 % TRYING [4]
% 3.37/0.77 % (3412607)Instruction limit reached!
% 3.37/0.77 % (3412607)------------------------------
% 3.37/0.77 % (3412607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412607)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412607)Termination reason: Instruction limit
% 3.37/0.77 % (3412607)Termination phase: Saturation
% 3.37/0.77 % (3412607)Time elapsed: 0.062 s
% 3.37/0.77 % (3412607)Peak memory usage: 13 MB
% 3.37/0.77 % (3412607)Instructions burned: 104 (million)
% 3.37/0.77 % (3412608)Instruction limit reached!
% 3.37/0.77 % (3412608)------------------------------
% 3.37/0.77 % (3412608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412608)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412608)Termination reason: Instruction limit
% 3.37/0.77 % (3412608)Termination phase: Saturation
% 3.37/0.77 % (3412608)Time elapsed: 0.071 s
% 3.37/0.77 % (3412608)Peak memory usage: 13 MB
% 3.37/0.77 % (3412608)Instructions burned: 118 (million)
% 3.37/0.77 % (3412609)Instruction limit reached!
% 3.37/0.77 % (3412609)------------------------------
% 3.37/0.77 % (3412609)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412609)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412609)Termination reason: Instruction limit
% 3.37/0.77 % (3412609)Termination phase: Saturation
% 3.37/0.77 % (3412609)Time elapsed: 0.077 s
% 3.37/0.77 % (3412609)Peak memory usage: 14 MB
% 3.37/0.77 % (3412609)Instructions burned: 131 (million)
% 3.37/0.77 % (3412618)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1587188911:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.37/0.77 % (3412619)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3052609205:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.37/0.77 % TRYING [5]
% 3.37/0.77 % TRYING [1]
% 3.37/0.77 % TRYING [2]
% 3.37/0.77 % (3412620)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=583069574:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.37/0.77 % TRYING [3]
% 3.37/0.77 % (3412610)Instruction limit reached!
% 3.37/0.77 % (3412610)------------------------------
% 3.37/0.77 % (3412610)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412610)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412610)Termination reason: Instruction limit
% 3.37/0.77 % (3412610)Termination phase: Saturation
% 3.37/0.77 % (3412610)Time elapsed: 0.105 s
% 3.37/0.77 % (3412610)Peak memory usage: 15 MB
% 3.37/0.77 % (3412610)Instructions burned: 159 (million)
% 3.37/0.77 % TRYING [4]
% 3.37/0.77 % (3412624)ott-21_1_sil=16000:fs=off:random_seed=370795919:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.37/0.77 % (3412619)Instruction limit reached!
% 3.37/0.77 % (3412619)------------------------------
% 3.37/0.77 % (3412619)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412619)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412619)Termination reason: Instruction limit
% 3.37/0.77 % (3412619)Termination phase: Saturation
% 3.37/0.77 % (3412619)Time elapsed: 0.073 s
% 3.37/0.77 % (3412619)Peak memory usage: 13 MB
% 3.37/0.77 % (3412619)Instructions burned: 133 (million)
% 3.37/0.77 % TRYING [5]
% 3.37/0.77 % (3412626)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4025733627:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 3.37/0.77 % (3412624)Instruction limit reached!
% 3.37/0.77 % (3412624)------------------------------
% 3.37/0.77 % (3412624)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412624)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412624)Termination reason: Instruction limit
% 3.37/0.77 % (3412624)Termination phase: Saturation
% 3.37/0.77 % (3412624)Time elapsed: 0.092 s
% 3.37/0.77 % (3412624)Peak memory usage: 14 MB
% 3.37/0.77 % (3412624)Instructions burned: 182 (million)
% 3.37/0.77 % TRYING [6]
% 3.37/0.77 % (3412628)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=519884272:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 3.37/0.77 % TRYING [1]
% 3.37/0.77 % TRYING [2]
% 3.37/0.77 % TRYING [3]
% 3.37/0.77 % TRYING [4]
% 3.37/0.77 % TRYING [6]
% 3.37/0.77 % (3412618)Instruction limit reached!
% 3.37/0.77 % (3412618)------------------------------
% 3.37/0.77 % (3412618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412618)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412618)Termination reason: Instruction limit
% 3.37/0.77 % (3412618)Termination phase: Finite model building constraint generation
% 3.37/0.77 % (3412618)Time elapsed: 0.289 s
% 3.37/0.77 % (3412618)Peak memory usage: 28 MB
% 3.37/0.77 % (3412618)Instructions burned: 717 (million)
% 3.37/0.77 % (3412630)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=102627807:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.37/0.77 % TRYING [5]
% 3.37/0.77 % (3412620)Instruction limit reached!
% 3.37/0.77 % (3412620)------------------------------
% 3.37/0.77 % (3412620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412620)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412620)Termination reason: Instruction limit
% 3.37/0.77 % (3412620)Termination phase: Saturation
% 3.37/0.77 % (3412620)Time elapsed: 0.386 s
% 3.37/0.77 % (3412620)Peak memory usage: 21 MB
% 3.37/0.77 % (3412620)Instructions burned: 685 (million)
% 3.37/0.77 % (3412632)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3858788621:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 3.37/0.77 % (3412626)Instruction limit reached!
% 3.37/0.77 % (3412626)------------------------------
% 3.37/0.77 % (3412626)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412626)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412626)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412626)Termination reason: Instruction limit
% 3.37/0.77 % (3412626)Termination phase: Saturation
% 3.37/0.77 % (3412626)Time elapsed: 0.323 s
% 3.37/0.77 % (3412626)Peak memory usage: 15 MB
% 3.37/0.77 % (3412626)Instructions burned: 477 (million)
% 3.37/0.77 % TRYING [7]
% 3.37/0.77 % (3412605) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3412599-3412605"...
% 3.37/0.77 % (3412605)...printing done.
% 3.37/0.77 % (3412605)Refutation found. Thanks to Tanya!
% 3.37/0.77 % SZS status Theorem for theBenchmark
% 3.37/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 3.37/0.77 % (3412605)------------------------------
% 3.37/0.77 % (3412605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.37/0.77 % (3412605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/0.77 % (3412605)CaDiCaL version: 2.1.3
% 3.37/0.77 % (3412605)Termination reason: Refutation
% 3.37/0.77 % (3412605)Time elapsed: 0.507 s
% 3.37/0.77 % (3412605)Peak memory usage: 36 MB
% 3.37/0.77 % (3412605)Instructions burned: 1719 (million)
% 3.37/0.77 % (3412599)Success in time 0.556 s
% 3.37/0.77 % Vampire exiting
%------------------------------------------------------------------------------