TSTP Solution File: SWB007+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWB007+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:38 EDT 2022
% Result : Theorem 1.81s 2.03s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 14 ( 2 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ iext(uri_owl_sameAs,A,B)
| A = B ),
file('SWB007+2.p',unknown),
[] ).
cnf(3,axiom,
( ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
file('SWB007+2.p',unknown),
[] ).
cnf(5,axiom,
iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2),
file('SWB007+2.p',unknown),
[] ).
cnf(6,axiom,
iext(uri_rdf_type,uri_ex_w,uri_ex_c1),
file('SWB007+2.p',unknown),
[] ).
cnf(7,axiom,
iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1),
file('SWB007+2.p',unknown),
[] ).
cnf(8,axiom,
iext(uri_rdfs_range,uri_ex_p,uri_ex_c1),
file('SWB007+2.p',unknown),
[] ).
cnf(11,plain,
uri_ex_c2 = uri_ex_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[5,1])]),
[iquote('hyper,5,1,flip.1')] ).
cnf(12,plain,
( ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c1)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1)
| ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c1) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),11,11,11]),
[iquote('back_demod,3,demod,11,11,11')] ).
cnf(49,plain,
$false,
inference(hyper,[status(thm)],[12,6,7,8]),
[iquote('hyper,12,6,7,8')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB007+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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:26:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.81/2.03 ----- Otter 3.3f, August 2004 -----
% 1.81/2.03 The process was started by sandbox on n021.cluster.edu,
% 1.81/2.03 Wed Jul 27 02:26:08 2022
% 1.81/2.03 The command was "./otter". The process ID is 7329.
% 1.81/2.03
% 1.81/2.03 set(prolog_style_variables).
% 1.81/2.03 set(auto).
% 1.81/2.03 dependent: set(auto1).
% 1.81/2.03 dependent: set(process_input).
% 1.81/2.03 dependent: clear(print_kept).
% 1.81/2.03 dependent: clear(print_new_demod).
% 1.81/2.03 dependent: clear(print_back_demod).
% 1.81/2.03 dependent: clear(print_back_sub).
% 1.81/2.03 dependent: set(control_memory).
% 1.81/2.03 dependent: assign(max_mem, 12000).
% 1.81/2.03 dependent: assign(pick_given_ratio, 4).
% 1.81/2.03 dependent: assign(stats_level, 1).
% 1.81/2.03 dependent: assign(max_seconds, 10800).
% 1.81/2.03 clear(print_given).
% 1.81/2.03
% 1.81/2.03 formula_list(usable).
% 1.81/2.03 all A (A=A).
% 1.81/2.03 all X Y (iext(uri_owl_sameAs,X,Y)<->X=Y).
% 1.81/2.03 -(iext(uri_rdf_type,uri_ex_w,uri_ex_c2)&iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)&iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)).
% 1.81/2.03 iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2).
% 1.81/2.03 iext(uri_rdf_type,uri_ex_w,uri_ex_c1).
% 1.81/2.03 iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1).
% 1.81/2.03 iext(uri_rdfs_range,uri_ex_p,uri_ex_c1).
% 1.81/2.03 end_of_list.
% 1.81/2.03
% 1.81/2.03 -------> usable clausifies to:
% 1.81/2.03
% 1.81/2.03 list(usable).
% 1.81/2.03 0 [] A=A.
% 1.81/2.03 0 [] -iext(uri_owl_sameAs,X,Y)|X=Y.
% 1.81/2.03 0 [] iext(uri_owl_sameAs,X,Y)|X!=Y.
% 1.81/2.03 0 [] -iext(uri_rdf_type,uri_ex_w,uri_ex_c2)| -iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)| -iext(uri_rdfs_range,uri_ex_p,uri_ex_c2).
% 1.81/2.03 0 [] iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2).
% 1.81/2.03 0 [] iext(uri_rdf_type,uri_ex_w,uri_ex_c1).
% 1.81/2.03 0 [] iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1).
% 1.81/2.03 0 [] iext(uri_rdfs_range,uri_ex_p,uri_ex_c1).
% 1.81/2.03 end_of_list.
% 1.81/2.03
% 1.81/2.03 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.81/2.03
% 1.81/2.03 This is a Horn set with equality. The strategy will be
% 1.81/2.03 Knuth-Bendix and hyper_res, with positive clauses in
% 1.81/2.03 sos and nonpositive clauses in usable.
% 1.81/2.03
% 1.81/2.03 dependent: set(knuth_bendix).
% 1.81/2.03 dependent: set(anl_eq).
% 1.81/2.03 dependent: set(para_from).
% 1.81/2.03 dependent: set(para_into).
% 1.81/2.03 dependent: clear(para_from_right).
% 1.81/2.03 dependent: clear(para_into_right).
% 1.81/2.03 dependent: set(para_from_vars).
% 1.81/2.03 dependent: set(eq_units_both_ways).
% 1.81/2.03 dependent: set(dynamic_demod_all).
% 1.81/2.03 dependent: set(dynamic_demod).
% 1.81/2.03 dependent: set(order_eq).
% 1.81/2.03 dependent: set(back_demod).
% 1.81/2.03 dependent: set(lrpo).
% 1.81/2.03 dependent: set(hyper_res).
% 1.81/2.03 dependent: clear(order_hyper).
% 1.81/2.03
% 1.81/2.03 ------------> process usable:
% 1.81/2.03 ** KEPT (pick-wt=7): 1 [] -iext(uri_owl_sameAs,A,B)|A=B.
% 1.81/2.03 ** KEPT (pick-wt=7): 2 [] iext(uri_owl_sameAs,A,B)|A!=B.
% 1.81/2.03 ** KEPT (pick-wt=12): 3 [] -iext(uri_rdf_type,uri_ex_w,uri_ex_c2)| -iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)| -iext(uri_rdfs_range,uri_ex_p,uri_ex_c2).
% 1.81/2.03
% 1.81/2.03 ------------> process sos:
% 1.81/2.03 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.81/2.03 ** KEPT (pick-wt=4): 5 [] iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2).
% 1.81/2.03 ** KEPT (pick-wt=4): 6 [] iext(uri_rdf_type,uri_ex_w,uri_ex_c1).
% 1.81/2.03 ** KEPT (pick-wt=4): 7 [] iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1).
% 1.81/2.03 ** KEPT (pick-wt=4): 8 [] iext(uri_rdfs_range,uri_ex_p,uri_ex_c1).
% 1.81/2.03 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.81/2.03
% 1.81/2.03 ======= end of input processing =======
% 1.81/2.03
% 1.81/2.03 =========== start of search ===========
% 1.81/2.03
% 1.81/2.03 -------- PROOF --------
% 1.81/2.03
% 1.81/2.03 -----> EMPTY CLAUSE at 0.00 sec ----> 49 [hyper,12,6,7,8] $F.
% 1.81/2.03
% 1.81/2.03 Length of proof is 2. Level of proof is 2.
% 1.81/2.03
% 1.81/2.03 ---------------- PROOF ----------------
% 1.81/2.03 % SZS status Theorem
% 1.81/2.03 % SZS output start Refutation
% See solution above
% 1.81/2.03 ------------ end of proof -------------
% 1.81/2.03
% 1.81/2.03
% 1.81/2.03 Search stopped by max_proofs option.
% 1.81/2.03
% 1.81/2.03
% 1.81/2.03 Search stopped by max_proofs option.
% 1.81/2.03
% 1.81/2.03 ============ end of search ============
% 1.81/2.03
% 1.81/2.03 -------------- statistics -------------
% 1.81/2.03 clauses given 11
% 1.81/2.03 clauses generated 56
% 1.81/2.03 clauses kept 47
% 1.81/2.03 clauses forward subsumed 19
% 1.81/2.03 clauses back subsumed 0
% 1.81/2.03 Kbytes malloced 976
% 1.81/2.03
% 1.81/2.03 ----------- times (seconds) -----------
% 1.81/2.03 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/2.03 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.81/2.03
% 1.81/2.03 That finishes the proof of the theorem.
% 1.81/2.03
% 1.81/2.03 Process 7329 finished Wed Jul 27 02:26:09 2022
% 1.81/2.03 Otter interrupted
% 1.81/2.03 PROOF FOUND
%------------------------------------------------------------------------------