%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB009+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 : n001.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:38 EDT 2023 % Result : Theorem 4.05s 1.36s % Output : Proof 5.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWB009+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.16/0.34 % Computer : n001.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Sun Aug 27 07:39:17 EDT 2023 % 0.16/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.06/1.01 Prover 1: Preprocessing ... % 2.06/1.01 Prover 4: Preprocessing ... % 2.06/1.05 Prover 3: Preprocessing ... % 2.06/1.05 Prover 6: Preprocessing ... % 2.06/1.05 Prover 0: Preprocessing ... % 2.06/1.05 Prover 5: Preprocessing ... % 2.06/1.05 Prover 2: Preprocessing ... % 3.08/1.17 Prover 2: Constructing countermodel ... % 3.08/1.18 Prover 5: Proving ... % 3.29/1.19 Prover 3: Constructing countermodel ... % 3.29/1.20 Prover 6: Proving ... % 3.29/1.22 Prover 1: Constructing countermodel ... % 3.55/1.26 Prover 4: Constructing countermodel ... % 3.55/1.29 Prover 0: Proving ... % 4.05/1.36 Prover 2: proved (729ms) % 4.05/1.36 % 4.05/1.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.05/1.36 % 4.05/1.36 Prover 3: stopped % 4.05/1.37 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.05/1.37 Prover 6: stopped % 4.05/1.37 Prover 0: stopped % 4.05/1.38 Prover 5: stopped % 4.05/1.38 Prover 7: Preprocessing ... % 4.05/1.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.05/1.38 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.05/1.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.05/1.40 Prover 10: Preprocessing ... % 4.05/1.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.05/1.40 Prover 11: Preprocessing ... % 4.05/1.41 Prover 8: Preprocessing ... % 4.05/1.42 Prover 13: Preprocessing ... % 4.05/1.43 Prover 10: Constructing countermodel ... % 4.05/1.44 Prover 13: Constructing countermodel ... % 4.05/1.46 Prover 1: Found proof (size 27) % 4.05/1.46 Prover 4: Found proof (size 18) % 4.05/1.46 Prover 4: proved (823ms) % 4.05/1.46 Prover 7: Constructing countermodel ... % 4.05/1.46 Prover 1: proved (832ms) % 4.05/1.46 Prover 10: stopped % 4.05/1.46 Prover 13: stopped % 4.05/1.46 Prover 7: stopped % 4.05/1.47 Prover 8: Warning: ignoring some quantifiers % 4.05/1.47 Prover 8: Constructing countermodel ... % 4.05/1.47 Prover 11: Constructing countermodel ... % 4.05/1.47 Prover 8: stopped % 5.14/1.48 Prover 11: stopped % 5.14/1.48 % 5.14/1.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.14/1.48 % 5.14/1.48 % SZS output start Proof for theBenchmark % 5.14/1.49 Assumptions after simplification: % 5.14/1.49 --------------------------------- % 5.14/1.49 % 5.14/1.49 (owl_restrict_somevaluesfrom) % 5.14/1.52 $i(uri_owl_onProperty) & $i(uri_owl_someValuesFrom) & ! [v0: $i] : ! [v1: % 5.14/1.52 $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : ! [v5: $i] : (v4 = 0 | ~ % 5.14/1.52 (icext(v2, v5) = 0) | ~ (icext(v0, v3) = v4) | ~ (iext(uri_owl_onProperty, % 5.14/1.52 v0, v1) = 0) | ~ (iext(uri_owl_someValuesFrom, v0, v2) = 0) | ~ $i(v5) % 5.14/1.52 | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: int] : ( ~ (v6 = % 5.14/1.52 0) & iext(v1, v3, v5) = v6)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 5.14/1.52 ! [v3: $i] : ! [v4: int] : ! [v5: $i] : (v4 = 0 | ~ (icext(v0, v3) = v4) | % 5.14/1.52 ~ (iext(v1, v3, v5) = 0) | ~ (iext(uri_owl_onProperty, v0, v1) = 0) | ~ % 5.14/1.52 (iext(uri_owl_someValuesFrom, v0, v2) = 0) | ~ $i(v5) | ~ $i(v3) | ~ % 5.14/1.52 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: int] : ( ~ (v6 = 0) & icext(v2, v5) % 5.14/1.52 = v6)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 5.14/1.52 (icext(v0, v3) = 0) | ~ (iext(uri_owl_onProperty, v0, v1) = 0) | ~ % 5.14/1.52 (iext(uri_owl_someValuesFrom, v0, v2) = 0) | ~ $i(v3) | ~ $i(v2) | ~ % 5.14/1.52 $i(v1) | ~ $i(v0) | ? [v4: $i] : (icext(v2, v4) = 0 & iext(v1, v3, v4) = 0 % 5.14/1.52 & $i(v4))) % 5.14/1.52 % 5.14/1.52 (rdfs_cext_def) % 5.14/1.53 $i(uri_rdf_type) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 5.14/1.53 (icext(v1, v0) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 5.14/1.53 iext(uri_rdf_type, v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 5.14/1.53 int] : (v2 = 0 | ~ (iext(uri_rdf_type, v0, v1) = v2) | ~ $i(v1) | ~ % 5.14/1.53 $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & icext(v1, v0) = v3)) & ! [v0: $i] : % 5.14/1.53 ! [v1: $i] : ( ~ (icext(v1, v0) = 0) | ~ $i(v1) | ~ $i(v0) | % 5.14/1.53 iext(uri_rdf_type, v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ % 5.14/1.53 (iext(uri_rdf_type, v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | icext(v1, v0) = % 5.14/1.53 0) % 5.14/1.53 % 5.14/1.53 (testcase_conclusion_fullish_009_Existential_Restriction_Entailments) % 5.14/1.53 $i(uri_ex_c) & $i(uri_ex_s) & $i(uri_ex_p) & $i(uri_rdf_type) & ! [v0: $i] : % 5.14/1.53 ( ~ (iext(uri_ex_p, uri_ex_s, v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = % 5.14/1.53 0) & iext(uri_rdf_type, v0, uri_ex_c) = v1)) & ! [v0: $i] : ( ~ % 5.14/1.53 (iext(uri_rdf_type, v0, uri_ex_c) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 % 5.14/1.53 = 0) & iext(uri_ex_p, uri_ex_s, v0) = v1)) % 5.14/1.53 % 5.14/1.53 (testcase_premise_fullish_009_Existential_Restriction_Entailments) % 5.14/1.54 $i(uri_owl_Restriction) & $i(uri_owl_Class) & $i(uri_owl_ObjectProperty) & % 5.14/1.54 $i(uri_ex_c) & $i(uri_ex_s) & $i(uri_ex_p) & $i(uri_owl_onProperty) & % 5.14/1.54 $i(uri_owl_someValuesFrom) & $i(uri_rdf_type) & ? [v0: $i] : % 5.14/1.54 (iext(uri_owl_onProperty, v0, uri_ex_p) = 0 & iext(uri_owl_someValuesFrom, v0, % 5.14/1.54 uri_ex_c) = 0 & iext(uri_rdf_type, v0, uri_owl_Restriction) = 0 & % 5.14/1.54 iext(uri_rdf_type, uri_ex_c, uri_owl_Class) = 0 & iext(uri_rdf_type, % 5.14/1.54 uri_ex_s, v0) = 0 & iext(uri_rdf_type, uri_ex_p, uri_owl_ObjectProperty) = % 5.14/1.54 0 & $i(v0)) % 5.14/1.54 % 5.14/1.54 (function-axioms) % 5.14/1.54 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 5.14/1.54 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4, % 5.14/1.54 v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 5.14/1.54 : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (icext(v3, v2) = v1) | ~ % 5.14/1.54 (icext(v3, v2) = v0)) % 5.14/1.54 % 5.14/1.54 Those formulas are unsatisfiable: % 5.14/1.54 --------------------------------- % 5.14/1.54 % 5.14/1.54 Begin of proof % 5.14/1.54 | % 5.14/1.54 | ALPHA: (rdfs_cext_def) implies: % 5.14/1.54 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_rdf_type, v0, v1) = 0) | ~ % 5.14/1.54 | $i(v1) | ~ $i(v0) | icext(v1, v0) = 0) % 5.14/1.54 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (icext(v1, v0) = 0) | ~ $i(v1) | ~ % 5.14/1.54 | $i(v0) | iext(uri_rdf_type, v0, v1) = 0) % 5.14/1.54 | % 5.14/1.54 | ALPHA: (owl_restrict_somevaluesfrom) implies: % 5.14/1.55 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (icext(v0, % 5.14/1.55 | v3) = 0) | ~ (iext(uri_owl_onProperty, v0, v1) = 0) | ~ % 5.14/1.55 | (iext(uri_owl_someValuesFrom, v0, v2) = 0) | ~ $i(v3) | ~ $i(v2) | % 5.14/1.55 | ~ $i(v1) | ~ $i(v0) | ? [v4: $i] : (icext(v2, v4) = 0 & iext(v1, % 5.14/1.55 | v3, v4) = 0 & $i(v4))) % 5.14/1.55 | % 5.14/1.55 | ALPHA: (testcase_premise_fullish_009_Existential_Restriction_Entailments) % 5.14/1.55 | implies: % 5.14/1.55 | (4) ? [v0: $i] : (iext(uri_owl_onProperty, v0, uri_ex_p) = 0 & % 5.14/1.55 | iext(uri_owl_someValuesFrom, v0, uri_ex_c) = 0 & iext(uri_rdf_type, % 5.14/1.55 | v0, uri_owl_Restriction) = 0 & iext(uri_rdf_type, uri_ex_c, % 5.14/1.55 | uri_owl_Class) = 0 & iext(uri_rdf_type, uri_ex_s, v0) = 0 & % 5.14/1.55 | iext(uri_rdf_type, uri_ex_p, uri_owl_ObjectProperty) = 0 & $i(v0)) % 5.14/1.55 | % 5.14/1.55 | ALPHA: (testcase_conclusion_fullish_009_Existential_Restriction_Entailments) % 5.14/1.55 | implies: % 5.14/1.55 | (5) $i(uri_ex_p) % 5.14/1.55 | (6) $i(uri_ex_s) % 5.14/1.55 | (7) $i(uri_ex_c) % 5.14/1.55 | (8) ! [v0: $i] : ( ~ (iext(uri_ex_p, uri_ex_s, v0) = 0) | ~ $i(v0) | ? % 5.14/1.55 | [v1: int] : ( ~ (v1 = 0) & iext(uri_rdf_type, v0, uri_ex_c) = v1)) % 5.14/1.55 | % 5.14/1.55 | ALPHA: (function-axioms) implies: % 5.14/1.55 | (9) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 5.14/1.55 | ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ % 5.14/1.55 | (iext(v4, v3, v2) = v0)) % 5.14/1.55 | % 5.14/1.55 | DELTA: instantiating (4) with fresh symbol all_7_0 gives: % 5.14/1.55 | (10) iext(uri_owl_onProperty, all_7_0, uri_ex_p) = 0 & % 5.14/1.55 | iext(uri_owl_someValuesFrom, all_7_0, uri_ex_c) = 0 & % 5.14/1.55 | iext(uri_rdf_type, all_7_0, uri_owl_Restriction) = 0 & % 5.14/1.55 | iext(uri_rdf_type, uri_ex_c, uri_owl_Class) = 0 & iext(uri_rdf_type, % 5.14/1.55 | uri_ex_s, all_7_0) = 0 & iext(uri_rdf_type, uri_ex_p, % 5.14/1.55 | uri_owl_ObjectProperty) = 0 & $i(all_7_0) % 5.14/1.55 | % 5.14/1.55 | ALPHA: (10) implies: % 5.14/1.55 | (11) $i(all_7_0) % 5.14/1.55 | (12) iext(uri_rdf_type, uri_ex_s, all_7_0) = 0 % 5.14/1.55 | (13) iext(uri_owl_someValuesFrom, all_7_0, uri_ex_c) = 0 % 5.14/1.56 | (14) iext(uri_owl_onProperty, all_7_0, uri_ex_p) = 0 % 5.14/1.56 | % 5.14/1.56 | GROUND_INST: instantiating (1) with uri_ex_s, all_7_0, simplifying with (6), % 5.14/1.56 | (11), (12) gives: % 5.14/1.56 | (15) icext(all_7_0, uri_ex_s) = 0 % 5.14/1.56 | % 5.14/1.56 | GROUND_INST: instantiating (3) with all_7_0, uri_ex_p, uri_ex_c, uri_ex_s, % 5.14/1.56 | simplifying with (5), (6), (7), (11), (13), (14), (15) gives: % 5.14/1.56 | (16) ? [v0: $i] : (icext(uri_ex_c, v0) = 0 & iext(uri_ex_p, uri_ex_s, v0) % 5.14/1.56 | = 0 & $i(v0)) % 5.14/1.56 | % 5.14/1.56 | DELTA: instantiating (16) with fresh symbol all_20_0 gives: % 5.14/1.56 | (17) icext(uri_ex_c, all_20_0) = 0 & iext(uri_ex_p, uri_ex_s, all_20_0) = 0 % 5.14/1.56 | & $i(all_20_0) % 5.14/1.56 | % 5.14/1.56 | ALPHA: (17) implies: % 5.14/1.56 | (18) $i(all_20_0) % 5.14/1.56 | (19) iext(uri_ex_p, uri_ex_s, all_20_0) = 0 % 5.14/1.56 | (20) icext(uri_ex_c, all_20_0) = 0 % 5.14/1.56 | % 5.14/1.56 | GROUND_INST: instantiating (8) with all_20_0, simplifying with (18), (19) % 5.14/1.56 | gives: % 5.14/1.56 | (21) ? [v0: int] : ( ~ (v0 = 0) & iext(uri_rdf_type, all_20_0, uri_ex_c) = % 5.14/1.56 | v0) % 5.14/1.56 | % 5.14/1.56 | GROUND_INST: instantiating (2) with all_20_0, uri_ex_c, simplifying with (7), % 5.14/1.56 | (18), (20) gives: % 5.14/1.56 | (22) iext(uri_rdf_type, all_20_0, uri_ex_c) = 0 % 5.14/1.56 | % 5.14/1.56 | DELTA: instantiating (21) with fresh symbol all_28_0 gives: % 5.14/1.56 | (23) ~ (all_28_0 = 0) & iext(uri_rdf_type, all_20_0, uri_ex_c) = all_28_0 % 5.14/1.56 | % 5.14/1.56 | ALPHA: (23) implies: % 5.14/1.56 | (24) ~ (all_28_0 = 0) % 5.14/1.56 | (25) iext(uri_rdf_type, all_20_0, uri_ex_c) = all_28_0 % 5.14/1.56 | % 5.14/1.56 | GROUND_INST: instantiating (9) with 0, all_28_0, uri_ex_c, all_20_0, % 5.14/1.56 | uri_rdf_type, simplifying with (22), (25) gives: % 5.14/1.56 | (26) all_28_0 = 0 % 5.14/1.56 | % 5.14/1.56 | REDUCE: (24), (26) imply: % 5.14/1.56 | (27) $false % 5.14/1.56 | % 5.14/1.56 | CLOSE: (27) is inconsistent. % 5.14/1.56 | % 5.14/1.56 End of proof % 5.14/1.56 % SZS output end Proof for theBenchmark % 5.14/1.56 % 5.14/1.56 957ms %------------------------------------------------------------------------------