%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS099+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 : n028.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:14 EDT 2023 % Result : Unsatisfiable 4.82s 1.50s % Output : Proof 6.94s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : KRS099+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n028.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Mon Aug 28 01:39:09 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.09/1.06 Prover 4: Preprocessing ... % 2.09/1.07 Prover 1: Preprocessing ... % 2.72/1.10 Prover 6: Preprocessing ... % 2.72/1.10 Prover 5: Preprocessing ... % 2.72/1.10 Prover 2: Preprocessing ... % 2.72/1.10 Prover 0: Preprocessing ... % 2.85/1.10 Prover 3: Preprocessing ... % 4.19/1.34 Prover 2: Proving ... % 4.19/1.34 Prover 5: Proving ... % 4.82/1.38 Prover 3: Constructing countermodel ... % 4.82/1.38 Prover 1: Constructing countermodel ... % 4.82/1.38 Prover 6: Proving ... % 4.82/1.44 Prover 0: Proving ... % 4.82/1.44 Prover 4: Constructing countermodel ... % 4.82/1.49 Prover 5: proved (846ms) % 4.82/1.50 % 4.82/1.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.82/1.50 % 4.82/1.50 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.82/1.50 Prover 3: stopped % 4.82/1.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.82/1.51 Prover 2: stopped % 4.82/1.51 Prover 6: stopped % 4.82/1.51 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.82/1.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.82/1.52 Prover 0: stopped % 5.59/1.52 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.59/1.53 Prover 7: Preprocessing ... % 5.81/1.54 Prover 11: Preprocessing ... % 5.81/1.55 Prover 8: Preprocessing ... % 5.94/1.56 Prover 10: Preprocessing ... % 5.94/1.57 Prover 13: Preprocessing ... % 5.94/1.57 Prover 7: Warning: ignoring some quantifiers % 5.94/1.58 Prover 7: Constructing countermodel ... % 5.94/1.59 Prover 10: Warning: ignoring some quantifiers % 5.94/1.60 Prover 10: Constructing countermodel ... % 5.94/1.60 Prover 1: Found proof (size 12) % 5.94/1.60 Prover 1: proved (961ms) % 5.94/1.60 Prover 7: stopped % 5.94/1.60 Prover 4: Found proof (size 10) % 5.94/1.60 Prover 4: proved (958ms) % 5.94/1.60 Prover 10: stopped % 6.34/1.62 Prover 13: Warning: ignoring some quantifiers % 6.34/1.62 Prover 13: Constructing countermodel ... % 6.34/1.63 Prover 13: stopped % 6.34/1.64 Prover 8: Warning: ignoring some quantifiers % 6.34/1.65 Prover 8: Constructing countermodel ... % 6.55/1.66 Prover 8: stopped % 6.55/1.67 Prover 11: Constructing countermodel ... % 6.55/1.68 Prover 11: stopped % 6.55/1.68 % 6.55/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.55/1.68 % 6.55/1.68 % SZS output start Proof for theBenchmark % 6.55/1.68 Assumptions after simplification: % 6.55/1.68 --------------------------------- % 6.55/1.69 % 6.55/1.69 (axiom_2) % 6.94/1.74 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~ % 6.94/1.74 $i(v0) | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & rtt(v0, v3) = 0 & % 6.94/1.74 rtt(v0, v2) = 0 & $i(v3) & $i(v2)) | ? [v2: $i] : ? [v3: int] : ( ~ (v3 % 6.94/1.74 = 0) & rtt(v0, v2) = 0 & ca(v2) = v3 & $i(v2)) | ! [v2: $i] : ! [v3: % 6.94/1.74 $i] : ! [v4: $i] : (v4 = v3 | v4 = v2 | v3 = v2 | ~ (rtt(v0, v4) = 0) | % 6.94/1.74 ~ (rtt(v0, v3) = 0) | ~ (rtt(v0, v2) = 0) | ~ $i(v4) | ~ $i(v3) | ~ % 6.94/1.74 $i(v2))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! % 6.94/1.74 [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rtt(v0, v2) = 0) | ~ (rtt(v0, v1) % 6.94/1.74 = 0) | ~ $i(v2) | ~ $i(v1)) & ! [v1: $i] : ! [v2: int] : (v2 = 0 | % 6.94/1.74 ~ (ca(v1) = v2) | ~ $i(v1) | ? [v3: int] : ( ~ (v3 = 0) & rtt(v0, v1) % 6.94/1.74 = v3)) & ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & ~ % 6.94/1.74 (v3 = v1) & ~ (v2 = v1) & rtt(v0, v3) = 0 & rtt(v0, v2) = 0 & rtt(v0, % 6.94/1.74 v1) = 0 & $i(v3) & $i(v2) & $i(v1)))) % 6.94/1.74 % 6.94/1.74 (axiom_5) % 6.94/1.74 cUnsatisfiable(i2003_11_14_17_20_29215) = 0 & $i(i2003_11_14_17_20_29215) % 6.94/1.74 % 6.94/1.74 Further assumptions not needed in the proof: % 6.94/1.74 -------------------------------------------- % 6.94/1.74 axiom_0, axiom_1, axiom_3, axiom_4, cUnsatisfiable_substitution_1, % 6.94/1.74 ca_substitution_1, cc_substitution_1, cd_substitution_1, % 6.94/1.74 cowlNothing_substitution_1, cowlThing_substitution_1, rtt_substitution_1, % 6.94/1.74 rtt_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 6.94/1.74 % 6.94/1.74 Those formulas are unsatisfiable: % 6.94/1.74 --------------------------------- % 6.94/1.74 % 6.94/1.74 Begin of proof % 6.94/1.74 | % 6.94/1.74 | ALPHA: (axiom_2) implies: % 6.94/1.75 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] : % 6.94/1.75 | ! [v2: $i] : (v2 = v1 | ~ (rtt(v0, v2) = 0) | ~ (rtt(v0, v1) = % 6.94/1.75 | 0) | ~ $i(v2) | ~ $i(v1)) & ! [v1: $i] : ! [v2: int] : (v2 % 6.94/1.75 | = 0 | ~ (ca(v1) = v2) | ~ $i(v1) | ? [v3: int] : ( ~ (v3 = 0) % 6.94/1.75 | & rtt(v0, v1) = v3)) & ? [v1: $i] : ? [v2: $i] : ? [v3: $i] % 6.94/1.75 | : ( ~ (v3 = v2) & ~ (v3 = v1) & ~ (v2 = v1) & rtt(v0, v3) = 0 & % 6.94/1.75 | rtt(v0, v2) = 0 & rtt(v0, v1) = 0 & $i(v3) & $i(v2) & $i(v1)))) % 6.94/1.75 | % 6.94/1.75 | ALPHA: (axiom_5) implies: % 6.94/1.75 | (2) $i(i2003_11_14_17_20_29215) % 6.94/1.75 | (3) cUnsatisfiable(i2003_11_14_17_20_29215) = 0 % 6.94/1.75 | % 6.94/1.75 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_29215, simplifying with % 6.94/1.75 | (2), (3) gives: % 6.94/1.76 | (4) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rtt(i2003_11_14_17_20_29215, % 6.94/1.76 | v1) = 0) | ~ (rtt(i2003_11_14_17_20_29215, v0) = 0) | ~ $i(v1) % 6.94/1.76 | | ~ $i(v0)) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (ca(v0) = % 6.94/1.76 | v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 6.94/1.76 | rtt(i2003_11_14_17_20_29215, v0) = v2)) & ? [v0: $i] : ? [v1: $i] % 6.94/1.76 | : ? [v2: $i] : ( ~ (v2 = v1) & ~ (v2 = v0) & ~ (v1 = v0) & % 6.94/1.76 | rtt(i2003_11_14_17_20_29215, v2) = 0 & rtt(i2003_11_14_17_20_29215, % 6.94/1.76 | v1) = 0 & rtt(i2003_11_14_17_20_29215, v0) = 0 & $i(v2) & $i(v1) & % 6.94/1.76 | $i(v0)) % 6.94/1.76 | % 6.94/1.76 | ALPHA: (4) implies: % 6.94/1.76 | (5) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rtt(i2003_11_14_17_20_29215, % 6.94/1.76 | v1) = 0) | ~ (rtt(i2003_11_14_17_20_29215, v0) = 0) | ~ $i(v1) % 6.94/1.76 | | ~ $i(v0)) % 6.94/1.76 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = v1) & ~ (v2 = v0) % 6.94/1.76 | & ~ (v1 = v0) & rtt(i2003_11_14_17_20_29215, v2) = 0 & % 6.94/1.76 | rtt(i2003_11_14_17_20_29215, v1) = 0 & rtt(i2003_11_14_17_20_29215, % 6.94/1.76 | v0) = 0 & $i(v2) & $i(v1) & $i(v0)) % 6.94/1.76 | % 6.94/1.76 | DELTA: instantiating (6) with fresh symbols all_15_0, all_15_1, all_15_2 % 6.94/1.76 | gives: % 6.94/1.76 | (7) ~ (all_15_0 = all_15_1) & ~ (all_15_0 = all_15_2) & ~ (all_15_1 = % 6.94/1.76 | all_15_2) & rtt(i2003_11_14_17_20_29215, all_15_0) = 0 & % 6.94/1.76 | rtt(i2003_11_14_17_20_29215, all_15_1) = 0 & % 6.94/1.76 | rtt(i2003_11_14_17_20_29215, all_15_2) = 0 & $i(all_15_0) & % 6.94/1.76 | $i(all_15_1) & $i(all_15_2) % 6.94/1.76 | % 6.94/1.76 | ALPHA: (7) implies: % 6.94/1.76 | (8) ~ (all_15_1 = all_15_2) % 6.94/1.76 | (9) $i(all_15_2) % 6.94/1.77 | (10) $i(all_15_1) % 6.94/1.77 | (11) $i(all_15_0) % 6.94/1.77 | (12) rtt(i2003_11_14_17_20_29215, all_15_2) = 0 % 6.94/1.77 | (13) rtt(i2003_11_14_17_20_29215, all_15_1) = 0 % 6.94/1.77 | (14) rtt(i2003_11_14_17_20_29215, all_15_0) = 0 % 6.94/1.77 | % 6.94/1.77 | GROUND_INST: instantiating (5) with all_15_1, all_15_0, simplifying with (10), % 6.94/1.77 | (11), (13), (14) gives: % 6.94/1.77 | (15) all_15_0 = all_15_1 % 6.94/1.77 | % 6.94/1.77 | GROUND_INST: instantiating (5) with all_15_2, all_15_0, simplifying with (9), % 6.94/1.77 | (11), (12), (14) gives: % 6.94/1.77 | (16) all_15_0 = all_15_2 % 6.94/1.77 | % 6.94/1.77 | COMBINE_EQS: (15), (16) imply: % 6.94/1.77 | (17) all_15_1 = all_15_2 % 6.94/1.77 | % 6.94/1.77 | SIMP: (17) implies: % 6.94/1.77 | (18) all_15_1 = all_15_2 % 6.94/1.77 | % 6.94/1.77 | REDUCE: (8), (18) imply: % 6.94/1.77 | (19) $false % 6.94/1.77 | % 6.94/1.77 | CLOSE: (19) is inconsistent. % 6.94/1.77 | % 6.94/1.77 End of proof % 6.94/1.77 % SZS output end Proof for theBenchmark % 6.94/1.77 % 6.94/1.77 1149ms %------------------------------------------------------------------------------