%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC204+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 : n002.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:55 PM UTC 2026
% Result : Theorem 2.65s 1.26s
% Output : Refutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of formulae : 131 ( 22 unt; 11 def)
% Number of atoms : 430 ( 84 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 506 ( 207 ~; 225 |; 40 &)
% ( 13 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 3 ( 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 : 64 ( 0 sgn 52 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
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(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
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)
& X3 != X4
& ? [X5] :
( ssList(X5)
& tl(X3) = X5
& app(X2,X5) = X4
& neq(nil,X3) ) )
| neq(X0,nil) )
& ( ~ 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)
& X3 != X4
& ? [X5] :
( ssList(X5)
& tl(X3) = X5
& app(X2,X5) = X4
& neq(nil,X3) ) )
| neq(X0,nil) )
& ( ~ 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(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(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
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(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| tl(X3) != X5
| app(X2,X5) != X4
| ~ neq(nil,X3) ) )
& ~ neq(X0,nil) )
| ( 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)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| tl(X3) != X5
| app(X2,X5) != X4
| ~ neq(nil,X3) ) )
& ~ neq(X0,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ( ( neq(sK54,nil)
& ! [X4] :
( ~ ssList(X4)
| sK56 = X4
| ! [X5] :
( ~ ssList(X5)
| tl(sK56) != X5
| app(sK55,X5) != X4
| ~ neq(nil,sK56) ) )
& ~ neq(sK53,nil) )
| ( neq(sK54,nil)
& ~ neq(sK56,nil) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f390,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f397,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f399,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f403,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f474,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK53,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X4,X5] :
( ~ ssList(X4)
| sK56 = X4
| ~ ssList(X5)
| tl(sK56) != X5
| app(sK55,X5) != X4
| ~ neq(nil,sK56)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( neq(sK54,nil)
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f537,plain,
! [X4] :
( ~ ssList(X4)
| sK56 = X4
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) != X4
| ~ neq(nil,sK56)
| ~ neq(sK56,nil) ),
inference(equality_resolution,[],[f502]) ).
fof(f538,plain,
( ~ ssList(app(sK55,tl(sK56)))
| sK56 = app(sK55,tl(sK56))
| ~ ssList(tl(sK56))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil) ),
inference(equality_resolution,[],[f537]) ).
fof(f539,plain,
neq(sK54,nil),
inference(duplicate_literal_removal,[],[f505]) ).
fof(f548,definition,
( spl57_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f549,plain,
( neq(sK56,nil)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f548]) ).
fof(f552,definition,
( spl57_2
<=> neq(sK53,nil) ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f554,plain,
( ~ neq(sK53,nil)
| spl57_2 ),
inference(avatar_component_clause,[],[f552]) ).
fof(f555,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f500,f552,f548]) ).
fof(f557,definition,
( spl57_3
<=> neq(sK54,nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f559,plain,
( neq(sK54,nil)
| ~ spl57_3 ),
inference(avatar_component_clause,[],[f557]) ).
fof(f562,definition,
( spl57_4
<=> neq(nil,sK56) ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f564,plain,
( ~ neq(nil,sK56)
| spl57_4 ),
inference(avatar_component_clause,[],[f562]) ).
fof(f566,definition,
( spl57_5
<=> ssList(tl(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f567,plain,
( ssList(tl(sK56))
| ~ spl57_5 ),
inference(avatar_component_clause,[],[f566]) ).
fof(f568,plain,
( ~ ssList(tl(sK56))
| spl57_5 ),
inference(avatar_component_clause,[],[f566]) ).
fof(f570,definition,
( spl57_6
<=> sK56 = app(sK55,tl(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_6])],[avatar_definition]) ).
fof(f572,plain,
( sK56 = app(sK55,tl(sK56))
| ~ spl57_6 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f574,definition,
( spl57_7
<=> ssList(app(sK55,tl(sK56))) ),
introduced(definition,[new_symbols(definition,[spl57_7])],[avatar_definition]) ).
fof(f576,plain,
( ~ ssList(app(sK55,tl(sK56)))
| spl57_7 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f577,plain,
( ~ spl57_1
| ~ spl57_4
| ~ spl57_5
| spl57_6
| ~ spl57_7 ),
inference(avatar_split_clause,[],[f538,f574,f570,f566,f562,f548]) ).
fof(f580,plain,
spl57_3,
inference(avatar_split_clause,[],[f539,f557]) ).
fof(f582,definition,
( spl57_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_8])],[avatar_definition]) ).
fof(f583,plain,
( ssList(nil)
| ~ spl57_8 ),
inference(avatar_component_clause,[],[f582]) ).
fof(f615,plain,
spl57_8,
inference(avatar_split_clause,[],[f389,f582]) ).
fof(f618,plain,
( neq(sK56,nil)
| ~ spl57_3 ),
inference(forward_demodulation,[],[f559,f507]) ).
fof(f621,plain,
( ~ neq(sK55,nil)
| spl57_2 ),
inference(forward_demodulation,[],[f554,f506]) ).
fof(f622,plain,
( spl57_1
| ~ spl57_3 ),
inference(avatar_split_clause,[],[f618,f557,f548]) ).
fof(f659,definition,
( spl57_17
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_17])],[avatar_definition]) ).
fof(f661,plain,
( nil = sK55
| ~ spl57_17 ),
inference(avatar_component_clause,[],[f659]) ).
fof(f668,definition,
( spl57_19
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_19])],[avatar_definition]) ).
fof(f669,plain,
( nil != sK56
| spl57_19 ),
inference(avatar_component_clause,[],[f668]) ).
fof(f670,plain,
( nil = sK56
| ~ spl57_19 ),
inference(avatar_component_clause,[],[f668]) ).
fof(f672,plain,
( nil = sK56
| ~ ssList(sK56)
| ~ ssList(nil)
| spl57_4 ),
inference(resolution,[],[f387,f564]) ).
fof(f673,plain,
( nil = sK55
| ~ ssList(nil)
| ~ ssList(sK55)
| spl57_2 ),
inference(resolution,[],[f387,f621]) ).
fof(f678,plain,
( nil = sK55
| ~ ssList(sK55)
| spl57_2
| ~ spl57_8 ),
inference(forward_subsumption_resolution,[],[f673,f583]) ).
fof(f679,plain,
( nil = sK56
| ~ ssList(nil)
| spl57_4 ),
inference(forward_subsumption_resolution,[],[f672,f499]) ).
fof(f680,plain,
( nil = sK55
| spl57_2
| ~ spl57_8 ),
inference(forward_subsumption_resolution,[],[f678,f498]) ).
fof(f681,plain,
( nil = sK56
| spl57_4
| ~ spl57_8 ),
inference(forward_subsumption_resolution,[],[f679,f583]) ).
fof(f682,plain,
( spl57_17
| spl57_2
| ~ spl57_8 ),
inference(avatar_split_clause,[],[f680,f582,f552,f659]) ).
fof(f683,plain,
( spl57_19
| spl57_4
| ~ spl57_8 ),
inference(avatar_split_clause,[],[f681,f582,f562,f668]) ).
fof(f685,plain,
( ~ neq(nil,nil)
| spl57_2
| ~ spl57_17 ),
inference(superposition,[],[f621,f661]) ).
fof(f689,plain,
( neq(nil,nil)
| ~ spl57_1
| ~ spl57_19 ),
inference(superposition,[],[f549,f670]) ).
fof(f699,plain,
( $false
| ~ spl57_1
| spl57_2
| ~ spl57_17
| ~ spl57_19 ),
inference(forward_subsumption_resolution,[],[f689,f685]) ).
fof(f700,plain,
( ~ spl57_1
| spl57_2
| ~ spl57_17
| ~ spl57_19 ),
inference(avatar_contradiction_clause,[],[f699]) ).
fof(f701,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_5 ),
inference(resolution,[],[f568,f399]) ).
fof(f702,plain,
( nil = sK56
| spl57_5 ),
inference(forward_subsumption_resolution,[],[f701,f499]) ).
fof(f703,plain,
( spl57_19
| spl57_5 ),
inference(avatar_split_clause,[],[f702,f566,f668]) ).
fof(f704,plain,
( ~ ssList(app(nil,tl(sK56)))
| spl57_7
| ~ spl57_17 ),
inference(forward_demodulation,[],[f576,f661]) ).
fof(f705,plain,
( ~ ssList(tl(sK56))
| ~ ssList(nil)
| spl57_7
| ~ spl57_17 ),
inference(resolution,[],[f704,f401]) ).
fof(f710,plain,
( ~ ssList(nil)
| ~ spl57_5
| spl57_7
| ~ spl57_17 ),
inference(forward_subsumption_resolution,[],[f705,f567]) ).
fof(f711,plain,
( $false
| ~ spl57_5
| spl57_7
| ~ spl57_8
| ~ spl57_17 ),
inference(forward_subsumption_resolution,[],[f710,f583]) ).
fof(f712,plain,
( ~ spl57_5
| spl57_7
| ~ spl57_8
| ~ spl57_17 ),
inference(avatar_contradiction_clause,[],[f711]) ).
fof(f713,plain,
( sK56 = app(nil,tl(sK56))
| ~ spl57_6
| ~ spl57_17 ),
inference(forward_demodulation,[],[f572,f661]) ).
fof(f718,plain,
( sK56 = tl(sK56)
| ~ ssList(tl(sK56))
| ~ spl57_6
| ~ spl57_17 ),
inference(superposition,[],[f403,f713]) ).
fof(f720,plain,
( sK56 = tl(sK56)
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17 ),
inference(forward_subsumption_resolution,[],[f718,f567]) ).
fof(f753,plain,
( sK56 = cons(hd(sK56),sK56)
| nil = sK56
| ~ ssList(sK56)
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17 ),
inference(superposition,[],[f474,f720]) ).
fof(f760,plain,
( sK56 = cons(hd(sK56),sK56)
| ~ ssList(sK56)
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17
| spl57_19 ),
inference(forward_subsumption_resolution,[],[f753,f669]) ).
fof(f765,plain,
( sK56 = cons(hd(sK56),sK56)
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17
| spl57_19 ),
inference(forward_subsumption_resolution,[],[f760,f499]) ).
fof(f771,plain,
( sK56 != sK56
| ~ ssItem(hd(sK56))
| ~ ssList(sK56)
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17
| spl57_19 ),
inference(superposition,[],[f390,f765]) ).
fof(f773,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(sK56)
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17
| spl57_19 ),
inference(trivial_inequality_removal,[],[f771]) ).
fof(f774,plain,
( ~ ssItem(hd(sK56))
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17
| spl57_19 ),
inference(forward_subsumption_resolution,[],[f773,f499]) ).
fof(f777,definition,
( spl57_20
<=> ssItem(hd(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_20])],[avatar_definition]) ).
fof(f779,plain,
( ~ ssItem(hd(sK56))
| spl57_20 ),
inference(avatar_component_clause,[],[f777]) ).
fof(f787,plain,
( ~ spl57_20
| ~ spl57_5
| ~ spl57_6
| ~ spl57_17
| spl57_19 ),
inference(avatar_split_clause,[],[f774,f668,f659,f570,f566,f777]) ).
fof(f792,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_20 ),
inference(resolution,[],[f779,f397]) ).
fof(f793,plain,
( ~ ssList(sK56)
| spl57_19
| spl57_20 ),
inference(forward_subsumption_resolution,[],[f792,f669]) ).
fof(f794,plain,
( $false
| spl57_19
| spl57_20 ),
inference(forward_subsumption_resolution,[],[f793,f499]) ).
fof(f795,plain,
( spl57_19
| spl57_20 ),
inference(avatar_contradiction_clause,[],[f794]) ).
cnf(s1,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f555]) ).
cnf(s3,plain,
( ~ spl57_1
| ~ spl57_4
| ~ spl57_5
| spl57_6
| ~ spl57_7 ),
inference(sat_conversion,[],[f577]) ).
cnf(s6,plain,
spl57_3,
inference(sat_conversion,[],[f580]) ).
cnf(s15,plain,
spl57_8,
inference(sat_conversion,[],[f615]) ).
cnf(s17,plain,
( spl57_1
| ~ spl57_3 ),
inference(sat_conversion,[],[f622]) ).
cnf(s20,plain,
( spl57_2
| ~ spl57_8
| spl57_17 ),
inference(sat_conversion,[],[f682]) ).
cnf(s21,plain,
( spl57_4
| ~ spl57_8
| spl57_19 ),
inference(sat_conversion,[],[f683]) ).
cnf(s22,plain,
( ~ spl57_1
| spl57_2
| ~ spl57_17
| ~ spl57_19 ),
inference(sat_conversion,[],[f700]) ).
cnf(s23,plain,
( spl57_5
| spl57_19 ),
inference(sat_conversion,[],[f703]) ).
cnf(s25,plain,
( ~ spl57_5
| spl57_7
| ~ spl57_8
| ~ spl57_17 ),
inference(sat_conversion,[],[f712]) ).
cnf(s27,plain,
( ~ spl57_5
| ~ spl57_6
| ~ spl57_17
| spl57_19
| ~ spl57_20 ),
inference(sat_conversion,[],[f787]) ).
cnf(s28,plain,
( spl57_19
| spl57_20 ),
inference(sat_conversion,[],[f795]) ).
cnf(s33,plain,
spl57_1,
inference(rat,[],[s17,s6]) ).
cnf(s34,plain,
( ~ spl57_4
| ~ spl57_5
| spl57_6
| ~ spl57_7 ),
inference(rat,[],[s3,s33]) ).
cnf(s35,plain,
~ spl57_2,
inference(rat,[],[s1,s33]) ).
cnf(s36,plain,
spl57_17,
inference(rat,[],[s20,s15,s35]) ).
cnf(s37,plain,
~ spl57_19,
inference(rat,[],[s22,s35,s33,s36]) ).
cnf(s38,plain,
spl57_20,
inference(rat,[],[s28,s37]) ).
cnf(s39,plain,
spl57_5,
inference(rat,[],[s23,s37]) ).
cnf(s40,plain,
spl57_4,
inference(rat,[],[s21,s15,s37]) ).
cnf(s41,plain,
~ spl57_6,
inference(rat,[],[s27,s38,s37,s36,s39]) ).
cnf(s42,plain,
spl57_7,
inference(rat,[],[s25,s36,s15,s39]) ).
cnf(s43,plain,
$false,
inference(rat,[],[s34,s42,s41,s39,s40]) ).
fof(f796,plain,
$false,
inference(avatar_sat_refutation,[],[s43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC204+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.13/0.37 % Computer : n002.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 28 08:29:22 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.65/1.26 % (209521)Detected formulas, will run a generic FOF schedule.
% 2.65/1.26 % (209526)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=1811120490:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.65/1.26 % (209531)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=185258246:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.65/1.26 % (209530)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2426922388:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.65/1.26 % (209529)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3200276670:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.65/1.26 % (209528)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=3057751248:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.65/1.26 % (209527)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=2682564012:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.65/1.26 % (209531)First to succeed.
% 2.65/1.26 % (209531)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-209521"
% 2.65/1.26 % (209532)dis-21_1_sil=8000:lcm=predicate:random_seed=3857181310: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.65/1.26 % (209530)Also succeeded, but the first one will report.
% 2.65/1.26 % (209529)Instruction limit reached!
% 2.65/1.26 % (209529)------------------------------
% 2.65/1.26 % (209529)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.26 % (209529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.26 % (209529)CaDiCaL version: 2.1.3
% 2.65/1.26 % (209529)Termination reason: Instruction limit
% 2.65/1.26 % (209529)Termination phase: Saturation
% 2.65/1.26 % (209529)Time elapsed: 0.062 s
% 2.65/1.26 % (209529)Peak memory usage: 89 MB
% 2.65/1.26 % (209529)Instructions burned: 110 (million)
% 2.65/1.26 % (209532)Instruction limit reached!
% 2.65/1.26 % (209532)------------------------------
% 2.65/1.26 % (209532)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.26 % (209532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.26 % (209532)CaDiCaL version: 2.1.3
% 2.65/1.26 % (209532)Termination reason: Instruction limit
% 2.65/1.26 % (209532)Termination phase: Saturation
% 2.65/1.26 % (209532)Time elapsed: 0.076 s
% 2.65/1.26 % (209532)Peak memory usage: 90 MB
% 2.65/1.26 % (209532)Instructions burned: 130 (million)
% 2.65/1.26 % (209540)lrs+10_1_sil=8000:sp=occurrence:random_seed=404239481:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.65/1.26 % (209540)Also succeeded, but the first one will report.
% 2.65/1.26 % (209541)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3448079742:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.65/1.26 % (209531)Refutation found. Thanks to Tanya!
% 2.65/1.26 % SZS status Theorem for theBenchmark
% 2.65/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.41/1.38 % (209531)------------------------------
% 3.41/1.38 % (209531)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.41/1.38 % (209531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.41/1.38 % (209531)CaDiCaL version: 2.1.3
% 3.41/1.38 % (209531)Termination reason: Refutation
% 3.41/1.38 % (209531)Time elapsed: 0.015 s
% 3.41/1.38 % (209531)Peak memory usage: 90 MB
% 3.41/1.38 % (209531)Instructions burned: 21 (million)
% 3.41/1.38 % (209531)------------------------------
% 3.41/1.38 % (209531)------------------------------
% 3.41/1.38 % (209521)Success in time 0.416 s
% 3.41/1.38 % Vampire exiting
%------------------------------------------------------------------------------