%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN080+1 : TPTP v8.1.2. Released v2.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n022.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 : Fri Sep 1 03:26:31 EDT 2023 % Result : Theorem 3.29s 1.38s % Output : Proof 3.29s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.15 % Problem : SYN080+1 : TPTP v8.1.2. Released v2.0.0. % 0.00/0.16 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.38 % Computer : n022.cluster.edu % 0.15/0.38 % Model : x86_64 x86_64 % 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.38 % Memory : 8042.1875MB % 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.38 % CPULimit : 300 % 0.15/0.38 % WCLimit : 300 % 0.15/0.38 % DateTime : Sat Aug 26 18:26:55 EDT 2023 % 0.15/0.38 % CPUTime : % 0.23/0.70 ________ _____ % 0.23/0.70 ___ __ \_________(_)________________________________ % 0.23/0.70 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.23/0.70 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.23/0.70 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.23/0.70 % 0.23/0.70 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.23/0.70 (2023-06-19) % 0.23/0.70 % 0.23/0.70 (c) Philipp Rümmer, 2009-2023 % 0.23/0.70 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.23/0.70 Amanda Stjerna. % 0.23/0.70 Free software under BSD-3-Clause. % 0.23/0.70 % 0.23/0.70 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.23/0.70 % 0.23/0.70 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.23/0.72 Running up to 7 provers in parallel. % 0.23/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.23/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.23/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.23/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.23/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.23/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.23/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.62/1.11 Prover 1: Preprocessing ... % 1.62/1.11 Prover 4: Preprocessing ... % 2.13/1.16 Prover 5: Preprocessing ... % 2.13/1.16 Prover 2: Preprocessing ... % 2.13/1.16 Prover 6: Preprocessing ... % 2.13/1.16 Prover 3: Preprocessing ... % 2.13/1.16 Prover 0: Preprocessing ... % 2.54/1.25 Prover 6: Constructing countermodel ... % 2.54/1.25 Prover 1: Constructing countermodel ... % 2.54/1.26 Prover 4: Constructing countermodel ... % 2.54/1.26 Prover 3: Constructing countermodel ... % 2.54/1.26 Prover 0: Proving ... % 2.90/1.27 Prover 5: Proving ... % 2.90/1.27 Prover 2: Proving ... % 3.29/1.37 Prover 6: proved (636ms) % 3.29/1.37 Prover 3: proved (639ms) % 3.29/1.38 % 3.29/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.29/1.38 % 3.29/1.38 % 3.29/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.29/1.38 % 3.29/1.38 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.29/1.38 Prover 2: stopped % 3.29/1.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.29/1.38 Prover 5: stopped % 3.29/1.38 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.29/1.39 Prover 7: Preprocessing ... % 3.29/1.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.29/1.40 Prover 1: Found proof (size 10) % 3.29/1.40 Prover 0: proved (669ms) % 3.29/1.40 Prover 1: proved (668ms) % 3.29/1.40 % 3.29/1.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.29/1.40 % 3.29/1.40 Prover 4: Found proof (size 10) % 3.29/1.40 Prover 4: proved (666ms) % 3.29/1.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.29/1.40 Prover 10: Preprocessing ... % 3.29/1.41 Prover 8: Preprocessing ... % 3.29/1.41 Prover 11: Preprocessing ... % 3.29/1.42 Prover 13: Preprocessing ... % 3.29/1.42 Prover 7: Constructing countermodel ... % 3.29/1.43 Prover 7: stopped % 3.29/1.43 Prover 10: Constructing countermodel ... % 3.29/1.43 Prover 8: Warning: ignoring some quantifiers % 3.29/1.43 Prover 11: Constructing countermodel ... % 3.29/1.44 Prover 10: stopped % 3.29/1.44 Prover 8: Constructing countermodel ... % 3.29/1.44 Prover 11: stopped % 3.29/1.44 Prover 8: stopped % 3.29/1.46 Prover 13: Warning: ignoring some quantifiers % 3.29/1.46 Prover 13: Constructing countermodel ... % 3.29/1.46 Prover 13: stopped % 3.29/1.46 % 3.29/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.29/1.46 % 3.29/1.47 % SZS output start Proof for theBenchmark % 3.29/1.47 Assumptions after simplification: % 3.29/1.47 --------------------------------- % 3.29/1.47 % 3.29/1.47 (pel58) % 3.29/1.53 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 3.29/1.53 $i] : ( ~ (v5 = v3) & f(v4) = v5 & f(v2) = v3 & f(v0) = v2 & g(v1) = v4 & % 3.29/1.53 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 3.29/1.53 % 3.29/1.53 (pel58_1) % 3.29/1.53 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v2 | ~ (f(v0) = % 3.29/1.53 v2) | ~ (g(v1) = v3) | ~ $i(v1) | ~ $i(v0)) % 3.29/1.53 % 3.29/1.53 Those formulas are unsatisfiable: % 3.29/1.53 --------------------------------- % 3.29/1.53 % 3.29/1.53 Begin of proof % 3.29/1.53 | % 3.29/1.53 | DELTA: instantiating (pel58) with fresh symbols all_4_0, all_4_1, all_4_2, % 3.29/1.53 | all_4_3, all_4_4, all_4_5 gives: % 3.29/1.54 | (1) ~ (all_4_0 = all_4_2) & f(all_4_1) = all_4_0 & f(all_4_3) = all_4_2 & % 3.29/1.54 | f(all_4_5) = all_4_3 & g(all_4_4) = all_4_1 & $i(all_4_0) & $i(all_4_1) % 3.29/1.54 | & $i(all_4_2) & $i(all_4_3) & $i(all_4_4) & $i(all_4_5) % 3.29/1.54 | % 3.29/1.54 | ALPHA: (1) implies: % 3.29/1.54 | (2) ~ (all_4_0 = all_4_2) % 3.29/1.54 | (3) $i(all_4_5) % 3.29/1.54 | (4) $i(all_4_4) % 3.29/1.54 | (5) $i(all_4_3) % 3.29/1.54 | (6) $i(all_4_1) % 3.29/1.54 | (7) g(all_4_4) = all_4_1 % 3.29/1.54 | (8) f(all_4_5) = all_4_3 % 3.29/1.54 | (9) f(all_4_3) = all_4_2 % 3.29/1.54 | (10) f(all_4_1) = all_4_0 % 3.29/1.54 | % 3.29/1.54 | GROUND_INST: instantiating (pel58_1) with all_4_5, all_4_4, all_4_3, all_4_1, % 3.29/1.54 | simplifying with (3), (4), (7), (8) gives: % 3.29/1.55 | (11) all_4_1 = all_4_3 % 3.29/1.55 | % 3.29/1.55 | GROUND_INST: instantiating (pel58_1) with all_4_3, all_4_4, all_4_2, all_4_1, % 3.29/1.55 | simplifying with (4), (5), (7), (9) gives: % 3.29/1.55 | (12) all_4_1 = all_4_2 % 3.29/1.55 | % 3.29/1.55 | GROUND_INST: instantiating (pel58_1) with all_4_1, all_4_4, all_4_0, all_4_1, % 3.29/1.55 | simplifying with (4), (6), (7), (10) gives: % 3.29/1.55 | (13) all_4_0 = all_4_1 % 3.29/1.55 | % 3.29/1.55 | COMBINE_EQS: (11), (12) imply: % 3.29/1.55 | (14) all_4_2 = all_4_3 % 3.29/1.55 | % 3.29/1.55 | SIMP: (14) implies: % 3.29/1.55 | (15) all_4_2 = all_4_3 % 3.29/1.55 | % 3.29/1.55 | COMBINE_EQS: (11), (13) imply: % 3.29/1.55 | (16) all_4_0 = all_4_3 % 3.29/1.55 | % 3.29/1.55 | REDUCE: (2), (15), (16) imply: % 3.29/1.55 | (17) $false % 3.29/1.55 | % 3.29/1.55 | CLOSE: (17) is inconsistent. % 3.29/1.55 | % 3.29/1.55 End of proof % 3.29/1.55 % SZS output end Proof for theBenchmark % 3.29/1.55 % 3.29/1.55 850ms %------------------------------------------------------------------------------