%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB006+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 : n017.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:36 EDT 2023 % Result : Theorem 3.48s 1.20s % Output : Proof 4.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWB006+2 : TPTP v8.1.2. Released v5.2.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n017.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Sun Aug 27 06:19:26 EDT 2023 % 0.14/0.34 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.02/0.98 Prover 4: Preprocessing ... % 2.02/0.98 Prover 1: Preprocessing ... % 2.27/1.03 Prover 5: Preprocessing ... % 2.27/1.03 Prover 6: Preprocessing ... % 2.27/1.03 Prover 3: Preprocessing ... % 2.27/1.03 Prover 0: Preprocessing ... % 2.27/1.03 Prover 2: Preprocessing ... % 2.27/1.10 Prover 2: Proving ... % 2.27/1.11 Prover 1: Constructing countermodel ... % 2.27/1.11 Prover 5: Proving ... % 2.27/1.11 Prover 0: Proving ... % 2.27/1.11 Prover 3: Constructing countermodel ... % 2.27/1.11 Prover 4: Constructing countermodel ... % 2.27/1.11 Prover 6: Constructing countermodel ... % 3.48/1.20 Prover 5: proved (563ms) % 3.48/1.20 % 3.48/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.48/1.20 % 3.48/1.20 Prover 0: proved (574ms) % 3.48/1.20 % 3.48/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.48/1.20 % 3.48/1.20 Prover 3: stopped % 3.48/1.20 Prover 6: stopped % 3.48/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.48/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.48/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.48/1.20 Prover 2: stopped % 3.48/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.48/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.48/1.22 Prover 7: Preprocessing ... % 3.48/1.23 Prover 13: Preprocessing ... % 3.48/1.23 Prover 11: Preprocessing ... % 3.48/1.23 Prover 4: Found proof (size 19) % 3.48/1.23 Prover 4: proved (596ms) % 3.48/1.23 Prover 8: Preprocessing ... % 3.48/1.23 Prover 10: Preprocessing ... % 3.48/1.24 Prover 1: Found proof (size 22) % 3.48/1.24 Prover 1: proved (608ms) % 3.48/1.24 Prover 7: Warning: ignoring some quantifiers % 3.48/1.25 Prover 7: Constructing countermodel ... % 3.48/1.26 Prover 7: stopped % 3.48/1.26 Prover 13: Warning: ignoring some quantifiers % 3.48/1.26 Prover 10: Warning: ignoring some quantifiers % 3.48/1.26 Prover 13: Constructing countermodel ... % 3.48/1.26 Prover 10: Constructing countermodel ... % 3.48/1.26 Prover 11: Constructing countermodel ... % 3.48/1.26 Prover 8: Warning: ignoring some quantifiers % 3.48/1.27 Prover 13: stopped % 3.48/1.27 Prover 10: stopped % 3.48/1.27 Prover 8: Constructing countermodel ... % 3.48/1.27 Prover 11: stopped % 4.00/1.27 Prover 8: stopped % 4.00/1.27 % 4.00/1.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.00/1.27 % 4.00/1.28 % SZS output start Proof for theBenchmark % 4.00/1.28 Assumptions after simplification: % 4.00/1.28 --------------------------------- % 4.00/1.28 % 4.00/1.28 (owl_eqdis_sameas) % 4.00/1.32 $i(uri_owl_sameAs) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ % 4.00/1.32 (iext(uri_owl_sameAs, v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : % 4.00/1.32 ! [v1: int] : (v1 = 0 | ~ (iext(uri_owl_sameAs, v0, v0) = v1) | ~ $i(v0)) % 4.00/1.32 % 4.00/1.32 (testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) % 4.00/1.32 $i(uri_ex_w) & $i(uri_ex_u) & $i(uri_owl_sameAs) & ? [v0: int] : ( ~ (v0 = 0) % 4.00/1.32 & iext(uri_owl_sameAs, uri_ex_u, uri_ex_w) = v0) % 4.00/1.32 % 4.00/1.32 (testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) % 4.00/1.32 $i(dat_str_abc) & $i(uri_ex_w) & $i(uri_ex_u) & $i(uri_owl_sameAs) & ? [v0: % 4.00/1.32 $i] : ? [v1: $i] : (literal_plain(dat_str_abc) = v0 & iext(uri_owl_sameAs, % 4.00/1.32 v1, v0) = 0 & iext(uri_owl_sameAs, v1, uri_ex_w) = 0 & % 4.00/1.32 iext(uri_owl_sameAs, uri_ex_u, v0) = 0 & $i(v1) & $i(v0)) % 4.00/1.32 % 4.00/1.32 (function-axioms) % 4.00/1.33 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 4.00/1.33 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4, % 4.00/1.33 v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 4.00/1.33 (literal_plain(v2) = v1) | ~ (literal_plain(v2) = v0)) % 4.00/1.33 % 4.00/1.33 Those formulas are unsatisfiable: % 4.00/1.33 --------------------------------- % 4.00/1.33 % 4.00/1.33 Begin of proof % 4.00/1.33 | % 4.00/1.33 | ALPHA: (owl_eqdis_sameas) implies: % 4.00/1.33 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (iext(uri_owl_sameAs, v0, v1) % 4.00/1.33 | = 0) | ~ $i(v1) | ~ $i(v0)) % 4.00/1.33 | % 4.00/1.33 | ALPHA: (testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) % 4.00/1.33 | implies: % 4.00/1.33 | (2) ? [v0: $i] : ? [v1: $i] : (literal_plain(dat_str_abc) = v0 & % 4.00/1.33 | iext(uri_owl_sameAs, v1, v0) = 0 & iext(uri_owl_sameAs, v1, uri_ex_w) % 4.00/1.33 | = 0 & iext(uri_owl_sameAs, uri_ex_u, v0) = 0 & $i(v1) & $i(v0)) % 4.00/1.33 | % 4.00/1.33 | ALPHA: (testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) % 4.00/1.33 | implies: % 4.00/1.33 | (3) $i(uri_ex_u) % 4.00/1.33 | (4) $i(uri_ex_w) % 4.00/1.34 | (5) ? [v0: int] : ( ~ (v0 = 0) & iext(uri_owl_sameAs, uri_ex_u, uri_ex_w) % 4.00/1.34 | = v0) % 4.00/1.34 | % 4.00/1.34 | ALPHA: (function-axioms) implies: % 4.00/1.34 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.00/1.34 | ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ % 4.00/1.34 | (iext(v4, v3, v2) = v0)) % 4.00/1.34 | % 4.00/1.34 | DELTA: instantiating (5) with fresh symbol all_5_0 gives: % 4.00/1.34 | (7) ~ (all_5_0 = 0) & iext(uri_owl_sameAs, uri_ex_u, uri_ex_w) = all_5_0 % 4.00/1.34 | % 4.00/1.34 | ALPHA: (7) implies: % 4.00/1.34 | (8) ~ (all_5_0 = 0) % 4.00/1.34 | (9) iext(uri_owl_sameAs, uri_ex_u, uri_ex_w) = all_5_0 % 4.00/1.34 | % 4.00/1.34 | DELTA: instantiating (2) with fresh symbols all_7_0, all_7_1 gives: % 4.00/1.34 | (10) literal_plain(dat_str_abc) = all_7_1 & iext(uri_owl_sameAs, all_7_0, % 4.00/1.34 | all_7_1) = 0 & iext(uri_owl_sameAs, all_7_0, uri_ex_w) = 0 & % 4.00/1.34 | iext(uri_owl_sameAs, uri_ex_u, all_7_1) = 0 & $i(all_7_0) & % 4.00/1.34 | $i(all_7_1) % 4.00/1.34 | % 4.00/1.34 | ALPHA: (10) implies: % 4.00/1.34 | (11) $i(all_7_1) % 4.00/1.34 | (12) $i(all_7_0) % 4.00/1.34 | (13) iext(uri_owl_sameAs, uri_ex_u, all_7_1) = 0 % 4.00/1.34 | (14) iext(uri_owl_sameAs, all_7_0, uri_ex_w) = 0 % 4.00/1.34 | (15) iext(uri_owl_sameAs, all_7_0, all_7_1) = 0 % 4.00/1.34 | % 4.00/1.35 | GROUND_INST: instantiating (1) with uri_ex_u, all_7_1, simplifying with (3), % 4.00/1.35 | (11), (13) gives: % 4.00/1.35 | (16) all_7_1 = uri_ex_u % 4.00/1.35 | % 4.00/1.35 | GROUND_INST: instantiating (1) with all_7_0, uri_ex_w, simplifying with (4), % 4.00/1.35 | (12), (14) gives: % 4.00/1.35 | (17) all_7_0 = uri_ex_w % 4.00/1.35 | % 4.00/1.35 | GROUND_INST: instantiating (1) with all_7_0, all_7_1, simplifying with (11), % 4.00/1.35 | (12), (15) gives: % 4.00/1.35 | (18) all_7_0 = all_7_1 % 4.00/1.35 | % 4.00/1.35 | COMBINE_EQS: (17), (18) imply: % 4.00/1.35 | (19) all_7_1 = uri_ex_w % 4.00/1.35 | % 4.00/1.35 | COMBINE_EQS: (16), (19) imply: % 4.00/1.35 | (20) uri_ex_w = uri_ex_u % 4.00/1.35 | % 4.00/1.35 | SIMP: (20) implies: % 4.00/1.35 | (21) uri_ex_w = uri_ex_u % 4.00/1.35 | % 4.00/1.35 | REDUCE: (13), (16) imply: % 4.00/1.35 | (22) iext(uri_owl_sameAs, uri_ex_u, uri_ex_u) = 0 % 4.00/1.35 | % 4.00/1.35 | REDUCE: (9), (21) imply: % 4.00/1.35 | (23) iext(uri_owl_sameAs, uri_ex_u, uri_ex_u) = all_5_0 % 4.00/1.35 | % 4.00/1.35 | GROUND_INST: instantiating (6) with 0, all_5_0, uri_ex_u, uri_ex_u, % 4.00/1.35 | uri_owl_sameAs, simplifying with (22), (23) gives: % 4.00/1.35 | (24) all_5_0 = 0 % 4.00/1.35 | % 4.00/1.35 | REDUCE: (8), (24) imply: % 4.00/1.35 | (25) $false % 4.00/1.35 | % 4.00/1.35 | CLOSE: (25) is inconsistent. % 4.00/1.35 | % 4.00/1.35 End of proof % 4.00/1.35 % SZS output end Proof for theBenchmark % 4.00/1.35 % 4.00/1.35 743ms %------------------------------------------------------------------------------