TSTP Solution File: SWC381+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC381+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:40:50 EDT 2022
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 150 ( 26 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 188 ( 74 ~; 62 |; 31 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 37 ( 24 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f562,plain,
$false,
inference(avatar_sat_refutation,[],[f543,f547,f552,f553,f556,f561]) ).
fof(f561,plain,
( ~ spl53_2
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5 ),
inference(avatar_contradiction_clause,[],[f560]) ).
fof(f560,plain,
( $false
| ~ spl53_2
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5 ),
inference(subsumption_resolution,[],[f559,f542]) ).
fof(f542,plain,
( ssItem(sK29)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f540]) ).
fof(f540,plain,
( spl53_3
<=> ssItem(sK29) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_3])]) ).
fof(f559,plain,
( ~ ssItem(sK29)
| ~ spl53_2
| ~ spl53_4
| ~ spl53_5 ),
inference(subsumption_resolution,[],[f558,f537]) ).
fof(f537,plain,
( memberP(sK28,sK29)
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f535]) ).
fof(f535,plain,
( spl53_2
<=> memberP(sK28,sK29) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_2])]) ).
fof(f558,plain,
( ~ memberP(sK28,sK29)
| ~ ssItem(sK29)
| ~ spl53_4
| ~ spl53_5 ),
inference(resolution,[],[f546,f551]) ).
fof(f551,plain,
( sQ52_eqProxy(cons(sK29,nil),sK27)
| ~ spl53_5 ),
inference(avatar_component_clause,[],[f549]) ).
fof(f549,plain,
( spl53_5
<=> sQ52_eqProxy(cons(sK29,nil),sK27) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_5])]) ).
fof(f546,plain,
( ! [X5] :
( ~ sQ52_eqProxy(cons(X5,nil),sK27)
| ~ memberP(sK28,X5)
| ~ ssItem(X5) )
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f545,plain,
( spl53_4
<=> ! [X5] :
( ~ sQ52_eqProxy(cons(X5,nil),sK27)
| ~ memberP(sK28,X5)
| ~ ssItem(X5) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_4])]) ).
fof(f556,plain,
spl53_1,
inference(avatar_split_clause,[],[f431,f531]) ).
fof(f531,plain,
( spl53_1
<=> neq(sK28,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_1])]) ).
fof(f431,plain,
neq(sK28,nil),
inference(definition_unfolding,[],[f321,f324]) ).
fof(f324,plain,
sK26 = sK28,
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( ( neq(X1,nil)
& ? [X4] :
( ssItem(X4)
& memberP(X3,X4)
& cons(X4,nil) = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| ~ ssItem(X5)
| cons(X5,nil) != X0 ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X5] :
( ~ memberP(X1,X5)
| ~ ssItem(X5)
| cons(X5,nil) != X0 )
& neq(X1,nil)
& ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& X1 = X3
& 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)
=> ( ( ( ? [X5] :
( memberP(X1,X5)
& ssItem(X5)
& cons(X5,nil) = X0 )
| ~ neq(X1,nil)
| ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
| ~ neq(X1,nil)
| ? [X4] :
( cons(X4,nil) = X0
& memberP(X1,X4)
& ssItem(X4) ) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
| ~ neq(X1,nil)
| ? [X4] :
( cons(X4,nil) = X0
& memberP(X1,X4)
& ssItem(X4) ) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f321,plain,
neq(sK26,nil),
inference(cnf_transformation,[],[f102]) ).
fof(f553,plain,
( spl53_2
| ~ spl53_1 ),
inference(avatar_split_clause,[],[f314,f531,f535]) ).
fof(f314,plain,
( ~ neq(sK28,nil)
| memberP(sK28,sK29) ),
inference(cnf_transformation,[],[f102]) ).
fof(f552,plain,
( ~ spl53_1
| spl53_5 ),
inference(avatar_split_clause,[],[f480,f549,f531]) ).
fof(f480,plain,
( sQ52_eqProxy(cons(sK29,nil),sK27)
| ~ neq(sK28,nil) ),
inference(equality_proxy_replacement,[],[f313,f437]) ).
fof(f437,plain,
! [X0,X1] :
( sQ52_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ52_eqProxy])]) ).
fof(f313,plain,
( ~ neq(sK28,nil)
| cons(sK29,nil) = sK27 ),
inference(cnf_transformation,[],[f102]) ).
fof(f547,plain,
( ~ spl53_1
| spl53_4 ),
inference(avatar_split_clause,[],[f478,f545,f531]) ).
fof(f478,plain,
! [X5] :
( ~ sQ52_eqProxy(cons(X5,nil),sK27)
| ~ neq(sK28,nil)
| ~ ssItem(X5)
| ~ memberP(sK28,X5) ),
inference(equality_proxy_replacement,[],[f433,f437]) ).
fof(f433,plain,
! [X5] :
( ~ neq(sK28,nil)
| cons(X5,nil) != sK27
| ~ ssItem(X5)
| ~ memberP(sK28,X5) ),
inference(definition_unfolding,[],[f319,f325,f324]) ).
fof(f325,plain,
sK25 = sK27,
inference(cnf_transformation,[],[f102]) ).
fof(f319,plain,
! [X5] :
( ~ neq(sK28,nil)
| cons(X5,nil) != sK25
| ~ ssItem(X5)
| ~ memberP(sK26,X5) ),
inference(cnf_transformation,[],[f102]) ).
fof(f543,plain,
( spl53_3
| ~ spl53_1 ),
inference(avatar_split_clause,[],[f315,f531,f540]) ).
fof(f315,plain,
( ~ neq(sK28,nil)
| ssItem(sK29) ),
inference(cnf_transformation,[],[f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC381+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.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 18:51:05 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.48 % (28395)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.21/0.49 % (28387)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.21/0.49 % (28378)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.49 % (28378)Instruction limit reached!
% 0.21/0.49 % (28378)------------------------------
% 0.21/0.49 % (28378)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (28378)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49 % (28395)Instruction limit reached!
% 0.21/0.49 % (28395)------------------------------
% 0.21/0.49 % (28395)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (28378)Termination reason: Unknown
% 0.21/0.49 % (28378)Termination phase: Saturation
% 0.21/0.49
% 0.21/0.49 % (28378)Memory used [KB]: 6140
% 0.21/0.49 % (28378)Time elapsed: 0.091 s
% 0.21/0.49 % (28378)Instructions burned: 7 (million)
% 0.21/0.49 % (28378)------------------------------
% 0.21/0.49 % (28378)------------------------------
% 0.21/0.50 % (28395)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (28395)Termination reason: Unknown
% 0.21/0.50 % (28395)Termination phase: Function definition elimination
% 0.21/0.50
% 0.21/0.50 % (28395)Memory used [KB]: 1791
% 0.21/0.50 % (28395)Time elapsed: 0.008 s
% 0.21/0.50 % (28395)Instructions burned: 8 (million)
% 0.21/0.50 % (28395)------------------------------
% 0.21/0.50 % (28395)------------------------------
% 0.21/0.50 % (28387)First to succeed.
% 0.21/0.50 % (28387)Refutation found. Thanks to Tanya!
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (28387)------------------------------
% 0.21/0.51 % (28387)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (28387)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (28387)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (28387)Memory used [KB]: 6268
% 0.21/0.51 % (28387)Time elapsed: 0.101 s
% 0.21/0.51 % (28387)Instructions burned: 13 (million)
% 0.21/0.51 % (28387)------------------------------
% 0.21/0.51 % (28387)------------------------------
% 0.21/0.51 % (28366)Success in time 0.15 s
%------------------------------------------------------------------------------