%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS074+1 : TPTP v8.1.2. Released v3.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n027.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 05:51:09 EDT 2023 % Result : Unsatisfiable 6.51s 1.62s % Output : Proof 7.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KRS074+1 : TPTP v8.1.2. Released v3.1.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n027.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 : Mon Aug 28 02:40:21 EDT 2023 % 0.19/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 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 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 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 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 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 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 % 2.65/1.08 Prover 4: Preprocessing ... % 2.65/1.08 Prover 1: Preprocessing ... % 2.65/1.12 Prover 0: Preprocessing ... % 2.65/1.12 Prover 6: Preprocessing ... % 2.65/1.12 Prover 3: Preprocessing ... % 2.65/1.12 Prover 5: Preprocessing ... % 2.65/1.14 Prover 2: Preprocessing ... % 5.44/1.48 Prover 5: Proving ... % 5.44/1.48 Prover 2: Proving ... % 5.90/1.55 Prover 6: Proving ... % 5.90/1.56 Prover 3: Constructing countermodel ... % 5.90/1.56 Prover 1: Constructing countermodel ... % 6.51/1.62 Prover 5: proved (996ms) % 6.51/1.62 % 6.51/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.51/1.62 % 6.51/1.62 Prover 3: stopped % 6.51/1.62 Prover 2: stopped % 6.51/1.62 Prover 6: stopped % 6.51/1.62 Prover 4: Constructing countermodel ... % 6.51/1.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.51/1.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.51/1.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.51/1.63 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.51/1.65 Prover 0: Proving ... % 6.51/1.66 Prover 0: stopped % 6.51/1.67 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.94/1.69 Prover 8: Preprocessing ... % 6.94/1.69 Prover 7: Preprocessing ... % 6.94/1.70 Prover 10: Preprocessing ... % 6.94/1.71 Prover 11: Preprocessing ... % 6.94/1.72 Prover 13: Preprocessing ... % 6.94/1.75 Prover 1: Found proof (size 13) % 6.94/1.75 Prover 1: proved (1133ms) % 6.94/1.76 Prover 4: stopped % 7.50/1.77 Prover 11: stopped % 7.50/1.77 Prover 10: Warning: ignoring some quantifiers % 7.63/1.78 Prover 13: Warning: ignoring some quantifiers % 7.63/1.78 Prover 7: Warning: ignoring some quantifiers % 7.63/1.78 Prover 10: Constructing countermodel ... % 7.63/1.78 Prover 13: Constructing countermodel ... % 7.63/1.78 Prover 7: Constructing countermodel ... % 7.63/1.79 Prover 10: stopped % 7.63/1.79 Prover 13: stopped % 7.63/1.79 Prover 7: stopped % 7.87/1.83 Prover 8: Warning: ignoring some quantifiers % 7.87/1.83 Prover 8: Constructing countermodel ... % 7.98/1.84 Prover 8: stopped % 7.98/1.84 % 7.98/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.98/1.84 % 7.98/1.85 % SZS output start Proof for theBenchmark % 7.98/1.85 Assumptions after simplification: % 7.98/1.85 --------------------------------- % 7.98/1.85 % 7.98/1.85 (axiom_2) % 7.98/1.88 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~ % 7.98/1.88 $i(v0) | ? [v2: $i] : (rs(v0, v2) = 0 & cp(v2) = 0 & $i(v2)) | ! [v2: $i] % 7.98/1.88 : ( ~ (cp(v2) = 0) | ~ $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & rs(v0, v2) = % 7.98/1.88 v3) | ! [v3: $i] : ( ~ (rinvS(v2, v3) = 0) | ~ $i(v3) | ? [v4: int] : % 7.98/1.88 ( ~ (v4 = 0) & cp(v3) = v4)))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = % 7.98/1.88 0) | ~ $i(v0) | ( ! [v1: $i] : ( ~ (cp(v1) = 0) | ~ $i(v1) | ? [v2: % 7.98/1.88 int] : ( ~ (v2 = 0) & rs(v0, v1) = v2)) & ? [v1: $i] : (rs(v0, v1) = % 7.98/1.88 0 & cp(v1) = 0 & $i(v1) & ? [v2: $i] : (rinvS(v1, v2) = 0 & cp(v2) = 0 % 7.98/1.88 & $i(v2))))) % 7.98/1.88 % 7.98/1.88 (axiom_9) % 7.98/1.88 cUnsatisfiable(i2003_11_14_17_18_59896) = 0 & $i(i2003_11_14_17_18_59896) % 7.98/1.88 % 7.98/1.88 (function-axioms) % 7.98/1.89 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 7.98/1.89 [v3: $i] : (v1 = v0 | ~ (rs(v3, v2) = v1) | ~ (rs(v3, v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.98/1.89 : (v1 = v0 | ~ (rinvS(v3, v2) = v1) | ~ (rinvS(v3, v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.98/1.89 : (v1 = v0 | ~ (rinvF1(v3, v2) = v1) | ~ (rinvF1(v3, v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.98/1.89 : (v1 = v0 | ~ (rinvF(v3, v2) = v1) | ~ (rinvF(v3, v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.98/1.89 : (v1 = v0 | ~ (rf1(v3, v2) = v1) | ~ (rf1(v3, v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.98/1.89 : (v1 = v0 | ~ (rf(v3, v2) = v1) | ~ (rf(v3, v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.98/1.89 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.98/1.89 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 7.98/1.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.98/1.89 ~ (cp(v2) = v1) | ~ (cp(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.98/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ % 7.98/1.89 (cowlThing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.98/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ % 7.98/1.89 (cowlNothing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.98/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | % 7.98/1.89 ~ (cUnsatisfiable(v2) = v0)) % 7.98/1.89 % 7.98/1.89 Further assumptions not needed in the proof: % 7.98/1.89 -------------------------------------------- % 7.98/1.89 axiom_0, axiom_1, axiom_10, axiom_11, axiom_3, axiom_4, axiom_5, axiom_6, % 7.98/1.89 axiom_7, axiom_8, cUnsatisfiable_substitution_1, cowlNothing_substitution_1, % 7.98/1.89 cowlThing_substitution_1, cp_substitution_1, rf1_substitution_1, % 7.98/1.89 rf1_substitution_2, rf_substitution_1, rf_substitution_2, rinvF1_substitution_1, % 7.98/1.89 rinvF1_substitution_2, rinvF_substitution_1, rinvF_substitution_2, % 7.98/1.89 rinvS_substitution_1, rinvS_substitution_2, rs_substitution_1, % 7.98/1.89 rs_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 7.98/1.89 % 7.98/1.89 Those formulas are unsatisfiable: % 7.98/1.89 --------------------------------- % 7.98/1.89 % 7.98/1.89 Begin of proof % 7.98/1.89 | % 7.98/1.89 | ALPHA: (axiom_2) implies: % 7.98/1.89 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] : % 7.98/1.89 | ( ~ (cp(v1) = 0) | ~ $i(v1) | ? [v2: int] : ( ~ (v2 = 0) & rs(v0, % 7.98/1.89 | v1) = v2)) & ? [v1: $i] : (rs(v0, v1) = 0 & cp(v1) = 0 & % 7.98/1.89 | $i(v1) & ? [v2: $i] : (rinvS(v1, v2) = 0 & cp(v2) = 0 & % 7.98/1.89 | $i(v2))))) % 7.98/1.89 | % 7.98/1.89 | ALPHA: (axiom_9) implies: % 7.98/1.90 | (2) $i(i2003_11_14_17_18_59896) % 7.98/1.90 | (3) cUnsatisfiable(i2003_11_14_17_18_59896) = 0 % 7.98/1.90 | % 7.98/1.90 | ALPHA: (function-axioms) implies: % 7.98/1.90 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.98/1.90 | ! [v3: $i] : (v1 = v0 | ~ (rs(v3, v2) = v1) | ~ (rs(v3, v2) = v0)) % 7.98/1.90 | % 7.98/1.90 | GROUND_INST: instantiating (1) with i2003_11_14_17_18_59896, simplifying with % 7.98/1.90 | (2), (3) gives: % 7.98/1.90 | (5) ! [v0: $i] : ( ~ (cp(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = % 7.98/1.90 | 0) & rs(i2003_11_14_17_18_59896, v0) = v1)) & ? [v0: $i] : % 7.98/1.90 | (rs(i2003_11_14_17_18_59896, v0) = 0 & cp(v0) = 0 & $i(v0) & ? [v1: % 7.98/1.90 | $i] : (rinvS(v0, v1) = 0 & cp(v1) = 0 & $i(v1))) % 7.98/1.90 | % 7.98/1.90 | ALPHA: (5) implies: % 7.98/1.90 | (6) ! [v0: $i] : ( ~ (cp(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = % 7.98/1.90 | 0) & rs(i2003_11_14_17_18_59896, v0) = v1)) % 7.98/1.90 | (7) ? [v0: $i] : (rs(i2003_11_14_17_18_59896, v0) = 0 & cp(v0) = 0 & % 7.98/1.90 | $i(v0) & ? [v1: $i] : (rinvS(v0, v1) = 0 & cp(v1) = 0 & $i(v1))) % 7.98/1.90 | % 7.98/1.90 | DELTA: instantiating (7) with fresh symbol all_21_0 gives: % 7.98/1.90 | (8) rs(i2003_11_14_17_18_59896, all_21_0) = 0 & cp(all_21_0) = 0 & % 7.98/1.90 | $i(all_21_0) & ? [v0: $i] : (rinvS(all_21_0, v0) = 0 & cp(v0) = 0 & % 7.98/1.90 | $i(v0)) % 7.98/1.90 | % 7.98/1.90 | ALPHA: (8) implies: % 7.98/1.90 | (9) $i(all_21_0) % 7.98/1.90 | (10) cp(all_21_0) = 0 % 7.98/1.90 | (11) rs(i2003_11_14_17_18_59896, all_21_0) = 0 % 7.98/1.90 | % 7.98/1.90 | GROUND_INST: instantiating (6) with all_21_0, simplifying with (9), (10) % 7.98/1.90 | gives: % 7.98/1.90 | (12) ? [v0: int] : ( ~ (v0 = 0) & rs(i2003_11_14_17_18_59896, all_21_0) = % 7.98/1.90 | v0) % 7.98/1.90 | % 7.98/1.90 | DELTA: instantiating (12) with fresh symbol all_33_0 gives: % 7.98/1.91 | (13) ~ (all_33_0 = 0) & rs(i2003_11_14_17_18_59896, all_21_0) = all_33_0 % 7.98/1.91 | % 7.98/1.91 | ALPHA: (13) implies: % 7.98/1.91 | (14) ~ (all_33_0 = 0) % 7.98/1.91 | (15) rs(i2003_11_14_17_18_59896, all_21_0) = all_33_0 % 7.98/1.91 | % 7.98/1.91 | GROUND_INST: instantiating (4) with 0, all_33_0, all_21_0, % 7.98/1.91 | i2003_11_14_17_18_59896, simplifying with (11), (15) gives: % 7.98/1.91 | (16) all_33_0 = 0 % 7.98/1.91 | % 7.98/1.91 | REDUCE: (14), (16) imply: % 7.98/1.91 | (17) $false % 7.98/1.91 | % 7.98/1.91 | CLOSE: (17) is inconsistent. % 7.98/1.91 | % 7.98/1.91 End of proof % 7.98/1.91 % SZS output end Proof for theBenchmark % 7.98/1.91 % 7.98/1.91 1309ms %------------------------------------------------------------------------------