TSTP Solution File: SWB006+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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.62s 1.80s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 19 ( 6 equ; 7 neg)
% Maximal clause size : 2 ( 1 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 : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ iext(uri_owl_sameAs,A,B)
| A = B ),
file('SWB006+2.p',unknown),
[] ).
cnf(2,axiom,
( iext(uri_owl_sameAs,A,B)
| A != B ),
file('SWB006+2.p',unknown),
[] ).
cnf(3,axiom,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('SWB006+2.p',unknown),
[] ).
cnf(4,axiom,
A = A,
file('SWB006+2.p',unknown),
[] ).
cnf(5,axiom,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
file('SWB006+2.p',unknown),
[] ).
cnf(6,axiom,
iext(uri_owl_sameAs,dollar_c1,literal_plain(dat_str_abc)),
file('SWB006+2.p',unknown),
[] ).
cnf(7,axiom,
iext(uri_owl_sameAs,dollar_c1,uri_ex_w),
file('SWB006+2.p',unknown),
[] ).
cnf(8,plain,
iext(uri_owl_sameAs,A,A),
inference(hyper,[status(thm)],[4,2]),
[iquote('hyper,4,2')] ).
cnf(10,plain,
uri_ex_w = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[7,1])]),
[iquote('hyper,7,1,flip.1')] ).
cnf(11,plain,
~ iext(uri_owl_sameAs,uri_ex_u,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),10]),
[iquote('back_demod,3,demod,10')] ).
cnf(16,plain,
( ~ iext(uri_owl_sameAs,uri_ex_u,A)
| ~ iext(uri_owl_sameAs,dollar_c1,A) ),
inference(para_into,[status(thm),theory(equality)],[11,1]),
[iquote('para_into,11.1.3,1.2.1')] ).
cnf(18,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[5,1])]),
[iquote('hyper,5,1,flip.1')] ).
cnf(19,plain,
iext(uri_owl_sameAs,dollar_c1,uri_ex_u),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[6]),18]),
[iquote('back_demod,6,demod,18')] ).
cnf(23,plain,
uri_ex_u = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[19,1])]),
[iquote('hyper,19,1,flip.1')] ).
cnf(27,plain,
~ iext(uri_owl_sameAs,dollar_c1,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[16]),23]),
[iquote('back_demod,16,demod,23')] ).
cnf(28,plain,
$false,
inference(binary,[status(thm)],[27,8]),
[iquote('binary,27.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 02:30:35 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.62/1.80 ----- Otter 3.3f, August 2004 -----
% 1.62/1.80 The process was started by sandbox2 on n005.cluster.edu,
% 1.62/1.80 Wed Jul 27 02:30:35 2022
% 1.62/1.80 The command was "./otter". The process ID is 2284.
% 1.62/1.80
% 1.62/1.80 set(prolog_style_variables).
% 1.62/1.80 set(auto).
% 1.62/1.80 dependent: set(auto1).
% 1.62/1.80 dependent: set(process_input).
% 1.62/1.80 dependent: clear(print_kept).
% 1.62/1.80 dependent: clear(print_new_demod).
% 1.62/1.80 dependent: clear(print_back_demod).
% 1.62/1.80 dependent: clear(print_back_sub).
% 1.62/1.80 dependent: set(control_memory).
% 1.62/1.80 dependent: assign(max_mem, 12000).
% 1.62/1.80 dependent: assign(pick_given_ratio, 4).
% 1.62/1.80 dependent: assign(stats_level, 1).
% 1.62/1.80 dependent: assign(max_seconds, 10800).
% 1.62/1.80 clear(print_given).
% 1.62/1.80
% 1.62/1.80 formula_list(usable).
% 1.62/1.80 all A (A=A).
% 1.62/1.80 all X Y (iext(uri_owl_sameAs,X,Y)<->X=Y).
% 1.62/1.80 -iext(uri_owl_sameAs,uri_ex_u,uri_ex_w).
% 1.62/1.80 exists BNODE_x (iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))&iext(uri_owl_sameAs,BNODE_x,literal_plain(dat_str_abc))&iext(uri_owl_sameAs,BNODE_x,uri_ex_w)).
% 1.62/1.80 end_of_list.
% 1.62/1.80
% 1.62/1.80 -------> usable clausifies to:
% 1.62/1.80
% 1.62/1.80 list(usable).
% 1.62/1.80 0 [] A=A.
% 1.62/1.80 0 [] -iext(uri_owl_sameAs,X,Y)|X=Y.
% 1.62/1.80 0 [] iext(uri_owl_sameAs,X,Y)|X!=Y.
% 1.62/1.80 0 [] -iext(uri_owl_sameAs,uri_ex_u,uri_ex_w).
% 1.62/1.80 0 [] iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)).
% 1.62/1.80 0 [] iext(uri_owl_sameAs,$c1,literal_plain(dat_str_abc)).
% 1.62/1.80 0 [] iext(uri_owl_sameAs,$c1,uri_ex_w).
% 1.62/1.80 end_of_list.
% 1.62/1.80
% 1.62/1.80 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.62/1.80
% 1.62/1.80 This is a Horn set with equality. The strategy will be
% 1.62/1.80 Knuth-Bendix and hyper_res, with positive clauses in
% 1.62/1.80 sos and nonpositive clauses in usable.
% 1.62/1.80
% 1.62/1.80 dependent: set(knuth_bendix).
% 1.62/1.80 dependent: set(anl_eq).
% 1.62/1.80 dependent: set(para_from).
% 1.62/1.80 dependent: set(para_into).
% 1.62/1.80 dependent: clear(para_from_right).
% 1.62/1.80 dependent: clear(para_into_right).
% 1.62/1.80 dependent: set(para_from_vars).
% 1.62/1.80 dependent: set(eq_units_both_ways).
% 1.62/1.80 dependent: set(dynamic_demod_all).
% 1.62/1.80 dependent: set(dynamic_demod).
% 1.62/1.80 dependent: set(order_eq).
% 1.62/1.80 dependent: set(back_demod).
% 1.62/1.80 dependent: set(lrpo).
% 1.62/1.80 dependent: set(hyper_res).
% 1.62/1.80 dependent: clear(order_hyper).
% 1.62/1.80
% 1.62/1.80 ------------> process usable:
% 1.62/1.80 ** KEPT (pick-wt=7): 1 [] -iext(uri_owl_sameAs,A,B)|A=B.
% 1.62/1.80 ** KEPT (pick-wt=7): 2 [] iext(uri_owl_sameAs,A,B)|A!=B.
% 1.62/1.80 ** KEPT (pick-wt=4): 3 [] -iext(uri_owl_sameAs,uri_ex_u,uri_ex_w).
% 1.62/1.80
% 1.62/1.80 ------------> process sos:
% 1.62/1.80 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.62/1.80 ** KEPT (pick-wt=5): 5 [] iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)).
% 1.62/1.80 ** KEPT (pick-wt=5): 6 [] iext(uri_owl_sameAs,$c1,literal_plain(dat_str_abc)).
% 1.62/1.80 ** KEPT (pick-wt=4): 7 [] iext(uri_owl_sameAs,$c1,uri_ex_w).
% 1.62/1.80 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.62/1.80
% 1.62/1.80 ======= end of input processing =======
% 1.62/1.80
% 1.62/1.80 =========== start of search ===========
% 1.62/1.80
% 1.62/1.80 -------- PROOF --------
% 1.62/1.80
% 1.62/1.80 ----> UNIT CONFLICT at 0.00 sec ----> 28 [binary,27.1,8.1] $F.
% 1.62/1.80
% 1.62/1.80 Length of proof is 8. Level of proof is 4.
% 1.62/1.80
% 1.62/1.80 ---------------- PROOF ----------------
% 1.62/1.80 % SZS status Theorem
% 1.62/1.80 % SZS output start Refutation
% See solution above
% 1.62/1.80 ------------ end of proof -------------
% 1.62/1.80
% 1.62/1.80
% 1.62/1.80 Search stopped by max_proofs option.
% 1.62/1.80
% 1.62/1.80
% 1.62/1.80 Search stopped by max_proofs option.
% 1.62/1.80
% 1.62/1.80 ============ end of search ============
% 1.62/1.80
% 1.62/1.80 -------------- statistics -------------
% 1.62/1.80 clauses given 8
% 1.62/1.80 clauses generated 18
% 1.62/1.80 clauses kept 23
% 1.62/1.80 clauses forward subsumed 12
% 1.62/1.80 clauses back subsumed 0
% 1.62/1.80 Kbytes malloced 976
% 1.62/1.80
% 1.62/1.80 ----------- times (seconds) -----------
% 1.62/1.80 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.80 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.80 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.62/1.80
% 1.62/1.80 That finishes the proof of the theorem.
% 1.62/1.80
% 1.62/1.80 Process 2284 finished Wed Jul 27 02:30:37 2022
% 1.62/1.80 Otter interrupted
% 1.62/1.80 PROOF FOUND
%------------------------------------------------------------------------------