%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI085_1 : TPTP v8.1.2. Released v5.0.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 : Wed Aug 30 17:46:57 EDT 2023 % Result : Theorem 2.91s 1.30s % Output : Proof 3.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : ARI085_1 : TPTP v8.1.2. Released v5.0.0. % 0.12/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 : Tue Aug 29 19:08:56 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.65 ________ _____ % 0.21/0.65 ___ __ \_________(_)________________________________ % 0.21/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.65 % 0.21/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.65 (2023-06-19) % 0.21/0.65 % 0.21/0.65 (c) Philipp Rümmer, 2009-2023 % 0.21/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.65 Amanda Stjerna. % 0.21/0.65 Free software under BSD-3-Clause. % 0.21/0.65 % 0.21/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.65 % 0.21/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.67 Running up to 7 provers in parallel. % 0.21/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.21/1.09 Prover 4: Preprocessing ... % 2.21/1.09 Prover 1: Preprocessing ... % 2.21/1.16 Prover 5: Preprocessing ... % 2.21/1.16 Prover 2: Preprocessing ... % 2.21/1.16 Prover 6: Preprocessing ... % 2.21/1.16 Prover 0: Preprocessing ... % 2.21/1.16 Prover 3: Preprocessing ... % 2.91/1.22 Prover 3: Constructing countermodel ... % 2.91/1.22 Prover 4: Constructing countermodel ... % 2.91/1.22 Prover 2: Constructing countermodel ... % 2.91/1.22 Prover 5: Constructing countermodel ... % 2.91/1.22 Prover 1: Constructing countermodel ... % 2.91/1.23 Prover 6: Proving ... % 2.91/1.23 Prover 0: Proving ... % 2.91/1.30 Prover 2: proved (615ms) % 2.91/1.30 Prover 3: proved (614ms) % 2.91/1.30 % 2.91/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.91/1.30 % 2.91/1.30 % 2.91/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.91/1.30 % 3.49/1.31 Prover 5: proved (615ms) % 3.49/1.31 % 3.49/1.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.49/1.31 % 3.49/1.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.49/1.31 Prover 6: stopped % 3.49/1.32 Prover 7: Preprocessing ... % 3.49/1.32 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.49/1.32 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.49/1.32 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.49/1.32 Prover 0: proved (648ms) % 3.49/1.32 % 3.49/1.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.49/1.32 % 3.49/1.33 Prover 4: Found proof (size 4) % 3.49/1.33 Prover 4: proved (645ms) % 3.49/1.33 Prover 1: Found proof (size 4) % 3.49/1.33 Prover 1: proved (651ms) % 3.49/1.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.49/1.34 Prover 7: Constructing countermodel ... % 3.49/1.34 Prover 8: Preprocessing ... % 3.49/1.34 Prover 7: stopped % 3.49/1.34 Prover 10: Preprocessing ... % 3.49/1.35 Prover 11: Preprocessing ... % 3.49/1.35 Prover 13: Preprocessing ... % 3.49/1.36 Prover 8: Warning: ignoring some quantifiers % 3.49/1.36 Prover 8: Constructing countermodel ... % 3.49/1.36 Prover 13: Constructing countermodel ... % 3.49/1.37 Prover 8: stopped % 3.49/1.37 Prover 10: Constructing countermodel ... % 3.49/1.37 Prover 13: stopped % 3.49/1.37 Prover 10: stopped % 3.49/1.37 Prover 11: Constructing countermodel ... % 3.49/1.38 Prover 11: stopped % 3.49/1.38 % 3.49/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.49/1.38 % 3.49/1.38 % SZS output start Proof for theBenchmark % 3.49/1.38 Assumptions after simplification: % 3.49/1.38 --------------------------------- % 3.49/1.38 % 3.49/1.38 (sum_X_Y_7_predicate) % 3.49/1.43 ? [v0: int] : ( ~ (v0 = 0) & p(3, 4) = 0 & p(1, 6) = v0 & ! [v1: int] : ~ % 3.49/1.43 (p(v1, $difference(7, v1)) = 0)) % 3.49/1.43 % 3.49/1.43 Those formulas are unsatisfiable: % 3.49/1.43 --------------------------------- % 3.49/1.43 % 3.49/1.43 Begin of proof % 3.49/1.43 | % 3.49/1.44 | DELTA: instantiating (sum_X_Y_7_predicate) with fresh symbol all_3_0 gives: % 3.49/1.44 | (1) ~ (all_3_0 = 0) & p(3, 4) = 0 & p(1, 6) = all_3_0 & ! [v0: int] : ~ % 3.49/1.44 | (p(v0, $difference(7, v0)) = 0) % 3.49/1.44 | % 3.49/1.44 | ALPHA: (1) implies: % 3.49/1.44 | (2) p(3, 4) = 0 % 3.49/1.44 | (3) ! [v0: int] : ~ (p(v0, $difference(7, v0)) = 0) % 3.49/1.44 | % 3.49/1.44 | GROUND_INST: instantiating (3) with 3, simplifying with (2) gives: % 3.49/1.45 | (4) $false % 3.49/1.45 | % 3.49/1.45 | CLOSE: (4) is inconsistent. % 3.49/1.45 | % 3.49/1.45 End of proof % 3.49/1.45 % SZS output end Proof for theBenchmark % 3.49/1.45 % 3.49/1.45 796ms %------------------------------------------------------------------------------