%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB025+2 : TPTP v8.1.2. Released v5.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n024.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 : 300s % DateTime : Thu Aug 31 20:11:51 EDT 2023 % Result : Theorem 7.61s 1.81s % Output : Proof 10.79s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SWB025+2 : TPTP v8.1.2. Released v5.2.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n024.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sun Aug 27 07:04:23 EDT 2023 % 0.14/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.98/1.05 Prover 4: Preprocessing ... % 1.98/1.05 Prover 1: Preprocessing ... % 2.61/1.09 Prover 5: Preprocessing ... % 2.61/1.09 Prover 0: Preprocessing ... % 2.61/1.09 Prover 3: Preprocessing ... % 2.61/1.09 Prover 6: Preprocessing ... % 2.61/1.09 Prover 2: Preprocessing ... % 4.03/1.33 Prover 2: Constructing countermodel ... % 4.03/1.34 Prover 5: Proving ... % 4.03/1.37 Prover 3: Constructing countermodel ... % 4.03/1.38 Prover 1: Constructing countermodel ... % 4.03/1.40 Prover 6: Proving ... % 7.61/1.78 Prover 4: Constructing countermodel ... % 7.61/1.81 Prover 3: proved (1154ms) % 7.61/1.81 % 7.61/1.81 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.61/1.81 % 7.61/1.81 Prover 2: stopped % 7.61/1.82 Prover 6: stopped % 7.61/1.82 Prover 5: stopped % 7.61/1.82 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.61/1.82 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.61/1.82 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.61/1.82 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.61/1.83 Prover 0: Proving ... % 8.05/1.84 Prover 0: stopped % 8.05/1.85 Prover 7: Preprocessing ... % 8.05/1.85 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.15/1.86 Prover 10: Preprocessing ... % 8.15/1.86 Prover 8: Preprocessing ... % 8.15/1.86 Prover 11: Preprocessing ... % 8.15/1.90 Prover 13: Preprocessing ... % 8.15/1.90 Prover 10: Constructing countermodel ... % 8.15/1.93 Prover 7: Constructing countermodel ... % 8.15/1.95 Prover 8: Warning: ignoring some quantifiers % 8.15/1.95 Prover 13: Constructing countermodel ... % 8.15/1.96 Prover 8: Constructing countermodel ... % 9.97/2.11 Prover 10: Found proof (size 13) % 9.97/2.12 Prover 10: proved (291ms) % 9.97/2.12 Prover 7: stopped % 9.97/2.12 Prover 8: stopped % 9.97/2.12 Prover 1: stopped % 9.97/2.12 Prover 4: stopped % 9.97/2.12 Prover 13: stopped % 10.35/2.23 Prover 11: Constructing countermodel ... % 10.35/2.23 Prover 11: stopped % 10.35/2.23 % 10.35/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.35/2.23 % 10.35/2.24 % SZS output start Proof for theBenchmark % 10.35/2.24 Assumptions after simplification: % 10.35/2.24 --------------------------------- % 10.35/2.24 % 10.35/2.24 (owl_chain_002) % 10.35/2.25 $i(uri_owl_propertyChainAxiom) & $i(uri_rdf_nil) & $i(uri_rdf_rest) & % 10.35/2.25 $i(uri_rdf_first) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! % 10.35/2.25 [v4: $i] : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | % 10.35/2.25 ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.35/2.25 iext(v4, v6, v7) | ~ iext(v2, v5, v6) | ~ iext(uri_owl_propertyChainAxiom, % 10.35/2.25 v0, v1) | ~ iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, % 10.35/2.25 v1, v3) | ~ iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) % 10.35/2.25 | iext(v0, v5, v7)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 10.35/2.26 : ! [v4: $i] : ( ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.35/2.26 ~ ip(v4) | ~ ip(v2) | ~ ip(v0) | ~ iext(uri_rdf_rest, v3, uri_rdf_nil) | % 10.35/2.26 ~ iext(uri_rdf_rest, v1, v3) | ~ iext(uri_rdf_first, v3, v4) | ~ % 10.35/2.26 iext(uri_rdf_first, v1, v2) | iext(uri_owl_propertyChainAxiom, v0, v1) | ? % 10.35/2.26 [v5: $i] : ? [v6: $i] : ? [v7: $i] : ($i(v7) & $i(v6) & $i(v5) & iext(v4, % 10.35/2.26 v6, v7) & iext(v2, v5, v6) & ~ iext(v0, v5, v7))) & ! [v0: $i] : ! % 10.35/2.26 [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ $i(v4) | ~ $i(v3) | % 10.35/2.26 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ iext(uri_owl_propertyChainAxiom, v0, % 10.35/2.26 v1) | ~ iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, % 10.35/2.26 v3) | ~ iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | % 10.35/2.26 ip(v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: % 10.35/2.26 $i] : ( ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.35/2.26 iext(uri_owl_propertyChainAxiom, v0, v1) | ~ iext(uri_rdf_rest, v3, % 10.35/2.26 uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) | ~ iext(uri_rdf_first, v3, % 10.35/2.26 v4) | ~ iext(uri_rdf_first, v1, v2) | ip(v2)) & ! [v0: $i] : ! [v1: $i] % 10.35/2.26 : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ $i(v4) | ~ $i(v3) | ~ $i(v2) % 10.35/2.26 | ~ $i(v1) | ~ $i(v0) | ~ iext(uri_owl_propertyChainAxiom, v0, v1) | ~ % 10.35/2.26 iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) | ~ % 10.35/2.26 iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | ip(v0)) % 10.35/2.26 % 10.35/2.26 (owl_inv) % 10.35/2.26 $i(uri_owl_inverseOf) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 10.35/2.26 : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ iext(v1, v3, v2) | ~ % 10.35/2.26 iext(uri_owl_inverseOf, v0, v1) | iext(v0, v2, v3)) & ! [v0: $i] : ! [v1: % 10.35/2.26 $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 10.35/2.26 $i(v0) | ~ iext(v0, v2, v3) | ~ iext(uri_owl_inverseOf, v0, v1) | iext(v1, % 10.35/2.26 v3, v2)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ip(v1) % 10.35/2.26 | ~ ip(v0) | iext(uri_owl_inverseOf, v0, v1) | ? [v2: $i] : ? [v3: $i] : % 10.35/2.26 ($i(v3) & $i(v2) & ( ~ iext(v1, v3, v2) | ~ iext(v0, v2, v3)) & (iext(v1, % 10.35/2.26 v3, v2) | iext(v0, v2, v3)))) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) % 10.35/2.26 | ~ $i(v0) | ~ iext(uri_owl_inverseOf, v0, v1) | ip(v1)) & ! [v0: $i] : % 10.35/2.26 ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ iext(uri_owl_inverseOf, v0, v1) | % 10.35/2.26 ip(v0)) % 10.35/2.26 % 10.35/2.26 (testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) % 10.35/2.26 $i(uri_ex_bob) & $i(uri_ex_hasCousin) & $i(uri_ex_charly) & $i(uri_ex_alice) & % 10.35/2.26 $i(uri_ex_hasUncle) & ( ~ iext(uri_ex_hasCousin, uri_ex_bob, uri_ex_alice) | % 10.35/2.26 ~ iext(uri_ex_hasUncle, uri_ex_alice, uri_ex_charly)) % 10.35/2.26 % 10.35/2.26 (testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) % 10.35/2.26 $i(uri_ex_dave) & $i(uri_ex_hasFather) & $i(uri_ex_bob) & $i(uri_ex_hasCousin) % 10.35/2.26 & $i(uri_ex_charly) & $i(uri_ex_alice) & $i(uri_ex_hasUncle) & % 10.35/2.26 $i(uri_owl_inverseOf) & $i(uri_owl_propertyChainAxiom) & $i(uri_rdf_nil) & % 10.35/2.26 $i(uri_rdf_rest) & $i(uri_rdf_first) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] % 10.35/2.26 : ? [v3: $i] : ? [v4: $i] : ($i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 10.35/2.26 iext(uri_ex_hasFather, uri_ex_bob, uri_ex_charly) & iext(uri_ex_hasFather, % 10.35/2.26 uri_ex_alice, uri_ex_dave) & iext(uri_ex_hasCousin, uri_ex_alice, % 10.35/2.26 uri_ex_bob) & iext(uri_ex_hasUncle, uri_ex_bob, uri_ex_dave) & % 10.35/2.26 iext(uri_owl_inverseOf, v4, uri_ex_hasFather) & % 10.35/2.26 iext(uri_owl_propertyChainAxiom, uri_ex_hasCousin, v2) & % 10.35/2.26 iext(uri_owl_propertyChainAxiom, uri_ex_hasUncle, v0) & iext(uri_rdf_rest, % 10.35/2.26 v3, uri_rdf_nil) & iext(uri_rdf_rest, v2, v3) & iext(uri_rdf_rest, v1, % 10.35/2.26 uri_rdf_nil) & iext(uri_rdf_rest, v0, v1) & iext(uri_rdf_first, v3, v4) & % 10.35/2.26 iext(uri_rdf_first, v2, uri_ex_hasUncle) & iext(uri_rdf_first, v1, % 10.35/2.26 uri_ex_hasFather) & iext(uri_rdf_first, v0, uri_ex_hasCousin)) % 10.35/2.26 % 10.35/2.26 Those formulas are unsatisfiable: % 10.35/2.26 --------------------------------- % 10.35/2.26 % 10.35/2.26 Begin of proof % 10.35/2.26 | % 10.35/2.26 | ALPHA: (testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) % 10.35/2.26 | implies: % 10.35/2.26 | (1) ~ iext(uri_ex_hasCousin, uri_ex_bob, uri_ex_alice) | ~ % 10.35/2.26 | iext(uri_ex_hasUncle, uri_ex_alice, uri_ex_charly) % 10.35/2.26 | % 10.35/2.26 | ALPHA: (testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) % 10.35/2.26 | implies: % 10.35/2.26 | (2) $i(uri_ex_hasUncle) % 10.35/2.26 | (3) $i(uri_ex_alice) % 10.35/2.27 | (4) $i(uri_ex_charly) % 10.35/2.27 | (5) $i(uri_ex_hasCousin) % 10.35/2.27 | (6) $i(uri_ex_bob) % 10.35/2.27 | (7) $i(uri_ex_hasFather) % 10.35/2.27 | (8) $i(uri_ex_dave) % 10.35/2.27 | (9) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 10.35/2.27 | ($i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & iext(uri_ex_hasFather, % 10.35/2.27 | uri_ex_bob, uri_ex_charly) & iext(uri_ex_hasFather, uri_ex_alice, % 10.35/2.27 | uri_ex_dave) & iext(uri_ex_hasCousin, uri_ex_alice, uri_ex_bob) & % 10.35/2.27 | iext(uri_ex_hasUncle, uri_ex_bob, uri_ex_dave) & % 10.35/2.27 | iext(uri_owl_inverseOf, v4, uri_ex_hasFather) & % 10.35/2.27 | iext(uri_owl_propertyChainAxiom, uri_ex_hasCousin, v2) & % 10.35/2.27 | iext(uri_owl_propertyChainAxiom, uri_ex_hasUncle, v0) & % 10.35/2.27 | iext(uri_rdf_rest, v3, uri_rdf_nil) & iext(uri_rdf_rest, v2, v3) & % 10.35/2.27 | iext(uri_rdf_rest, v1, uri_rdf_nil) & iext(uri_rdf_rest, v0, v1) & % 10.35/2.27 | iext(uri_rdf_first, v3, v4) & iext(uri_rdf_first, v2, % 10.35/2.27 | uri_ex_hasUncle) & iext(uri_rdf_first, v1, uri_ex_hasFather) & % 10.35/2.27 | iext(uri_rdf_first, v0, uri_ex_hasCousin)) % 10.35/2.27 | % 10.35/2.27 | ALPHA: (owl_inv) implies: % 10.35/2.27 | (10) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 10.35/2.27 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ iext(v1, v3, v2) | ~ % 10.35/2.27 | iext(uri_owl_inverseOf, v0, v1) | iext(v0, v2, v3)) % 10.35/2.27 | % 10.35/2.27 | ALPHA: (owl_chain_002) implies: % 10.35/2.27 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 10.35/2.27 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ % 10.35/2.27 | $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.35/2.27 | ~ iext(v4, v6, v7) | ~ iext(v2, v5, v6) | ~ % 10.35/2.27 | iext(uri_owl_propertyChainAxiom, v0, v1) | ~ iext(uri_rdf_rest, v3, % 10.35/2.27 | uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) | ~ % 10.35/2.27 | iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | % 10.35/2.27 | iext(v0, v5, v7)) % 10.35/2.27 | % 10.35/2.27 | DELTA: instantiating (9) with fresh symbols all_5_0, all_5_1, all_5_2, % 10.35/2.27 | all_5_3, all_5_4 gives: % 10.79/2.27 | (12) $i(all_5_0) & $i(all_5_1) & $i(all_5_2) & $i(all_5_3) & $i(all_5_4) & % 10.79/2.27 | iext(uri_ex_hasFather, uri_ex_bob, uri_ex_charly) & % 10.79/2.27 | iext(uri_ex_hasFather, uri_ex_alice, uri_ex_dave) & % 10.79/2.27 | iext(uri_ex_hasCousin, uri_ex_alice, uri_ex_bob) & % 10.79/2.27 | iext(uri_ex_hasUncle, uri_ex_bob, uri_ex_dave) & % 10.79/2.27 | iext(uri_owl_inverseOf, all_5_0, uri_ex_hasFather) & % 10.79/2.27 | iext(uri_owl_propertyChainAxiom, uri_ex_hasCousin, all_5_2) & % 10.79/2.27 | iext(uri_owl_propertyChainAxiom, uri_ex_hasUncle, all_5_4) & % 10.79/2.27 | iext(uri_rdf_rest, all_5_1, uri_rdf_nil) & iext(uri_rdf_rest, all_5_2, % 10.79/2.27 | all_5_1) & iext(uri_rdf_rest, all_5_3, uri_rdf_nil) & % 10.79/2.27 | iext(uri_rdf_rest, all_5_4, all_5_3) & iext(uri_rdf_first, all_5_1, % 10.79/2.27 | all_5_0) & iext(uri_rdf_first, all_5_2, uri_ex_hasUncle) & % 10.79/2.27 | iext(uri_rdf_first, all_5_3, uri_ex_hasFather) & iext(uri_rdf_first, % 10.79/2.27 | all_5_4, uri_ex_hasCousin) % 10.79/2.27 | % 10.79/2.27 | ALPHA: (12) implies: % 10.79/2.27 | (13) iext(uri_rdf_first, all_5_4, uri_ex_hasCousin) % 10.79/2.27 | (14) iext(uri_rdf_first, all_5_3, uri_ex_hasFather) % 10.79/2.27 | (15) iext(uri_rdf_first, all_5_2, uri_ex_hasUncle) % 10.79/2.27 | (16) iext(uri_rdf_first, all_5_1, all_5_0) % 10.79/2.27 | (17) iext(uri_rdf_rest, all_5_4, all_5_3) % 10.79/2.27 | (18) iext(uri_rdf_rest, all_5_3, uri_rdf_nil) % 10.79/2.27 | (19) iext(uri_rdf_rest, all_5_2, all_5_1) % 10.79/2.27 | (20) iext(uri_rdf_rest, all_5_1, uri_rdf_nil) % 10.79/2.27 | (21) iext(uri_owl_propertyChainAxiom, uri_ex_hasUncle, all_5_4) % 10.79/2.27 | (22) iext(uri_owl_propertyChainAxiom, uri_ex_hasCousin, all_5_2) % 10.79/2.27 | (23) iext(uri_owl_inverseOf, all_5_0, uri_ex_hasFather) % 10.79/2.27 | (24) iext(uri_ex_hasUncle, uri_ex_bob, uri_ex_dave) % 10.79/2.27 | (25) iext(uri_ex_hasCousin, uri_ex_alice, uri_ex_bob) % 10.79/2.27 | (26) iext(uri_ex_hasFather, uri_ex_alice, uri_ex_dave) % 10.79/2.27 | (27) iext(uri_ex_hasFather, uri_ex_bob, uri_ex_charly) % 10.79/2.27 | (28) $i(all_5_4) % 10.79/2.27 | (29) $i(all_5_3) % 10.79/2.27 | (30) $i(all_5_2) % 10.79/2.27 | (31) $i(all_5_1) % 10.79/2.27 | (32) $i(all_5_0) % 10.79/2.27 | % 10.79/2.28 | GROUND_INST: instantiating (10) with all_5_0, uri_ex_hasFather, uri_ex_dave, % 10.79/2.28 | uri_ex_alice, simplifying with (3), (7), (8), (23), (26), (32) % 10.79/2.28 | gives: % 10.79/2.28 | (33) iext(all_5_0, uri_ex_dave, uri_ex_alice) % 10.79/2.28 | % 10.79/2.28 | GROUND_INST: instantiating (11) with uri_ex_hasUncle, all_5_4, % 10.79/2.28 | uri_ex_hasCousin, all_5_3, uri_ex_hasFather, uri_ex_alice, % 10.79/2.28 | uri_ex_bob, uri_ex_charly, simplifying with (2), (3), (4), (5), % 10.79/2.28 | (6), (7), (13), (14), (17), (18), (21), (25), (27), (28), (29) % 10.79/2.28 | gives: % 10.79/2.28 | (34) iext(uri_ex_hasUncle, uri_ex_alice, uri_ex_charly) % 10.79/2.28 | % 10.79/2.28 | BETA: splitting (1) gives: % 10.79/2.28 | % 10.79/2.28 | Case 1: % 10.79/2.28 | | % 10.79/2.28 | | (35) ~ iext(uri_ex_hasCousin, uri_ex_bob, uri_ex_alice) % 10.79/2.28 | | % 10.79/2.28 | | GROUND_INST: instantiating (11) with uri_ex_hasCousin, all_5_2, % 10.79/2.28 | | uri_ex_hasUncle, all_5_1, all_5_0, uri_ex_bob, uri_ex_dave, % 10.79/2.28 | | uri_ex_alice, simplifying with (2), (3), (5), (6), (8), (15), % 10.79/2.28 | | (16), (19), (20), (22), (24), (30), (31), (32), (33), (35) % 10.79/2.28 | | gives: % 10.79/2.28 | | (36) $false % 10.79/2.28 | | % 10.79/2.28 | | CLOSE: (36) is inconsistent. % 10.79/2.28 | | % 10.79/2.28 | Case 2: % 10.79/2.28 | | % 10.79/2.28 | | (37) ~ iext(uri_ex_hasUncle, uri_ex_alice, uri_ex_charly) % 10.79/2.28 | | % 10.79/2.28 | | PRED_UNIFY: (34), (37) imply: % 10.79/2.28 | | (38) $false % 10.79/2.28 | | % 10.79/2.28 | | CLOSE: (38) is inconsistent. % 10.79/2.28 | | % 10.79/2.28 | End of split % 10.79/2.28 | % 10.79/2.28 End of proof % 10.79/2.28 % SZS output end Proof for theBenchmark % 10.79/2.28 % 10.79/2.28 1654ms %------------------------------------------------------------------------------