%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC014+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 : n015.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:04:17 PM UTC 2026
% Result : Theorem 2.20s 0.81s
% Output : Refutation 2.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of formulae : 158 ( 30 unt; 12 def)
% Number of atoms : 497 ( 106 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 533 ( 194 ~; 263 |; 36 &)
% ( 14 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 13 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 80 !; 16 ?)
% 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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f86,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil != X0
=> tl(app(X0,X1)) = app(tl(X0),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X1 = X4
& ? [X5] :
( ssList(X5)
& tl(X1) = X5
& app(X0,X5) = X4
& neq(nil,X1) ) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X6,nil) != X2
| app(cons(X6,nil),X7) != X3 ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X1 = X4
& ? [X5] :
( ssList(X5)
& tl(X1) = X5
& app(X0,X5) = X4
& neq(nil,X1) ) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X6,nil) != X2
| app(cons(X6,nil),X7) != X3 ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
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(f131,plain,
! [X0] :
( ! [X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f204,plain,
! [X0] :
( ! [X1] :
( tl(app(X0,X1)) = app(tl(X0),X1)
| nil = X0
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f205,plain,
! [X0] :
( ! [X1] :
( tl(app(X0,X1)) = app(tl(X0),X1)
| nil = X0
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f204]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X1 != X4
| ! [X5] :
( ~ ssList(X5)
| tl(X1) != X5
| app(X0,X5) != X4
| ~ neq(nil,X1) ) )
& ? [X6] :
( ? [X7] :
( cons(X6,nil) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X1 != X4
| ! [X5] :
( ~ ssList(X5)
| tl(X1) != X5
| app(X0,X5) != X4
| ~ neq(nil,X1) ) )
& ? [X6] :
( ? [X7] :
( cons(X6,nil) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f307,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != X0 ),
inference(cnf_transformation,[],[f120]) ).
fof(f316,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f130]) ).
fof(f317,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f318,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f132]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f399,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil = X0
| tl(app(X0,X1)) = app(tl(X0),X1) ),
inference(cnf_transformation,[],[f205]) ).
fof(f412,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK48)
| app(sK47,X5) != X4
| tl(sK48) != X5
| ~ ssList(X5)
| sK48 != X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( ~ neq(sK50,nil)
| sK50 = app(cons(sK51,nil),sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( ~ neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f428,plain,
ssList(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f429,plain,
ssList(sK49),
inference(definition_unfolding,[],[f428,f424]) ).
fof(f430,plain,
ssList(sK50),
inference(definition_unfolding,[],[f427,f425]) ).
fof(f432,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f421,f425]) ).
fof(f437,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| app(sK49,X5) != X4
| tl(sK50) != X5
| ~ ssList(X5)
| sK50 != X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f412,f425,f424,f425,f425]) ).
fof(f453,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f464,plain,
! [X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| tl(sK50) != X5
| ~ ssList(X5)
| sK50 != app(sK49,X5)
| ~ ssList(app(sK49,X5)) ),
inference(equality_resolution,[],[f437]) ).
fof(f465,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssList(tl(sK50))
| sK50 != app(sK49,tl(sK50))
| ~ ssList(app(sK49,tl(sK50))) ),
inference(equality_resolution,[],[f464]) ).
fof(f547,plain,
! [X1] :
( ssList(X1)
| ssList(X1)
| neq(X1,X1) ),
inference(consistent_polarity_flipping,[],[f453]) ).
fof(f548,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ssList(X1)
| X0 = X1
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f550,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f551,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ssItem(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f307]) ).
fof(f560,plain,
! [X0] :
( ~ ssList(tl(X0))
| nil = X0
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f316]) ).
fof(f561,plain,
! [X0,X1] :
( ssList(X0)
| ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
inference(consistent_polarity_flipping,[],[f317]) ).
fof(f562,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ssList(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f318]) ).
fof(f564,plain,
! [X0] :
( ssList(X0)
| app(nil,X0) = X0 ),
inference(consistent_polarity_flipping,[],[f320]) ).
fof(f640,plain,
! [X0,X1] :
( ssList(X0)
| ssList(X1)
| nil = X0
| tl(app(X0,X1)) = app(tl(X0),X1) ),
inference(consistent_polarity_flipping,[],[f399]) ).
fof(f652,plain,
~ ssList(sK49),
inference(consistent_polarity_flipping,[],[f429]) ).
fof(f653,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f430]) ).
fof(f657,plain,
~ neq(sK50,nil),
inference(consistent_polarity_flipping,[],[f432]) ).
fof(f659,plain,
( neq(sK50,nil)
| ~ ssItem(sK51) ),
inference(consistent_polarity_flipping,[],[f419]) ).
fof(f660,plain,
( neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(consistent_polarity_flipping,[],[f418]) ).
fof(f661,plain,
( neq(sK50,nil)
| sK50 = app(cons(sK51,nil),sK52) ),
inference(consistent_polarity_flipping,[],[f417]) ).
fof(f662,plain,
( neq(sK50,nil)
| ~ ssList(sK52) ),
inference(consistent_polarity_flipping,[],[f416]) ).
fof(f666,plain,
( neq(sK50,nil)
| neq(nil,sK50)
| ssList(tl(sK50))
| sK50 != app(sK49,tl(sK50))
| ssList(app(sK49,tl(sK50))) ),
inference(consistent_polarity_flipping,[],[f465]) ).
fof(f672,plain,
! [X1] :
( neq(X1,X1)
| ssList(X1) ),
inference(duplicate_literal_removal,[],[f547]) ).
fof(f676,definition,
( spl53_1
<=> ssList(app(sK49,tl(sK50))) ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f678,plain,
( ssList(app(sK49,tl(sK50)))
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f676]) ).
fof(f680,definition,
( spl53_2
<=> sK50 = app(sK49,tl(sK50)) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f682,plain,
( sK50 != app(sK49,tl(sK50))
| spl53_2 ),
inference(avatar_component_clause,[],[f680]) ).
fof(f684,definition,
( spl53_3
<=> ssList(tl(sK50)) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f685,plain,
( ~ ssList(tl(sK50))
| spl53_3 ),
inference(avatar_component_clause,[],[f684]) ).
fof(f686,plain,
( ssList(tl(sK50))
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f684]) ).
fof(f688,definition,
( spl53_4
<=> neq(nil,sK50) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f690,plain,
( neq(nil,sK50)
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f688]) ).
fof(f692,definition,
( spl53_5
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f694,plain,
( ~ neq(sK50,nil)
| spl53_5 ),
inference(avatar_component_clause,[],[f692]) ).
fof(f696,plain,
( spl53_1
| ~ spl53_2
| spl53_3
| spl53_4
| spl53_5 ),
inference(avatar_split_clause,[],[f666,f692,f688,f684,f680,f676]) ).
fof(f698,definition,
( spl53_6
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).
fof(f700,plain,
( ~ ssList(sK52)
| spl53_6 ),
inference(avatar_component_clause,[],[f698]) ).
fof(f703,definition,
( spl53_7
<=> sK50 = app(cons(sK51,nil),sK52) ),
introduced(definition,[new_symbols(definition,[spl53_7])],[avatar_definition]) ).
fof(f705,plain,
( sK50 = app(cons(sK51,nil),sK52)
| ~ spl53_7 ),
inference(avatar_component_clause,[],[f703]) ).
fof(f708,definition,
( spl53_8
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl53_8])],[avatar_definition]) ).
fof(f710,plain,
( sK49 = cons(sK51,nil)
| ~ spl53_8 ),
inference(avatar_component_clause,[],[f708]) ).
fof(f712,plain,
( ~ spl53_6
| spl53_5 ),
inference(avatar_split_clause,[],[f662,f692,f698]) ).
fof(f713,plain,
( spl53_7
| spl53_5 ),
inference(avatar_split_clause,[],[f661,f692,f703]) ).
fof(f714,plain,
( spl53_8
| spl53_5 ),
inference(avatar_split_clause,[],[f660,f692,f708]) ).
fof(f716,definition,
( spl53_9
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl53_9])],[avatar_definition]) ).
fof(f718,plain,
( ~ ssItem(sK51)
| spl53_9 ),
inference(avatar_component_clause,[],[f716]) ).
fof(f719,plain,
( ~ spl53_9
| spl53_5 ),
inference(avatar_split_clause,[],[f659,f692,f716]) ).
fof(f721,plain,
~ spl53_5,
inference(avatar_split_clause,[],[f657,f692]) ).
fof(f727,definition,
( spl53_11
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_11])],[avatar_definition]) ).
fof(f728,plain,
( ~ ssList(nil)
| spl53_11 ),
inference(avatar_component_clause,[],[f727]) ).
fof(f756,plain,
~ spl53_11,
inference(avatar_split_clause,[],[f550,f727]) ).
fof(f757,plain,
( sK50 = app(sK49,sK52)
| ~ spl53_7
| ~ spl53_8 ),
inference(forward_demodulation,[],[f705,f710]) ).
fof(f795,plain,
( sK52 = app(nil,sK52)
| spl53_6 ),
inference(resolution,[],[f564,f700]) ).
fof(f855,plain,
( nil != sK49
| ssItem(sK51)
| ssList(nil)
| ~ spl53_8 ),
inference(superposition,[],[f551,f710]) ).
fof(f856,plain,
( nil != sK49
| ssList(nil)
| ~ spl53_8
| spl53_9 ),
inference(forward_subsumption_resolution,[],[f855,f718]) ).
fof(f857,plain,
( nil != sK49
| ~ spl53_8
| spl53_9
| spl53_11 ),
inference(forward_subsumption_resolution,[],[f856,f728]) ).
fof(f968,plain,
( ! [X0] :
( ssList(X0)
| tl(cons(sK51,X0)) = X0 )
| spl53_9 ),
inference(resolution,[],[f561,f718]) ).
fof(f1038,definition,
( spl53_22
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_22])],[avatar_definition]) ).
fof(f1039,plain,
( nil != sK50
| spl53_22 ),
inference(avatar_component_clause,[],[f1038]) ).
fof(f1040,plain,
( nil = sK50
| ~ spl53_22 ),
inference(avatar_component_clause,[],[f1038]) ).
fof(f1110,plain,
( ~ neq(nil,nil)
| spl53_5
| ~ spl53_22 ),
inference(superposition,[],[f694,f1040]) ).
fof(f1169,plain,
( ssList(nil)
| spl53_5
| ~ spl53_22 ),
inference(resolution,[],[f1110,f672]) ).
fof(f1170,plain,
( $false
| spl53_5
| spl53_11
| ~ spl53_22 ),
inference(forward_subsumption_resolution,[],[f1169,f728]) ).
fof(f1171,plain,
( spl53_5
| spl53_11
| ~ spl53_22 ),
inference(avatar_contradiction_clause,[],[f1170]) ).
fof(f1823,plain,
! [X0] :
( ssList(X0)
| nil = sK49
| tl(app(sK49,X0)) = app(tl(sK49),X0) ),
inference(resolution,[],[f640,f652]) ).
fof(f1864,plain,
( ! [X0] :
( ssList(X0)
| tl(app(sK49,X0)) = app(tl(sK49),X0) )
| ~ spl53_8
| spl53_9
| spl53_11 ),
inference(forward_subsumption_resolution,[],[f1823,f857]) ).
fof(f2818,plain,
( nil = sK50
| ssList(sK50)
| ~ spl53_3 ),
inference(resolution,[],[f686,f560]) ).
fof(f2819,plain,
( ssList(sK50)
| ~ spl53_3
| spl53_22 ),
inference(forward_subsumption_resolution,[],[f2818,f1039]) ).
fof(f2820,plain,
( $false
| ~ spl53_3
| spl53_22 ),
inference(forward_subsumption_resolution,[],[f2819,f653]) ).
fof(f2821,plain,
( ~ spl53_3
| spl53_22 ),
inference(avatar_contradiction_clause,[],[f2820]) ).
fof(f3035,plain,
( nil = tl(cons(sK51,nil))
| spl53_9
| spl53_11 ),
inference(resolution,[],[f968,f728]) ).
fof(f3073,plain,
( nil = tl(sK49)
| ~ spl53_8
| spl53_9
| spl53_11 ),
inference(forward_demodulation,[],[f3035,f710]) ).
fof(f3338,plain,
( ssList(sK50)
| nil = sK50
| ssList(nil)
| ~ spl53_4 ),
inference(resolution,[],[f690,f548]) ).
fof(f3341,plain,
( nil = sK50
| ssList(nil)
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f3338,f653]) ).
fof(f3351,plain,
( ssList(nil)
| ~ spl53_4
| spl53_22 ),
inference(forward_subsumption_resolution,[],[f3341,f1039]) ).
fof(f3352,plain,
( $false
| ~ spl53_4
| spl53_11
| spl53_22 ),
inference(forward_subsumption_resolution,[],[f3351,f728]) ).
fof(f3353,plain,
( ~ spl53_4
| spl53_11
| spl53_22 ),
inference(avatar_contradiction_clause,[],[f3352]) ).
fof(f3656,definition,
( spl53_161
<=> nil = tl(sK49) ),
introduced(definition,[new_symbols(definition,[spl53_161])],[avatar_definition]) ).
fof(f3658,plain,
( nil = tl(sK49)
| ~ spl53_161 ),
inference(avatar_component_clause,[],[f3656]) ).
fof(f4363,plain,
( tl(app(sK49,sK52)) = app(tl(sK49),sK52)
| spl53_6
| ~ spl53_8
| spl53_9
| spl53_11 ),
inference(resolution,[],[f1864,f700]) ).
fof(f4364,plain,
( tl(sK50) = app(tl(sK49),sK52)
| spl53_6
| ~ spl53_7
| ~ spl53_8
| spl53_9
| spl53_11 ),
inference(forward_demodulation,[],[f4363,f757]) ).
fof(f6847,plain,
( spl53_161
| ~ spl53_8
| spl53_9
| spl53_11 ),
inference(avatar_split_clause,[],[f3073,f727,f716,f708,f3656]) ).
fof(f13521,plain,
( tl(sK50) = app(nil,sK52)
| spl53_6
| ~ spl53_7
| ~ spl53_8
| spl53_9
| spl53_11
| ~ spl53_161 ),
inference(forward_demodulation,[],[f4364,f3658]) ).
fof(f13644,plain,
( sK52 = tl(sK50)
| spl53_6
| ~ spl53_7
| ~ spl53_8
| spl53_9
| spl53_11
| ~ spl53_161 ),
inference(forward_demodulation,[],[f13521,f795]) ).
fof(f13994,plain,
( ssList(tl(sK50))
| ssList(sK49)
| ~ spl53_1 ),
inference(resolution,[],[f678,f562]) ).
fof(f13995,plain,
( ssList(sK49)
| ~ spl53_1
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f13994,f685]) ).
fof(f13996,plain,
( $false
| ~ spl53_1
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f13995,f652]) ).
fof(f13997,plain,
( ~ spl53_1
| spl53_3 ),
inference(avatar_contradiction_clause,[],[f13996]) ).
fof(f14873,plain,
( sK50 != app(sK49,sK52)
| spl53_2
| spl53_6
| ~ spl53_7
| ~ spl53_8
| spl53_9
| spl53_11
| ~ spl53_161 ),
inference(superposition,[],[f682,f13644]) ).
fof(f14891,plain,
( $false
| spl53_2
| spl53_6
| ~ spl53_7
| ~ spl53_8
| spl53_9
| spl53_11
| ~ spl53_161 ),
inference(forward_subsumption_resolution,[],[f14873,f757]) ).
fof(f14892,plain,
( spl53_2
| spl53_6
| ~ spl53_7
| ~ spl53_8
| spl53_9
| spl53_11
| ~ spl53_161 ),
inference(avatar_contradiction_clause,[],[f14891]) ).
cnf(s2,plain,
( spl53_1
| ~ spl53_2
| spl53_3
| spl53_4
| spl53_5 ),
inference(sat_conversion,[],[f696]) ).
cnf(s6,plain,
( spl53_5
| ~ spl53_6 ),
inference(sat_conversion,[],[f712]) ).
cnf(s7,plain,
( spl53_5
| spl53_7 ),
inference(sat_conversion,[],[f713]) ).
cnf(s8,plain,
( spl53_5
| spl53_8 ),
inference(sat_conversion,[],[f714]) ).
cnf(s9,plain,
( spl53_5
| ~ spl53_9 ),
inference(sat_conversion,[],[f719]) ).
cnf(s11,plain,
~ spl53_5,
inference(sat_conversion,[],[f721]) ).
cnf(s20,plain,
~ spl53_11,
inference(sat_conversion,[],[f756]) ).
cnf(s26,plain,
( spl53_5
| spl53_11
| ~ spl53_22 ),
inference(sat_conversion,[],[f1171]) ).
cnf(s104,plain,
( ~ spl53_3
| spl53_22 ),
inference(sat_conversion,[],[f2821]) ).
cnf(s133,plain,
( ~ spl53_4
| spl53_11
| spl53_22 ),
inference(sat_conversion,[],[f3353]) ).
cnf(s350,plain,
( ~ spl53_8
| spl53_9
| spl53_11
| spl53_161 ),
inference(sat_conversion,[],[f6847]) ).
cnf(s589,plain,
( ~ spl53_1
| spl53_3 ),
inference(sat_conversion,[],[f13997]) ).
cnf(s704,plain,
( spl53_2
| spl53_6
| ~ spl53_7
| ~ spl53_8
| spl53_9
| spl53_11
| ~ spl53_161 ),
inference(sat_conversion,[],[f14892]) ).
cnf(s710,plain,
~ spl53_22,
inference(rat,[],[s26,s20,s11]) ).
cnf(s714,plain,
~ spl53_3,
inference(rat,[],[s104,s710]) ).
cnf(s719,plain,
~ spl53_4,
inference(rat,[],[s133,s20,s710]) ).
cnf(s720,plain,
~ spl53_1,
inference(rat,[],[s589,s714]) ).
cnf(s763,plain,
~ spl53_9,
inference(rat,[],[s9,s11]) ).
cnf(s765,plain,
spl53_8,
inference(rat,[],[s8,s11]) ).
cnf(s768,plain,
spl53_161,
inference(rat,[],[s350,s763,s20,s765]) ).
cnf(s824,plain,
spl53_7,
inference(rat,[],[s7,s11]) ).
cnf(s825,plain,
~ spl53_6,
inference(rat,[],[s6,s11]) ).
cnf(s826,plain,
spl53_2,
inference(rat,[],[s704,s768,s20,s763,s765,s824,s825]) ).
cnf(s839,plain,
$false,
inference(rat,[],[s2,s11,s719,s714,s826,s720]) ).
fof(f14898,plain,
$false,
inference(avatar_sat_refutation,[],[s839]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC014+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 07:29:32 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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
% 2.20/0.81 % (2449505)Will run a generic schedule for satisfiability detection.
% 2.20/0.81 % (2449513)dis+10_1_sil=32000:sp=arity:random_seed=4113012684:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.20/0.81 % (2449511)% WARNING: option uhcvi not known.
% 2.20/0.81 % (2449510)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=873541875_2999 on theBenchmark for (2999ds/0Mi)
% 2.20/0.81 % (2449512)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4133093240:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.20/0.81 % (2449514)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4099377434:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.20/0.81 % (2449511)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=307281487:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.20/0.81 % (2449515)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1700957303:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.20/0.81 % (2449516)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1411240521:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.20/0.81 % TRYING [1]
% 2.20/0.81 % TRYING [2]
% 2.20/0.81 % TRYING [3]
% 2.20/0.81 % (2449513)Instruction limit reached!
% 2.20/0.81 % (2449513)------------------------------
% 2.20/0.81 % (2449513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449513)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449513)Termination reason: Instruction limit
% 2.20/0.81 % (2449513)Termination phase: Saturation
% 2.20/0.81 % (2449513)Time elapsed: 0.035 s
% 2.20/0.81 % (2449513)Peak memory usage: 13 MB
% 2.20/0.81 % (2449513)Instructions burned: 103 (million)
% 2.20/0.81 % TRYING [4]
% 2.20/0.81 % (2449524)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=26923695:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.20/0.81 % TRYING [1]
% 2.20/0.81 % TRYING [2]
% 2.20/0.81 % TRYING [3]
% 2.20/0.81 % TRYING [4]
% 2.20/0.81 % (2449514)Instruction limit reached!
% 2.20/0.81 % (2449514)------------------------------
% 2.20/0.81 % (2449514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449514)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449514)Termination reason: Instruction limit
% 2.20/0.81 % (2449514)Termination phase: Saturation
% 2.20/0.81 % (2449514)Time elapsed: 0.070 s
% 2.20/0.81 % (2449514)Peak memory usage: 13 MB
% 2.20/0.81 % (2449514)Instructions burned: 116 (million)
% 2.20/0.81 % (2449515)Instruction limit reached!
% 2.20/0.81 % (2449515)------------------------------
% 2.20/0.81 % (2449515)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449515)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449515)Termination reason: Instruction limit
% 2.20/0.81 % (2449515)Termination phase: Saturation
% 2.20/0.81 % (2449515)Time elapsed: 0.076 s
% 2.20/0.81 % (2449515)Peak memory usage: 14 MB
% 2.20/0.81 % (2449515)Instructions burned: 131 (million)
% 2.20/0.81 % (2449526)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2238465748:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.20/0.81 % TRYING [5]
% 2.20/0.81 % TRYING [5]
% 2.20/0.81 % (2449527)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=1128484734:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.20/0.81 % (2449516)Instruction limit reached!
% 2.20/0.81 % (2449516)------------------------------
% 2.20/0.81 % (2449516)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449516)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449516)Termination reason: Instruction limit
% 2.20/0.81 % (2449516)Termination phase: Saturation
% 2.20/0.81 % (2449516)Time elapsed: 0.105 s
% 2.20/0.81 % (2449516)Peak memory usage: 15 MB
% 2.20/0.81 % (2449516)Instructions burned: 160 (million)
% 2.20/0.81 % (2449530)ott-21_1_sil=16000:fs=off:random_seed=3865110683:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.20/0.81 % (2449526)Instruction limit reached!
% 2.20/0.81 % (2449526)------------------------------
% 2.20/0.81 % (2449526)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449526)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449526)Termination reason: Instruction limit
% 2.20/0.81 % (2449526)Termination phase: Saturation
% 2.20/0.81 % (2449526)Time elapsed: 0.070 s
% 2.20/0.81 % (2449526)Peak memory usage: 13 MB
% 2.20/0.81 % (2449526)Instructions burned: 132 (million)
% 2.20/0.81 % (2449532)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3705595243:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.20/0.81 % TRYING [6]
% 2.20/0.81 % (2449524)Instruction limit reached!
% 2.20/0.81 % (2449524)------------------------------
% 2.20/0.81 % (2449524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449524)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449524)Termination reason: Instruction limit
% 2.20/0.81 % (2449524)Termination phase: Finite model building constraint generation
% 2.20/0.81 % (2449524)Time elapsed: 0.168 s
% 2.20/0.81 % (2449524)Peak memory usage: 29 MB
% 2.20/0.81 % (2449524)Instructions burned: 715 (million)
% 2.20/0.81 % (2449530)Instruction limit reached!
% 2.20/0.81 % (2449530)------------------------------
% 2.20/0.81 % (2449530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449530)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449530)Termination reason: Instruction limit
% 2.20/0.81 % (2449530)Termination phase: Saturation
% 2.20/0.81 % (2449530)Time elapsed: 0.090 s
% 2.20/0.81 % (2449530)Peak memory usage: 14 MB
% 2.20/0.81 % (2449530)Instructions burned: 181 (million)
% 2.20/0.81 % (2449534)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1515732961:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.20/0.81 % TRYING [6]
% 2.20/0.81 % TRYING [1]
% 2.20/0.81 % TRYING [2]
% 2.20/0.81 % TRYING [3]
% 2.20/0.81 % (2449535)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2258218129:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.20/0.81 % TRYING [4]
% 2.20/0.81 % TRYING [5]
% 2.20/0.81 % (2449511) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2449505-2449511"...
% 2.20/0.81 % (2449511)...printing done.
% 2.20/0.81 % (2449511)Refutation found. Thanks to Tanya!
% 2.20/0.81 % SZS status Theorem for theBenchmark
% 2.20/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 2.20/0.81 % (2449511)------------------------------
% 2.20/0.81 % (2449511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.20/0.81 % (2449511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.20/0.81 % (2449511)CaDiCaL version: 2.1.3
% 2.20/0.81 % (2449511)Termination reason: Refutation
% 2.20/0.81 % (2449511)Time elapsed: 0.337 s
% 2.20/0.81 % (2449511)Peak memory usage: 20 MB
% 2.20/0.81 % (2449511)Instructions burned: 623 (million)
% 2.20/0.81 % (2449505)Success in time 0.382 s
% 2.20/0.81 % Vampire exiting
%------------------------------------------------------------------------------