TSTP Solution File: SWB030+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWB030+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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:50 EDT 2022
% Result : Unsatisfiable 1.64s 1.87s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 7 unt; 4 nHn; 12 RR)
% Number of literals : 31 ( 0 equ; 12 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 : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ iext(uri_rdf_type,A,B)
| icext(B,A) ),
file('SWB030+2.p',unknown),
[] ).
cnf(2,axiom,
( iext(uri_rdf_type,A,B)
| ~ icext(B,A) ),
file('SWB030+2.p',unknown),
[] ).
cnf(3,axiom,
( ~ iext(uri_owl_hasSelf,A,B)
| ~ iext(uri_owl_onProperty,A,C)
| ~ icext(A,D)
| iext(C,D,D) ),
file('SWB030+2.p',unknown),
[] ).
cnf(4,axiom,
( ~ iext(uri_owl_hasSelf,A,B)
| ~ iext(uri_owl_onProperty,A,C)
| icext(A,D)
| ~ iext(C,D,D) ),
file('SWB030+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ iext(uri_owl_complementOf,A,B)
| ~ icext(A,C)
| ~ icext(B,C) ),
file('SWB030+2.p',unknown),
[] ).
cnf(8,axiom,
( ~ iext(uri_owl_complementOf,A,B)
| icext(A,C)
| icext(B,C) ),
file('SWB030+2.p',unknown),
[] ).
cnf(14,axiom,
iext(uri_owl_complementOf,uri_ex_c,dollar_c1),
file('SWB030+2.p',unknown),
[] ).
cnf(16,axiom,
iext(uri_owl_onProperty,dollar_c1,uri_rdf_type),
file('SWB030+2.p',unknown),
[] ).
cnf(17,axiom,
iext(uri_owl_hasSelf,dollar_c1,literal_typed(dat_str_true,uri_xsd_boolean)),
file('SWB030+2.p',unknown),
[] ).
cnf(19,plain,
( icext(uri_ex_c,A)
| icext(dollar_c1,A) ),
inference(hyper,[status(thm)],[14,8]),
[iquote('hyper,14,8')] ).
cnf(23,plain,
( icext(dollar_c1,A)
| iext(uri_rdf_type,A,uri_ex_c) ),
inference(hyper,[status(thm)],[19,2]),
[iquote('hyper,19,2')] ).
cnf(26,plain,
( iext(uri_rdf_type,A,uri_ex_c)
| iext(uri_rdf_type,A,A) ),
inference(hyper,[status(thm)],[23,3,17,16]),
[iquote('hyper,23,3,17,16')] ).
cnf(28,plain,
iext(uri_rdf_type,uri_ex_c,uri_ex_c),
inference(factor,[status(thm)],[26]),
[iquote('factor,26.1.2')] ).
cnf(29,plain,
icext(dollar_c1,uri_ex_c),
inference(hyper,[status(thm)],[28,4,17,16]),
[iquote('hyper,28,4,17,16')] ).
cnf(30,plain,
icext(uri_ex_c,uri_ex_c),
inference(hyper,[status(thm)],[28,1]),
[iquote('hyper,28,1')] ).
cnf(32,plain,
$false,
inference(hyper,[status(thm)],[30,7,14,29]),
[iquote('hyper,30,7,14,29')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWB030+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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 01:53:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.87 ----- Otter 3.3f, August 2004 -----
% 1.64/1.87 The process was started by sandbox on n017.cluster.edu,
% 1.64/1.87 Wed Jul 27 01:53:33 2022
% 1.64/1.87 The command was "./otter". The process ID is 26980.
% 1.64/1.87
% 1.64/1.87 set(prolog_style_variables).
% 1.64/1.87 set(auto).
% 1.64/1.87 dependent: set(auto1).
% 1.64/1.87 dependent: set(process_input).
% 1.64/1.87 dependent: clear(print_kept).
% 1.64/1.87 dependent: clear(print_new_demod).
% 1.64/1.87 dependent: clear(print_back_demod).
% 1.64/1.87 dependent: clear(print_back_sub).
% 1.64/1.87 dependent: set(control_memory).
% 1.64/1.87 dependent: assign(max_mem, 12000).
% 1.64/1.87 dependent: assign(pick_given_ratio, 4).
% 1.64/1.87 dependent: assign(stats_level, 1).
% 1.64/1.87 dependent: assign(max_seconds, 10800).
% 1.64/1.87 clear(print_given).
% 1.64/1.87
% 1.64/1.87 formula_list(usable).
% 1.64/1.87 all X C (iext(uri_rdf_type,X,C)<->icext(C,X)).
% 1.64/1.87 all Z P V (iext(uri_owl_hasSelf,Z,V)&iext(uri_owl_onProperty,Z,P)-> (all X (icext(Z,X)<->iext(P,X,X)))).
% 1.64/1.87 all Z C (iext(uri_owl_complementOf,Z,C)->ic(Z)&ic(C)& (all X (icext(Z,X)<-> -icext(C,X)))).
% 1.64/1.87 exists BNODE_x (iext(uri_rdf_type,uri_ex_c,uri_owl_Class)&iext(uri_owl_complementOf,uri_ex_c,BNODE_x)&iext(uri_rdf_type,BNODE_x,uri_owl_Restriction)&iext(uri_owl_onProperty,BNODE_x,uri_rdf_type)&iext(uri_owl_hasSelf,BNODE_x,literal_typed(dat_str_true,uri_xsd_boolean))).
% 1.64/1.87 end_of_list.
% 1.64/1.87
% 1.64/1.87 -------> usable clausifies to:
% 1.64/1.87
% 1.64/1.87 list(usable).
% 1.64/1.87 0 [] -iext(uri_rdf_type,X,C)|icext(C,X).
% 1.64/1.87 0 [] iext(uri_rdf_type,X,C)| -icext(C,X).
% 1.64/1.87 0 [] -iext(uri_owl_hasSelf,Z,V)| -iext(uri_owl_onProperty,Z,P)| -icext(Z,X)|iext(P,X,X).
% 1.64/1.87 0 [] -iext(uri_owl_hasSelf,Z,V)| -iext(uri_owl_onProperty,Z,P)|icext(Z,X)| -iext(P,X,X).
% 1.64/1.87 0 [] -iext(uri_owl_complementOf,Z,C)|ic(Z).
% 1.64/1.87 0 [] -iext(uri_owl_complementOf,Z,C)|ic(C).
% 1.64/1.87 0 [] -iext(uri_owl_complementOf,Z,C)| -icext(Z,X)| -icext(C,X).
% 1.64/1.87 0 [] -iext(uri_owl_complementOf,Z,C)|icext(Z,X)|icext(C,X).
% 1.64/1.87 0 [] iext(uri_rdf_type,uri_ex_c,uri_owl_Class).
% 1.64/1.87 0 [] iext(uri_owl_complementOf,uri_ex_c,$c1).
% 1.64/1.87 0 [] iext(uri_rdf_type,$c1,uri_owl_Restriction).
% 1.64/1.87 0 [] iext(uri_owl_onProperty,$c1,uri_rdf_type).
% 1.64/1.87 0 [] iext(uri_owl_hasSelf,$c1,literal_typed(dat_str_true,uri_xsd_boolean)).
% 1.64/1.87 end_of_list.
% 1.64/1.87
% 1.64/1.87 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.64/1.87
% 1.64/1.87 This is a non-Horn set without equality. The strategy will
% 1.64/1.87 be ordered hyper_res, unit deletion, and factoring, with
% 1.64/1.87 satellites in sos and with nuclei in usable.
% 1.64/1.87
% 1.64/1.87 dependent: set(hyper_res).
% 1.64/1.87 dependent: set(factor).
% 1.64/1.87 dependent: set(unit_deletion).
% 1.64/1.87
% 1.64/1.87 ------------> process usable:
% 1.64/1.87 ** KEPT (pick-wt=7): 1 [] -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.64/1.87 ** KEPT (pick-wt=7): 2 [] iext(uri_rdf_type,A,B)| -icext(B,A).
% 1.64/1.87 ** KEPT (pick-wt=15): 3 [] -iext(uri_owl_hasSelf,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)|iext(C,D,D).
% 1.64/1.87 ** KEPT (pick-wt=15): 4 [] -iext(uri_owl_hasSelf,A,B)| -iext(uri_owl_onProperty,A,C)|icext(A,D)| -iext(C,D,D).
% 1.64/1.87 ** KEPT (pick-wt=6): 5 [] -iext(uri_owl_complementOf,A,B)|ic(A).
% 1.64/1.87 ** KEPT (pick-wt=6): 6 [] -iext(uri_owl_complementOf,A,B)|ic(B).
% 1.64/1.87 ** KEPT (pick-wt=10): 7 [] -iext(uri_owl_complementOf,A,B)| -icext(A,C)| -icext(B,C).
% 1.64/1.87 ** KEPT (pick-wt=10): 8 [] -iext(uri_owl_complementOf,A,B)|icext(A,C)|icext(B,C).
% 1.64/1.87
% 1.64/1.87 ------------> process sos:
% 1.64/1.87 ** KEPT (pick-wt=4): 13 [] iext(uri_rdf_type,uri_ex_c,uri_owl_Class).
% 1.64/1.87 ** KEPT (pick-wt=4): 14 [] iext(uri_owl_complementOf,uri_ex_c,$c1).
% 1.64/1.87 ** KEPT (pick-wt=4): 15 [] iext(uri_rdf_type,$c1,uri_owl_Restriction).
% 1.64/1.87 ** KEPT (pick-wt=4): 16 [] iext(uri_owl_onProperty,$c1,uri_rdf_type).
% 1.64/1.87 ** KEPT (pick-wt=6): 17 [] iext(uri_owl_hasSelf,$c1,literal_typed(dat_str_true,uri_xsd_boolean)).
% 1.64/1.87
% 1.64/1.87 ======= end of input processing =======
% 1.64/1.87
% 1.64/1.87 =========== start of search ===========
% 1.64/1.87
% 1.64/1.87 -------- PROOF --------
% 1.64/1.87
% 1.64/1.87 -----> EMPTY CLAUSE at 0.00 sec ----> 32 [hyper,30,7,14,29] $F.
% 1.64/1.87
% 1.64/1.87 Length of proof is 6. Level of proof is 5.
% 1.64/1.87
% 1.64/1.87 ---------------- PROOF ----------------
% 1.64/1.87 % SZS status Theorem
% 1.64/1.87 % SZS output start Refutation
% See solution above
% 1.64/1.87 ------------ end of proof -------------
% 1.64/1.87
% 1.64/1.87
% 1.64/1.87 Search stopped by max_proofs option.
% 1.64/1.87
% 1.64/1.87
% 1.64/1.87 Search stopped by max_proofs option.
% 1.64/1.87
% 1.64/1.87 ============ end of search ============
% 1.64/1.87
% 1.64/1.87 -------------- statistics -------------
% 1.64/1.87 clauses given 14
% 1.64/1.87 clauses generated 26
% 1.64/1.87 clauses kept 31
% 1.64/1.87 clauses forward subsumed 7
% 1.64/1.87 clauses back subsumed 0
% 1.64/1.87 Kbytes malloced 976
% 1.64/1.87
% 1.64/1.87 ----------- times (seconds) -----------
% 1.64/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.87 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.64/1.87
% 1.64/1.87 That finishes the proof of the theorem.
% 1.64/1.87
% 1.64/1.87 Process 26980 finished Wed Jul 27 01:53:34 2022
% 1.64/1.87 Otter interrupted
% 1.64/1.87 PROOF FOUND
%------------------------------------------------------------------------------