TSTP Solution File: SWB009+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWB009+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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 Jul 27 13:17:39 EDT 2022
% Result : Theorem 1.66s 1.85s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 0 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-4 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ iext(uri_rdf_type,A,B)
| icext(B,A) ),
file('SWB009+2.p',unknown),
[] ).
cnf(2,axiom,
( iext(uri_rdf_type,A,B)
| ~ icext(B,A) ),
file('SWB009+2.p',unknown),
[] ).
cnf(3,axiom,
( ~ iext(uri_owl_someValuesFrom,A,B)
| ~ iext(uri_owl_onProperty,A,C)
| ~ icext(A,D)
| iext(C,D,dollar_f1(A,C,B,D)) ),
file('SWB009+2.p',unknown),
[] ).
cnf(4,axiom,
( ~ iext(uri_owl_someValuesFrom,A,B)
| ~ iext(uri_owl_onProperty,A,C)
| ~ icext(A,D)
| icext(B,dollar_f1(A,C,B,D)) ),
file('SWB009+2.p',unknown),
[] ).
cnf(6,axiom,
( ~ iext(uri_ex_p,uri_ex_s,A)
| ~ iext(uri_rdf_type,A,uri_ex_c) ),
file('SWB009+2.p',unknown),
[] ).
cnf(9,axiom,
iext(uri_rdf_type,uri_ex_s,dollar_c1),
file('SWB009+2.p',unknown),
[] ).
cnf(11,axiom,
iext(uri_owl_onProperty,dollar_c1,uri_ex_p),
file('SWB009+2.p',unknown),
[] ).
cnf(12,axiom,
iext(uri_owl_someValuesFrom,dollar_c1,uri_ex_c),
file('SWB009+2.p',unknown),
[] ).
cnf(15,plain,
icext(dollar_c1,uri_ex_s),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(17,plain,
icext(uri_ex_c,dollar_f1(dollar_c1,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(hyper,[status(thm)],[12,4,11,15]),
[iquote('hyper,12,4,11,15')] ).
cnf(18,plain,
iext(uri_ex_p,uri_ex_s,dollar_f1(dollar_c1,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(hyper,[status(thm)],[12,3,11,15]),
[iquote('hyper,12,3,11,15')] ).
cnf(19,plain,
iext(uri_rdf_type,dollar_f1(dollar_c1,uri_ex_p,uri_ex_c,uri_ex_s),uri_ex_c),
inference(hyper,[status(thm)],[17,2]),
[iquote('hyper,17,2')] ).
cnf(20,plain,
$false,
inference(hyper,[status(thm)],[19,6,18]),
[iquote('hyper,19,6,18')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWB009+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % 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 : Wed Jul 27 02:38:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.85 ----- Otter 3.3f, August 2004 -----
% 1.66/1.85 The process was started by sandbox on n028.cluster.edu,
% 1.66/1.85 Wed Jul 27 02:38:48 2022
% 1.66/1.85 The command was "./otter". The process ID is 31132.
% 1.66/1.85
% 1.66/1.85 set(prolog_style_variables).
% 1.66/1.85 set(auto).
% 1.66/1.85 dependent: set(auto1).
% 1.66/1.85 dependent: set(process_input).
% 1.66/1.85 dependent: clear(print_kept).
% 1.66/1.85 dependent: clear(print_new_demod).
% 1.66/1.85 dependent: clear(print_back_demod).
% 1.66/1.85 dependent: clear(print_back_sub).
% 1.66/1.85 dependent: set(control_memory).
% 1.66/1.85 dependent: assign(max_mem, 12000).
% 1.66/1.85 dependent: assign(pick_given_ratio, 4).
% 1.66/1.85 dependent: assign(stats_level, 1).
% 1.66/1.85 dependent: assign(max_seconds, 10800).
% 1.66/1.85 clear(print_given).
% 1.66/1.85
% 1.66/1.85 formula_list(usable).
% 1.66/1.85 all X C (iext(uri_rdf_type,X,C)<->icext(C,X)).
% 1.66/1.85 all Z P C (iext(uri_owl_someValuesFrom,Z,C)&iext(uri_owl_onProperty,Z,P)-> (all X (icext(Z,X)<-> (exists Y (iext(P,X,Y)&icext(C,Y)))))).
% 1.66/1.85 -(exists BNODE_x (iext(uri_ex_p,uri_ex_s,BNODE_x)&iext(uri_rdf_type,BNODE_x,uri_ex_c))).
% 1.66/1.85 exists BNODE_z (iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)&iext(uri_rdf_type,uri_ex_c,uri_owl_Class)&iext(uri_rdf_type,uri_ex_s,BNODE_z)&iext(uri_rdf_type,BNODE_z,uri_owl_Restriction)&iext(uri_owl_onProperty,BNODE_z,uri_ex_p)&iext(uri_owl_someValuesFrom,BNODE_z,uri_ex_c)).
% 1.66/1.85 end_of_list.
% 1.66/1.85
% 1.66/1.85 -------> usable clausifies to:
% 1.66/1.85
% 1.66/1.85 list(usable).
% 1.66/1.85 0 [] -iext(uri_rdf_type,X,C)|icext(C,X).
% 1.66/1.85 0 [] iext(uri_rdf_type,X,C)| -icext(C,X).
% 1.66/1.85 0 [] -iext(uri_owl_someValuesFrom,Z,C)| -iext(uri_owl_onProperty,Z,P)| -icext(Z,X)|iext(P,X,$f1(Z,P,C,X)).
% 1.66/1.85 0 [] -iext(uri_owl_someValuesFrom,Z,C)| -iext(uri_owl_onProperty,Z,P)| -icext(Z,X)|icext(C,$f1(Z,P,C,X)).
% 1.66/1.85 0 [] -iext(uri_owl_someValuesFrom,Z,C)| -iext(uri_owl_onProperty,Z,P)|icext(Z,X)| -iext(P,X,Y)| -icext(C,Y).
% 1.66/1.85 0 [] -iext(uri_ex_p,uri_ex_s,BNODE_x)| -iext(uri_rdf_type,BNODE_x,uri_ex_c).
% 1.66/1.85 0 [] iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty).
% 1.66/1.85 0 [] iext(uri_rdf_type,uri_ex_c,uri_owl_Class).
% 1.66/1.85 0 [] iext(uri_rdf_type,uri_ex_s,$c1).
% 1.66/1.85 0 [] iext(uri_rdf_type,$c1,uri_owl_Restriction).
% 1.66/1.85 0 [] iext(uri_owl_onProperty,$c1,uri_ex_p).
% 1.66/1.85 0 [] iext(uri_owl_someValuesFrom,$c1,uri_ex_c).
% 1.66/1.85 end_of_list.
% 1.66/1.85
% 1.66/1.85 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 1.66/1.85
% 1.66/1.85 This is a Horn set without equality. The strategy will
% 1.66/1.85 be hyperresolution, with satellites in sos and nuclei
% 1.66/1.85 in usable.
% 1.66/1.85
% 1.66/1.85 dependent: set(hyper_res).
% 1.66/1.85 dependent: clear(order_hyper).
% 1.66/1.85
% 1.66/1.85 ------------> process usable:
% 1.66/1.85 ** KEPT (pick-wt=7): 1 [] -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.66/1.85 ** KEPT (pick-wt=7): 2 [] iext(uri_rdf_type,A,B)| -icext(B,A).
% 1.66/1.85 ** KEPT (pick-wt=19): 3 [] -iext(uri_owl_someValuesFrom,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)|iext(C,D,$f1(A,C,B,D)).
% 1.66/1.85 ** KEPT (pick-wt=18): 4 [] -iext(uri_owl_someValuesFrom,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)|icext(B,$f1(A,C,B,D)).
% 1.66/1.85 ** KEPT (pick-wt=18): 5 [] -iext(uri_owl_someValuesFrom,A,B)| -iext(uri_owl_onProperty,A,C)|icext(A,D)| -iext(C,D,E)| -icext(B,E).
% 1.66/1.85 ** KEPT (pick-wt=8): 6 [] -iext(uri_ex_p,uri_ex_s,A)| -iext(uri_rdf_type,A,uri_ex_c).
% 1.66/1.85
% 1.66/1.85 ------------> process sos:
% 1.66/1.85 ** KEPT (pick-wt=4): 7 [] iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty).
% 1.66/1.85 ** KEPT (pick-wt=4): 8 [] iext(uri_rdf_type,uri_ex_c,uri_owl_Class).
% 1.66/1.85 ** KEPT (pick-wt=4): 9 [] iext(uri_rdf_type,uri_ex_s,$c1).
% 1.66/1.85 ** KEPT (pick-wt=4): 10 [] iext(uri_rdf_type,$c1,uri_owl_Restriction).
% 1.66/1.85 ** KEPT (pick-wt=4): 11 [] iext(uri_owl_onProperty,$c1,uri_ex_p).
% 1.66/1.85 ** KEPT (pick-wt=4): 12 [] iext(uri_owl_someValuesFrom,$c1,uri_ex_c).
% 1.66/1.85
% 1.66/1.85 ======= end of input processing =======
% 1.66/1.85
% 1.66/1.85 =========== start of search ===========
% 1.66/1.85
% 1.66/1.85 -------- PROOF --------
% 1.66/1.85
% 1.66/1.85 -----> EMPTY CLAUSE at 0.00 sec ----> 20 [hyper,19,6,18] $F.
% 1.66/1.85
% 1.66/1.85 Length of proof is 4. Level of proof is 3.
% 1.66/1.85
% 1.66/1.85 ---------------- PROOF ----------------
% 1.66/1.85 % SZS status Theorem
% 1.66/1.85 % SZS output start Refutation
% See solution above
% 1.66/1.85 ------------ end of proof -------------
% 1.66/1.85
% 1.66/1.85
% 1.66/1.85 Search stopped by max_proofs option.
% 1.66/1.85
% 1.66/1.85
% 1.66/1.85 Search stopped by max_proofs option.
% 1.66/1.85
% 1.66/1.85 ============ end of search ============
% 1.66/1.85
% 1.66/1.85 -------------- statistics -------------
% 1.66/1.85 clauses given 13
% 1.66/1.85 clauses generated 13
% 1.66/1.85 clauses kept 19
% 1.66/1.85 clauses forward subsumed 5
% 1.66/1.85 clauses back subsumed 0
% 1.66/1.85 Kbytes malloced 976
% 1.66/1.85
% 1.66/1.85 ----------- times (seconds) -----------
% 1.66/1.85 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.85 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.85 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.66/1.85
% 1.66/1.85 That finishes the proof of the theorem.
% 1.66/1.85
% 1.66/1.85 Process 31132 finished Wed Jul 27 02:38:50 2022
% 1.66/1.85 Otter interrupted
% 1.66/1.85 PROOF FOUND
%------------------------------------------------------------------------------