TSTP Solution File: SWB025+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:53 EDT 2022
% Result : Theorem 1.06s 1.31s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 1 08:35:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.71/0.96 ============================== Prover9 ===============================
% 0.71/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.96 Process 13013 was started by sandbox on n028.cluster.edu,
% 0.71/0.96 Wed Jun 1 08:35:22 2022
% 0.71/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12860_n028.cluster.edu".
% 0.71/0.96 ============================== end of head ===========================
% 0.71/0.96
% 0.71/0.96 ============================== INPUT =================================
% 0.71/0.96
% 0.71/0.96 % Reading from file /tmp/Prover9_12860_n028.cluster.edu
% 0.71/0.96
% 0.71/0.96 set(prolog_style_variables).
% 0.71/0.96 set(auto2).
% 0.71/0.96 % set(auto2) -> set(auto).
% 0.71/0.96 % set(auto) -> set(auto_inference).
% 0.71/0.96 % set(auto) -> set(auto_setup).
% 0.71/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.96 % set(auto) -> set(auto_limits).
% 0.71/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.96 % set(auto) -> set(auto_denials).
% 0.71/0.96 % set(auto) -> set(auto_process).
% 0.71/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.96 % set(auto2) -> assign(stats, some).
% 0.71/0.96 % set(auto2) -> clear(echo_input).
% 0.71/0.96 % set(auto2) -> set(quiet).
% 0.71/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.96 % set(auto2) -> clear(print_given).
% 0.71/0.96 assign(lrs_ticks,-1).
% 0.71/0.96 assign(sos_limit,10000).
% 0.71/0.96 assign(order,kbo).
% 0.71/0.96 set(lex_order_vars).
% 0.71/0.96 clear(print_given).
% 0.71/0.96
% 0.71/0.96 % formulas(sos). % not echoed (4 formulas)
% 0.71/0.96
% 0.71/0.96 ============================== end of input ==========================
% 0.71/0.96
% 0.71/0.96 % From the command line: assign(max_seconds, 300).
% 0.71/0.96
% 0.71/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.96
% 0.71/0.96 % Formulas that are not ordinary clauses:
% 0.71/0.96 1 (all P all S1 all P1 all S2 all P2 (iext(uri_rdf_first,S1,P1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,P2) & iext(uri_rdf_rest,S2,uri_rdf_nil) -> (iext(uri_owl_propertyChainAxiom,P,S1) <-> ip(P) & ip(P1) & ip(P2) & (all Y0 all Y1 all Y2 (iext(P1,Y0,Y1) & iext(P2,Y1,Y2) -> iext(P,Y0,Y2)))))) # label(owl_chain_002) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.96 2 (all P1 all P2 (iext(uri_owl_inverseOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) <-> iext(P2,Y,X))))) # label(owl_inv) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.96 3 (exists BNODE_l11 exists BNODE_l12 exists BNODE_l21 exists BNODE_l22 exists BNODE_l3 (iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,BNODE_l11) & iext(uri_rdf_first,BNODE_l11,uri_ex_hasCousin) & iext(uri_rdf_rest,BNODE_l11,BNODE_l12) & iext(uri_rdf_first,BNODE_l12,uri_ex_hasFather) & iext(uri_rdf_rest,BNODE_l12,uri_rdf_nil) & iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,BNODE_l21) & iext(uri_rdf_first,BNODE_l21,uri_ex_hasUncle) & iext(uri_rdf_rest,BNODE_l21,BNODE_l22) & iext(uri_rdf_first,BNODE_l22,BNODE_l3) & iext(uri_rdf_rest,BNODE_l22,uri_rdf_nil) & iext(uri_owl_inverseOf,BNODE_l3,uri_ex_hasFather) & iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave) & iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob) & iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly) & iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave))) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.96 4 -(iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) & iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)) # label(testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.96
% 0.71/0.96 ============================== end of process non-clausal formulas ===
% 0.71/0.96
% 0.71/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.96
% 0.71/0.96 ============================== PREDICATE ELIMINATION =================
% 1.06/1.31
% 1.06/1.31 ============================== end predicate elimination =============
% 1.06/1.31
% 1.06/1.31 Auto_denials: (non-Horn, no changes).
% 1.06/1.31
% 1.06/1.31 Term ordering decisions:
% 1.06/1.31 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_owl_propertyChainAxiom=1. uri_rdf_nil=1. uri_owl_inverseOf=1. uri_ex_hasFather=1. uri_ex_bob=1. uri_ex_hasCousin=1. uri_ex_hasUncle=1. uri_ex_alice=1. uri_ex_dave=1. uri_ex_charly=1. c1=1. c2=1. c3=1. c4=1. c5=1. f4=1. f5=1. f1=1. f2=1. f3=1.
% 1.06/1.31
% 1.06/1.31 ============================== end of process initial clauses ========
% 1.06/1.31
% 1.06/1.31 ============================== CLAUSES FOR SEARCH ====================
% 1.06/1.31
% 1.06/1.31 ============================== end of clauses for search =============
% 1.06/1.31
% 1.06/1.31 ============================== SEARCH ================================
% 1.06/1.31
% 1.06/1.31 % Starting search at 0.03 seconds.
% 1.06/1.31
% 1.06/1.31 ============================== PROOF =================================
% 1.06/1.31 % SZS status Theorem
% 1.06/1.31 % SZS output start Refutation
% 1.06/1.31
% 1.06/1.31 % Proof 1 at 0.36 (+ 0.01) seconds.
% 1.06/1.31 % Length of proof is 32.
% 1.06/1.31 % Level of proof is 8.
% 1.06/1.31 % Maximum clause weight is 32.000.
% 1.06/1.31 % Given clauses 302.
% 1.06/1.31
% 1.06/1.31 1 (all P all S1 all P1 all S2 all P2 (iext(uri_rdf_first,S1,P1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,P2) & iext(uri_rdf_rest,S2,uri_rdf_nil) -> (iext(uri_owl_propertyChainAxiom,P,S1) <-> ip(P) & ip(P1) & ip(P2) & (all Y0 all Y1 all Y2 (iext(P1,Y0,Y1) & iext(P2,Y1,Y2) -> iext(P,Y0,Y2)))))) # label(owl_chain_002) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.31 2 (all P1 all P2 (iext(uri_owl_inverseOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) <-> iext(P2,Y,X))))) # label(owl_inv) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.31 3 (exists BNODE_l11 exists BNODE_l12 exists BNODE_l21 exists BNODE_l22 exists BNODE_l3 (iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,BNODE_l11) & iext(uri_rdf_first,BNODE_l11,uri_ex_hasCousin) & iext(uri_rdf_rest,BNODE_l11,BNODE_l12) & iext(uri_rdf_first,BNODE_l12,uri_ex_hasFather) & iext(uri_rdf_rest,BNODE_l12,uri_rdf_nil) & iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,BNODE_l21) & iext(uri_rdf_first,BNODE_l21,uri_ex_hasUncle) & iext(uri_rdf_rest,BNODE_l21,BNODE_l22) & iext(uri_rdf_first,BNODE_l22,BNODE_l3) & iext(uri_rdf_rest,BNODE_l22,uri_rdf_nil) & iext(uri_owl_inverseOf,BNODE_l3,uri_ex_hasFather) & iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave) & iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob) & iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly) & iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave))) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.31 4 -(iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) & iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)) # label(testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.06/1.31 5 iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,c1) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 6 iext(uri_rdf_first,c1,uri_ex_hasCousin) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 7 iext(uri_rdf_rest,c1,c2) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 8 iext(uri_rdf_first,c2,uri_ex_hasFather) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 9 iext(uri_rdf_rest,c2,uri_rdf_nil) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 10 iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,c3) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 11 iext(uri_rdf_first,c3,uri_ex_hasUncle) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 12 iext(uri_rdf_rest,c3,c4) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 13 iext(uri_rdf_first,c4,c5) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 14 iext(uri_rdf_rest,c4,uri_rdf_nil) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 15 iext(uri_owl_inverseOf,c5,uri_ex_hasFather) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 16 iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 17 iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 18 iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 19 iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave) # label(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(axiom). [clausify(3)].
% 1.06/1.31 20 -iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) | -iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) # label(testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) # label(negated_conjecture). [clausify(4)].
% 1.06/1.31 24 -iext(uri_owl_inverseOf,A,B) | iext(A,C,D) | -iext(B,D,C) # label(owl_inv) # label(axiom). [clausify(2)].
% 1.06/1.31 30 -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_propertyChainAxiom,E,A) | -iext(B,F,V6) | -iext(D,V6,V7) | iext(E,F,V7) # label(owl_chain_002) # label(axiom). [clausify(1)].
% 1.06/1.31 170 iext(c5,A,B) | -iext(uri_ex_hasFather,B,A). [resolve(24,a,15,a)].
% 1.06/1.31 231 -iext(uri_rdf_rest,c3,A) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_propertyChainAxiom,C,c3) | -iext(uri_ex_hasUncle,D,E) | -iext(B,E,F) | iext(C,D,F). [resolve(30,a,11,a)].
% 1.06/1.31 240 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,c2) | -iext(uri_owl_propertyChainAxiom,C,A) | -iext(B,D,E) | -iext(uri_ex_hasFather,E,F) | iext(C,D,F). [resolve(30,c,8,a),unit_del(c,9)].
% 1.06/1.31 977 iext(c5,uri_ex_dave,uri_ex_alice). [resolve(170,b,16,a)].
% 1.06/1.31 1148 -iext(uri_owl_propertyChainAxiom,A,c3) | -iext(uri_ex_hasUncle,B,C) | -iext(c5,C,D) | iext(A,B,D). [resolve(231,b,13,a),unit_del(a,12),unit_del(b,14)].
% 1.06/1.31 1539 -iext(uri_ex_hasUncle,A,B) | -iext(c5,B,C) | iext(uri_ex_hasCousin,A,C). [resolve(1148,a,10,a)].
% 1.06/1.31 1543 -iext(c5,uri_ex_dave,A) | iext(uri_ex_hasCousin,uri_ex_bob,A). [resolve(1539,a,19,a)].
% 1.06/1.31 1546 iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice). [resolve(1543,a,977,a)].
% 1.06/1.31 1547 -iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly). [back_unit_del(20),unit_del(b,1546)].
% 1.06/1.31 1574 $F. [ur(240,b,7,a,c,5,a,d,17,a,e,18,a,f,1547,a),unit_del(a,6)].
% 1.06/1.31
% 1.06/1.31 % SZS output end Refutation
% 1.06/1.31 ============================== end of proof ==========================
% 1.06/1.31
% 1.06/1.31 ============================== STATISTICS ============================
% 1.06/1.31
% 1.06/1.31 Given=302. Generated=2882. Kept=1569. proofs=1.
% 1.06/1.31 Usable=285. Sos=1179. Demods=0. Limbo=0, Disabled=134. Hints=0.
% 1.06/1.31 Megabytes=2.28.
% 1.06/1.31 User_CPU=0.36, System_CPU=0.01, Wall_clock=1.
% 1.06/1.31
% 1.06/1.31 ============================== end of statistics =====================
% 1.06/1.31
% 1.06/1.31 ============================== end of search =========================
% 1.06/1.31
% 1.06/1.31 THEOREM PROVED
% 1.06/1.31 % SZS status Theorem
% 1.06/1.31
% 1.06/1.31 Exiting with 1 proof.
% 1.06/1.31
% 1.06/1.31 Process 13013 exit (max_proofs) Wed Jun 1 08:35:23 2022
% 1.06/1.31 Prover9 interrupted
%------------------------------------------------------------------------------