TSTP Solution File: SWB017+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWB017+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:44 EDT 2022
% Result : Theorem 1.75s 1.94s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 6 unt; 2 nHn; 7 RR)
% Number of literals : 13 ( 1 equ; 4 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 : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ iext(uri_owl_propertyDisjointWith,A,B)
| ~ iext(A,C,D)
| ~ iext(B,C,D) ),
file('SWB017+2.p',unknown),
[] ).
cnf(7,axiom,
~ iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u),
file('SWB017+2.p',unknown),
[] ).
cnf(14,axiom,
( iext(uri_owl_differentFrom,A,B)
| A = B ),
file('SWB017+2.p',unknown),
[] ).
cnf(15,axiom,
iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type),
file('SWB017+2.p',unknown),
[] ).
cnf(16,axiom,
iext(uri_rdf_type,uri_ex_w,uri_ex_c),
file('SWB017+2.p',unknown),
[] ).
cnf(17,axiom,
iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c),
file('SWB017+2.p',unknown),
[] ).
cnf(34,plain,
( iext(uri_rdf_type,A,uri_ex_c)
| iext(uri_owl_differentFrom,uri_ex_w,A) ),
inference(para_from,[status(thm),theory(equality)],[14,16]),
[iquote('para_from,14.2.1,16.1.2')] ).
cnf(200,plain,
iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u),
inference(hyper,[status(thm)],[34,4,15,17]),
[iquote('hyper,34,4,15,17')] ).
cnf(201,plain,
$false,
inference(binary,[status(thm)],[200,7]),
[iquote('binary,200.1,7.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWB017+2 : TPTP v8.1.0. Released v5.2.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n019.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 02:34:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.75/1.94 ----- Otter 3.3f, August 2004 -----
% 1.75/1.94 The process was started by sandbox2 on n019.cluster.edu,
% 1.75/1.94 Wed Jul 27 02:34:07 2022
% 1.75/1.94 The command was "./otter". The process ID is 12348.
% 1.75/1.94
% 1.75/1.94 set(prolog_style_variables).
% 1.75/1.94 set(auto).
% 1.75/1.94 dependent: set(auto1).
% 1.75/1.94 dependent: set(process_input).
% 1.75/1.94 dependent: clear(print_kept).
% 1.75/1.94 dependent: clear(print_new_demod).
% 1.75/1.94 dependent: clear(print_back_demod).
% 1.75/1.94 dependent: clear(print_back_sub).
% 1.75/1.94 dependent: set(control_memory).
% 1.75/1.94 dependent: assign(max_mem, 12000).
% 1.75/1.94 dependent: assign(pick_given_ratio, 4).
% 1.75/1.94 dependent: assign(stats_level, 1).
% 1.75/1.94 dependent: assign(max_seconds, 10800).
% 1.75/1.94 clear(print_given).
% 1.75/1.94
% 1.75/1.94 formula_list(usable).
% 1.75/1.94 all A (A=A).
% 1.75/1.94 all X Y (iext(uri_owl_differentFrom,X,Y)<->X!=Y).
% 1.75/1.94 all P1 P2 (iext(uri_owl_propertyDisjointWith,P1,P2)<->ip(P1)&ip(P2)& (all X Y (-(iext(P1,X,Y)&iext(P2,X,Y))))).
% 1.75/1.94 -iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u).
% 1.75/1.94 iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type).
% 1.75/1.94 iext(uri_rdf_type,uri_ex_w,uri_ex_c).
% 1.75/1.94 iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c).
% 1.75/1.94 end_of_list.
% 1.75/1.94
% 1.75/1.94 -------> usable clausifies to:
% 1.75/1.94
% 1.75/1.94 list(usable).
% 1.75/1.94 0 [] A=A.
% 1.75/1.94 0 [] -iext(uri_owl_differentFrom,X,Y)|X!=Y.
% 1.75/1.94 0 [] iext(uri_owl_differentFrom,X,Y)|X=Y.
% 1.75/1.94 0 [] -iext(uri_owl_propertyDisjointWith,P1,P2)|ip(P1).
% 1.75/1.94 0 [] -iext(uri_owl_propertyDisjointWith,P1,P2)|ip(P2).
% 1.75/1.94 0 [] -iext(uri_owl_propertyDisjointWith,P1,P2)| -iext(P1,X,Y)| -iext(P2,X,Y).
% 1.75/1.94 0 [] iext(uri_owl_propertyDisjointWith,P1,P2)| -ip(P1)| -ip(P2)|iext(P1,$f2(P1,P2),$f1(P1,P2)).
% 1.75/1.94 0 [] iext(uri_owl_propertyDisjointWith,P1,P2)| -ip(P1)| -ip(P2)|iext(P2,$f2(P1,P2),$f1(P1,P2)).
% 1.75/1.94 0 [] -iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u).
% 1.75/1.94 0 [] iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type).
% 1.75/1.94 0 [] iext(uri_rdf_type,uri_ex_w,uri_ex_c).
% 1.75/1.94 0 [] iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c).
% 1.75/1.94 end_of_list.
% 1.75/1.94
% 1.75/1.94 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.75/1.94
% 1.75/1.94 This ia a non-Horn set with equality. The strategy will be
% 1.75/1.94 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.75/1.94 deletion, with positive clauses in sos and nonpositive
% 1.75/1.94 clauses in usable.
% 1.75/1.94
% 1.75/1.94 dependent: set(knuth_bendix).
% 1.75/1.94 dependent: set(anl_eq).
% 1.75/1.94 dependent: set(para_from).
% 1.75/1.94 dependent: set(para_into).
% 1.75/1.94 dependent: clear(para_from_right).
% 1.75/1.94 dependent: clear(para_into_right).
% 1.75/1.94 dependent: set(para_from_vars).
% 1.75/1.94 dependent: set(eq_units_both_ways).
% 1.75/1.94 dependent: set(dynamic_demod_all).
% 1.75/1.94 dependent: set(dynamic_demod).
% 1.75/1.94 dependent: set(order_eq).
% 1.75/1.94 dependent: set(back_demod).
% 1.75/1.94 dependent: set(lrpo).
% 1.75/1.94 dependent: set(hyper_res).
% 1.75/1.94 dependent: set(unit_deletion).
% 1.75/1.94 dependent: set(factor).
% 1.75/1.94
% 1.75/1.94 ------------> process usable:
% 1.75/1.94 ** KEPT (pick-wt=7): 1 [] -iext(uri_owl_differentFrom,A,B)|A!=B.
% 1.75/1.94 ** KEPT (pick-wt=6): 2 [] -iext(uri_owl_propertyDisjointWith,A,B)|ip(A).
% 1.75/1.94 ** KEPT (pick-wt=6): 3 [] -iext(uri_owl_propertyDisjointWith,A,B)|ip(B).
% 1.75/1.94 ** KEPT (pick-wt=12): 4 [] -iext(uri_owl_propertyDisjointWith,A,B)| -iext(A,C,D)| -iext(B,C,D).
% 1.75/1.94 ** KEPT (pick-wt=16): 5 [] iext(uri_owl_propertyDisjointWith,A,B)| -ip(A)| -ip(B)|iext(A,$f2(A,B),$f1(A,B)).
% 1.75/1.94 ** KEPT (pick-wt=16): 6 [] iext(uri_owl_propertyDisjointWith,A,B)| -ip(A)| -ip(B)|iext(B,$f2(A,B),$f1(A,B)).
% 1.75/1.94 ** KEPT (pick-wt=4): 7 [] -iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u).
% 1.75/1.94
% 1.75/1.94 ------------> process sos:
% 1.75/1.94 ** KEPT (pick-wt=3): 13 [] A=A.
% 1.75/1.94 ** KEPT (pick-wt=7): 14 [] iext(uri_owl_differentFrom,A,B)|A=B.
% 1.75/1.94 ** KEPT (pick-wt=4): 15 [] iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type).
% 1.75/1.94 ** KEPT (pick-wt=4): 16 [] iext(uri_rdf_type,uri_ex_w,uri_ex_c).
% 1.75/1.94 ** KEPT (pick-wt=4): 17 [] iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c).
% 1.75/1.94 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] A=A.
% 1.75/1.94
% 1.75/1.94 ======= end of input processing =======
% 1.75/1.94
% 1.75/1.94 =========== start of search ===========
% 1.75/1.94
% 1.75/1.94 -------- PROOF --------
% 1.75/1.94
% 1.75/1.94 ----> UNIT CONFLICT at 0.01 sec ----> 201 [binary,200.1,7.1] $F.
% 1.75/1.94
% 1.75/1.94 Length of proof is 2. Level of proof is 2.
% 1.75/1.94
% 1.75/1.94 ---------------- PROOF ----------------
% 1.75/1.94 % SZS status Theorem
% 1.75/1.94 % SZS output start Refutation
% See solution above
% 1.75/1.94 ------------ end of proof -------------
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94 ============ end of search ============
% 1.75/1.94
% 1.75/1.94 -------------- statistics -------------
% 1.75/1.94 clauses given 22
% 1.75/1.94 clauses generated 320
% 1.75/1.94 clauses kept 200
% 1.75/1.94 clauses forward subsumed 133
% 1.75/1.94 clauses back subsumed 8
% 1.75/1.94 Kbytes malloced 976
% 1.75/1.94
% 1.75/1.94 ----------- times (seconds) -----------
% 1.75/1.94 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.75/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.94 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.75/1.94
% 1.75/1.94 That finishes the proof of the theorem.
% 1.75/1.94
% 1.75/1.94 Process 12348 finished Wed Jul 27 02:34:08 2022
% 1.75/1.94 Otter interrupted
% 1.75/1.94 PROOF FOUND
%------------------------------------------------------------------------------