TSTP Solution File: GRA010+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.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 : n019.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 16:13:21 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 5 unt; 0 def)
% Number of atoms : 153 ( 15 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 170 ( 65 ~; 59 |; 27 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 7 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 99 ( 82 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f261,plain,
$false,
inference(avatar_sat_refutation,[],[f209,f217,f219,f227,f234,f259]) ).
fof(f259,plain,
( ~ spl13_8
| ~ spl13_10
| ~ spl13_11
| ~ spl13_12 ),
inference(avatar_contradiction_clause,[],[f258]) ).
fof(f258,plain,
( $false
| ~ spl13_8
| ~ spl13_10
| ~ spl13_11
| ~ spl13_12 ),
inference(subsumption_resolution,[],[f257,f216]) ).
fof(f216,plain,
( on_path(sK4(sK8),sK8)
| ~ spl13_10 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f214,plain,
( spl13_10
<=> on_path(sK4(sK8),sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_10])]) ).
fof(f257,plain,
( ~ on_path(sK4(sK8),sK8)
| ~ spl13_8
| ~ spl13_11
| ~ spl13_12 ),
inference(subsumption_resolution,[],[f256,f226]) ).
fof(f226,plain,
( sequential(sK4(sK8),sK3(sK8))
| ~ spl13_11 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f224,plain,
( spl13_11
<=> sequential(sK4(sK8),sK3(sK8)) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_11])]) ).
fof(f256,plain,
( ~ sequential(sK4(sK8),sK3(sK8))
| ~ on_path(sK4(sK8),sK8)
| ~ spl13_8
| ~ spl13_12 ),
inference(subsumption_resolution,[],[f254,f205]) ).
fof(f205,plain,
( on_path(sK3(sK8),sK8)
| ~ spl13_8 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f203,plain,
( spl13_8
<=> on_path(sK3(sK8),sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_8])]) ).
fof(f254,plain,
( ~ on_path(sK3(sK8),sK8)
| ~ sequential(sK4(sK8),sK3(sK8))
| ~ on_path(sK4(sK8),sK8)
| ~ spl13_12 ),
inference(resolution,[],[f233,f117]) ).
fof(f117,plain,
! [X3,X4] :
( triangle(X3,X4,sK11(X3,X4))
| ~ sequential(X3,X4)
| ~ on_path(X4,sK8)
| ~ on_path(X3,sK8) ),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
( complete
& ? [X1,X2,X0] :
( path(X0,X2,X1)
& number_of_in(sequential_pairs,X1) != number_of_in(triangles,X1)
& ! [X4,X3] :
( ? [X5] : triangle(X3,X4,X5)
| ~ on_path(X4,X1)
| ~ sequential(X3,X4)
| ~ on_path(X3,X1) ) ) ),
inference(flattening,[],[f52]) ).
fof(f52,plain,
( ? [X2,X1,X0] :
( number_of_in(sequential_pairs,X1) != number_of_in(triangles,X1)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ on_path(X3,X1)
| ~ on_path(X4,X1)
| ~ sequential(X3,X4) )
& path(X0,X2,X1) )
& complete ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ( complete
=> ! [X2,X1,X0] :
( ( ! [X3,X4] :
( ( on_path(X3,X1)
& on_path(X4,X1)
& sequential(X3,X4) )
=> ? [X5] : triangle(X3,X4,X5) )
& path(X0,X2,X1) )
=> number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f19,negated_conjecture,
~ ( complete
=> ! [X1,X3,X2] :
( ( ! [X6,X7] :
( ( sequential(X6,X7)
& on_path(X7,X3)
& on_path(X6,X3) )
=> ? [X8] : triangle(X6,X7,X8) )
& path(X1,X2,X3) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ) ),
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
( complete
=> ! [X1,X3,X2] :
( ( ! [X6,X7] :
( ( sequential(X6,X7)
& on_path(X7,X3)
& on_path(X6,X3) )
=> ? [X8] : triangle(X6,X7,X8) )
& path(X1,X2,X3) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
fof(f233,plain,
( ! [X0] : ~ triangle(sK4(sK8),sK3(sK8),X0)
| ~ spl13_12 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f232,plain,
( spl13_12
<=> ! [X0] : ~ triangle(sK4(sK8),sK3(sK8),X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_12])]) ).
fof(f234,plain,
( spl13_9
| spl13_12 ),
inference(avatar_split_clause,[],[f228,f232,f207]) ).
fof(f207,plain,
( spl13_9
<=> ! [X0,X1] : ~ path(X0,X1,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_9])]) ).
fof(f228,plain,
! [X2,X0,X1] :
( ~ triangle(sK4(sK8),sK3(sK8),X0)
| ~ path(X1,X2,sK8) ),
inference(resolution,[],[f135,f150]) ).
fof(f150,plain,
~ sQ12_eqProxy(number_of_in(sequential_pairs,sK8),number_of_in(triangles,sK8)),
inference(equality_proxy_replacement,[],[f118,f121]) ).
fof(f121,plain,
! [X0,X1] :
( sQ12_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ12_eqProxy])]) ).
fof(f118,plain,
number_of_in(sequential_pairs,sK8) != number_of_in(triangles,sK8),
inference(cnf_transformation,[],[f53]) ).
fof(f135,plain,
! [X2,X0,X1,X5] :
( sQ12_eqProxy(number_of_in(sequential_pairs,X2),number_of_in(triangles,X2))
| ~ triangle(sK4(X2),sK3(X2),X5)
| ~ path(X0,X1,X2) ),
inference(equality_proxy_replacement,[],[f87,f121]) ).
fof(f87,plain,
! [X2,X0,X1,X5] :
( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| ~ triangle(sK4(X2),sK3(X2),X5)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X1,X2,X0] :
( ~ path(X0,X1,X2)
| ? [X3,X4] :
( on_path(X3,X2)
& ! [X5] : ~ triangle(X4,X3,X5)
& sequential(X4,X3)
& on_path(X4,X2) )
| number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2) ),
inference(flattening,[],[f56]) ).
fof(f56,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| ~ path(X0,X1,X2)
| ? [X4,X3] :
( ! [X5] : ~ triangle(X4,X3,X5)
& on_path(X4,X2)
& on_path(X3,X2)
& sequential(X4,X3) ) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ( path(X0,X1,X2)
& ! [X4,X3] :
( ( on_path(X4,X2)
& on_path(X3,X2)
& sequential(X4,X3) )
=> ? [X5] : triangle(X4,X3,X5) ) )
=> number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X1,X2,X3] :
( ( ! [X7,X6] :
( ( on_path(X6,X3)
& on_path(X7,X3)
& sequential(X6,X7) )
=> ? [X8] : triangle(X6,X7,X8) )
& path(X1,X2,X3) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(f227,plain,
( spl13_9
| spl13_11 ),
inference(avatar_split_clause,[],[f220,f224,f207]) ).
fof(f220,plain,
! [X0,X1] :
( sequential(sK4(sK8),sK3(sK8))
| ~ path(X0,X1,sK8) ),
inference(resolution,[],[f136,f150]) ).
fof(f136,plain,
! [X2,X0,X1] :
( sQ12_eqProxy(number_of_in(sequential_pairs,X2),number_of_in(triangles,X2))
| ~ path(X0,X1,X2)
| sequential(sK4(X2),sK3(X2)) ),
inference(equality_proxy_replacement,[],[f86,f121]) ).
fof(f86,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| sequential(sK4(X2),sK3(X2))
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f219,plain,
~ spl13_9,
inference(avatar_contradiction_clause,[],[f218]) ).
fof(f218,plain,
( $false
| ~ spl13_9 ),
inference(resolution,[],[f208,f119]) ).
fof(f119,plain,
path(sK10,sK9,sK8),
inference(cnf_transformation,[],[f53]) ).
fof(f208,plain,
( ! [X0,X1] : ~ path(X0,X1,sK8)
| ~ spl13_9 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f217,plain,
( spl13_10
| spl13_9 ),
inference(avatar_split_clause,[],[f210,f207,f214]) ).
fof(f210,plain,
! [X0,X1] :
( ~ path(X0,X1,sK8)
| on_path(sK4(sK8),sK8) ),
inference(resolution,[],[f137,f150]) ).
fof(f137,plain,
! [X2,X0,X1] :
( sQ12_eqProxy(number_of_in(sequential_pairs,X2),number_of_in(triangles,X2))
| ~ path(X0,X1,X2)
| on_path(sK4(X2),X2) ),
inference(equality_proxy_replacement,[],[f85,f121]) ).
fof(f85,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| on_path(sK4(X2),X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f209,plain,
( spl13_8
| spl13_9 ),
inference(avatar_split_clause,[],[f199,f207,f203]) ).
fof(f199,plain,
! [X0,X1] :
( ~ path(X0,X1,sK8)
| on_path(sK3(sK8),sK8) ),
inference(resolution,[],[f134,f150]) ).
fof(f134,plain,
! [X2,X0,X1] :
( sQ12_eqProxy(number_of_in(sequential_pairs,X2),number_of_in(triangles,X2))
| ~ path(X0,X1,X2)
| on_path(sK3(X2),X2) ),
inference(equality_proxy_replacement,[],[f88,f121]) ).
fof(f88,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| on_path(sK3(X2),X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.10/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.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 29 22:04:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.49 % (21122)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.49 % (21123)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50 % (21126)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.50 % (21135)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.20/0.50 % (21125)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.51 % (21145)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.51 % (21129)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.51 % (21146)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (21144)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.51 % (21132)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.20/0.51 % (21130)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.20/0.51 % (21131)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.51 % (21142)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.51 % (21133)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 % (21123)Instruction limit reached!
% 0.20/0.51 % (21123)------------------------------
% 0.20/0.51 % (21123)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (21123)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (21123)Termination reason: Unknown
% 0.20/0.51 % (21123)Termination phase: Preprocessing 3
% 0.20/0.51
% 0.20/0.51 % (21123)Memory used [KB]: 1535
% 0.20/0.51 % (21123)Time elapsed: 0.004 s
% 0.20/0.51 % (21123)Instructions burned: 3 (million)
% 0.20/0.51 % (21123)------------------------------
% 0.20/0.51 % (21123)------------------------------
% 0.20/0.52 % (21124)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (21142)First to succeed.
% 0.20/0.52 % (21149)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.52 % (21142)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 % (21142)------------------------------
% 0.20/0.52 % (21142)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (21142)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (21142)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (21142)Memory used [KB]: 6140
% 0.20/0.52 % (21142)Time elapsed: 0.118 s
% 0.20/0.52 % (21142)Instructions burned: 7 (million)
% 0.20/0.52 % (21142)------------------------------
% 0.20/0.52 % (21142)------------------------------
% 0.20/0.52 % (21116)Success in time 0.177 s
%------------------------------------------------------------------------------