TSTP Solution File: SWC082+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC082+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 : n029.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:41 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 6 unt; 0 def)
% Number of atoms : 335 ( 62 equ)
% Maximal formula atoms : 36 ( 7 avg)
% Number of connectives : 428 ( 135 ~; 115 |; 153 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 72 ( 29 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f272,plain,
$false,
inference(avatar_sat_refutation,[],[f235,f240,f241,f260,f266,f271]) ).
fof(f271,plain,
( ~ spl11_4
| ~ spl11_5
| ~ spl11_9
| ~ spl11_10 ),
inference(avatar_contradiction_clause,[],[f270]) ).
fof(f270,plain,
( $false
| ~ spl11_4
| ~ spl11_5
| ~ spl11_9
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f269,f265]) ).
fof(f265,plain,
( ssList(sK6)
| ~ spl11_10 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f263,plain,
( spl11_10
<=> ssList(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_10])]) ).
fof(f269,plain,
( ~ ssList(sK6)
| ~ spl11_4
| ~ spl11_5
| ~ spl11_9 ),
inference(subsumption_resolution,[],[f268,f234]) ).
fof(f234,plain,
( neq(sK6,nil)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f232,plain,
( spl11_4
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f268,plain,
( ~ neq(sK6,nil)
| ~ ssList(sK6)
| ~ spl11_5
| ~ spl11_9 ),
inference(subsumption_resolution,[],[f267,f239]) ).
fof(f239,plain,
( segmentP(sK4,sK6)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f237,plain,
( spl11_5
<=> segmentP(sK4,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f267,plain,
( ~ segmentP(sK4,sK6)
| ~ ssList(sK6)
| ~ neq(sK6,nil)
| ~ spl11_9 ),
inference(resolution,[],[f206,f259]) ).
fof(f259,plain,
( segmentP(sK5,sK6)
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f257,plain,
( spl11_9
<=> segmentP(sK5,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).
fof(f206,plain,
! [X4] :
( ~ segmentP(sK5,X4)
| ~ segmentP(sK4,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f173,f176,f171]) ).
fof(f171,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( sK2 = sK4
& neq(sK3,nil)
& ssList(sK5)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != sK5
| nil = sK4 )
& sK3 = sK5
& ( ~ neq(sK5,nil)
| ( neq(sK6,nil)
& ssList(sK6)
& segmentP(sK5,sK6)
& segmentP(sK4,sK6) ) )
& ssList(sK4)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6])],[f138,f143,f142,f141,f140,f139]) ).
fof(f139,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& neq(X1,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = X2 )
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(X2,X5) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK2 = X2
& neq(X1,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = X2 )
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(X2,X5) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK2 = X2
& neq(X1,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = X2 )
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(X2,X5) ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK2 = X2
& neq(sK3,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = X2 )
& sK3 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(X2,X5) ) ) )
& ssList(X2) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X2] :
( ? [X3] :
( sK2 = X2
& neq(sK3,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = X2 )
& sK3 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(X2,X5) ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK2 = sK4
& neq(sK3,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = sK4 )
& sK3 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(sK4,X5) ) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X3] :
( sK2 = sK4
& neq(sK3,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = sK4 )
& sK3 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(sK4,X5) ) ) )
=> ( sK2 = sK4
& neq(sK3,nil)
& ssList(sK5)
& ! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != sK5
| nil = sK4 )
& sK3 = sK5
& ( ~ neq(sK5,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(sK5,X5)
& segmentP(sK4,X5) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(sK5,X5)
& segmentP(sK4,X5) )
=> ( neq(sK6,nil)
& ssList(sK6)
& segmentP(sK5,sK6)
& segmentP(sK4,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& neq(X1,nil)
& ssList(X3)
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& ( nil != X3
| nil = X2 )
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( neq(X5,nil)
& ssList(X5)
& segmentP(X3,X5)
& segmentP(X2,X5) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f107]) ).
fof(f107,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& neq(X1,nil)
& ssList(X3)
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& ( nil != X3
| nil = X2 )
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X4] :
( neq(X4,nil)
& ssList(X4)
& segmentP(X3,X4)
& segmentP(X2,X4) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f106]) ).
fof(f106,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& ( ? [X4] :
( segmentP(X3,X4)
& segmentP(X2,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& X1 = X3
& ( nil != X3
| nil = X2 )
& 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)
=> ( ~ neq(X1,nil)
| ? [X5] :
( segmentP(X0,X5)
& neq(X5,nil)
& segmentP(X1,X5)
& ssList(X5) )
| ( ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X3,X4)
| ~ segmentP(X2,X4)
| ~ neq(X4,nil) ) )
& neq(X3,nil) )
| X1 != X3
| ( nil = X3
& nil != X2 )
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ neq(X5,nil)
| ~ segmentP(X3,X5) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4) )
| ~ neq(X1,nil)
| ( nil = X3
& nil != X2 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ neq(X5,nil)
| ~ segmentP(X3,X5) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4) )
| ~ neq(X1,nil)
| ( nil = X3
& nil != X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f176,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f144]) ).
fof(f173,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f266,plain,
( ~ spl11_3
| spl11_10 ),
inference(avatar_split_clause,[],[f169,f263,f228]) ).
fof(f228,plain,
( spl11_3
<=> neq(sK5,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f169,plain,
( ssList(sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f260,plain,
( ~ spl11_3
| spl11_9 ),
inference(avatar_split_clause,[],[f168,f257,f228]) ).
fof(f168,plain,
( segmentP(sK5,sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f241,plain,
spl11_3,
inference(avatar_split_clause,[],[f205,f228]) ).
fof(f205,plain,
neq(sK5,nil),
inference(definition_unfolding,[],[f175,f171]) ).
fof(f175,plain,
neq(sK3,nil),
inference(cnf_transformation,[],[f144]) ).
fof(f240,plain,
( spl11_5
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f167,f228,f237]) ).
fof(f167,plain,
( ~ neq(sK5,nil)
| segmentP(sK4,sK6) ),
inference(cnf_transformation,[],[f144]) ).
fof(f235,plain,
( ~ spl11_3
| spl11_4 ),
inference(avatar_split_clause,[],[f170,f232,f228]) ).
fof(f170,plain,
( neq(sK6,nil)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC082+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.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:20:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (5952)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.51 % (5944)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.51 % (5944)Instruction limit reached!
% 0.19/0.51 % (5944)------------------------------
% 0.19/0.51 % (5944)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (5944)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (5944)Termination reason: Unknown
% 0.19/0.51 % (5944)Termination phase: Preprocessing 3
% 0.19/0.51
% 0.19/0.51 % (5944)Memory used [KB]: 1535
% 0.19/0.51 % (5944)Time elapsed: 0.004 s
% 0.19/0.51 % (5944)Instructions burned: 3 (million)
% 0.19/0.51 % (5944)------------------------------
% 0.19/0.51 % (5944)------------------------------
% 0.19/0.52 % (5936)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.52 % (5936)First to succeed.
% 0.19/0.52 % (5939)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)
% 0.19/0.52 % (5952)Also succeeded, but the first one will report.
% 0.19/0.52 % (5936)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (5936)------------------------------
% 0.19/0.52 % (5936)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (5936)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (5936)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (5936)Memory used [KB]: 6140
% 0.19/0.52 % (5936)Time elapsed: 0.067 s
% 0.19/0.52 % (5936)Instructions burned: 5 (million)
% 0.19/0.52 % (5936)------------------------------
% 0.19/0.52 % (5936)------------------------------
% 0.19/0.52 % (5929)Success in time 0.173 s
%------------------------------------------------------------------------------