TSTP Solution File: SWB029+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB029+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %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 : 600s
% DateTime : Tue Jul 19 19:18:55 EDT 2022
% Result : Theorem 0.72s 1.02s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWB029+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n017.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 : 600
% 0.14/0.34 % DateTime : Wed Jun 1 04:34:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 17681 was started by sandbox2 on n017.cluster.edu,
% 0.43/0.98 Wed Jun 1 04:34:27 2022
% 0.43/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17528_n017.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_17528_n017.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (5 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99 1 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 2 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(Z) & ic(C) & (all X (icext(Z,X) <-> -icext(C,X))))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 3 (all Z all S1 all C1 all S2 all 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)))))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 4 (exists BNODE_x exists BNODE_y exists BNODE_l1 exists 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))) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials: (non-Horn, no changes).
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_owl_intersectionOf=1. uri_rdf_nil=1. uri_rdf_type=1. uri_owl_complementOf=1. uri_ex_A=1. uri_owl_Class=1. uri_ex_B=1. uri_ex_w=1. c1=1. c2=1. c3=1. c4=1. f1=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.02
% 0.72/1.02 ============================== end of clauses for search =============
% 0.72/1.02
% 0.72/1.02 ============================== SEARCH ================================
% 0.72/1.02
% 0.72/1.02 % Starting search at 0.02 seconds.
% 0.72/1.02
% 0.72/1.02 ============================== PROOF =================================
% 0.72/1.02 % SZS status Theorem
% 0.72/1.02 % SZS output start Refutation
% 0.72/1.02
% 0.72/1.02 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.72/1.02 % Length of proof is 25.
% 0.72/1.02 % Level of proof is 9.
% 0.72/1.02 % Maximum clause weight is 26.000.
% 0.72/1.02 % Given clauses 112.
% 0.72/1.02
% 0.72/1.02 1 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 2 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(Z) & ic(C) & (all X (icext(Z,X) <-> -icext(C,X))))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 3 (all Z all S1 all C1 all S2 all 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)))))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 4 (exists BNODE_x exists BNODE_y exists BNODE_l1 exists 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))) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 7 iext(uri_rdf_type,uri_ex_w,c1) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom). [clausify(4)].
% 0.72/1.02 8 iext(uri_owl_intersectionOf,c1,c3) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom). [clausify(4)].
% 0.72/1.02 9 iext(uri_rdf_first,c3,uri_ex_A) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom). [clausify(4)].
% 0.72/1.02 10 iext(uri_rdf_rest,c3,c4) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom). [clausify(4)].
% 0.72/1.02 11 iext(uri_rdf_first,c4,c2) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom). [clausify(4)].
% 0.72/1.02 12 iext(uri_rdf_rest,c4,uri_rdf_nil) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom). [clausify(4)].
% 0.72/1.02 13 iext(uri_owl_complementOf,c2,uri_ex_A) # label(testcase_premise_fullish_029_Ex_Falso_Quodlibet) # label(axiom). [clausify(4)].
% 0.72/1.02 15 -iext(uri_owl_complementOf,A,B) | -icext(A,C) | -icext(B,C) # label(owl_bool_complementof_class) # label(axiom). [clausify(2)].
% 0.72/1.02 18 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 0.72/1.02 24 -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) # label(owl_bool_intersectionof_class_002) # label(axiom). [clausify(3)].
% 0.72/1.02 25 -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) # label(owl_bool_intersectionof_class_002) # label(axiom). [clausify(3)].
% 0.72/1.02 70 -icext(c2,A) | -icext(uri_ex_A,A). [resolve(15,a,13,a)].
% 0.72/1.02 73 icext(c1,uri_ex_w). [resolve(18,a,7,a)].
% 0.72/1.02 101 -iext(uri_rdf_first,c3,A) | -iext(uri_rdf_first,c4,B) | -iext(uri_owl_intersectionOf,C,c3) | -icext(C,D) | icext(A,D). [resolve(24,b,10,a),unit_del(c,12)].
% 0.72/1.02 256 -iext(uri_rdf_first,c4,A) | -iext(uri_owl_intersectionOf,B,c3) | -icext(B,C) | icext(uri_ex_A,C). [resolve(101,a,9,a)].
% 0.72/1.02 259 -iext(uri_owl_intersectionOf,A,c3) | -icext(A,B) | icext(uri_ex_A,B). [resolve(256,a,11,a)].
% 0.72/1.02 261 -icext(c1,A) | icext(uri_ex_A,A). [resolve(259,a,8,a)].
% 0.72/1.02 262 icext(uri_ex_A,uri_ex_w). [resolve(261,a,73,a)].
% 0.72/1.02 264 -icext(c2,uri_ex_w). [ur(70,b,262,a)].
% 0.72/1.02 271 -iext(uri_rdf_first,c3,A). [ur(25,b,10,a,c,11,a,d,12,a,e,8,a,f,73,a,g,264,a)].
% 0.72/1.02 272 $F. [resolve(271,a,9,a)].
% 0.72/1.02
% 0.72/1.02 % SZS output end Refutation
% 0.72/1.02 ============================== end of proof ==========================
% 0.72/1.02
% 0.72/1.02 ============================== STATISTICS ============================
% 0.72/1.02
% 0.72/1.02 Given=112. Generated=588. Kept=267. proofs=1.
% 0.72/1.02 Usable=102. Sos=120. Demods=0. Limbo=2, Disabled=67. Hints=0.
% 0.72/1.02 Megabytes=0.35.
% 0.72/1.02 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.72/1.02
% 0.72/1.02 ============================== end of statistics =====================
% 0.72/1.02
% 0.72/1.02 ============================== end of search =========================
% 0.72/1.02
% 0.72/1.02 THEOREM PROVED
% 0.72/1.02 % SZS status Theorem
% 0.72/1.02
% 0.72/1.02 Exiting with 1 proof.
% 0.72/1.02
% 0.72/1.02 Process 17681 exit (max_proofs) Wed Jun 1 04:34:27 2022
% 0.72/1.02 Prover9 interrupted
%------------------------------------------------------------------------------