TSTP Solution File: SWC049+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC049+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 : n022.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:25 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 58 ( 9 unt; 0 def)
% Number of atoms : 325 ( 96 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 422 ( 155 ~; 132 |; 111 &)
% ( 9 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 58 ( 32 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f322,plain,
$false,
inference(avatar_sat_refutation,[],[f219,f237,f243,f244,f249,f305,f318,f321]) ).
fof(f321,plain,
spl9_14,
inference(avatar_contradiction_clause,[],[f320]) ).
fof(f320,plain,
( $false
| spl9_14 ),
inference(subsumption_resolution,[],[f319,f155]) ).
fof(f155,plain,
ssList(sK2),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ssList(sK0)
& ( ~ neq(sK3,nil)
| ( neq(sK2,nil)
& rearsegP(sK3,sK2) ) )
& ssList(sK3)
& ( nil = sK2
| nil != sK3 )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& sK1 = sK3
& sK0 = sK2
& ssList(sK2)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f111,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3)
& ( nil = X2
| nil != X3 )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4)
| ~ ssList(X4) )
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3)
& ( nil = X2
| nil != X3 )
& ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& X1 = X3
& sK0 = X2 )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3)
& ( nil = X2
| nil != X3 )
& ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& X1 = X3
& sK0 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3)
& ( nil = X2
| nil != X3 )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& sK1 = X3
& sK0 = X2 )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3)
& ( nil = X2
| nil != X3 )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& sK1 = X3
& sK0 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(sK2,nil)
& rearsegP(X3,sK2) ) )
& ssList(X3)
& ( nil = sK2
| nil != X3 )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& sK1 = X3
& sK0 = sK2 )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(sK2,nil)
& rearsegP(X3,sK2) ) )
& ssList(X3)
& ( nil = sK2
| nil != X3 )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& sK1 = X3
& sK0 = sK2 )
=> ( ( ~ neq(sK3,nil)
| ( neq(sK2,nil)
& rearsegP(sK3,sK2) ) )
& ssList(sK3)
& ( nil = sK2
| nil != sK3 )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) )
& sK1 = sK3
& sK0 = sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3)
& ( nil = X2
| nil != X3 )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4)
| ~ ssList(X4) )
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4)
| ~ ssList(X4) )
& X0 = X2
& ( nil != X0
| nil != X1 )
& X1 = X3
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ( nil = X2
| nil != X3 )
& 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)
=> ( ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X0,X4)
& rearsegP(X1,X4) )
| X0 != X2
| ( nil = X1
& nil = X0 )
| X1 != X3
| ( neq(X3,nil)
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| ( nil = X3
& nil != X2 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X0,X4)
& rearsegP(X1,X4) )
| X0 != X2
| ( nil = X1
& nil = X0 )
| X1 != X3
| ( neq(X3,nil)
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| ( nil = X3
& nil != X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f319,plain,
( ~ ssList(sK2)
| spl9_14 ),
inference(resolution,[],[f317,f170]) ).
fof(f170,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f317,plain,
( ~ rearsegP(sK2,sK2)
| spl9_14 ),
inference(avatar_component_clause,[],[f315]) ).
fof(f315,plain,
( spl9_14
<=> rearsegP(sK2,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_14])]) ).
fof(f318,plain,
( ~ spl9_14
| ~ spl9_8
| ~ spl9_5 ),
inference(avatar_split_clause,[],[f313,f230,f246,f315]) ).
fof(f246,plain,
( spl9_8
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_8])]) ).
fof(f230,plain,
( spl9_5
<=> rearsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).
fof(f313,plain,
( ~ neq(sK2,nil)
| ~ rearsegP(sK2,sK2)
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f312,f155]) ).
fof(f312,plain,
( ~ ssList(sK2)
| ~ rearsegP(sK2,sK2)
| ~ neq(sK2,nil)
| ~ spl9_5 ),
inference(resolution,[],[f232,f200]) ).
fof(f200,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f158,f157,f156]) ).
fof(f156,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
fof(f157,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f158,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f232,plain,
( rearsegP(sK3,sK2)
| ~ spl9_5 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f305,plain,
( spl9_2
| ~ spl9_4
| spl9_6 ),
inference(avatar_contradiction_clause,[],[f304]) ).
fof(f304,plain,
( $false
| spl9_2
| ~ spl9_4
| spl9_6 ),
inference(subsumption_resolution,[],[f303,f161]) ).
fof(f161,plain,
ssList(sK3),
inference(cnf_transformation,[],[f134]) ).
fof(f303,plain,
( ~ ssList(sK3)
| spl9_2
| ~ spl9_4
| spl9_6 ),
inference(subsumption_resolution,[],[f302,f218]) ).
fof(f218,plain,
( nil != sK3
| spl9_2 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f216,plain,
( spl9_2
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f302,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ spl9_4
| spl9_6 ),
inference(subsumption_resolution,[],[f295,f226]) ).
fof(f226,plain,
( ssList(nil)
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f225,plain,
( spl9_4
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f295,plain,
( ~ ssList(nil)
| nil = sK3
| ~ ssList(sK3)
| spl9_6 ),
inference(resolution,[],[f183,f236]) ).
fof(f236,plain,
( ~ neq(sK3,nil)
| spl9_6 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f234,plain,
( spl9_6
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_6])]) ).
fof(f183,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f249,plain,
( spl9_8
| ~ spl9_6 ),
inference(avatar_split_clause,[],[f163,f234,f246]) ).
fof(f163,plain,
( ~ neq(sK3,nil)
| neq(sK2,nil) ),
inference(cnf_transformation,[],[f134]) ).
fof(f244,plain,
spl9_4,
inference(avatar_split_clause,[],[f193,f225]) ).
fof(f193,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f243,plain,
( spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f160,f216,f212]) ).
fof(f212,plain,
( spl9_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f160,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f237,plain,
( spl9_5
| ~ spl9_6 ),
inference(avatar_split_clause,[],[f162,f234,f230]) ).
fof(f162,plain,
( ~ neq(sK3,nil)
| rearsegP(sK3,sK2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f219,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f199,f216,f212]) ).
fof(f199,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f159,f156,f157]) ).
fof(f159,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC049+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:02:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.51 % (10484)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.20/0.51 % (10479)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51 % (10502)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.20/0.52 % (10484)First to succeed.
% 0.20/0.52 % (10482)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.20/0.52 % (10498)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)
% 0.20/0.52 % (10483)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.20/0.52 % (10484)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (10484)------------------------------
% 0.20/0.52 % (10484)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (10484)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (10484)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (10484)Memory used [KB]: 6140
% 0.20/0.52 % (10484)Time elapsed: 0.108 s
% 0.20/0.52 % (10484)Instructions burned: 5 (million)
% 0.20/0.52 % (10484)------------------------------
% 0.20/0.52 % (10484)------------------------------
% 0.20/0.52 % (10469)Success in time 0.172 s
%------------------------------------------------------------------------------