TSTP Solution File: SWC004+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC004+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 18:38:09 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 77 ( 8 unt; 0 def)
% Number of atoms : 503 ( 135 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 650 ( 224 ~; 198 |; 181 &)
% ( 13 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 12 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 168 ( 89 !; 79 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1070,plain,
$false,
inference(avatar_sat_refutation,[],[f634,f652,f653,f659,f666,f667,f668,f671,f699,f838,f924,f1053]) ).
fof(f1053,plain,
( ~ spl54_8
| ~ spl54_6
| ~ spl54_46 ),
inference(avatar_split_clause,[],[f1014,f904,f621,f631]) ).
fof(f631,plain,
( spl54_8
<=> ssItem(sK35) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_8])]) ).
fof(f621,plain,
( spl54_6
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_6])]) ).
fof(f904,plain,
( spl54_46
<=> nil = cons(sK35,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_46])]) ).
fof(f1014,plain,
( ~ ssList(nil)
| ~ ssItem(sK35)
| ~ spl54_46 ),
inference(trivial_inequality_removal,[],[f1011]) ).
fof(f1011,plain,
( nil != nil
| ~ ssList(nil)
| ~ ssItem(sK35)
| ~ spl54_46 ),
inference(superposition,[],[f513,f906]) ).
fof(f906,plain,
( nil = cons(sK35,nil)
| ~ spl54_46 ),
inference(avatar_component_clause,[],[f904]) ).
fof(f513,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f173,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).
fof(f924,plain,
( ~ spl54_6
| ~ spl54_19
| spl54_46
| spl54_18 ),
inference(avatar_split_clause,[],[f918,f692,f904,f696,f621]) ).
fof(f696,plain,
( spl54_19
<=> ssList(cons(sK35,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_19])]) ).
fof(f692,plain,
( spl54_18
<=> neq(cons(sK35,nil),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_18])]) ).
fof(f918,plain,
( nil = cons(sK35,nil)
| ~ ssList(cons(sK35,nil))
| ~ ssList(nil)
| spl54_18 ),
inference(resolution,[],[f530,f694]) ).
fof(f694,plain,
( ~ neq(cons(sK35,nil),nil)
| spl54_18 ),
inference(avatar_component_clause,[],[f692]) ).
fof(f530,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f327]) ).
fof(f327,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f180]) ).
fof(f180,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f838,plain,
( ~ spl54_6
| ~ spl54_8
| spl54_19 ),
inference(avatar_split_clause,[],[f837,f696,f631,f621]) ).
fof(f837,plain,
( ~ ssItem(sK35)
| ~ ssList(nil)
| spl54_19 ),
inference(resolution,[],[f548,f698]) ).
fof(f698,plain,
( ~ ssList(cons(sK35,nil))
| spl54_19 ),
inference(avatar_component_clause,[],[f696]) ).
fof(f548,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f699,plain,
( ~ spl54_18
| ~ spl54_19
| ~ spl54_12
| ~ spl54_2
| ~ spl54_3
| ~ spl54_4
| ~ spl54_10 ),
inference(avatar_split_clause,[],[f690,f640,f613,f608,f603,f649,f696,f692]) ).
fof(f649,plain,
( spl54_12
<=> ssList(sK37) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_12])]) ).
fof(f603,plain,
( spl54_2
<=> ssList(sK36) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_2])]) ).
fof(f608,plain,
( spl54_3
<=> sK34 = app(app(sK36,cons(sK35,nil)),sK37) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_3])]) ).
fof(f613,plain,
( spl54_4
<=> app(sK36,sK37) = sK31 ),
introduced(avatar_definition,[new_symbols(naming,[spl54_4])]) ).
fof(f640,plain,
( spl54_10
<=> ! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK34
| app(X4,X6) != sK31
| ~ ssList(X6)
| ~ neq(X5,nil)
| ~ ssList(X4)
| ~ ssList(X5) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_10])]) ).
fof(f690,plain,
( ~ ssList(sK36)
| ~ ssList(sK37)
| ~ ssList(cons(sK35,nil))
| ~ neq(cons(sK35,nil),nil)
| ~ spl54_3
| ~ spl54_4
| ~ spl54_10 ),
inference(trivial_inequality_removal,[],[f689]) ).
fof(f689,plain,
( ~ ssList(sK37)
| ~ ssList(sK36)
| sK31 != sK31
| ~ ssList(cons(sK35,nil))
| ~ neq(cons(sK35,nil),nil)
| ~ spl54_3
| ~ spl54_4
| ~ spl54_10 ),
inference(forward_demodulation,[],[f676,f615]) ).
fof(f615,plain,
( app(sK36,sK37) = sK31
| ~ spl54_4 ),
inference(avatar_component_clause,[],[f613]) ).
fof(f676,plain,
( ~ ssList(cons(sK35,nil))
| ~ ssList(sK37)
| ~ neq(cons(sK35,nil),nil)
| app(sK36,sK37) != sK31
| ~ ssList(sK36)
| ~ spl54_3
| ~ spl54_10 ),
inference(trivial_inequality_removal,[],[f675]) ).
fof(f675,plain,
( sK34 != sK34
| ~ neq(cons(sK35,nil),nil)
| ~ ssList(sK36)
| ~ ssList(sK37)
| app(sK36,sK37) != sK31
| ~ ssList(cons(sK35,nil))
| ~ spl54_3
| ~ spl54_10 ),
inference(superposition,[],[f641,f610]) ).
fof(f610,plain,
( sK34 = app(app(sK36,cons(sK35,nil)),sK37)
| ~ spl54_3 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f641,plain,
( ! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK34
| ~ ssList(X6)
| app(X4,X6) != sK31
| ~ ssList(X5)
| ~ ssList(X4)
| ~ neq(X5,nil) )
| ~ spl54_10 ),
inference(avatar_component_clause,[],[f640]) ).
fof(f671,plain,
( spl54_2
| ~ spl54_1 ),
inference(avatar_split_clause,[],[f458,f599,f603]) ).
fof(f599,plain,
( spl54_1
<=> neq(sK34,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_1])]) ).
fof(f458,plain,
( ~ neq(sK34,nil)
| ssList(sK36) ),
inference(cnf_transformation,[],[f302]) ).
fof(f302,plain,
( ssList(sK32)
& ssList(sK33)
& sK32 = sK34
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(sK32,nil)
& ssList(sK37)
& sK33 = app(sK36,sK37)
& sK34 = app(app(sK36,cons(sK35,nil)),sK37)
& ssList(sK36)
& ssItem(sK35) )
| ( ~ neq(sK34,nil)
& neq(sK32,nil) ) )
& sK33 = sK31
& ssList(sK34)
& ssList(sK31) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32,sK33,sK34,sK35,sK36,sK37])],[f294,f301,f300,f299,f298,f297,f296,f295]) ).
fof(f295,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ neq(X5,nil)
| app(X4,X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(X1,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X0 = X2
& ssList(X3) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(X1,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& sK31 = X2
& ssList(X3) ) ) )
& ssList(sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f296,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(X1,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& sK31 = X2
& ssList(X3) ) ) )
=> ( ssList(sK32)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK32 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(sK32,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(sK32,nil) ) )
& sK31 = X2
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f297,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK32 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(sK32,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(sK32,nil) ) )
& sK31 = X2
& ssList(X3) ) )
=> ( ssList(sK33)
& ? [X3] :
( sK32 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(sK32,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = sK33
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(sK32,nil) ) )
& sK33 = sK31
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f298,plain,
( ? [X3] :
( sK32 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(sK32,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = sK33
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(sK32,nil) ) )
& sK33 = sK31
& ssList(X3) )
=> ( sK32 = sK34
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(sK32,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = sK33
& app(app(X8,cons(X7,nil)),X9) = sK34 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(sK34,nil)
& neq(sK32,nil) ) )
& sK33 = sK31
& ssList(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f299,plain,
( ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = sK33
& app(app(X8,cons(X7,nil)),X9) = sK34 )
& ssList(X8) )
& ssItem(X7) )
=> ( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = sK33
& sK34 = app(app(X8,cons(sK35,nil)),X9) )
& ssList(X8) )
& ssItem(sK35) ) ),
introduced(choice_axiom,[]) ).
fof(f300,plain,
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = sK33
& sK34 = app(app(X8,cons(sK35,nil)),X9) )
& ssList(X8) )
=> ( ? [X9] :
( ssList(X9)
& app(sK36,X9) = sK33
& sK34 = app(app(sK36,cons(sK35,nil)),X9) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f301,plain,
( ? [X9] :
( ssList(X9)
& app(sK36,X9) = sK33
& sK34 = app(app(sK36,cons(sK35,nil)),X9) )
=> ( ssList(sK37)
& sK33 = app(sK36,sK37)
& sK34 = app(app(sK36,cons(sK35,nil)),sK37) ) ),
introduced(choice_axiom,[]) ).
fof(f294,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ neq(X5,nil)
| app(X4,X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& neq(X1,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 )
& ssList(X8) )
& ssItem(X7) ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X0 = X2
& ssList(X3) ) ) )
& ssList(X0) ),
inference(rectify,[],[f122]) ).
fof(f122,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( ( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(app(X7,X8),X9) != X1
| ~ neq(X8,nil)
| app(X7,X9) != X0
| ~ ssList(X9) )
| ~ ssList(X8) ) )
& neq(X1,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3 )
& ssList(X5) )
& ssItem(X4) ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X0 = X2
& ssList(X3) ) ) )
& ssList(X0) ),
inference(flattening,[],[f121]) ).
fof(f121,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(X5,X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(app(X7,X8),X9) != X1
| ~ neq(X8,nil)
| app(X7,X9) != X0
| ~ ssList(X9) )
| ~ ssList(X8) ) )
& neq(X1,nil) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,cons(X4,nil)),X6) != X3
| app(X5,X6) != X2 ) ) ) )
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(app(X7,X8),X9) = X1
& app(X7,X9) = X0
& neq(X8,nil) ) ) )
| ~ neq(X1,nil) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) )
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ~ neq(X1,nil)
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(X8,X9) != X2 ) ) ) )
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X4,X5),X6) = X1
& ssList(X6)
& neq(X5,nil)
& app(X4,X6) = X0 ) ) ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ~ neq(X1,nil)
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(X8,X9) != X2 ) ) ) )
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X4,X5),X6) = X1
& ssList(X6)
& neq(X5,nil)
& app(X4,X6) = X0 ) ) ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f668,plain,
( ~ spl54_1
| spl54_4 ),
inference(avatar_split_clause,[],[f558,f613,f599]) ).
fof(f558,plain,
( app(sK36,sK37) = sK31
| ~ neq(sK34,nil) ),
inference(definition_unfolding,[],[f462,f454]) ).
fof(f454,plain,
sK33 = sK31,
inference(cnf_transformation,[],[f302]) ).
fof(f462,plain,
( sK33 = app(sK36,sK37)
| ~ neq(sK34,nil) ),
inference(cnf_transformation,[],[f302]) ).
fof(f667,plain,
spl54_1,
inference(avatar_split_clause,[],[f590,f599]) ).
fof(f590,plain,
neq(sK34,nil),
inference(duplicate_literal_removal,[],[f556]) ).
fof(f556,plain,
( neq(sK34,nil)
| neq(sK34,nil) ),
inference(definition_unfolding,[],[f465,f469,f469]) ).
fof(f469,plain,
sK32 = sK34,
inference(cnf_transformation,[],[f302]) ).
fof(f465,plain,
( neq(sK32,nil)
| neq(sK32,nil) ),
inference(cnf_transformation,[],[f302]) ).
fof(f666,plain,
( ~ spl54_1
| spl54_3 ),
inference(avatar_split_clause,[],[f460,f608,f599]) ).
fof(f460,plain,
( sK34 = app(app(sK36,cons(sK35,nil)),sK37)
| ~ neq(sK34,nil) ),
inference(cnf_transformation,[],[f302]) ).
fof(f659,plain,
( ~ spl54_1
| spl54_10 ),
inference(avatar_split_clause,[],[f553,f640,f599]) ).
fof(f553,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK34
| ~ ssList(X5)
| app(X4,X6) != sK31
| ~ neq(X5,nil)
| ~ neq(sK34,nil)
| ~ ssList(X4)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f468,f469]) ).
fof(f468,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| app(app(X4,X5),X6) != sK32
| ~ neq(X5,nil)
| app(X4,X6) != sK31
| ~ ssList(X6)
| ~ ssList(X5)
| ~ neq(sK34,nil) ),
inference(cnf_transformation,[],[f302]) ).
fof(f653,plain,
spl54_6,
inference(avatar_split_clause,[],[f495,f621]) ).
fof(f495,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f652,plain,
( spl54_12
| ~ spl54_1 ),
inference(avatar_split_clause,[],[f464,f599,f649]) ).
fof(f464,plain,
( ~ neq(sK34,nil)
| ssList(sK37) ),
inference(cnf_transformation,[],[f302]) ).
fof(f634,plain,
( spl54_8
| ~ spl54_1 ),
inference(avatar_split_clause,[],[f456,f599,f631]) ).
fof(f456,plain,
( ~ neq(sK34,nil)
| ssItem(sK35) ),
inference(cnf_transformation,[],[f302]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC004+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 17:52:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.19/0.48 % (22627)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.48 % (22636)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.49 % (22619)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49 % (22620)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.50 % (22627)Refutation not found, incomplete strategy% (22627)------------------------------
% 0.19/0.50 % (22627)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (22631)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.50 % (22622)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (22619)Instruction limit reached!
% 0.19/0.50 % (22619)------------------------------
% 0.19/0.50 % (22619)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (22619)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (22619)Termination reason: Unknown
% 0.19/0.50 % (22619)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (22619)Memory used [KB]: 6140
% 0.19/0.50 % (22619)Time elapsed: 0.114 s
% 0.19/0.50 % (22619)Instructions burned: 7 (million)
% 0.19/0.50 % (22619)------------------------------
% 0.19/0.50 % (22619)------------------------------
% 0.19/0.51 % (22627)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (22627)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51
% 0.19/0.51 % (22627)Memory used [KB]: 6012
% 0.19/0.51 % (22627)Time elapsed: 0.113 s
% 0.19/0.51 % (22627)Instructions burned: 3 (million)
% 0.19/0.51 % (22627)------------------------------
% 0.19/0.51 % (22627)------------------------------
% 0.19/0.51 % (22622)Instruction limit reached!
% 0.19/0.51 % (22622)------------------------------
% 0.19/0.51 % (22622)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (22622)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (22622)Termination reason: Unknown
% 0.19/0.51 % (22622)Termination phase: Preprocessing 2
% 0.19/0.51
% 0.19/0.51 % (22622)Memory used [KB]: 1535
% 0.19/0.51 % (22622)Time elapsed: 0.006 s
% 0.19/0.51 % (22622)Instructions burned: 3 (million)
% 0.19/0.51 % (22622)------------------------------
% 0.19/0.51 % (22622)------------------------------
% 0.19/0.51 % (22614)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.51 % (22620)Instruction limit reached!
% 0.19/0.51 % (22620)------------------------------
% 0.19/0.51 % (22620)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (22620)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (22620)Termination reason: Unknown
% 0.19/0.51 % (22620)Termination phase: Saturation
% 0.19/0.51
% 0.19/0.51 % (22620)Memory used [KB]: 2046
% 0.19/0.51 % (22620)Time elapsed: 0.113 s
% 0.19/0.51 % (22620)Instructions burned: 18 (million)
% 0.19/0.51 % (22620)------------------------------
% 0.19/0.51 % (22620)------------------------------
% 0.19/0.52 % (22636)Instruction limit reached!
% 0.19/0.52 % (22636)------------------------------
% 0.19/0.52 % (22636)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (22636)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (22636)Termination reason: Unknown
% 0.19/0.52 % (22636)Termination phase: Saturation
% 0.19/0.52
% 0.19/0.52 % (22636)Memory used [KB]: 6652
% 0.19/0.52 % (22636)Time elapsed: 0.111 s
% 0.19/0.52 % (22636)Instructions burned: 25 (million)
% 0.19/0.52 % (22636)------------------------------
% 0.19/0.52 % (22636)------------------------------
% 0.19/0.52 % (22612)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.52 % (22607)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.53 % (22631)First to succeed.
% 0.19/0.53 % (22637)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.53 % (22611)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.53 % (22615)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.53 % (22631)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (22631)------------------------------
% 0.19/0.53 % (22631)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (22631)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (22631)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (22631)Memory used [KB]: 6652
% 0.19/0.53 % (22631)Time elapsed: 0.073 s
% 0.19/0.53 % (22631)Instructions burned: 19 (million)
% 0.19/0.53 % (22631)------------------------------
% 0.19/0.53 % (22631)------------------------------
% 0.19/0.53 % (22602)Success in time 0.174 s
%------------------------------------------------------------------------------