TSTP Solution File: SWB016+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB016+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %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 : 600s
% DateTime : Tue Jul 19 19:18:50 EDT 2022
% Result : Theorem 0.43s 1.01s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWB016+2 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.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 : 600
% 0.13/0.34 % DateTime : Wed Jun 1 03:27:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 739 was started by sandbox on n021.cluster.edu,
% 0.43/1.00 Wed Jun 1 03:27:01 2022
% 0.43/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_557_n021.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_557_n021.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (11 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00 1 (all P (iext(uri_rdf_type,P,uri_rdf_Property) <-> ip(P))) # label(rdf_type_ip) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 2 (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/1.00 3 (all P all C all X all Y (iext(uri_rdfs_domain,P,C) & iext(P,X,Y) -> icext(C,X))) # label(rdfs_domain_main) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 4 (all X all Y (iext(uri_owl_equivalentClass,X,Y) -> ic(X) & ic(Y))) # label(owl_prop_equivalentclass_ext) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 5 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) -> icext(C2,X))))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 6 (all P1 all P2 (iext(uri_rdfs_subPropertyOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) -> iext(P2,X,Y))))) # label(owl_rdfsext_subpropertyof) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 7 (all C1 all C2 (iext(uri_owl_equivalentClass,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) <-> icext(C2,X))))) # label(owl_eqdis_equivalentclass) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00
% 0.43/1.00 ============================== end of process non-clausal formulas ===
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.00
% 0.43/1.00 ============================== PREDICATE ELIMINATION =================
% 0.43/1.00
% 0.43/1.00 ============================== end predicate elimination =============
% 0.43/1.00
% 0.43/1.00 Auto_denials: (non-Horn, no changes).
% 0.43/1.00
% 0.43/1.00 Term ordering decisions:
% 0.43/1.00 Function symbol KB weights: uri_owl_equivalentClass=1. uri_rdfs_subClassOf=1. uri_rdfs_subPropertyOf=1. uri_rdf_type=1. uri_rdfs_domain=1. uri_rdf_Property=1. uri_rdfs_Class=1. f1=1. f2=1. f3=1. f4=1.
% 0.43/1.00
% 0.43/1.00 ============================== end of process initial clauses ========
% 0.43/1.00
% 0.43/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.00
% 0.43/1.00 ============================== end of clauses for search =============
% 0.43/1.00
% 0.43/1.00 ============================== SEARCH ================================
% 0.43/1.01
% 0.43/1.01 % Starting search at 0.01 seconds.
% 0.43/1.01
% 0.43/1.01 ============================== PROOF =================================
% 0.43/1.01 % SZS status Theorem
% 0.43/1.01 % SZS output start Refutation
% 0.43/1.01
% 0.43/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.01 % Length of proof is 33.
% 0.43/1.01 % Level of proof is 10.
% 0.43/1.01 % Maximum clause weight is 16.000.
% 0.43/1.01 % Given clauses 67.
% 0.43/1.01
% 0.43/1.01 1 (all P (iext(uri_rdf_type,P,uri_rdf_Property) <-> ip(P))) # label(rdf_type_ip) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 2 (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/1.01 3 (all P all C all X all Y (iext(uri_rdfs_domain,P,C) & iext(P,X,Y) -> icext(C,X))) # label(rdfs_domain_main) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 4 (all X all Y (iext(uri_owl_equivalentClass,X,Y) -> ic(X) & ic(Y))) # label(owl_prop_equivalentclass_ext) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 5 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) -> icext(C2,X))))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 6 (all P1 all P2 (iext(uri_rdfs_subPropertyOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) -> iext(P2,X,Y))))) # label(owl_rdfsext_subpropertyof) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 7 (all C1 all C2 (iext(uri_owl_equivalentClass,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) <-> icext(C2,X))))) # label(owl_eqdis_equivalentclass) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 8 ip(uri_owl_equivalentClass) # label(owl_prop_equivalentclass_type) # label(axiom). [assumption].
% 0.43/1.01 9 iext(uri_rdfs_domain,uri_rdfs_domain,uri_rdf_Property) # label(rdfs_domain_domain) # label(axiom). [assumption].
% 0.43/1.01 10 iext(uri_rdfs_domain,uri_rdfs_subClassOf,uri_rdfs_Class) # label(rdfs_subclassof_domain) # label(axiom). [assumption].
% 0.43/1.01 11 -iext(uri_rdfs_subPropertyOf,uri_owl_equivalentClass,uri_rdfs_subClassOf) # label(testcase_conclusion_fullish_016_Reflective_Tautologies_II) # label(negated_conjecture). [assumption].
% 0.43/1.01 12 -iext(uri_rdf_type,A,uri_rdf_Property) | ip(A) # label(rdf_type_ip) # label(axiom). [clausify(1)].
% 0.43/1.01 14 -iext(uri_owl_equivalentClass,A,B) | ic(A) # label(owl_prop_equivalentclass_ext) # label(axiom). [clausify(4)].
% 0.43/1.01 15 -iext(uri_owl_equivalentClass,A,B) | ic(B) # label(owl_prop_equivalentclass_ext) # label(axiom). [clausify(4)].
% 0.43/1.01 21 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(2)].
% 0.43/1.01 23 -iext(uri_owl_equivalentClass,A,B) | -icext(A,C) | icext(B,C) # label(owl_eqdis_equivalentclass) # label(axiom). [clausify(7)].
% 0.43/1.01 25 -iext(uri_rdfs_domain,A,B) | -iext(A,C,D) | icext(B,C) # label(rdfs_domain_main) # label(axiom). [clausify(3)].
% 0.43/1.01 27 iext(uri_rdfs_subClassOf,A,B) | -ic(A) | -ic(B) | icext(A,f1(A,B)) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(5)].
% 0.43/1.01 28 iext(uri_rdfs_subClassOf,A,B) | -ic(A) | -ic(B) | -icext(B,f1(A,B)) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(5)].
% 0.43/1.01 29 iext(uri_rdfs_subPropertyOf,A,B) | -ip(A) | -ip(B) | iext(A,f2(A,B),f3(A,B)) # label(owl_rdfsext_subpropertyof) # label(axiom). [clausify(6)].
% 0.43/1.01 30 iext(uri_rdfs_subPropertyOf,A,B) | -ip(A) | -ip(B) | -iext(B,f2(A,B),f3(A,B)) # label(owl_rdfsext_subpropertyof) # label(axiom). [clausify(6)].
% 0.43/1.01 43 -iext(uri_rdfs_domain,A,B) | icext(uri_rdf_Property,A). [resolve(25,a,9,a)].
% 0.43/1.01 47 iext(uri_rdfs_subPropertyOf,uri_owl_equivalentClass,A) | -ip(A) | iext(uri_owl_equivalentClass,f2(uri_owl_equivalentClass,A),f3(uri_owl_equivalentClass,A)). [resolve(29,b,8,a)].
% 0.43/1.01 61 icext(uri_rdf_Property,uri_rdfs_subClassOf). [resolve(43,a,10,a)].
% 0.43/1.01 62 iext(uri_rdf_type,uri_rdfs_subClassOf,uri_rdf_Property). [resolve(61,a,21,b)].
% 0.43/1.01 65 ip(uri_rdfs_subClassOf). [resolve(62,a,12,a)].
% 0.43/1.01 69 -iext(uri_rdfs_subClassOf,f2(uri_owl_equivalentClass,uri_rdfs_subClassOf),f3(uri_owl_equivalentClass,uri_rdfs_subClassOf)). [ur(30,a,11,a,b,8,a,c,65,a)].
% 0.43/1.01 71 iext(uri_owl_equivalentClass,f2(uri_owl_equivalentClass,uri_rdfs_subClassOf),f3(uri_owl_equivalentClass,uri_rdfs_subClassOf)). [resolve(47,b,65,a),unit_del(a,11)].
% 0.43/1.01 79 ic(f3(uri_owl_equivalentClass,uri_rdfs_subClassOf)). [resolve(71,a,15,a)].
% 0.43/1.01 80 ic(f2(uri_owl_equivalentClass,uri_rdfs_subClassOf)). [resolve(71,a,14,a)].
% 0.43/1.01 95 -icext(f3(uri_owl_equivalentClass,uri_rdfs_subClassOf),f1(f2(uri_owl_equivalentClass,uri_rdfs_subClassOf),f3(uri_owl_equivalentClass,uri_rdfs_subClassOf))). [ur(28,a,69,a,b,80,a,c,79,a)].
% 0.43/1.01 98 -icext(f2(uri_owl_equivalentClass,uri_rdfs_subClassOf),f1(f2(uri_owl_equivalentClass,uri_rdfs_subClassOf),f3(uri_owl_equivalentClass,uri_rdfs_subClassOf))). [ur(23,a,71,a,c,95,a)].
% 0.43/1.01 100 $F. [ur(27,a,69,a,c,79,a,d,98,a),unit_del(a,80)].
% 0.43/1.01
% 0.43/1.01 % SZS output end Refutation
% 0.43/1.01 ============================== end of proof ==========================
% 0.43/1.01
% 0.43/1.01 ============================== STATISTICS ============================
% 0.43/1.01
% 0.43/1.01 Given=67. Generated=128. Kept=92. proofs=1.
% 0.43/1.01 Usable=65. Sos=24. Demods=0. Limbo=0, Disabled=30. Hints=0.
% 0.43/1.01 Megabytes=0.14.
% 0.43/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.01
% 0.43/1.01 ============================== end of statistics =====================
% 0.43/1.01
% 0.43/1.01 ============================== end of search =========================
% 0.43/1.01
% 0.43/1.01 THEOREM PROVED
% 0.43/1.01 % SZS status Theorem
% 0.43/1.01
% 0.43/1.01 Exiting with 1 proof.
% 0.43/1.01
% 0.43/1.01 Process 739 exit (max_proofs) Wed Jun 1 03:27:01 2022
% 0.43/1.01 Prover9 interrupted
%------------------------------------------------------------------------------