TSTP Solution File: SWB014+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB014+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:49 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.03/0.11 % Problem : SWB014+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 : 600
% 0.12/0.33 % DateTime : Wed Jun 1 08:42:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 20415 was started by sandbox2 on n020.cluster.edu,
% 0.42/1.00 Wed Jun 1 08:42:54 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20083_n020.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_20083_n020.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (4 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 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.42/1.00 2 (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_unionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & (all X (icext(Z,X) <-> icext(C1,X) | icext(C2,X)))))) # label(owl_bool_unionof_class_002) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 3 (exists BNODE_u exists BNODE_l1 exists BNODE_l2 (iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species) & iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species) & iext(uri_rdf_type,uri_ex_harry,BNODE_u) & iext(uri_owl_unionOf,BNODE_u,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_ex_Eagle) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_ex_Falcon) & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil))) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 -(exists BNODE_x (iext(uri_rdf_type,uri_ex_harry,BNODE_x) & iext(uri_rdf_type,BNODE_x,uri_ex_Species))) # label(testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00
% 0.42/1.00 ============================== end predicate elimination =============
% 0.42/1.00
% 0.42/1.00 Auto_denials: (non-Horn, no changes).
% 0.42/1.00
% 0.42/1.00 Term ordering decisions:
% 0.42/1.00 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_owl_unionOf=1. uri_rdf_nil=1. uri_rdf_type=1. uri_ex_Eagle=1. uri_ex_Falcon=1. uri_ex_Species=1. uri_ex_harry=1. c1=1. c2=1. c3=1. f1=1.
% 0.42/1.00
% 0.42/1.00 ============================== end of process initial clauses ========
% 0.42/1.00
% 0.42/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.00
% 0.42/1.00 ============================== 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.04 (+ 0.00) seconds.
% 0.72/1.02 % Length of proof is 22.
% 0.72/1.02 % Level of proof is 4.
% 0.72/1.02 % Maximum clause weight is 29.000.
% 0.72/1.02 % Given clauses 63.
% 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 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_unionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & (all X (icext(Z,X) <-> icext(C1,X) | icext(C2,X)))))) # label(owl_bool_unionof_class_002) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 3 (exists BNODE_u exists BNODE_l1 exists BNODE_l2 (iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species) & iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species) & iext(uri_rdf_type,uri_ex_harry,BNODE_u) & iext(uri_owl_unionOf,BNODE_u,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_ex_Eagle) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_ex_Falcon) & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil))) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 4 -(exists BNODE_x (iext(uri_rdf_type,uri_ex_harry,BNODE_x) & iext(uri_rdf_type,BNODE_x,uri_ex_Species))) # label(testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/1.02 5 iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 6 iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 7 iext(uri_rdf_type,uri_ex_harry,c1) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 8 iext(uri_owl_unionOf,c1,c2) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 9 iext(uri_rdf_first,c2,uri_ex_Eagle) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 10 iext(uri_rdf_rest,c2,c3) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 11 iext(uri_rdf_first,c3,uri_ex_Falcon) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 12 iext(uri_rdf_rest,c3,uri_rdf_nil) # label(testcase_premise_fullish_014_Harry_belongs_to_some_Species) # label(axiom). [clausify(3)].
% 0.72/1.02 13 -iext(uri_rdf_type,uri_ex_harry,A) | -iext(uri_rdf_type,A,uri_ex_Species) # label(testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) # label(negated_conjecture). [clausify(4)].
% 0.72/1.02 14 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 0.72/1.02 15 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 0.72/1.02 21 -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_unionOf,E,A) | -icext(E,F) | icext(B,F) | icext(D,F) # label(owl_bool_unionof_class_002) # label(axiom). [clausify(2)].
% 0.72/1.02 64 -iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon). [resolve(13,b,6,a)].
% 0.72/1.02 65 -iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle). [resolve(13,b,5,a)].
% 0.72/1.02 66 icext(c1,uri_ex_harry). [resolve(14,a,7,a)].
% 0.72/1.02 232 -icext(uri_ex_Falcon,uri_ex_harry). [ur(15,a,64,a)].
% 0.72/1.02 233 -icext(uri_ex_Eagle,uri_ex_harry). [ur(15,a,65,a)].
% 0.72/1.02 238 $F. [ur(21,b,10,a,c,11,a,d,12,a,e,8,a,f,66,a,g,233,a,h,232,a),unit_del(a,9)].
% 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=63. Generated=548. Kept=233. proofs=1.
% 0.72/1.02 Usable=63. Sos=155. Demods=0. Limbo=1, Disabled=34. Hints=0.
% 0.72/1.02 Megabytes=0.32.
% 0.72/1.02 User_CPU=0.04, 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 20415 exit (max_proofs) Wed Jun 1 08:42:54 2022
% 0.72/1.02 Prover9 interrupted
%------------------------------------------------------------------------------