TSTP Solution File: SWC366+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC366+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 : n008.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:40:44 EDT 2022
% Result : Theorem 1.64s 0.60s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of formulae : 90 ( 13 unt; 0 def)
% Number of atoms : 470 ( 117 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 620 ( 240 ~; 228 |; 114 &)
% ( 15 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 12 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 95 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1034,plain,
$false,
inference(avatar_sat_refutation,[],[f615,f624,f627,f648,f665,f690,f692,f694,f708,f710,f783,f1024]) ).
fof(f1024,plain,
( ~ spl51_6
| ~ spl51_16
| spl51_1
| ~ spl51_15
| ~ spl51_7 ),
inference(avatar_split_clause,[],[f1018,f612,f662,f587,f675,f608]) ).
fof(f608,plain,
( spl51_6
<=> ssList(cons(hd(sK31),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_6])]) ).
fof(f675,plain,
( spl51_16
<=> ssList(sK31) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_16])]) ).
fof(f587,plain,
( spl51_1
<=> rearsegP(sK31,sK30) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).
fof(f662,plain,
( spl51_15
<=> ssList(sK30) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_15])]) ).
fof(f612,plain,
( spl51_7
<=> sK31 = app(cons(hd(sK31),nil),sK30) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_7])]) ).
fof(f1018,plain,
( ~ ssList(sK30)
| rearsegP(sK31,sK30)
| ~ ssList(sK31)
| ~ ssList(cons(hd(sK31),nil))
| ~ spl51_7 ),
inference(superposition,[],[f568,f614]) ).
fof(f614,plain,
( sK31 = app(cons(hd(sK31),nil),sK30)
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f568,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f476]) ).
fof(f476,plain,
! [X2,X0,X1] :
( rearsegP(X0,X1)
| ~ ssList(X2)
| app(X2,X1) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f297]) ).
fof(f297,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ( ssList(sK34(X0,X1))
& app(sK34(X0,X1),X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK34])],[f295,f296]) ).
fof(f296,plain,
! [X0,X1] :
( ? [X3] :
( ssList(X3)
& app(X3,X1) = X0 )
=> ( ssList(sK34(X0,X1))
& app(sK34(X0,X1),X1) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f295,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X3,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f294]) ).
fof(f294,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f180]) ).
fof(f180,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(f783,plain,
( ~ spl51_9
| ~ spl51_16
| spl51_17
| spl51_5 ),
inference(avatar_split_clause,[],[f780,f604,f679,f675,f620]) ).
fof(f620,plain,
( spl51_9
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_9])]) ).
fof(f679,plain,
( spl51_17
<=> nil = sK31 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_17])]) ).
fof(f604,plain,
( spl51_5
<=> neq(nil,sK31) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_5])]) ).
fof(f780,plain,
( nil = sK31
| ~ ssList(sK31)
| ~ ssList(nil)
| spl51_5 ),
inference(resolution,[],[f528,f606]) ).
fof(f606,plain,
( ~ neq(nil,sK31)
| spl51_5 ),
inference(avatar_component_clause,[],[f604]) ).
fof(f528,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f330]) ).
fof(f330,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f186]) ).
fof(f186,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) )
| ~ ssList(X0) ),
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(f710,plain,
spl51_16,
inference(avatar_split_clause,[],[f428,f675]) ).
fof(f428,plain,
ssList(sK31),
inference(cnf_transformation,[],[f280]) ).
fof(f280,plain,
( ssList(sK30)
& sK28 = sK30
& sK29 = sK31
& ( ( ! [X4] :
( ~ ssList(X4)
| sK31 = X4
| ! [X5] :
( ! [X6] :
( hd(sK31) != X6
| ~ neq(nil,sK31)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK30) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(sK29,sK28)
& neq(sK29,nil) )
| ( neq(sK29,nil)
& ~ neq(sK31,nil) ) )
& ssList(sK31)
& ssList(sK29)
& ssList(sK28) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28,sK29,sK30,sK31])],[f211,f279,f278,f277,f276]) ).
fof(f276,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(X1,X0)
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK28 = X2
& X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(X1,sK28)
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) ) )
& ssList(X1) )
& ssList(sK28) ) ),
introduced(choice_axiom,[]) ).
fof(f277,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK28 = X2
& X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(X1,sK28)
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK28 = X2
& sK29 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(sK29,sK28)
& neq(sK29,nil) )
| ( neq(sK29,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) ) )
& ssList(sK29) ) ),
introduced(choice_axiom,[]) ).
fof(f278,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK28 = X2
& sK29 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(sK29,sK28)
& neq(sK29,nil) )
| ( neq(sK29,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) ) )
=> ( ssList(sK30)
& ? [X3] :
( sK28 = sK30
& sK29 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK30) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(sK29,sK28)
& neq(sK29,nil) )
| ( neq(sK29,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f279,plain,
( ? [X3] :
( sK28 = sK30
& sK29 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK30) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(sK29,sK28)
& neq(sK29,nil) )
| ( neq(sK29,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
=> ( sK28 = sK30
& sK29 = sK31
& ( ( ! [X4] :
( ~ ssList(X4)
| sK31 = X4
| ! [X5] :
( ! [X6] :
( hd(sK31) != X6
| ~ neq(nil,sK31)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK30) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(sK29,sK28)
& neq(sK29,nil) )
| ( neq(sK29,nil)
& ~ neq(sK31,nil) ) )
& ssList(sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f211,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& X1 = X3
& ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(X1,X0)
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f210]) ).
fof(f210,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ! [X6] :
( hd(X3) != X6
| ~ neq(nil,X3)
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) ) )
& ~ rearsegP(X1,X0)
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X4] :
( X3 != X4
& ssList(X4)
& ? [X5] :
( app(X5,X2) = X4
& ssList(X5)
& ? [X6] :
( cons(X6,nil) = X5
& neq(nil,X3)
& ssItem(X6)
& hd(X3) = X6 ) ) )
| rearsegP(X1,X0)
| ~ neq(X1,nil) ) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X4] :
( X3 != X4
& ssList(X4)
& ? [X5] :
( app(X5,X2) = X4
& ssList(X5)
& ? [X6] :
( cons(X6,nil) = X5
& neq(nil,X3)
& ssItem(X6)
& hd(X3) = X6 ) ) )
| rearsegP(X1,X0)
| ~ neq(X1,nil) ) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f708,plain,
( ~ spl51_9
| ~ spl51_2
| ~ spl51_17 ),
inference(avatar_split_clause,[],[f707,f679,f591,f620]) ).
fof(f591,plain,
( spl51_2
<=> neq(sK31,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_2])]) ).
fof(f707,plain,
( ~ ssList(nil)
| ~ spl51_2
| ~ spl51_17 ),
inference(resolution,[],[f698,f582]) ).
fof(f582,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f575]) ).
fof(f575,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f529]) ).
fof(f529,plain,
! [X0,X1] :
( ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f698,plain,
( neq(nil,nil)
| ~ spl51_2
| ~ spl51_17 ),
inference(backward_demodulation,[],[f593,f681]) ).
fof(f681,plain,
( nil = sK31
| ~ spl51_17 ),
inference(avatar_component_clause,[],[f679]) ).
fof(f593,plain,
( neq(sK31,nil)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f591]) ).
fof(f694,plain,
( ~ spl51_9
| ~ spl51_4
| spl51_6 ),
inference(avatar_split_clause,[],[f693,f608,f600,f620]) ).
fof(f600,plain,
( spl51_4
<=> ssItem(hd(sK31)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_4])]) ).
fof(f693,plain,
( ~ ssItem(hd(sK31))
| ~ ssList(nil)
| spl51_6 ),
inference(resolution,[],[f610,f338]) ).
fof(f338,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f153,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(f610,plain,
( ~ ssList(cons(hd(sK31),nil))
| spl51_6 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f692,plain,
( ~ spl51_16
| spl51_17
| spl51_4 ),
inference(avatar_split_clause,[],[f691,f600,f679,f675]) ).
fof(f691,plain,
( nil = sK31
| ~ ssList(sK31)
| spl51_4 ),
inference(resolution,[],[f602,f444]) ).
fof(f444,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
! [X0] :
( nil = X0
| ssItem(hd(X0))
| ~ ssList(X0) ),
inference(flattening,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f602,plain,
( ~ ssItem(hd(sK31))
| spl51_4 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f690,plain,
spl51_15,
inference(avatar_contradiction_clause,[],[f687]) ).
fof(f687,plain,
( $false
| spl51_15 ),
inference(resolution,[],[f664,f544]) ).
fof(f544,plain,
ssList(sK30),
inference(definition_unfolding,[],[f426,f436]) ).
fof(f436,plain,
sK28 = sK30,
inference(cnf_transformation,[],[f280]) ).
fof(f426,plain,
ssList(sK28),
inference(cnf_transformation,[],[f280]) ).
fof(f664,plain,
( ~ ssList(sK30)
| spl51_15 ),
inference(avatar_component_clause,[],[f662]) ).
fof(f665,plain,
( ~ spl51_6
| ~ spl51_15
| spl51_3 ),
inference(avatar_split_clause,[],[f654,f596,f662,f608]) ).
fof(f596,plain,
( spl51_3
<=> ssList(app(cons(hd(sK31),nil),sK30)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_3])]) ).
fof(f654,plain,
( ~ ssList(sK30)
| ~ ssList(cons(hd(sK31),nil))
| spl51_3 ),
inference(resolution,[],[f382,f598]) ).
fof(f598,plain,
( ~ ssList(app(cons(hd(sK31),nil),sK30))
| spl51_3 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f382,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f212]) ).
fof(f212,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f648,plain,
spl51_2,
inference(avatar_split_clause,[],[f578,f591]) ).
fof(f578,plain,
neq(sK31,nil),
inference(duplicate_literal_removal,[],[f541]) ).
fof(f541,plain,
( neq(sK31,nil)
| neq(sK31,nil) ),
inference(definition_unfolding,[],[f430,f435,f435]) ).
fof(f435,plain,
sK29 = sK31,
inference(cnf_transformation,[],[f280]) ).
fof(f430,plain,
( neq(sK29,nil)
| neq(sK29,nil) ),
inference(cnf_transformation,[],[f280]) ).
fof(f627,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f540,f591,f587]) ).
fof(f540,plain,
( ~ neq(sK31,nil)
| ~ rearsegP(sK31,sK30) ),
inference(definition_unfolding,[],[f431,f435,f436]) ).
fof(f431,plain,
( ~ rearsegP(sK29,sK28)
| ~ neq(sK31,nil) ),
inference(cnf_transformation,[],[f280]) ).
fof(f624,plain,
spl51_9,
inference(avatar_split_clause,[],[f524,f620]) ).
fof(f524,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f615,plain,
( ~ spl51_3
| ~ spl51_4
| ~ spl51_5
| ~ spl51_6
| ~ spl51_2
| spl51_7 ),
inference(avatar_split_clause,[],[f561,f612,f591,f608,f604,f600,f596]) ).
fof(f561,plain,
( sK31 = app(cons(hd(sK31),nil),sK30)
| ~ neq(sK31,nil)
| ~ ssList(cons(hd(sK31),nil))
| ~ neq(nil,sK31)
| ~ ssItem(hd(sK31))
| ~ ssList(app(cons(hd(sK31),nil),sK30)) ),
inference(equality_resolution,[],[f560]) ).
fof(f560,plain,
! [X4] :
( ~ ssList(X4)
| sK31 = X4
| ~ neq(nil,sK31)
| ~ ssItem(hd(sK31))
| app(cons(hd(sK31),nil),sK30) != X4
| ~ ssList(cons(hd(sK31),nil))
| ~ neq(sK31,nil) ),
inference(equality_resolution,[],[f559]) ).
fof(f559,plain,
! [X4,X5] :
( ~ ssList(X4)
| sK31 = X4
| ~ neq(nil,sK31)
| cons(hd(sK31),nil) != X5
| ~ ssItem(hd(sK31))
| app(X5,sK30) != X4
| ~ ssList(X5)
| ~ neq(sK31,nil) ),
inference(equality_resolution,[],[f433]) ).
fof(f433,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| sK31 = X4
| hd(sK31) != X6
| ~ neq(nil,sK31)
| cons(X6,nil) != X5
| ~ ssItem(X6)
| app(X5,sK30) != X4
| ~ ssList(X5)
| ~ neq(sK31,nil) ),
inference(cnf_transformation,[],[f280]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC366+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:53:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.33/0.54 % (4274)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)
% 1.33/0.55 % (4291)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)
% 1.64/0.56 % (4282)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.64/0.56 % (4273)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)
% 1.64/0.56 % (4271)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.64/0.56 % (4274)Instruction limit reached!
% 1.64/0.56 % (4274)------------------------------
% 1.64/0.56 % (4274)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.64/0.57 % (4279)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.64/0.57 % (4274)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.64/0.57 % (4274)Termination reason: Unknown
% 1.64/0.57 % (4274)Termination phase: Saturation
% 1.64/0.57
% 1.64/0.57 % (4274)Memory used [KB]: 1663
% 1.64/0.57 % (4274)Time elapsed: 0.132 s
% 1.64/0.57 % (4274)Instructions burned: 15 (million)
% 1.64/0.57 % (4274)------------------------------
% 1.64/0.57 % (4274)------------------------------
% 1.64/0.57 % (4271)Instruction limit reached!
% 1.64/0.57 % (4271)------------------------------
% 1.64/0.57 % (4271)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.64/0.57 % (4271)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.64/0.57 % (4271)Termination reason: Unknown
% 1.64/0.57 % (4271)Termination phase: Naming
% 1.64/0.57
% 1.64/0.57 % (4271)Memory used [KB]: 1535
% 1.64/0.57 % (4271)Time elapsed: 0.006 s
% 1.64/0.57 % (4271)Instructions burned: 3 (million)
% 1.64/0.57 % (4271)------------------------------
% 1.64/0.57 % (4271)------------------------------
% 1.64/0.58 % (4298)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 1.64/0.58 % (4284)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.64/0.59 % (4277)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 1.64/0.59 % (4275)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)
% 1.64/0.59 % (4287)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.64/0.59 % (4287)Instruction limit reached!
% 1.64/0.59 % (4287)------------------------------
% 1.64/0.59 % (4287)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.64/0.59 % (4287)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.64/0.59 % (4287)Termination reason: Unknown
% 1.64/0.59 % (4287)Termination phase: Preprocessing 3
% 1.64/0.59
% 1.64/0.59 % (4287)Memory used [KB]: 1535
% 1.64/0.59 % (4287)Time elapsed: 0.003 s
% 1.64/0.59 % (4287)Instructions burned: 2 (million)
% 1.64/0.59 % (4287)------------------------------
% 1.64/0.59 % (4287)------------------------------
% 1.64/0.59 % (4291)First to succeed.
% 1.64/0.59 % (4272)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.64/0.59 % (4278)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.64/0.59 % (4292)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.64/0.60 % (4291)Refutation found. Thanks to Tanya!
% 1.64/0.60 % SZS status Theorem for theBenchmark
% 1.64/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.64/0.60 % (4291)------------------------------
% 1.64/0.60 % (4291)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.64/0.60 % (4291)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.64/0.60 % (4291)Termination reason: Refutation
% 1.64/0.60
% 1.64/0.60 % (4291)Memory used [KB]: 6524
% 1.64/0.60 % (4291)Time elapsed: 0.179 s
% 1.64/0.60 % (4291)Instructions burned: 20 (million)
% 1.64/0.60 % (4291)------------------------------
% 1.64/0.60 % (4291)------------------------------
% 1.64/0.60 % (4268)Success in time 0.258 s
%------------------------------------------------------------------------------