%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN962+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 : 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:29:23 EDT 2023 % Result : Theorem 2.85s 1.12s % Output : Proof 3.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SYN962+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n022.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Sat Aug 26 18:37:40 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.39/0.96 Prover 4: Preprocessing ... % 1.39/0.96 Prover 1: Preprocessing ... % 2.15/1.01 Prover 6: Preprocessing ... % 2.15/1.01 Prover 2: Preprocessing ... % 2.15/1.01 Prover 5: Preprocessing ... % 2.15/1.01 Prover 0: Preprocessing ... % 2.15/1.01 Prover 3: Preprocessing ... % 2.29/1.05 Prover 4: Constructing countermodel ... % 2.29/1.05 Prover 3: Constructing countermodel ... % 2.29/1.05 Prover 1: Constructing countermodel ... % 2.29/1.05 Prover 5: Proving ... % 2.29/1.05 Prover 0: Proving ... % 2.29/1.05 Prover 2: Proving ... % 2.29/1.06 Prover 6: Proving ... % 2.85/1.12 Prover 3: proved (475ms) % 2.85/1.12 % 2.85/1.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.12 % 2.85/1.12 Prover 2: stopped % 2.85/1.12 Prover 6: stopped % 2.85/1.12 Prover 5: stopped % 2.85/1.12 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.85/1.12 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.85/1.12 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.85/1.12 Prover 0: proved (490ms) % 2.85/1.12 % 2.85/1.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.12 % 2.85/1.12 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.85/1.13 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.85/1.13 Prover 13: Preprocessing ... % 2.85/1.13 Prover 10: Preprocessing ... % 2.85/1.14 Prover 8: Preprocessing ... % 2.85/1.14 Prover 7: Preprocessing ... % 2.85/1.14 Prover 13: Warning: ignoring some quantifiers % 2.85/1.14 Prover 13: Constructing countermodel ... % 2.85/1.14 Prover 10: Warning: ignoring some quantifiers % 2.85/1.14 Prover 10: Constructing countermodel ... % 2.85/1.14 Prover 4: Found proof (size 5) % 2.85/1.14 Prover 4: proved (500ms) % 2.85/1.14 Prover 13: stopped % 2.85/1.15 Prover 10: stopped % 2.85/1.15 Prover 7: Warning: ignoring some quantifiers % 2.85/1.15 Prover 1: Found proof (size 6) % 2.85/1.15 Prover 1: proved (506ms) % 2.85/1.15 Prover 7: Constructing countermodel ... % 2.85/1.15 Prover 7: stopped % 2.85/1.15 Prover 8: Warning: ignoring some quantifiers % 2.85/1.15 Prover 8: Constructing countermodel ... % 2.85/1.15 Prover 11: Preprocessing ... % 2.85/1.15 Prover 8: stopped % 2.85/1.17 Prover 11: Constructing countermodel ... % 2.85/1.17 Prover 11: stopped % 2.85/1.17 % 2.85/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.17 % 2.85/1.17 % SZS output start Proof for theBenchmark % 2.85/1.18 Assumptions after simplification: % 2.85/1.18 --------------------------------- % 2.85/1.18 % 2.85/1.18 (prove_this) % 3.19/1.23 ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & p(v0) = v1 & $i(v0) & ! [v2: $i] % 3.19/1.23 : ! [v3: int] : (v3 = 0 | ~ (p(v2) = v3) | ~ $i(v2))) % 3.19/1.23 % 3.19/1.23 Those formulas are unsatisfiable: % 3.19/1.23 --------------------------------- % 3.19/1.23 % 3.19/1.23 Begin of proof % 3.19/1.23 | % 3.19/1.23 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1 gives: % 3.19/1.23 | (1) ~ (all_3_0 = 0) & p(all_3_1) = all_3_0 & $i(all_3_1) & ! [v0: $i] : % 3.19/1.23 | ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.19/1.23 | % 3.19/1.23 | ALPHA: (1) implies: % 3.19/1.23 | (2) ~ (all_3_0 = 0) % 3.19/1.23 | (3) $i(all_3_1) % 3.19/1.23 | (4) p(all_3_1) = all_3_0 % 3.19/1.24 | (5) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.19/1.24 | % 3.19/1.24 | GROUND_INST: instantiating (5) with all_3_1, all_3_0, simplifying with (3), % 3.19/1.24 | (4) gives: % 3.19/1.24 | (6) all_3_0 = 0 % 3.19/1.24 | % 3.19/1.24 | REDUCE: (2), (6) imply: % 3.19/1.24 | (7) $false % 3.19/1.24 | % 3.19/1.24 | CLOSE: (7) is inconsistent. % 3.19/1.24 | % 3.19/1.24 End of proof % 3.19/1.24 % SZS output end Proof for theBenchmark % 3.19/1.24 % 3.19/1.24 621ms %------------------------------------------------------------------------------