TSTP Solution File: SWB031+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWB031+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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.57s 1.77s
% Output : Refutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 12 unt; 0 nHn; 10 RR)
% Number of literals : 27 ( 2 equ; 13 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 19 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( icext(uri_owl_Thing,A)
| ~ ir(A) ),
file('SWB031+2.p',unknown),
[] ).
cnf(3,axiom,
~ icext(uri_owl_Nothing,A),
file('SWB031+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ iext(uri_rdf_first,A,B)
| ~ iext(uri_rdf_rest,A,uri_rdf_nil)
| ~ iext(uri_owl_oneOf,C,A)
| ~ icext(C,D)
| D = B ),
file('SWB031+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ iext(uri_owl_e_quivalentClass,A,B)
| ~ icext(A,C)
| icext(B,C) ),
file('SWB031+2.p',unknown),
[] ).
cnf(18,axiom,
ir(A),
file('SWB031+2.p',unknown),
[] ).
cnf(19,axiom,
iext(uri_owl_e_quivalentClass,uri_owl_Thing,dollar_c2),
file('SWB031+2.p',unknown),
[] ).
cnf(20,axiom,
iext(uri_owl_oneOf,dollar_c2,dollar_c1),
file('SWB031+2.p',unknown),
[] ).
cnf(21,axiom,
iext(uri_rdf_first,dollar_c1,uri_ex_w),
file('SWB031+2.p',unknown),
[] ).
cnf(22,axiom,
iext(uri_rdf_rest,dollar_c1,uri_rdf_nil),
file('SWB031+2.p',unknown),
[] ).
cnf(23,plain,
icext(uri_owl_Thing,A),
inference(hyper,[status(thm)],[18,2]),
[iquote('hyper,18,2')] ).
cnf(24,plain,
( icext(A,B)
| ~ iext(uri_rdf_first,C,A)
| ~ iext(uri_rdf_rest,C,uri_rdf_nil)
| ~ iext(uri_owl_oneOf,D,C)
| ~ icext(D,uri_owl_Thing) ),
inference(para_into,[status(thm),theory(equality)],[23,5]),
[iquote('para_into,23.1.1,5.5.1')] ).
cnf(25,plain,
icext(dollar_c2,A),
inference(hyper,[status(thm)],[19,11,23]),
[iquote('hyper,19,11,23')] ).
cnf(43,plain,
A = uri_ex_w,
inference(hyper,[status(thm)],[22,5,21,20,25]),
[iquote('hyper,22,5,21,20,25')] ).
cnf(48,plain,
icext(uri_ex_w,A),
inference(hyper,[status(thm)],[24,21,22,20,25]),
[iquote('hyper,24,21,22,20,25')] ).
cnf(130,plain,
~ icext(uri_ex_w,A),
inference(para_from,[status(thm),theory(equality)],[43,3]),
[iquote('para_from,43.1.1,3.1.1')] ).
cnf(131,plain,
$false,
inference(binary,[status(thm)],[130,48]),
[iquote('binary,130.1,48.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWB031+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:28:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.57/1.77 ----- Otter 3.3f, August 2004 -----
% 1.57/1.77 The process was started by sandbox2 on n012.cluster.edu,
% 1.57/1.77 Wed Jul 27 02:28:20 2022
% 1.57/1.77 The command was "./otter". The process ID is 15733.
% 1.57/1.77
% 1.57/1.77 set(prolog_style_variables).
% 1.57/1.77 set(auto).
% 1.57/1.77 dependent: set(auto1).
% 1.57/1.77 dependent: set(process_input).
% 1.57/1.77 dependent: clear(print_kept).
% 1.57/1.77 dependent: clear(print_new_demod).
% 1.57/1.77 dependent: clear(print_back_demod).
% 1.57/1.77 dependent: clear(print_back_sub).
% 1.57/1.77 dependent: set(control_memory).
% 1.57/1.77 dependent: assign(max_mem, 12000).
% 1.57/1.77 dependent: assign(pick_given_ratio, 4).
% 1.57/1.77 dependent: assign(stats_level, 1).
% 1.57/1.77 dependent: assign(max_seconds, 10800).
% 1.57/1.77 clear(print_given).
% 1.57/1.77
% 1.57/1.77 formula_list(usable).
% 1.57/1.77 all A (A=A).
% 1.57/1.77 all X ir(X).
% 1.57/1.77 all X (icext(uri_owl_Thing,X)<->ir(X)).
% 1.57/1.77 all X (-icext(uri_owl_Nothing,X)).
% 1.57/1.77 all Z S1 A1 (iext(uri_rdf_first,S1,A1)&iext(uri_rdf_rest,S1,uri_rdf_nil)-> (iext(uri_owl_oneOf,Z,S1)<->ic(Z)& (all X (icext(Z,X)<->X=A1)))).
% 1.57/1.77 all C1 C2 (iext(uri_owl_e_quivalentClass,C1,C2)<->ic(C1)&ic(C2)& (all X (icext(C1,X)<->icext(C2,X)))).
% 1.57/1.77 exists BNODE_x BNODE_l (iext(uri_owl_e_quivalentClass,uri_owl_Thing,BNODE_x)&iext(uri_owl_oneOf,BNODE_x,BNODE_l)&iext(uri_rdf_first,BNODE_l,uri_ex_w)&iext(uri_rdf_rest,BNODE_l,uri_rdf_nil)).
% 1.57/1.77 end_of_list.
% 1.57/1.77
% 1.57/1.77 -------> usable clausifies to:
% 1.57/1.77
% 1.57/1.77 list(usable).
% 1.57/1.77 0 [] A=A.
% 1.57/1.77 0 [] ir(X).
% 1.57/1.77 0 [] -icext(uri_owl_Thing,X)|ir(X).
% 1.57/1.77 0 [] icext(uri_owl_Thing,X)| -ir(X).
% 1.57/1.77 0 [] -icext(uri_owl_Nothing,X).
% 1.57/1.77 0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)| -iext(uri_owl_oneOf,Z,S1)|ic(Z).
% 1.57/1.77 0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)| -iext(uri_owl_oneOf,Z,S1)| -icext(Z,X)|X=A1.
% 1.57/1.77 0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)| -iext(uri_owl_oneOf,Z,S1)|icext(Z,X)|X!=A1.
% 1.57/1.77 0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)|iext(uri_owl_oneOf,Z,S1)| -ic(Z)|icext(Z,$f1(Z,S1,A1))|$f1(Z,S1,A1)=A1.
% 1.57/1.77 0 [] -iext(uri_rdf_first,S1,A1)| -iext(uri_rdf_rest,S1,uri_rdf_nil)|iext(uri_owl_oneOf,Z,S1)| -ic(Z)| -icext(Z,$f1(Z,S1,A1))|$f1(Z,S1,A1)!=A1.
% 1.57/1.77 0 [] -iext(uri_owl_e_quivalentClass,C1,C2)|ic(C1).
% 1.57/1.77 0 [] -iext(uri_owl_e_quivalentClass,C1,C2)|ic(C2).
% 1.57/1.77 0 [] -iext(uri_owl_e_quivalentClass,C1,C2)| -icext(C1,X)|icext(C2,X).
% 1.57/1.77 0 [] -iext(uri_owl_e_quivalentClass,C1,C2)|icext(C1,X)| -icext(C2,X).
% 1.57/1.77 0 [] iext(uri_owl_e_quivalentClass,C1,C2)| -ic(C1)| -ic(C2)|icext(C1,$f2(C1,C2))|icext(C2,$f2(C1,C2)).
% 1.57/1.77 0 [] iext(uri_owl_e_quivalentClass,C1,C2)| -ic(C1)| -ic(C2)| -icext(C1,$f2(C1,C2))| -icext(C2,$f2(C1,C2)).
% 1.57/1.77 0 [] iext(uri_owl_e_quivalentClass,uri_owl_Thing,$c2).
% 1.57/1.77 0 [] iext(uri_owl_oneOf,$c2,$c1).
% 1.57/1.77 0 [] iext(uri_rdf_first,$c1,uri_ex_w).
% 1.57/1.77 0 [] iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.57/1.77 end_of_list.
% 1.57/1.77
% 1.57/1.77 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.57/1.77
% 1.57/1.77 This ia a non-Horn set with equality. The strategy will be
% 1.57/1.77 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.57/1.77 deletion, with positive clauses in sos and nonpositive
% 1.57/1.77 clauses in usable.
% 1.57/1.77
% 1.57/1.77 dependent: set(knuth_bendix).
% 1.57/1.77 dependent: set(anl_eq).
% 1.57/1.77 dependent: set(para_from).
% 1.57/1.77 dependent: set(para_into).
% 1.57/1.77 dependent: clear(para_from_right).
% 1.57/1.77 dependent: clear(para_into_right).
% 1.57/1.77 dependent: set(para_from_vars).
% 1.57/1.77 dependent: set(eq_units_both_ways).
% 1.57/1.77 dependent: set(dynamic_demod_all).
% 1.57/1.77 dependent: set(dynamic_demod).
% 1.57/1.77 dependent: set(order_eq).
% 1.57/1.77 dependent: set(back_demod).
% 1.57/1.77 dependent: set(lrpo).
% 1.57/1.77 dependent: set(hyper_res).
% 1.57/1.77 dependent: set(unit_deletion).
% 1.57/1.77 dependent: set(factor).
% 1.57/1.77
% 1.57/1.77 ------------> process usable:
% 1.57/1.77 ** KEPT (pick-wt=5): 1 [] -icext(uri_owl_Thing,A)|ir(A).
% 1.57/1.77 ** KEPT (pick-wt=5): 2 [] icext(uri_owl_Thing,A)| -ir(A).
% 1.57/1.77 ** KEPT (pick-wt=3): 3 [] -icext(uri_owl_Nothing,A).
% 1.57/1.77 ** KEPT (pick-wt=14): 4 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)| -iext(uri_owl_oneOf,C,A)|ic(C).
% 1.57/1.77 ** KEPT (pick-wt=18): 5 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)| -iext(uri_owl_oneOf,C,A)| -icext(C,D)|D=B.
% 1.57/1.77 ** KEPT (pick-wt=18): 6 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)| -iext(uri_owl_oneOf,C,A)|icext(C,D)|D!=B.
% 1.57/1.77 ** KEPT (pick-wt=26): 7 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)|iext(uri_owl_oneOf,C,A)| -ic(C)|icext(C,$f1(C,A,B))|$f1(C,A,B)=B.
% 1.57/1.77 ** KEPT (pick-wt=26): 8 [] -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)|iext(uri_owl_oneOf,C,A)| -ic(C)| -icext(C,$f1(C,A,B))|$f1(C,A,B)!=B.
% 1.57/1.77 ** KEPT (pick-wt=6): 9 [] -iext(uri_owl_e_quivalentClass,A,B)|ic(A).
% 1.57/1.77 ** KEPT (pick-wt=6): 10 [] -iext(uri_owl_e_quivalentClass,A,B)|ic(B).
% 1.57/1.77 ** KEPT (pick-wt=10): 11 [] -iext(uri_owl_e_quivalentClass,A,B)| -icext(A,C)|icext(B,C).
% 1.57/1.77 ** KEPT (pick-wt=10): 12 [] -iext(uri_owl_e_quivalentClass,A,B)|icext(A,C)| -icext(B,C).
% 1.57/1.77 ** KEPT (pick-wt=18): 13 [] iext(uri_owl_e_quivalentClass,A,B)| -ic(A)| -ic(B)|icext(A,$f2(A,B))|icext(B,$f2(A,B)).
% 1.57/1.77 ** KEPT (pick-wt=18): 14 [] iext(uri_owl_e_quivalentClass,A,B)| -ic(A)| -ic(B)| -icext(A,$f2(A,B))| -icext(B,$f2(A,B)).
% 1.57/1.77
% 1.57/1.77 ------------> process sos:
% 1.57/1.77 ** KEPT (pick-wt=3): 17 [] A=A.
% 1.57/1.77 ** KEPT (pick-wt=2): 18 [] ir(A).
% 1.57/1.77 ** KEPT (pick-wt=4): 19 [] iext(uri_owl_e_quivalentClass,uri_owl_Thing,$c2).
% 1.57/1.77 ** KEPT (pick-wt=4): 20 [] iext(uri_owl_oneOf,$c2,$c1).
% 1.57/1.77 ** KEPT (pick-wt=4): 21 [] iext(uri_rdf_first,$c1,uri_ex_w).
% 1.57/1.77 ** KEPT (pick-wt=4): 22 [] iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.57/1.77 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A.
% 1.57/1.77 18 back subsumes 1.
% 1.57/1.77
% 1.57/1.77 ======= end of input processing =======
% 1.57/1.77
% 1.57/1.77 =========== start of search ===========
% 1.57/1.77
% 1.57/1.77 -------- PROOF --------
% 1.57/1.77
% 1.57/1.77 ----> UNIT CONFLICT at 0.01 sec ----> 131 [binary,130.1,48.1] $F.
% 1.57/1.77
% 1.57/1.77 Length of proof is 6. Level of proof is 4.
% 1.57/1.77
% 1.57/1.77 ---------------- PROOF ----------------
% 1.57/1.77 % SZS status Theorem
% 1.57/1.77 % SZS output start Refutation
% See solution above
% 1.57/1.77 ------------ end of proof -------------
% 1.57/1.77
% 1.57/1.77
% 1.57/1.77 Search stopped by max_proofs option.
% 1.57/1.77
% 1.57/1.77
% 1.57/1.77 Search stopped by max_proofs option.
% 1.57/1.77
% 1.57/1.77 ============ end of search ============
% 1.57/1.77
% 1.57/1.77 -------------- statistics -------------
% 1.57/1.77 clauses given 12
% 1.57/1.77 clauses generated 179
% 1.57/1.77 clauses kept 130
% 1.57/1.77 clauses forward subsumed 72
% 1.57/1.77 clauses back subsumed 2
% 1.57/1.77 Kbytes malloced 976
% 1.57/1.77
% 1.57/1.77 ----------- times (seconds) -----------
% 1.57/1.77 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.57/1.77 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.57/1.77 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.57/1.77
% 1.57/1.77 That finishes the proof of the theorem.
% 1.57/1.77
% 1.57/1.77 Process 15733 finished Wed Jul 27 02:28:22 2022
% 1.57/1.77 Otter interrupted
% 1.57/1.77 PROOF FOUND
%------------------------------------------------------------------------------