TSTP Solution File: SWB030+2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWB030+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n032.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:56 EDT 2022

% Result   : Unsatisfiable 0.53s 0.84s
% Output   : Refutation 0.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWB030+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.11  % Command  : tptp2X_and_run_prover9 %d %s
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Wed Jun  1 04:42:29 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.53/0.84  ============================== Prover9 ===============================
% 0.53/0.84  Prover9 (32) version 2009-11A, November 2009.
% 0.53/0.84  Process 2922 was started by sandbox on n032.cluster.edu,
% 0.53/0.84  Wed Jun  1 04:42:29 2022
% 0.53/0.84  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2769_n032.cluster.edu".
% 0.53/0.84  ============================== end of head ===========================
% 0.53/0.84  
% 0.53/0.84  ============================== INPUT =================================
% 0.53/0.84  
% 0.53/0.84  % Reading from file /tmp/Prover9_2769_n032.cluster.edu
% 0.53/0.84  
% 0.53/0.84  set(prolog_style_variables).
% 0.53/0.84  set(auto2).
% 0.53/0.84      % set(auto2) -> set(auto).
% 0.53/0.84      % set(auto) -> set(auto_inference).
% 0.53/0.84      % set(auto) -> set(auto_setup).
% 0.53/0.84      % set(auto_setup) -> set(predicate_elim).
% 0.53/0.84      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.53/0.84      % set(auto) -> set(auto_limits).
% 0.53/0.84      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.53/0.84      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.53/0.84      % set(auto) -> set(auto_denials).
% 0.53/0.84      % set(auto) -> set(auto_process).
% 0.53/0.84      % set(auto2) -> assign(new_constants, 1).
% 0.53/0.84      % set(auto2) -> assign(fold_denial_max, 3).
% 0.53/0.84      % set(auto2) -> assign(max_weight, "200.000").
% 0.53/0.84      % set(auto2) -> assign(max_hours, 1).
% 0.53/0.84      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.53/0.84      % set(auto2) -> assign(max_seconds, 0).
% 0.53/0.84      % set(auto2) -> assign(max_minutes, 5).
% 0.53/0.84      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.53/0.84      % set(auto2) -> set(sort_initial_sos).
% 0.53/0.84      % set(auto2) -> assign(sos_limit, -1).
% 0.53/0.84      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.53/0.84      % set(auto2) -> assign(max_megs, 400).
% 0.53/0.84      % set(auto2) -> assign(stats, some).
% 0.53/0.84      % set(auto2) -> clear(echo_input).
% 0.53/0.84      % set(auto2) -> set(quiet).
% 0.53/0.84      % set(auto2) -> clear(print_initial_clauses).
% 0.53/0.84      % set(auto2) -> clear(print_given).
% 0.53/0.84  assign(lrs_ticks,-1).
% 0.53/0.84  assign(sos_limit,10000).
% 0.53/0.84  assign(order,kbo).
% 0.53/0.84  set(lex_order_vars).
% 0.53/0.84  clear(print_given).
% 0.53/0.84  
% 0.53/0.84  % formulas(sos).  % not echoed (4 formulas)
% 0.53/0.84  
% 0.53/0.84  ============================== end of input ==========================
% 0.53/0.84  
% 0.53/0.84  % From the command line: assign(max_seconds, 300).
% 0.53/0.84  
% 0.53/0.84  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.53/0.84  
% 0.53/0.84  % Formulas that are not ordinary clauses:
% 0.53/0.84  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.53/0.84  2 (all Z all P all V (iext(uri_owl_hasSelf,Z,V) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> iext(P,X,X))))) # label(owl_restrict_hasself) # label(axiom) # label(non_clause).  [assumption].
% 0.53/0.84  3 (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.53/0.84  4 (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)))) # label(testcase_premise_fullish_030_Bad_Class) # label(axiom) # label(non_clause).  [assumption].
% 0.53/0.84  
% 0.53/0.84  ============================== end of process non-clausal formulas ===
% 0.53/0.84  
% 0.53/0.84  ============================== PROCESS INITIAL CLAUSES ===============
% 0.53/0.84  
% 0.53/0.84  ============================== PREDICATE ELIMINATION =================
% 0.53/0.84  
% 0.53/0.84  ============================== end predicate elimination =============
% 0.53/0.84  
% 0.53/0.84  Auto_denials:  (non-Horn, no changes).
% 0.53/0.84  
% 0.53/0.84  Term ordering decisions:
% 0.53/0.84  Function symbol KB weights:  uri_rdf_type=1. uri_owl_hasSelf=1. uri_owl_onProperty=1. uri_ex_c=1. uri_owl_complementOf=1. dat_str_true=1. uri_owl_Class=1. uri_owl_Restriction=1. uri_xsd_boolean=1. c1=1. literal_typed=1.
% 0.53/0.84  
% 0.53/0.84  ============================== end of process initial clauses ========
% 0.53/0.84  
% 0.53/0.84  ============================== CLAUSES FOR SEARCH ====================
% 0.53/0.84  
% 0.53/0.84  ============================== end of clauses for search =============
% 0.53/0.84  
% 0.53/0.84  ============================== SEARCH ================================
% 0.53/0.84  
% 0.53/0.84  % Starting search at 0.01 seconds.
% 0.53/0.84  
% 0.53/0.84  ============================== PROOF =================================
% 0.53/0.84  % SZS status Unsatisfiable
% 0.53/0.84  % SZS output start Refutation
% 0.53/0.84  
% 0.53/0.84  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.53/0.84  % Length of proof is 24.
% 0.53/0.84  % Level of proof is 8.
% 0.53/0.84  % Maximum clause weight is 15.000.
% 0.53/0.84  % Given clauses 28.
% 0.53/0.84  
% 0.53/0.84  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.53/0.84  2 (all Z all P all V (iext(uri_owl_hasSelf,Z,V) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> iext(P,X,X))))) # label(owl_restrict_hasself) # label(axiom) # label(non_clause).  [assumption].
% 0.53/0.84  3 (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.53/0.84  4 (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)))) # label(testcase_premise_fullish_030_Bad_Class) # label(axiom) # label(non_clause).  [assumption].
% 0.53/0.84  6 iext(uri_owl_complementOf,uri_ex_c,c1) # label(testcase_premise_fullish_030_Bad_Class) # label(axiom).  [clausify(4)].
% 0.53/0.84  8 iext(uri_owl_onProperty,c1,uri_rdf_type) # label(testcase_premise_fullish_030_Bad_Class) # label(axiom).  [clausify(4)].
% 0.53/0.84  9 iext(uri_owl_hasSelf,c1,literal_typed(dat_str_true,uri_xsd_boolean)) # label(testcase_premise_fullish_030_Bad_Class) # label(axiom).  [clausify(4)].
% 0.53/0.84  10 -iext(uri_owl_complementOf,A,B) | -icext(A,C) | -icext(B,C) # label(owl_bool_complementof_class) # label(axiom).  [clausify(3)].
% 0.53/0.84  11 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom).  [clausify(1)].
% 0.53/0.84  12 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom).  [clausify(1)].
% 0.53/0.84  13 -iext(uri_owl_complementOf,A,B) | icext(A,C) | icext(B,C) # label(owl_bool_complementof_class) # label(axiom).  [clausify(3)].
% 0.53/0.84  14 -iext(uri_owl_hasSelf,A,B) | -iext(uri_owl_onProperty,A,C) | -icext(A,D) | iext(C,D,D) # label(owl_restrict_hasself) # label(axiom).  [clausify(2)].
% 0.53/0.84  15 -iext(uri_owl_hasSelf,A,B) | -iext(uri_owl_onProperty,A,C) | icext(A,D) | -iext(C,D,D) # label(owl_restrict_hasself) # label(axiom).  [clausify(2)].
% 0.53/0.84  20 -icext(uri_ex_c,A) | -icext(c1,A).  [resolve(10,a,6,a)].
% 0.53/0.84  23 icext(uri_ex_c,A) | icext(c1,A).  [resolve(13,a,6,a)].
% 0.53/0.84  24 -iext(uri_owl_onProperty,c1,A) | -icext(c1,B) | iext(A,B,B).  [resolve(14,a,9,a)].
% 0.53/0.84  26 -iext(uri_owl_onProperty,c1,A) | icext(c1,B) | -iext(A,B,B).  [resolve(15,a,9,a)].
% 0.53/0.84  33 -icext(c1,A) | iext(uri_rdf_type,A,A).  [resolve(24,a,8,a)].
% 0.53/0.84  34 iext(uri_rdf_type,A,A) | icext(uri_ex_c,A).  [resolve(33,a,23,b)].
% 0.53/0.84  36 icext(uri_ex_c,A) | icext(A,A).  [resolve(34,a,11,a)].
% 0.53/0.84  38 icext(uri_ex_c,uri_ex_c).  [factor(36,a,b)].
% 0.53/0.84  39 iext(uri_rdf_type,uri_ex_c,uri_ex_c).  [resolve(38,a,12,b)].
% 0.53/0.84  40 -icext(c1,uri_ex_c).  [ur(20,a,38,a)].
% 0.53/0.84  46 $F.  [resolve(26,c,39,a),unit_del(a,8),unit_del(b,40)].
% 0.53/0.84  
% 0.53/0.84  % SZS output end Refutation
% 0.53/0.84  ============================== end of proof ==========================
% 0.53/0.84  
% 0.53/0.84  ============================== STATISTICS ============================
% 0.53/0.84  
% 0.53/0.84  Given=28. Generated=54. Kept=41. proofs=1.
% 0.53/0.84  Usable=28. Sos=9. Demods=0. Limbo=1, Disabled=16. Hints=0.
% 0.53/0.84  Megabytes=0.06.
% 0.53/0.84  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.53/0.84  
% 0.53/0.84  ============================== end of statistics =====================
% 0.53/0.84  
% 0.53/0.84  ============================== end of search =========================
% 0.53/0.84  
% 0.53/0.84  THEOREM PROVED
% 0.53/0.84  % SZS status Unsatisfiable
% 0.53/0.84  
% 0.53/0.84  Exiting with 1 proof.
% 0.53/0.84  
% 0.53/0.84  Process 2922 exit (max_proofs) Wed Jun  1 04:42:29 2022
% 0.57/0.84  Prover9 interrupted
%------------------------------------------------------------------------------