TSTP Solution File: SWB006+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n013.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:37:06 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 15 unt; 0 def)
% Number of atoms : 40 ( 10 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 25 ( 8 ~; 4 |; 11 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 12 ( 9 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,plain,
$false,
inference(subsumption_resolution,[],[f29,f16]) ).
fof(f16,plain,
! [X1] : iext(uri_owl_sameAs,X1,X1),
inference(equality_resolution,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( iext(uri_owl_sameAs,X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( ( iext(uri_owl_sameAs,X0,X1)
| X0 != X1 )
& ( X0 = X1
| ~ iext(uri_owl_sameAs,X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( iext(uri_owl_sameAs,X0,X1)
<=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_eqdis_sameas) ).
fof(f29,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_u),
inference(backward_demodulation,[],[f13,f26]) ).
fof(f26,plain,
uri_ex_u = uri_ex_w,
inference(forward_demodulation,[],[f25,f20]) ).
fof(f20,plain,
uri_ex_u = literal_plain(dat_str_abc),
inference(resolution,[],[f14,f12]) ).
fof(f12,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,sK0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,sK0,uri_ex_w) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
( ? [X0] :
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X0,uri_ex_w) )
=> ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,sK0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,sK0,uri_ex_w) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0] :
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X0,uri_ex_w) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
? [X2] :
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X2,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X2,uri_ex_w) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(f14,plain,
! [X0,X1] :
( ~ iext(uri_owl_sameAs,X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f25,plain,
uri_ex_w = literal_plain(dat_str_abc),
inference(forward_demodulation,[],[f18,f17]) ).
fof(f17,plain,
uri_ex_w = sK0,
inference(resolution,[],[f14,f10]) ).
fof(f10,plain,
iext(uri_owl_sameAs,sK0,uri_ex_w),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
literal_plain(dat_str_abc) = sK0,
inference(resolution,[],[f14,f11]) ).
fof(f11,plain,
iext(uri_owl_sameAs,sK0,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(cnf_transformation,[],[f5]) ).
fof(f5,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(flattening,[],[f3]) ).
fof(f3,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n013.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 17:21:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (28110)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.20/0.49 % (28118)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.20/0.50 % (28118)First to succeed.
% 0.20/0.50 % (28105)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.20/0.50 % (28118)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (28118)------------------------------
% 0.20/0.50 % (28118)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (28118)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (28118)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (28118)Memory used [KB]: 895
% 0.20/0.50 % (28118)Time elapsed: 0.100 s
% 0.20/0.50 % (28118)Instructions burned: 2 (million)
% 0.20/0.50 % (28118)------------------------------
% 0.20/0.50 % (28118)------------------------------
% 0.20/0.50 % (28102)Success in time 0.144 s
%------------------------------------------------------------------------------