TSTP Solution File: SWC059+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC059+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:29 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 4 unt; 0 def)
% Number of atoms : 188 ( 35 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 236 ( 97 ~; 89 |; 34 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 31 ( 21 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f563,plain,
$false,
inference(avatar_sat_refutation,[],[f531,f539,f544,f549,f550,f551,f552,f560]) ).
fof(f560,plain,
( ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(avatar_contradiction_clause,[],[f559]) ).
fof(f559,plain,
( $false
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(subsumption_resolution,[],[f557,f351]) ).
fof(f351,plain,
ssList(sK32),
inference(cnf_transformation,[],[f180]) ).
fof(f180,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X1
& nil != X0 )
| ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X0,X4)
| ~ segmentP(X1,X4) )
& neq(X1,nil) ) )
& ( nil != X3
| nil = X2 )
& ssList(X3)
& X0 = X2
& X1 = X3
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f179]) ).
fof(f179,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& X1 = X3
& ( nil != X3
| nil = X2 )
& ( ( nil = X1
& nil != X0 )
| ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X0,X4)
| ~ segmentP(X1,X4) )
& neq(X1,nil) ) )
& 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)
=> ( X0 != X2
| ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| X1 != X3
| ( nil != X2
& nil = X3 )
| ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X4] :
( neq(X4,nil)
& ssList(X4)
& segmentP(X0,X4)
& segmentP(X1,X4) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| X1 != X3
| ( nil != X2
& nil = X3 )
| ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X4] :
( neq(X4,nil)
& ssList(X4)
& segmentP(X0,X4)
& segmentP(X1,X4) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f557,plain,
( ~ ssList(sK32)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(resolution,[],[f405,f555]) ).
fof(f555,plain,
( ~ segmentP(sK32,sK32)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(subsumption_resolution,[],[f554,f543]) ).
fof(f543,plain,
( neq(sK32,nil)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f541,plain,
( spl52_5
<=> neq(sK32,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_5])]) ).
fof(f554,plain,
( ~ neq(sK32,nil)
| ~ segmentP(sK32,sK32)
| ~ spl52_1
| ~ spl52_4 ),
inference(subsumption_resolution,[],[f553,f351]) ).
fof(f553,plain,
( ~ ssList(sK32)
| ~ segmentP(sK32,sK32)
| ~ neq(sK32,nil)
| ~ spl52_1
| ~ spl52_4 ),
inference(resolution,[],[f538,f526]) ).
fof(f526,plain,
( segmentP(sK33,sK32)
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f524]) ).
fof(f524,plain,
( spl52_1
<=> segmentP(sK33,sK32) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f538,plain,
( ! [X4] :
( ~ segmentP(sK33,X4)
| ~ neq(X4,nil)
| ~ segmentP(sK32,X4)
| ~ ssList(X4) )
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f537,plain,
( spl52_4
<=> ! [X4] :
( ~ segmentP(sK32,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ segmentP(sK33,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_4])]) ).
fof(f405,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f173,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f552,plain,
( spl52_6
| spl52_4 ),
inference(avatar_split_clause,[],[f491,f537,f546]) ).
fof(f546,plain,
( spl52_6
<=> sQ51_eqProxy(nil,sK33) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_6])]) ).
fof(f491,plain,
! [X4] :
( ~ segmentP(sK32,X4)
| sQ51_eqProxy(nil,sK33)
| ~ ssList(X4)
| ~ segmentP(sK33,X4)
| ~ neq(X4,nil) ),
inference(equality_proxy_replacement,[],[f339,f429]) ).
fof(f429,plain,
! [X0,X1] :
( sQ51_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ51_eqProxy])]) ).
fof(f339,plain,
! [X4] :
( ~ segmentP(sK33,X4)
| ~ segmentP(sK32,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK33 ),
inference(cnf_transformation,[],[f180]) ).
fof(f551,plain,
( ~ spl52_3
| spl52_2 ),
inference(avatar_split_clause,[],[f489,f528,f533]) ).
fof(f533,plain,
( spl52_3
<=> sQ51_eqProxy(nil,sK32) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_3])]) ).
fof(f528,plain,
( spl52_2
<=> neq(sK33,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f489,plain,
( neq(sK33,nil)
| ~ sQ51_eqProxy(nil,sK32) ),
inference(equality_proxy_replacement,[],[f341,f429]) ).
fof(f341,plain,
( neq(sK33,nil)
| nil != sK32 ),
inference(cnf_transformation,[],[f180]) ).
fof(f550,plain,
( spl52_6
| spl52_2 ),
inference(avatar_split_clause,[],[f488,f528,f546]) ).
fof(f488,plain,
( neq(sK33,nil)
| sQ51_eqProxy(nil,sK33) ),
inference(equality_proxy_replacement,[],[f342,f429]) ).
fof(f342,plain,
( neq(sK33,nil)
| nil = sK33 ),
inference(cnf_transformation,[],[f180]) ).
fof(f549,plain,
( ~ spl52_6
| spl52_3 ),
inference(avatar_split_clause,[],[f487,f533,f546]) ).
fof(f487,plain,
( sQ51_eqProxy(nil,sK32)
| ~ sQ51_eqProxy(nil,sK33) ),
inference(equality_proxy_replacement,[],[f426,f429,f429]) ).
fof(f426,plain,
( nil = sK32
| nil != sK33 ),
inference(definition_unfolding,[],[f345,f347,f346]) ).
fof(f346,plain,
sK35 = sK33,
inference(cnf_transformation,[],[f180]) ).
fof(f347,plain,
sK34 = sK32,
inference(cnf_transformation,[],[f180]) ).
fof(f345,plain,
( nil = sK34
| nil != sK35 ),
inference(cnf_transformation,[],[f180]) ).
fof(f544,plain,
( ~ spl52_2
| spl52_5 ),
inference(avatar_split_clause,[],[f428,f541,f528]) ).
fof(f428,plain,
( neq(sK32,nil)
| ~ neq(sK33,nil) ),
inference(definition_unfolding,[],[f343,f346,f347]) ).
fof(f343,plain,
( ~ neq(sK35,nil)
| neq(sK34,nil) ),
inference(cnf_transformation,[],[f180]) ).
fof(f539,plain,
( ~ spl52_3
| spl52_4 ),
inference(avatar_split_clause,[],[f490,f537,f533]) ).
fof(f490,plain,
! [X4] :
( ~ segmentP(sK32,X4)
| ~ segmentP(sK33,X4)
| ~ sQ51_eqProxy(nil,sK32)
| ~ ssList(X4)
| ~ neq(X4,nil) ),
inference(equality_proxy_replacement,[],[f340,f429]) ).
fof(f340,plain,
! [X4] :
( ~ segmentP(sK33,X4)
| ~ segmentP(sK32,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK32 ),
inference(cnf_transformation,[],[f180]) ).
fof(f531,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f427,f528,f524]) ).
fof(f427,plain,
( ~ neq(sK33,nil)
| segmentP(sK33,sK32) ),
inference(definition_unfolding,[],[f344,f346,f346,f347]) ).
fof(f344,plain,
( ~ neq(sK35,nil)
| segmentP(sK35,sK34) ),
inference(cnf_transformation,[],[f180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC059+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % 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 : n012.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:03:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (20922)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.50 % (20914)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.20/0.51 % (20922)First to succeed.
% 0.20/0.52 % (20903)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.52 % (20922)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 % (20922)------------------------------
% 0.20/0.52 % (20922)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (20922)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (20922)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (20922)Memory used [KB]: 6268
% 0.20/0.52 % (20922)Time elapsed: 0.105 s
% 0.20/0.52 % (20922)Instructions burned: 13 (million)
% 0.20/0.52 % (20922)------------------------------
% 0.20/0.52 % (20922)------------------------------
% 0.20/0.52 % (20900)Success in time 0.178 s
%------------------------------------------------------------------------------