%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB019+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 : n004.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:46 EDT 2023 % Result : Unsatisfiable 3.77s 1.24s % Output : Proof 4.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWB019+2 : TPTP v8.1.2. Released v5.2.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n004.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sun Aug 27 06:59:52 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 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 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 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 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 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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.69/0.97 Prover 4: Preprocessing ... % 1.69/0.97 Prover 1: Preprocessing ... % 2.08/1.02 Prover 0: Preprocessing ... % 2.08/1.02 Prover 2: Preprocessing ... % 2.08/1.02 Prover 5: Preprocessing ... % 2.08/1.02 Prover 3: Preprocessing ... % 2.08/1.02 Prover 6: Preprocessing ... % 2.92/1.13 Prover 5: Constructing countermodel ... % 2.92/1.14 Prover 1: Constructing countermodel ... % 2.92/1.14 Prover 2: Proving ... % 2.92/1.14 Prover 4: Constructing countermodel ... % 3.12/1.15 Prover 6: Proving ... % 3.12/1.15 Prover 3: Constructing countermodel ... % 3.12/1.18 Prover 0: Proving ... % 3.77/1.24 Prover 3: proved (613ms) % 3.77/1.24 % 3.77/1.24 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.77/1.24 % 3.77/1.24 Prover 5: stopped % 3.77/1.24 Prover 0: stopped % 3.77/1.24 Prover 2: stopped % 3.77/1.25 Prover 6: stopped % 3.77/1.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.77/1.25 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.77/1.25 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.77/1.25 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.77/1.25 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.77/1.27 Prover 8: Preprocessing ... % 3.77/1.27 Prover 11: Preprocessing ... % 3.77/1.27 Prover 10: Preprocessing ... % 3.77/1.27 Prover 7: Preprocessing ... % 3.77/1.28 Prover 13: Preprocessing ... % 4.14/1.29 Prover 1: Found proof (size 13) % 4.14/1.29 Prover 1: proved (661ms) % 4.14/1.29 Prover 11: stopped % 4.14/1.29 Prover 4: Found proof (size 11) % 4.14/1.29 Prover 4: proved (666ms) % 4.14/1.31 Prover 13: Constructing countermodel ... % 4.14/1.31 Prover 7: Constructing countermodel ... % 4.14/1.31 Prover 13: stopped % 4.14/1.31 Prover 7: stopped % 4.14/1.32 Prover 8: Warning: ignoring some quantifiers % 4.14/1.32 Prover 10: Constructing countermodel ... % 4.14/1.32 Prover 8: Constructing countermodel ... % 4.14/1.32 Prover 10: stopped % 4.14/1.33 Prover 8: stopped % 4.14/1.33 % 4.14/1.33 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.14/1.33 % 4.14/1.33 % SZS output start Proof for theBenchmark % 4.14/1.33 Assumptions after simplification: % 4.14/1.33 --------------------------------- % 4.14/1.33 % 4.14/1.33 (owl_eqdis_propertydisjointwith) % 4.14/1.37 $i(uri_owl_propertyDisjointWith) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : % 4.14/1.37 (v2 = 0 | ~ (iext(uri_owl_propertyDisjointWith, v0, v1) = v2) | ~ $i(v1) | % 4.14/1.37 ~ $i(v0) | ? [v3: any] : ? [v4: any] : (ip(v1) = v4 & ip(v0) = v3 & ( ~ % 4.14/1.37 (v4 = 0) | ~ (v3 = 0))) | ? [v3: $i] : ? [v4: $i] : (iext(v1, v3, v4) % 4.14/1.37 = 0 & iext(v0, v3, v4) = 0 & $i(v4) & $i(v3))) & ! [v0: $i] : ! [v1: $i] % 4.14/1.37 : ( ~ (iext(uri_owl_propertyDisjointWith, v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) % 4.14/1.37 | (ip(v1) = 0 & ip(v0) = 0 & ! [v2: $i] : ! [v3: $i] : ( ~ (iext(v0, v2, % 4.14/1.37 v3) = 0) | ~ $i(v3) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & % 4.14/1.37 iext(v1, v2, v3) = v4)))) % 4.14/1.37 % 4.14/1.37 (testcase_premise_fullish_019_Disjoint_Annotation_Properties) % 4.14/1.37 $i(dat_str_foo) & $i(uri_ex_foo) & $i(uri_skos_altLabel) & $i(uri_rdfs_label) % 4.14/1.37 & $i(uri_rdfs_subPropertyOf) & $i(uri_owl_AnnotationProperty) & % 4.14/1.37 $i(uri_skos_prefLabel) & $i(uri_rdf_type) & $i(uri_owl_propertyDisjointWith) & % 4.14/1.37 ? [v0: $i] : (literal_plain(dat_str_foo) = v0 & iext(uri_skos_altLabel, % 4.14/1.37 uri_ex_foo, v0) = 0 & iext(uri_rdfs_subPropertyOf, uri_skos_altLabel, % 4.14/1.37 uri_rdfs_label) = 0 & iext(uri_rdfs_subPropertyOf, uri_skos_prefLabel, % 4.14/1.37 uri_rdfs_label) = 0 & iext(uri_skos_prefLabel, uri_ex_foo, v0) = 0 & % 4.14/1.37 iext(uri_rdf_type, uri_skos_altLabel, uri_owl_AnnotationProperty) = 0 & % 4.14/1.37 iext(uri_rdf_type, uri_skos_prefLabel, uri_owl_AnnotationProperty) = 0 & % 4.14/1.37 iext(uri_owl_propertyDisjointWith, uri_skos_prefLabel, uri_skos_altLabel) = % 4.14/1.37 0 & $i(v0)) % 4.14/1.37 % 4.14/1.37 (function-axioms) % 4.14/1.37 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 4.14/1.37 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4, % 4.14/1.37 v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 4.14/1.37 (literal_plain(v2) = v1) | ~ (literal_plain(v2) = v0)) & ! [v0: % 4.14/1.38 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 4.14/1.38 ~ (ip(v2) = v1) | ~ (ip(v2) = v0)) % 4.14/1.38 % 4.14/1.38 Those formulas are unsatisfiable: % 4.14/1.38 --------------------------------- % 4.14/1.38 % 4.14/1.38 Begin of proof % 4.14/1.38 | % 4.14/1.38 | ALPHA: (owl_eqdis_propertydisjointwith) implies: % 4.14/1.38 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_owl_propertyDisjointWith, v0, % 4.14/1.38 | v1) = 0) | ~ $i(v1) | ~ $i(v0) | (ip(v1) = 0 & ip(v0) = 0 & ! % 4.14/1.38 | [v2: $i] : ! [v3: $i] : ( ~ (iext(v0, v2, v3) = 0) | ~ $i(v3) | % 4.14/1.38 | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & iext(v1, v2, v3) = % 4.14/1.38 | v4)))) % 4.14/1.38 | % 4.14/1.38 | ALPHA: (testcase_premise_fullish_019_Disjoint_Annotation_Properties) implies: % 4.14/1.38 | (2) $i(uri_skos_prefLabel) % 4.14/1.38 | (3) $i(uri_skos_altLabel) % 4.14/1.38 | (4) $i(uri_ex_foo) % 4.14/1.39 | (5) ? [v0: $i] : (literal_plain(dat_str_foo) = v0 & % 4.14/1.39 | iext(uri_skos_altLabel, uri_ex_foo, v0) = 0 & % 4.14/1.39 | iext(uri_rdfs_subPropertyOf, uri_skos_altLabel, uri_rdfs_label) = 0 & % 4.14/1.39 | iext(uri_rdfs_subPropertyOf, uri_skos_prefLabel, uri_rdfs_label) = 0 % 4.14/1.39 | & iext(uri_skos_prefLabel, uri_ex_foo, v0) = 0 & iext(uri_rdf_type, % 4.14/1.39 | uri_skos_altLabel, uri_owl_AnnotationProperty) = 0 & % 4.14/1.39 | iext(uri_rdf_type, uri_skos_prefLabel, uri_owl_AnnotationProperty) = % 4.14/1.39 | 0 & iext(uri_owl_propertyDisjointWith, uri_skos_prefLabel, % 4.14/1.39 | uri_skos_altLabel) = 0 & $i(v0)) % 4.14/1.39 | % 4.14/1.39 | ALPHA: (function-axioms) implies: % 4.14/1.39 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.14/1.39 | ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ % 4.14/1.39 | (iext(v4, v3, v2) = v0)) % 4.14/1.39 | % 4.14/1.39 | DELTA: instantiating (5) with fresh symbol all_5_0 gives: % 4.14/1.39 | (7) literal_plain(dat_str_foo) = all_5_0 & iext(uri_skos_altLabel, % 4.14/1.39 | uri_ex_foo, all_5_0) = 0 & iext(uri_rdfs_subPropertyOf, % 4.14/1.39 | uri_skos_altLabel, uri_rdfs_label) = 0 & iext(uri_rdfs_subPropertyOf, % 4.14/1.39 | uri_skos_prefLabel, uri_rdfs_label) = 0 & iext(uri_skos_prefLabel, % 4.14/1.39 | uri_ex_foo, all_5_0) = 0 & iext(uri_rdf_type, uri_skos_altLabel, % 4.14/1.39 | uri_owl_AnnotationProperty) = 0 & iext(uri_rdf_type, % 4.14/1.39 | uri_skos_prefLabel, uri_owl_AnnotationProperty) = 0 & % 4.14/1.39 | iext(uri_owl_propertyDisjointWith, uri_skos_prefLabel, % 4.14/1.39 | uri_skos_altLabel) = 0 & $i(all_5_0) % 4.14/1.39 | % 4.14/1.39 | ALPHA: (7) implies: % 4.14/1.39 | (8) $i(all_5_0) % 4.14/1.39 | (9) iext(uri_owl_propertyDisjointWith, uri_skos_prefLabel, % 4.14/1.39 | uri_skos_altLabel) = 0 % 4.14/1.39 | (10) iext(uri_skos_prefLabel, uri_ex_foo, all_5_0) = 0 % 4.14/1.39 | (11) iext(uri_skos_altLabel, uri_ex_foo, all_5_0) = 0 % 4.14/1.39 | % 4.14/1.39 | GROUND_INST: instantiating (1) with uri_skos_prefLabel, uri_skos_altLabel, % 4.14/1.40 | simplifying with (2), (3), (9) gives: % 4.14/1.40 | (12) ip(uri_skos_altLabel) = 0 & ip(uri_skos_prefLabel) = 0 & ! [v0: $i] : % 4.14/1.40 | ! [v1: $i] : ( ~ (iext(uri_skos_prefLabel, v0, v1) = 0) | ~ $i(v1) | % 4.14/1.40 | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & iext(uri_skos_altLabel, % 4.14/1.40 | v0, v1) = v2)) % 4.14/1.40 | % 4.14/1.40 | ALPHA: (12) implies: % 4.14/1.40 | (13) ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_skos_prefLabel, v0, v1) = 0) % 4.14/1.40 | | ~ $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 4.14/1.40 | iext(uri_skos_altLabel, v0, v1) = v2)) % 4.14/1.40 | % 4.14/1.40 | GROUND_INST: instantiating (13) with uri_ex_foo, all_5_0, simplifying with % 4.14/1.40 | (4), (8), (10) gives: % 4.14/1.40 | (14) ? [v0: int] : ( ~ (v0 = 0) & iext(uri_skos_altLabel, uri_ex_foo, % 4.14/1.40 | all_5_0) = v0) % 4.14/1.40 | % 4.14/1.40 | DELTA: instantiating (14) with fresh symbol all_14_0 gives: % 4.14/1.40 | (15) ~ (all_14_0 = 0) & iext(uri_skos_altLabel, uri_ex_foo, all_5_0) = % 4.14/1.40 | all_14_0 % 4.14/1.40 | % 4.14/1.40 | ALPHA: (15) implies: % 4.14/1.40 | (16) ~ (all_14_0 = 0) % 4.14/1.40 | (17) iext(uri_skos_altLabel, uri_ex_foo, all_5_0) = all_14_0 % 4.14/1.40 | % 4.14/1.40 | GROUND_INST: instantiating (6) with 0, all_14_0, all_5_0, uri_ex_foo, % 4.14/1.40 | uri_skos_altLabel, simplifying with (11), (17) gives: % 4.14/1.40 | (18) all_14_0 = 0 % 4.14/1.40 | % 4.14/1.40 | REDUCE: (16), (18) imply: % 4.14/1.40 | (19) $false % 4.14/1.40 | % 4.14/1.40 | CLOSE: (19) is inconsistent. % 4.14/1.40 | % 4.14/1.40 End of proof % 4.14/1.40 % SZS output end Proof for theBenchmark % 4.14/1.40 % 4.14/1.40 798ms %------------------------------------------------------------------------------