%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI604_1 : TPTP v8.1.2. Released v5.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 : Wed Aug 30 17:48:33 EDT 2023 % Result : Theorem 2.67s 1.16s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : ARI604_1 : TPTP v8.1.2. Released v5.1.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n022.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Tue Aug 29 18:13:38 EDT 2023 % 0.12/0.33 % CPUTime : % 0.60/0.61 ________ _____ % 0.60/0.61 ___ __ \_________(_)________________________________ % 0.60/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.60/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.60/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.60/0.61 % 0.60/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.60/0.61 (2023-06-19) % 0.60/0.61 % 0.60/0.61 (c) Philipp Rümmer, 2009-2023 % 0.60/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.60/0.61 Amanda Stjerna. % 0.60/0.61 Free software under BSD-3-Clause. % 0.60/0.61 % 0.60/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.60/0.61 % 0.60/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.60/0.62 Running up to 7 provers in parallel. % 0.74/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.74/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.74/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.74/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.74/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.74/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.74/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.77/0.99 Prover 4: Preprocessing ... % 1.77/0.99 Prover 1: Preprocessing ... % 2.19/1.04 Prover 5: Preprocessing ... % 2.19/1.04 Prover 6: Preprocessing ... % 2.19/1.04 Prover 2: Preprocessing ... % 2.19/1.04 Prover 3: Preprocessing ... % 2.19/1.04 Prover 0: Preprocessing ... % 2.19/1.06 Prover 4: Constructing countermodel ... % 2.19/1.06 Prover 1: Constructing countermodel ... % 2.19/1.06 Prover 6: Proving ... % 2.19/1.06 Prover 0: Proving ... % 2.19/1.07 Prover 2: Proving ... % 2.67/1.08 Prover 3: Constructing countermodel ... % 2.67/1.09 Prover 5: Proving ... % 2.67/1.16 Prover 3: proved (525ms) % 2.67/1.16 % 2.67/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.67/1.16 % 2.67/1.16 Prover 6: stopped % 2.67/1.16 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.67/1.16 Prover 5: proved (525ms) % 2.67/1.16 Prover 2: proved (528ms) % 2.67/1.16 % 2.67/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.67/1.16 % 2.67/1.16 % 2.67/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.67/1.16 % 2.67/1.17 Prover 0: proved (528ms) % 2.67/1.17 % 2.67/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.67/1.17 % 2.67/1.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.67/1.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.67/1.17 Prover 4: Found proof (size 7) % 2.67/1.17 Prover 8: Preprocessing ... % 2.67/1.17 Prover 7: Preprocessing ... % 3.23/1.17 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.23/1.17 Prover 1: Found proof (size 8) % 3.23/1.17 Prover 1: proved (540ms) % 3.23/1.17 Prover 4: proved (537ms) % 3.23/1.17 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.23/1.17 Prover 10: Preprocessing ... % 3.23/1.18 Prover 13: Preprocessing ... % 3.23/1.18 Prover 11: Preprocessing ... % 3.23/1.18 Prover 8: Warning: ignoring some quantifiers % 3.23/1.18 Prover 7: Constructing countermodel ... % 3.23/1.18 Prover 8: Constructing countermodel ... % 3.23/1.18 Prover 7: stopped % 3.23/1.19 Prover 10: Constructing countermodel ... % 3.23/1.19 Prover 8: stopped % 3.23/1.19 Prover 10: stopped % 3.23/1.19 Prover 11: Constructing countermodel ... % 3.23/1.19 Prover 11: stopped % 3.23/1.19 Prover 13: Warning: ignoring some quantifiers % 3.23/1.20 Prover 13: Constructing countermodel ... % 3.23/1.20 Prover 13: stopped % 3.23/1.20 % 3.23/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.23/1.20 % 3.23/1.20 % SZS output start Proof for theBenchmark % 3.43/1.20 Assumptions after simplification: % 3.43/1.20 --------------------------------- % 3.43/1.20 % 3.43/1.20 (fX_gt_X_implies_negfnegX_lt_fX) % 3.51/1.23 ? [v0: int] : ? [v1: int] : ? [v2: int] : ($lesseq(v1, $product(-1, v2)) & % 3.51/1.23 f($product(-1, v0)) = v2 & f(v0) = v1 & ! [v3: int] : ! [v4: int] : ( ~ % 3.51/1.23 ($lesseq(v4, v3)) | ~ (f(v3) = v4))) % 3.51/1.24 % 3.51/1.24 Those formulas are unsatisfiable: % 3.51/1.24 --------------------------------- % 3.51/1.24 % 3.51/1.24 Begin of proof % 3.51/1.24 | % 3.51/1.24 | DELTA: instantiating (fX_gt_X_implies_negfnegX_lt_fX) with fresh symbols % 3.51/1.24 | all_3_0, all_3_1, all_3_2 gives: % 3.51/1.24 | (1) $lesseq(all_3_1, $product(-1, all_3_0)) & f($product(-1, all_3_2)) = % 3.51/1.24 | all_3_0 & f(all_3_2) = all_3_1 & ! [v0: int] : ! [v1: int] : ( ~ % 3.51/1.24 | ($lesseq(v1, v0)) | ~ (f(v0) = v1)) % 3.51/1.24 | % 3.51/1.24 | ALPHA: (1) implies: % 3.51/1.24 | (2) $lesseq(all_3_1, $product(-1, all_3_0)) % 3.51/1.24 | (3) f(all_3_2) = all_3_1 % 3.51/1.24 | (4) f($product(-1, all_3_2)) = all_3_0 % 3.51/1.24 | (5) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | ~ (f(v0) = v1)) % 3.51/1.24 | % 3.51/1.24 | GROUND_INST: instantiating (5) with all_3_2, all_3_1, simplifying with (3) % 3.51/1.24 | gives: % 3.51/1.24 | (6) $lesseq(1, $difference(all_3_1, all_3_2)) % 3.51/1.24 | % 3.51/1.24 | GROUND_INST: instantiating (5) with $product(-1, all_3_2), all_3_0, % 3.51/1.24 | simplifying with (4) gives: % 3.51/1.25 | (7) $lesseq(1, $sum(all_3_0, all_3_2)) % 3.51/1.25 | % 3.51/1.25 | COMBINE_INEQS: (2), (7) imply: % 3.51/1.25 | (8) $lesseq(1, $difference(all_3_2, all_3_1)) % 3.51/1.25 | % 3.51/1.25 | COMBINE_INEQS: (6), (8) imply: % 3.51/1.25 | (9) $false % 3.51/1.25 | % 3.51/1.25 | CLOSE: (9) is inconsistent. % 3.51/1.25 | % 3.51/1.25 End of proof % 3.51/1.25 % SZS output end Proof for theBenchmark % 3.51/1.25 % 3.51/1.25 635ms %------------------------------------------------------------------------------