TSTP Solution File: SWB029+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWB029+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:50 EDT 2022
% Result : Theorem 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of clauses : 15 ( 11 unt; 0 nHn; 15 RR)
% Number of literals : 30 ( 0 equ; 16 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 17 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ iext(uri_rdf_type,A,B)
| icext(B,A) ),
file('SWB029+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ iext(uri_owl_complementOf,A,B)
| ~ icext(A,C)
| ~ icext(B,C) ),
file('SWB029+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ iext(uri_rdf_first,A,B)
| ~ iext(uri_rdf_rest,A,C)
| ~ iext(uri_rdf_first,C,D)
| ~ iext(uri_rdf_rest,C,uri_rdf_nil)
| ~ iext(uri_owl_intersectionOf,E,A)
| ~ icext(E,F)
| icext(B,F) ),
file('SWB029+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ iext(uri_rdf_first,A,B)
| ~ iext(uri_rdf_rest,A,C)
| ~ iext(uri_rdf_first,C,D)
| ~ iext(uri_rdf_rest,C,uri_rdf_nil)
| ~ iext(uri_owl_intersectionOf,E,A)
| ~ icext(E,F)
| icext(D,F) ),
file('SWB029+2.p',unknown),
[] ).
cnf(54,axiom,
iext(uri_rdf_type,uri_ex_w,dollar_c4),
file('SWB029+2.p',unknown),
[] ).
cnf(55,axiom,
iext(uri_owl_intersectionOf,dollar_c4,dollar_c2),
file('SWB029+2.p',unknown),
[] ).
cnf(56,axiom,
iext(uri_rdf_first,dollar_c2,uri_ex_A),
file('SWB029+2.p',unknown),
[] ).
cnf(57,axiom,
iext(uri_rdf_rest,dollar_c2,dollar_c1),
file('SWB029+2.p',unknown),
[] ).
cnf(58,axiom,
iext(uri_rdf_first,dollar_c1,dollar_c3),
file('SWB029+2.p',unknown),
[] ).
cnf(59,axiom,
iext(uri_rdf_rest,dollar_c1,uri_rdf_nil),
file('SWB029+2.p',unknown),
[] ).
cnf(60,axiom,
iext(uri_owl_complementOf,dollar_c3,uri_ex_A),
file('SWB029+2.p',unknown),
[] ).
cnf(63,plain,
icext(dollar_c4,uri_ex_w),
inference(hyper,[status(thm)],[54,1]),
[iquote('hyper,54,1')] ).
cnf(64,plain,
icext(dollar_c3,uri_ex_w),
inference(hyper,[status(thm)],[59,11,56,57,58,55,63]),
[iquote('hyper,59,11,56,57,58,55,63')] ).
cnf(65,plain,
icext(uri_ex_A,uri_ex_w),
inference(hyper,[status(thm)],[59,10,56,57,58,55,63]),
[iquote('hyper,59,10,56,57,58,55,63')] ).
cnf(73,plain,
$false,
inference(hyper,[status(thm)],[65,5,60,64]),
[iquote('hyper,65,5,60,64')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWB029+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 02:25:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox on n021.cluster.edu,
% 1.69/1.90 Wed Jul 27 02:25:53 2022
% 1.69/1.90 The command was "./otter". The process ID is 6451.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 formula_list(usable).
% 1.69/1.90 all X C (iext(uri_rdf_type,X,C)<->icext(C,X)).
% 1.69/1.90 all Z C (iext(uri_owl_complementOf,Z,C)->ic(Z)&ic(C)& (all X (icext(Z,X)<-> -icext(C,X)))).
% 1.69/1.90 all Z S1 C1 S2 C2 (iext(uri_rdf_first,S1,C1)&iext(uri_rdf_rest,S1,S2)&iext(uri_rdf_first,S2,C2)&iext(uri_rdf_rest,S2,uri_rdf_nil)-> (iext(uri_owl_intersectionOf,Z,S1)<->ic(Z)&ic(C1)&ic(C2)& (all X (icext(Z,X)<->icext(C1,X)&icext(C2,X))))).
% 1.69/1.90 -iext(uri_rdf_type,uri_ex_w,uri_ex_B).
% 1.69/1.90 exists BNODE_x BNODE_y BNODE_l1 BNODE_l2 (iext(uri_rdf_type,uri_ex_A,uri_owl_Class)&iext(uri_rdf_type,uri_ex_B,uri_owl_Class)&iext(uri_rdf_type,uri_ex_w,BNODE_x)&iext(uri_owl_intersectionOf,BNODE_x,BNODE_l1)&iext(uri_rdf_first,BNODE_l1,uri_ex_A)&iext(uri_rdf_rest,BNODE_l1,BNODE_l2)&iext(uri_rdf_first,BNODE_l2,BNODE_y)&iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil)&iext(uri_owl_complementOf,BNODE_y,uri_ex_A)).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 -------> usable clausifies to:
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] -iext(uri_rdf_type,X,C)|icext(C,X).
% 1.69/1.90 0 [] iext(uri_rdf_type,X,C)| -icext(C,X).
% 1.69/1.90 0 [] -iext(uri_owl_complementOf,Z,C)|ic(Z).
% 1.69/1.90 0 [] -iext(uri_owl_complementOf,Z,C)|ic(C).
% 1.69/1.90 0 [] -iext(uri_owl_complementOf,Z,C)| -icext(Z,X)| -icext(C,X).
% 1.69/1.90 0 [] -iext(uri_owl_complementOf,Z,C)|icext(Z,X)|icext(C,X).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)| -iext(uri_owl_intersectionOf,Z,S1)|ic(Z).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)| -iext(uri_owl_intersectionOf,Z,S1)|ic(C1).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)| -iext(uri_owl_intersectionOf,Z,S1)|ic(C2).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)| -iext(uri_owl_intersectionOf,Z,S1)| -icext(Z,X)|icext(C1,X).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)| -iext(uri_owl_intersectionOf,Z,S1)| -icext(Z,X)|icext(C2,X).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)| -iext(uri_owl_intersectionOf,Z,S1)|icext(Z,X)| -icext(C1,X)| -icext(C2,X).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)|iext(uri_owl_intersectionOf,Z,S1)| -ic(Z)| -ic(C1)| -ic(C2)|icext(Z,$f1(Z,S1,C1,S2,C2))|icext(C1,$f1(Z,S1,C1,S2,C2)).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)|iext(uri_owl_intersectionOf,Z,S1)| -ic(Z)| -ic(C1)| -ic(C2)|icext(Z,$f1(Z,S1,C1,S2,C2))|icext(C2,$f1(Z,S1,C1,S2,C2)).
% 1.69/1.90 0 [] -iext(uri_rdf_first,S1,C1)| -iext(uri_rdf_rest,S1,S2)| -iext(uri_rdf_first,S2,C2)| -iext(uri_rdf_rest,S2,uri_rdf_nil)|iext(uri_owl_intersectionOf,Z,S1)| -ic(Z)| -ic(C1)| -ic(C2)| -icext(Z,$f1(Z,S1,C1,S2,C2))| -icext(C1,$f1(Z,S1,C1,S2,C2))| -icext(C2,$f1(Z,S1,C1,S2,C2)).
% 1.69/1.90 0 [] -iext(uri_rdf_type,uri_ex_w,uri_ex_B).
% 1.69/1.90 0 [] iext(uri_rdf_type,uri_ex_A,uri_owl_Class).
% 1.69/1.90 0 [] iext(uri_rdf_type,uri_ex_B,uri_owl_Class).
% 1.69/1.90 0 [] iext(uri_rdf_type,uri_ex_w,$c4).
% 1.69/1.90 0 [] iext(uri_owl_intersectionOf,$c4,$c2).
% 1.69/1.90 0 [] iext(uri_rdf_first,$c2,uri_ex_A).
% 1.69/1.90 0 [] iext(uri_rdf_rest,$c2,$c1).
% 1.69/1.90 0 [] iext(uri_rdf_first,$c1,$c3).
% 1.69/1.90 0 [] iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.69/1.90 0 [] iext(uri_owl_complementOf,$c3,uri_ex_A).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=11.
% 1.69/1.90
% 1.69/1.90 This is a non-Horn set without equality. The strategy will
% 1.69/1.90 be ordered hyper_res, unit deletion, and factoring, with
% 1.69/1.90 satellites in sos and with nuclei in usable.
% 1.69/1.90
% 1.69/1.90 dependent: set(hyper_res).
% 1.69/1.90 dependent: set(factor).
% 1.69/1.90 dependent: set(unit_deletion).
% 1.69/1.90
% 1.69/1.90 ------------> process usable:
% 1.69/1.90 ** KEPT (pick-wt=7): 1 [] -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.69/1.90 ** KEPT (pick-wt=7): 2 [] iext(uri_rdf_type,A,B)| -icext(B,A).
% 1.69/1.90 ** KEPT (pick-wt=6): 3 [] -iext(uri_owl_complementOf,A,B)|ic(A).
% 1.69/1.90 ** KEPT (pick-wt=6): 4 [] -iext(uri_owl_complementOf,A,B)|ic(B).
% 1.69/1.90 ** KEPT (pick-wt=10): 5 [] -iext(uri_owl_complementOf,A,B)| -icext(A,C)| -icext(B,C).
% 1.69/1.90 ** KEPT (pick-wt=10): 6 [] -iext(uri_owl_complementOf,A,B)|icext(A,C)|icext(B,C).
% 1.69/1.90 ** KEPT (pick-wt=22): 7 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)|ic(E).
% 1.69/1.90 ** KEPT (pick-wt=22): 8 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)|ic(B).
% 1.69/1.90 ** KEPT (pick-wt=22): 9 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)|ic(D).
% 1.69/1.90 ** KEPT (pick-wt=26): 10 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)| -icext(E,F)|icext(B,F).
% 1.69/1.90 ** KEPT (pick-wt=26): 11 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)| -icext(E,F)|icext(D,F).
% 1.69/1.90 ** KEPT (pick-wt=29): 12 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)|icext(E,F)| -icext(B,F)| -icext(D,F).
% 1.69/1.90 ** KEPT (pick-wt=42): 13 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)|iext(uri_owl_intersectionOf,E,A)| -ic(E)| -ic(B)| -ic(D)|icext(E,$f1(E,A,B,C,D))|icext(B,$f1(E,A,B,C,D)).
% 1.69/1.90 ** KEPT (pick-wt=42): 14 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)|iext(uri_owl_intersectionOf,E,A)| -ic(E)| -ic(B)| -ic(D)|icext(E,$f1(E,A,B,C,D))|icext(D,$f1(E,A,B,C,D)).
% 1.69/1.90 ** KEPT (pick-wt=50): 15 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)|iext(uri_owl_intersectionOf,E,A)| -ic(E)| -ic(B)| -ic(D)| -icext(E,$f1(E,A,B,C,D))| -icext(B,$f1(E,A,B,C,D))| -icext(D,$f1(E,A,B,C,D)).
% 1.69/1.90 ** KEPT (pick-wt=4): 16 [] -iext(uri_rdf_type,uri_ex_w,uri_ex_B).
% 1.69/1.90 34 back subsumes 31.
% 1.69/1.90
% 1.69/1.90 ------------> process sos:
% 1.69/1.90 ** KEPT (pick-wt=4): 52 [] iext(uri_rdf_type,uri_ex_A,uri_owl_Class).
% 1.69/1.90 ** KEPT (pick-wt=4): 53 [] iext(uri_rdf_type,uri_ex_B,uri_owl_Class).
% 1.69/1.90 ** KEPT (pick-wt=4): 54 [] iext(uri_rdf_type,uri_ex_w,$c4).
% 1.69/1.90 ** KEPT (pick-wt=4): 55 [] iext(uri_owl_intersectionOf,$c4,$c2).
% 1.69/1.90 ** KEPT (pick-wt=4): 56 [] iext(uri_rdf_first,$c2,uri_ex_A).
% 1.69/1.90 ** KEPT (pick-wt=4): 57 [] iext(uri_rdf_rest,$c2,$c1).
% 1.69/1.90 ** KEPT (pick-wt=4): 58 [] iext(uri_rdf_first,$c1,$c3).
% 1.69/1.90 ** KEPT (pick-wt=4): 59 [] iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.69/1.90 ** KEPT (pick-wt=4): 60 [] iext(uri_owl_complementOf,$c3,uri_ex_A).
% 1.69/1.90
% 1.69/1.90 ======= end of input processing =======
% 1.69/1.90
% 1.69/1.90 =========== start of search ===========
% 1.69/1.90
% 1.69/1.90 -------- PROOF --------
% 1.69/1.90
% 1.69/1.90 -----> EMPTY CLAUSE at 0.01 sec ----> 73 [hyper,65,5,60,64] $F.
% 1.69/1.90
% 1.69/1.90 Length of proof is 3. Level of proof is 2.
% 1.69/1.90
% 1.69/1.90 ---------------- PROOF ----------------
% 1.69/1.90 % SZS status Theorem
% 1.69/1.90 % SZS output start Refutation
% See solution above
% 1.69/1.90 ------------ end of proof -------------
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90 ============ end of search ============
% 1.69/1.90
% 1.69/1.90 -------------- statistics -------------
% 1.69/1.90 clauses given 17
% 1.69/1.90 clauses generated 137
% 1.69/1.90 clauses kept 72
% 1.69/1.90 clauses forward subsumed 89
% 1.69/1.90 clauses back subsumed 1
% 1.69/1.90 Kbytes malloced 976
% 1.69/1.90
% 1.69/1.90 ----------- times (seconds) -----------
% 1.69/1.90 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.69/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.69/1.90
% 1.69/1.90 That finishes the proof of the theorem.
% 1.69/1.90
% 1.69/1.90 Process 6451 finished Wed Jul 27 02:25:54 2022
% 1.69/1.90 Otter interrupted
% 1.69/1.90 PROOF FOUND
%------------------------------------------------------------------------------