%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB014+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 : 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 : 300s % DateTime : Thu Aug 31 20:11:42 EDT 2023 % Result : Theorem 9.84s 2.08s % Output : Proof 10.91s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWB014+2 : TPTP v8.1.2. Released v5.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n021.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Sun Aug 27 07:05:42 EDT 2023 % 0.12/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.83/0.96 Prover 1: Preprocessing ... % 1.83/0.96 Prover 4: Preprocessing ... % 2.39/1.00 Prover 5: Preprocessing ... % 2.39/1.00 Prover 0: Preprocessing ... % 2.39/1.00 Prover 2: Preprocessing ... % 2.39/1.00 Prover 6: Preprocessing ... % 2.39/1.00 Prover 3: Preprocessing ... % 3.67/1.19 Prover 2: Constructing countermodel ... % 3.67/1.19 Prover 5: Proving ... % 3.89/1.21 Prover 6: Proving ... % 3.89/1.22 Prover 3: Constructing countermodel ... % 3.89/1.22 Prover 1: Constructing countermodel ... % 4.55/1.42 Prover 3: gave up % 4.55/1.42 Prover 1: gave up % 4.55/1.42 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.55/1.42 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.55/1.43 Prover 7: Preprocessing ... % 4.55/1.44 Prover 8: Preprocessing ... % 4.55/1.49 Prover 7: Constructing countermodel ... % 4.55/1.55 Prover 8: Warning: ignoring some quantifiers % 4.55/1.55 Prover 8: Constructing countermodel ... % 6.92/1.65 Prover 8: gave up % 6.92/1.66 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 6.92/1.67 Prover 9: Preprocessing ... % 7.68/1.75 Prover 4: Constructing countermodel ... % 8.50/1.88 Prover 0: Proving ... % 9.59/2.03 Prover 9: Constructing countermodel ... % 9.84/2.07 Prover 2: proved (1450ms) % 9.84/2.08 % 9.84/2.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.84/2.08 % 9.84/2.08 Prover 9: stopped % 9.84/2.09 Prover 6: stopped % 9.84/2.09 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.84/2.09 Prover 5: stopped % 9.84/2.10 Prover 0: stopped % 9.84/2.14 Prover 10: Preprocessing ... % 9.84/2.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.84/2.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.84/2.14 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.84/2.14 Prover 13: Preprocessing ... % 9.84/2.14 Prover 10: Constructing countermodel ... % 9.84/2.14 Prover 16: Preprocessing ... % 9.84/2.14 Prover 11: Preprocessing ... % 10.56/2.14 Prover 13: Constructing countermodel ... % 10.56/2.14 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 10.56/2.14 Prover 7: Found proof (size 16) % 10.56/2.14 Prover 7: proved (727ms) % 10.56/2.15 Prover 13: stopped % 10.56/2.15 Prover 10: stopped % 10.56/2.15 Prover 16: stopped % 10.56/2.15 Prover 19: Preprocessing ... % 10.56/2.16 Prover 4: stopped % 10.56/2.18 Prover 11: stopped % 10.91/2.20 Prover 19: Warning: ignoring some quantifiers % 10.91/2.20 Prover 19: Constructing countermodel ... % 10.91/2.20 Prover 19: stopped % 10.91/2.20 % 10.91/2.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.91/2.20 % 10.91/2.21 % SZS output start Proof for theBenchmark % 10.91/2.21 Assumptions after simplification: % 10.91/2.21 --------------------------------- % 10.91/2.21 % 10.91/2.21 (owl_bool_unionof_class_002) % 10.91/2.23 $i(uri_owl_unionOf) & $i(uri_rdf_nil) & $i(uri_rdf_rest) & $i(uri_rdf_first) & % 10.91/2.23 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.91/2.23 $i] : ( ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 10.91/2.23 | ~ icext(v4, v5) | ~ iext(uri_owl_unionOf, v0, v1) | ~ % 10.91/2.23 iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) | ~ % 10.91/2.23 iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | icext(v0, % 10.91/2.23 v5)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] % 10.91/2.23 : ! [v5: $i] : ( ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | % 10.91/2.23 ~ $i(v0) | ~ icext(v2, v5) | ~ iext(uri_owl_unionOf, v0, v1) | ~ % 10.91/2.23 iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) | ~ % 10.91/2.23 iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | icext(v0, % 10.91/2.23 v5)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] % 10.91/2.23 : ! [v5: $i] : ( ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | % 10.91/2.23 ~ $i(v0) | ~ icext(v0, v5) | ~ iext(uri_owl_unionOf, v0, v1) | ~ % 10.91/2.23 iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) | ~ % 10.91/2.23 iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | icext(v4, v5) % 10.91/2.23 | icext(v2, v5)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : % 10.91/2.23 ! [v4: $i] : ( ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.91/2.23 ic(v4) | ~ ic(v2) | ~ ic(v0) | ~ iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ % 10.91/2.23 iext(uri_rdf_rest, v1, v3) | ~ iext(uri_rdf_first, v3, v4) | ~ % 10.91/2.23 iext(uri_rdf_first, v1, v2) | iext(uri_owl_unionOf, v0, v1) | ? [v5: $i] : % 10.91/2.23 ($i(v5) & ( ~ icext(v0, v5) | ( ~ icext(v4, v5) & ~ icext(v2, v5))) & % 10.91/2.23 (icext(v4, v5) | icext(v2, v5) | icext(v0, v5)))) & ! [v0: $i] : ! [v1: % 10.91/2.23 $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ $i(v4) | ~ $i(v3) | ~ % 10.91/2.23 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ iext(uri_owl_unionOf, v0, v1) | ~ % 10.91/2.23 iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) | ~ % 10.91/2.23 iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | ic(v4)) & ! % 10.91/2.23 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ $i(v4) % 10.91/2.23 | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ iext(uri_owl_unionOf, % 10.91/2.23 v0, v1) | ~ iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, % 10.91/2.23 v1, v3) | ~ iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) % 10.91/2.23 | ic(v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: % 10.91/2.23 $i] : ( ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.91/2.23 iext(uri_owl_unionOf, v0, v1) | ~ iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ % 10.91/2.23 iext(uri_rdf_rest, v1, v3) | ~ iext(uri_rdf_first, v3, v4) | ~ % 10.91/2.23 iext(uri_rdf_first, v1, v2) | ic(v0)) % 10.91/2.23 % 10.91/2.23 (rdfs_cext_def) % 10.91/2.23 $i(uri_rdf_type) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 10.91/2.23 icext(v1, v0) | iext(uri_rdf_type, v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( % 10.91/2.23 ~ $i(v1) | ~ $i(v0) | ~ iext(uri_rdf_type, v0, v1) | icext(v1, v0)) % 10.91/2.23 % 10.91/2.23 (testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) % 10.91/2.23 $i(uri_ex_Species) & $i(uri_ex_harry) & $i(uri_rdf_type) & ! [v0: $i] : ( ~ % 10.91/2.23 $i(v0) | ~ iext(uri_rdf_type, v0, uri_ex_Species) | ~ iext(uri_rdf_type, % 10.91/2.23 uri_ex_harry, v0)) % 10.91/2.23 % 10.91/2.23 (testcase_premise_fullish_014_Harry_belongs_to_some_Species) % 10.91/2.24 $i(uri_ex_Falcon) & $i(uri_ex_Eagle) & $i(uri_ex_Species) & $i(uri_ex_harry) & % 10.91/2.24 $i(uri_owl_unionOf) & $i(uri_rdf_nil) & $i(uri_rdf_rest) & $i(uri_rdf_first) & % 10.91/2.24 $i(uri_rdf_type) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) % 10.91/2.24 & $i(v0) & iext(uri_owl_unionOf, v0, v1) & iext(uri_rdf_rest, v2, % 10.91/2.24 uri_rdf_nil) & iext(uri_rdf_rest, v1, v2) & iext(uri_rdf_first, v2, % 10.91/2.24 uri_ex_Falcon) & iext(uri_rdf_first, v1, uri_ex_Eagle) & % 10.91/2.24 iext(uri_rdf_type, uri_ex_Falcon, uri_ex_Species) & iext(uri_rdf_type, % 10.91/2.24 uri_ex_Eagle, uri_ex_Species) & iext(uri_rdf_type, uri_ex_harry, v0)) % 10.91/2.24 % 10.91/2.24 Those formulas are unsatisfiable: % 10.91/2.24 --------------------------------- % 10.91/2.24 % 10.91/2.24 Begin of proof % 10.91/2.24 | % 10.91/2.24 | ALPHA: (testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) % 10.91/2.24 | implies: % 10.91/2.24 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ iext(uri_rdf_type, v0, uri_ex_Species) | % 10.91/2.24 | ~ iext(uri_rdf_type, uri_ex_harry, v0)) % 10.91/2.24 | % 10.91/2.24 | ALPHA: (testcase_premise_fullish_014_Harry_belongs_to_some_Species) implies: % 10.91/2.24 | (2) $i(uri_ex_harry) % 10.91/2.24 | (3) $i(uri_ex_Eagle) % 10.91/2.24 | (4) $i(uri_ex_Falcon) % 10.91/2.24 | (5) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 10.91/2.24 | iext(uri_owl_unionOf, v0, v1) & iext(uri_rdf_rest, v2, uri_rdf_nil) & % 10.91/2.24 | iext(uri_rdf_rest, v1, v2) & iext(uri_rdf_first, v2, uri_ex_Falcon) & % 10.91/2.24 | iext(uri_rdf_first, v1, uri_ex_Eagle) & iext(uri_rdf_type, % 10.91/2.24 | uri_ex_Falcon, uri_ex_Species) & iext(uri_rdf_type, uri_ex_Eagle, % 10.91/2.24 | uri_ex_Species) & iext(uri_rdf_type, uri_ex_harry, v0)) % 10.91/2.24 | % 10.91/2.24 | ALPHA: (owl_bool_unionof_class_002) implies: % 10.91/2.24 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 10.91/2.24 | ! [v5: $i] : ( ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) % 10.91/2.24 | | ~ $i(v0) | ~ icext(v0, v5) | ~ iext(uri_owl_unionOf, v0, v1) | % 10.91/2.24 | ~ iext(uri_rdf_rest, v3, uri_rdf_nil) | ~ iext(uri_rdf_rest, v1, v3) % 10.91/2.24 | | ~ iext(uri_rdf_first, v3, v4) | ~ iext(uri_rdf_first, v1, v2) | % 10.91/2.24 | icext(v4, v5) | icext(v2, v5)) % 10.91/2.24 | % 10.91/2.24 | ALPHA: (rdfs_cext_def) implies: % 10.91/2.24 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 10.91/2.24 | iext(uri_rdf_type, v0, v1) | icext(v1, v0)) % 10.91/2.24 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ icext(v1, v0) | % 10.91/2.24 | iext(uri_rdf_type, v0, v1)) % 10.91/2.24 | % 10.91/2.24 | DELTA: instantiating (5) with fresh symbols all_6_0, all_6_1, all_6_2 gives: % 10.91/2.24 | (9) $i(all_6_0) & $i(all_6_1) & $i(all_6_2) & iext(uri_owl_unionOf, % 10.91/2.24 | all_6_2, all_6_1) & iext(uri_rdf_rest, all_6_0, uri_rdf_nil) & % 10.91/2.24 | iext(uri_rdf_rest, all_6_1, all_6_0) & iext(uri_rdf_first, all_6_0, % 10.91/2.24 | uri_ex_Falcon) & iext(uri_rdf_first, all_6_1, uri_ex_Eagle) & % 10.91/2.24 | iext(uri_rdf_type, uri_ex_Falcon, uri_ex_Species) & iext(uri_rdf_type, % 10.91/2.24 | uri_ex_Eagle, uri_ex_Species) & iext(uri_rdf_type, uri_ex_harry, % 10.91/2.24 | all_6_2) % 10.91/2.24 | % 10.91/2.24 | ALPHA: (9) implies: % 10.91/2.24 | (10) iext(uri_rdf_type, uri_ex_harry, all_6_2) % 10.91/2.25 | (11) iext(uri_rdf_type, uri_ex_Eagle, uri_ex_Species) % 10.91/2.25 | (12) iext(uri_rdf_type, uri_ex_Falcon, uri_ex_Species) % 10.91/2.25 | (13) iext(uri_rdf_first, all_6_1, uri_ex_Eagle) % 10.91/2.25 | (14) iext(uri_rdf_first, all_6_0, uri_ex_Falcon) % 10.91/2.25 | (15) iext(uri_rdf_rest, all_6_1, all_6_0) % 10.91/2.25 | (16) iext(uri_rdf_rest, all_6_0, uri_rdf_nil) % 10.91/2.25 | (17) iext(uri_owl_unionOf, all_6_2, all_6_1) % 10.91/2.25 | (18) $i(all_6_2) % 10.91/2.25 | (19) $i(all_6_1) % 10.91/2.25 | (20) $i(all_6_0) % 10.91/2.25 | % 10.91/2.25 | GROUND_INST: instantiating (7) with uri_ex_harry, all_6_2, simplifying with % 10.91/2.25 | (2), (10), (18) gives: % 10.91/2.25 | (21) icext(all_6_2, uri_ex_harry) % 10.91/2.25 | % 10.91/2.25 | GROUND_INST: instantiating (1) with uri_ex_Eagle, simplifying with (3), (11) % 10.91/2.25 | gives: % 10.91/2.25 | (22) ~ iext(uri_rdf_type, uri_ex_harry, uri_ex_Eagle) % 10.91/2.25 | % 10.91/2.25 | GROUND_INST: instantiating (1) with uri_ex_Falcon, simplifying with (4), (12) % 10.91/2.25 | gives: % 10.91/2.25 | (23) ~ iext(uri_rdf_type, uri_ex_harry, uri_ex_Falcon) % 10.91/2.25 | % 10.91/2.25 | GROUND_INST: instantiating (6) with all_6_2, all_6_1, uri_ex_Eagle, all_6_0, % 10.91/2.25 | uri_ex_Falcon, uri_ex_harry, simplifying with (2), (3), (4), % 10.91/2.25 | (13), (14), (15), (16), (17), (18), (19), (20), (21) gives: % 10.91/2.25 | (24) icext(uri_ex_Falcon, uri_ex_harry) | icext(uri_ex_Eagle, uri_ex_harry) % 10.91/2.25 | % 10.91/2.25 | BETA: splitting (24) gives: % 10.91/2.25 | % 10.91/2.25 | Case 1: % 10.91/2.25 | | % 10.91/2.25 | | (25) icext(uri_ex_Falcon, uri_ex_harry) % 10.91/2.25 | | % 10.91/2.25 | | GROUND_INST: instantiating (8) with uri_ex_harry, uri_ex_Falcon, simplifying % 10.91/2.25 | | with (2), (4), (23), (25) gives: % 10.91/2.25 | | (26) $false % 10.91/2.25 | | % 10.91/2.25 | | CLOSE: (26) is inconsistent. % 10.91/2.25 | | % 10.91/2.25 | Case 2: % 10.91/2.25 | | % 10.91/2.25 | | (27) icext(uri_ex_Eagle, uri_ex_harry) % 10.91/2.25 | | % 10.91/2.25 | | GROUND_INST: instantiating (8) with uri_ex_harry, uri_ex_Eagle, simplifying % 10.91/2.25 | | with (2), (3), (22), (27) gives: % 10.91/2.25 | | (28) $false % 10.91/2.25 | | % 10.91/2.25 | | CLOSE: (28) is inconsistent. % 10.91/2.25 | | % 10.91/2.25 | End of split % 10.91/2.25 | % 10.91/2.25 End of proof % 10.91/2.25 % SZS output end Proof for theBenchmark % 10.91/2.25 % 10.91/2.25 1652ms %------------------------------------------------------------------------------