TSTP Solution File: SWC041+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC041+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 : n021.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:22 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 16 unt; 0 def)
% Number of atoms : 125 ( 54 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 140 ( 47 ~; 41 |; 36 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 30 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f766,plain,
$false,
inference(avatar_sat_refutation,[],[f578,f765]) ).
fof(f765,plain,
spl53_1,
inference(avatar_contradiction_clause,[],[f764]) ).
fof(f764,plain,
( $false
| spl53_1 ),
inference(subsumption_resolution,[],[f762,f572]) ).
fof(f572,plain,
( ~ sQ52_eqProxy(sK32,sK33)
| spl53_1 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f570,plain,
( spl53_1
<=> sQ52_eqProxy(sK32,sK33) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_1])]) ).
fof(f762,plain,
sQ52_eqProxy(sK32,sK33),
inference(resolution,[],[f568,f660]) ).
fof(f660,plain,
sQ52_eqProxy(sK33,sK32),
inference(subsumption_resolution,[],[f659,f351]) ).
fof(f351,plain,
ssList(sK34),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& X0 = X2
& nil = X1
& X1 = X3
& ( nil = X3
| nil != X2 )
& nil != X0
& ssList(X3) ) )
& ssList(X1) ) ),
inference(flattening,[],[f100]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 ) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& ssList(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& ( nil = X3
| nil != X2 )
& nil = X1
& 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)
=> ( app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) ) )
& ssItem(X5) )
| ~ equalelemsP(X2) ) )
| nil = X0
| X0 != X2
| X1 != X3
| ( nil != X3
& nil = X2 )
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) ) )
& ssItem(X5) )
| ~ equalelemsP(X2) ) )
| nil = X0
| X0 != X2
| X1 != X3
| ( nil != X3
& nil = X2 )
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f659,plain,
( sQ52_eqProxy(sK33,sK32)
| ~ ssList(sK34) ),
inference(subsumption_resolution,[],[f654,f359]) ).
fof(f359,plain,
ssList(sK32),
inference(cnf_transformation,[],[f101]) ).
fof(f654,plain,
( ~ ssList(sK32)
| ~ ssList(sK34)
| sQ52_eqProxy(sK33,sK32) ),
inference(resolution,[],[f514,f542]) ).
fof(f542,plain,
sQ52_eqProxy(app(sK32,sK34),sK33),
inference(equality_proxy_replacement,[],[f350,f480]) ).
fof(f480,plain,
! [X0,X1] :
( sQ52_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ52_eqProxy])]) ).
fof(f350,plain,
app(sK32,sK34) = sK33,
inference(cnf_transformation,[],[f101]) ).
fof(f514,plain,
! [X0,X1] :
( ~ sQ52_eqProxy(app(X0,X1),sK33)
| sQ52_eqProxy(sK33,X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(equality_proxy_replacement,[],[f439,f480,f480]) ).
fof(f439,plain,
! [X0,X1] :
( ~ ssList(X1)
| app(X0,X1) != sK33
| sK33 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f297,f418,f418]) ).
fof(f418,plain,
nil = sK33,
inference(definition_unfolding,[],[f357,f356]) ).
fof(f356,plain,
sK31 = sK33,
inference(cnf_transformation,[],[f101]) ).
fof(f357,plain,
nil = sK31,
inference(cnf_transformation,[],[f101]) ).
fof(f297,plain,
! [X0,X1] :
( ~ ssList(X1)
| nil != app(X0,X1)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( nil = X1
& nil = X0 )
<=> nil = app(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( nil = X1
& nil = X0 )
<=> nil = app(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f568,plain,
! [X0,X1] :
( ~ sQ52_eqProxy(X0,X1)
| sQ52_eqProxy(X1,X0) ),
inference(equality_proxy_axiom,[],[f480]) ).
fof(f578,plain,
~ spl53_1,
inference(avatar_split_clause,[],[f540,f570]) ).
fof(f540,plain,
~ sQ52_eqProxy(sK32,sK33),
inference(equality_proxy_replacement,[],[f456,f480]) ).
fof(f456,plain,
sK32 != sK33,
inference(definition_unfolding,[],[f355,f418,f358]) ).
fof(f358,plain,
sK30 = sK32,
inference(cnf_transformation,[],[f101]) ).
fof(f355,plain,
nil != sK30,
inference(cnf_transformation,[],[f101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC041+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:01:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 % (24990)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.46 % (24982)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.19/0.47 % (24990)Instruction limit reached!
% 0.19/0.47 % (24990)------------------------------
% 0.19/0.47 % (24990)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (24982)First to succeed.
% 0.19/0.48 % (24990)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (24990)Termination reason: Unknown
% 0.19/0.48 % (24990)Termination phase: Function definition elimination
% 0.19/0.48
% 0.19/0.48 % (24990)Memory used [KB]: 1791
% 0.19/0.48 % (24990)Time elapsed: 0.008 s
% 0.19/0.48 % (24990)Instructions burned: 8 (million)
% 0.19/0.48 % (24990)------------------------------
% 0.19/0.48 % (24990)------------------------------
% 0.19/0.48 % (24982)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (24982)------------------------------
% 0.19/0.48 % (24982)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (24982)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (24982)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (24982)Memory used [KB]: 6396
% 0.19/0.48 % (24982)Time elapsed: 0.082 s
% 0.19/0.48 % (24982)Instructions burned: 18 (million)
% 0.19/0.48 % (24982)------------------------------
% 0.19/0.48 % (24982)------------------------------
% 0.19/0.48 % (24961)Success in time 0.139 s
%------------------------------------------------------------------------------