TSTP Solution File: GRA005+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRA005+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n007.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 : Sun May 5 05:43:57 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 88 ( 36 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 101 ( 36 ~; 17 |; 41 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 83 ( 58 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f376,plain,
$false,
inference(resolution,[],[f374,f97]) ).
fof(f97,plain,
precedes(sK6,sK7,sK8),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
( head_of(sK7) = head_of(sK9)
& tail_of(sK6) = tail_of(sK9)
& edge(sK9)
& precedes(sK6,sK7,sK8)
& shortest_path(sK4,sK5,sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9])],[f39,f69,f68]) ).
fof(f68,plain,
( ? [X0,X1,X2,X3,X4] :
( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ( ? [X5] :
( head_of(X5) = head_of(sK7)
& tail_of(X5) = tail_of(sK6)
& edge(X5) )
& precedes(sK6,sK7,sK8)
& shortest_path(sK4,sK5,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
( ? [X5] :
( head_of(X5) = head_of(sK7)
& tail_of(X5) = tail_of(sK6)
& edge(X5) )
=> ( head_of(sK7) = head_of(sK9)
& tail_of(sK6) = tail_of(sK9)
& edge(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
? [X0,X1,X2,X3,X4] :
( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
? [X0,X1,X2,X3,X4] :
( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ~ ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) ) ),
inference(rectify,[],[f19]) ).
fof(f19,negated_conjecture,
~ ! [X1,X2,X6,X7,X3] :
( ( precedes(X6,X7,X3)
& shortest_path(X1,X2,X3) )
=> ~ ? [X8] :
( head_of(X8) = head_of(X7)
& tail_of(X8) = tail_of(X6)
& edge(X8) ) ),
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
! [X1,X2,X6,X7,X3] :
( ( precedes(X6,X7,X3)
& shortest_path(X1,X2,X3) )
=> ~ ? [X8] :
( head_of(X8) = head_of(X7)
& tail_of(X8) = tail_of(X6)
& edge(X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_short_cut_edge) ).
fof(f374,plain,
~ precedes(sK6,sK7,sK8),
inference(resolution,[],[f370,f96]) ).
fof(f96,plain,
shortest_path(sK4,sK5,sK8),
inference(cnf_transformation,[],[f70]) ).
fof(f370,plain,
! [X2,X0,X1] :
( ~ shortest_path(X1,X2,X0)
| ~ precedes(sK6,sK7,X0) ),
inference(trivial_inequality_removal,[],[f368]) ).
fof(f368,plain,
! [X2,X0,X1] :
( head_of(sK9) != head_of(sK9)
| ~ precedes(sK6,sK7,X0)
| ~ shortest_path(X1,X2,X0) ),
inference(superposition,[],[f366,f100]) ).
fof(f100,plain,
head_of(sK7) = head_of(sK9),
inference(cnf_transformation,[],[f70]) ).
fof(f366,plain,
! [X2,X3,X0,X1] :
( head_of(X0) != head_of(sK9)
| ~ precedes(sK6,X0,X1)
| ~ shortest_path(X2,X3,X1) ),
inference(equality_resolution,[],[f349]) ).
fof(f349,plain,
! [X2,X3,X0,X1,X4] :
( tail_of(X0) != tail_of(sK9)
| head_of(X0) != head_of(X1)
| ~ precedes(sK6,X1,X2)
| ~ shortest_path(X3,X4,X2) ),
inference(superposition,[],[f151,f99]) ).
fof(f99,plain,
tail_of(sK6) = tail_of(sK9),
inference(cnf_transformation,[],[f70]) ).
fof(f151,plain,
! [X2,X3,X0,X1,X4,X5] :
( tail_of(X5) != tail_of(X2)
| head_of(X5) != head_of(X3)
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0,X1,X2,X3,X4] :
( ( ~ precedes(X3,X2,X4)
& ! [X5] :
( head_of(X5) != head_of(X3)
| tail_of(X5) != tail_of(X2) ) )
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2,X3,X4] :
( ( ~ precedes(X3,X2,X4)
& ! [X5] :
( head_of(X5) != head_of(X3)
| tail_of(X5) != tail_of(X2) ) )
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2,X3,X4] :
( ( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ( ~ precedes(X3,X2,X4)
& ~ ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X1,X2,X6,X7,X3] :
( ( precedes(X6,X7,X3)
& shortest_path(X1,X2,X3) )
=> ( ~ precedes(X7,X6,X3)
& ~ ? [X8] :
( head_of(X8) = head_of(X7)
& tail_of(X8) = tail_of(X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRA005+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.33 % Computer : n007.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Fri May 3 18:23:23 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.15/0.34 % (17383)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.36 % (17386)WARNING: value z3 for option sas not known
% 0.15/0.36 % (17389)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.36 % (17384)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.36 % (17386)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.36 TRYING [1]
% 0.15/0.36 TRYING [2]
% 0.15/0.37 % (17388)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.37 % (17387)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.37 % (17390)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.37 TRYING [3]
% 0.15/0.37 % (17385)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.37 % (17389)First to succeed.
% 0.15/0.37 % (17389)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17383"
% 0.15/0.38 % (17389)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (17389)------------------------------
% 0.15/0.38 % (17389)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (17389)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (17389)Memory used [KB]: 1039
% 0.15/0.38 % (17389)Time elapsed: 0.021 s
% 0.15/0.38 % (17389)Instructions burned: 26 (million)
% 0.15/0.38 % (17383)Success in time 0.036 s
%------------------------------------------------------------------------------