%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI608_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 3.34s 1.25s % Output : Proof 3.92s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ARI608_1 : TPTP v8.1.2. Released v5.1.0. % 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n022.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Tue Aug 29 18:33:38 EDT 2023 % 0.13/0.35 % CPUTime : % 0.66/0.65 ________ _____ % 0.66/0.65 ___ __ \_________(_)________________________________ % 0.66/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.66/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.66/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.66/0.65 % 0.66/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.66/0.65 (2023-06-19) % 0.66/0.65 % 0.66/0.65 (c) Philipp Rümmer, 2009-2023 % 0.66/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.66/0.65 Amanda Stjerna. % 0.66/0.65 Free software under BSD-3-Clause. % 0.66/0.65 % 0.66/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.66/0.65 % 0.66/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.66/0.66 Running up to 7 provers in parallel. % 0.73/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.73/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.73/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.73/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.73/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.73/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.73/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 2.09/1.06 Prover 4: Preprocessing ... % 2.09/1.06 Prover 1: Preprocessing ... % 2.34/1.10 Prover 0: Preprocessing ... % 2.34/1.10 Prover 2: Preprocessing ... % 2.34/1.10 Prover 6: Preprocessing ... % 2.34/1.10 Prover 5: Preprocessing ... % 2.34/1.10 Prover 3: Preprocessing ... % 2.73/1.16 Prover 1: Constructing countermodel ... % 2.73/1.16 Prover 4: Constructing countermodel ... % 2.73/1.16 Prover 3: Constructing countermodel ... % 2.73/1.17 Prover 2: Proving ... % 2.73/1.17 Prover 0: Proving ... % 2.73/1.17 Prover 6: Proving ... % 2.73/1.17 Prover 5: Proving ... % 3.34/1.25 Prover 3: proved (552ms) % 3.34/1.25 % 3.34/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.34/1.25 % 3.49/1.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.49/1.25 Prover 0: proved (585ms) % 3.49/1.26 % 3.49/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.49/1.26 % 3.49/1.26 Prover 5: proved (565ms) % 3.49/1.26 % 3.49/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.49/1.26 % 3.49/1.26 Prover 2: proved (585ms) % 3.49/1.26 % 3.49/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.49/1.26 % 3.49/1.26 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.49/1.26 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.49/1.26 Prover 6: stopped % 3.49/1.26 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.49/1.26 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.49/1.27 Prover 7: Preprocessing ... % 3.49/1.27 Prover 10: Preprocessing ... % 3.49/1.27 Prover 11: Preprocessing ... % 3.49/1.28 Prover 8: Preprocessing ... % 3.49/1.28 Prover 10: Constructing countermodel ... % 3.49/1.28 Prover 11: Constructing countermodel ... % 3.49/1.29 Prover 7: Constructing countermodel ... % 3.49/1.29 Prover 13: Preprocessing ... % 3.49/1.29 Prover 4: Found proof (size 9) % 3.49/1.29 Prover 4: proved (599ms) % 3.49/1.29 Prover 10: stopped % 3.49/1.29 Prover 7: stopped % 3.49/1.29 Prover 11: stopped % 3.49/1.29 Prover 1: stopped % 3.49/1.30 Prover 8: Warning: ignoring some quantifiers % 3.49/1.30 Prover 8: Constructing countermodel ... % 3.49/1.30 Prover 8: stopped % 3.49/1.31 Prover 13: Warning: ignoring some quantifiers % 3.49/1.31 Prover 13: Constructing countermodel ... % 3.49/1.31 Prover 13: stopped % 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 % SZS output start Proof for theBenchmark % 3.49/1.32 Assumptions after simplification: % 3.49/1.32 --------------------------------- % 3.49/1.32 % 3.49/1.32 (f_mon_implies_trans) % 3.92/1.34 ? [v0: int] : ? [v1: int] : ($lesseq(1, $difference(v1, v0)) & $lesseq(1, % 3.92/1.34 $difference(c, b)) & $lesseq(a, b) & f(c) = v0 & f(a) = v1 & ! [v2: int] % 3.92/1.34 : ! [v3: int] : ! [v4: int] : ! [v5: int] : ( ~ ($lesseq(1, % 3.92/1.34 $difference(v5, v4))) | ~ ($lesseq(v2, v3)) | ~ (f(v3) = v4) | ~ % 3.92/1.34 (f(v2) = v5))) % 3.92/1.34 % 3.92/1.34 Those formulas are unsatisfiable: % 3.92/1.34 --------------------------------- % 3.92/1.34 % 3.92/1.34 Begin of proof % 3.92/1.35 | % 3.92/1.35 | DELTA: instantiating (f_mon_implies_trans) with fresh symbols all_3_0, all_3_1 % 3.92/1.35 | gives: % 3.92/1.35 | (1) $lesseq(1, $difference(all_3_0, all_3_1)) & $lesseq(1, $difference(c, % 3.92/1.35 | b)) & $lesseq(a, b) & f(c) = all_3_1 & f(a) = all_3_0 & ! [v0: % 3.92/1.35 | int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ( ~ ($lesseq(1, % 3.92/1.35 | $difference(v3, v2))) | ~ ($lesseq(v0, v1)) | ~ (f(v1) = v2) | % 3.92/1.35 | ~ (f(v0) = v3)) % 3.92/1.35 | % 3.92/1.35 | ALPHA: (1) implies: % 3.92/1.35 | (2) $lesseq(a, b) % 3.92/1.35 | (3) $lesseq(1, $difference(c, b)) % 3.92/1.35 | (4) $lesseq(1, $difference(all_3_0, all_3_1)) % 3.92/1.35 | (5) f(a) = all_3_0 % 3.92/1.35 | (6) f(c) = all_3_1 % 3.92/1.36 | (7) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ( ~ % 3.92/1.36 | ($lesseq(1, $difference(v3, v2))) | ~ ($lesseq(v0, v1)) | ~ (f(v1) % 3.92/1.36 | = v2) | ~ (f(v0) = v3)) % 3.92/1.36 | % 3.92/1.36 | GROUND_INST: instantiating (7) with a, c, all_3_1, all_3_0, simplifying with % 3.92/1.36 | (5), (6) gives: % 3.92/1.36 | (8) ~ ($lesseq(1, $difference(all_3_0, all_3_1))) | ~ ($lesseq(a, c)) % 3.92/1.36 | % 3.92/1.36 | COMBINE_INEQS: (2), (3) imply: % 3.92/1.36 | (9) $lesseq(1, $difference(c, a)) % 3.92/1.36 | % 3.92/1.36 | BETA: splitting (8) gives: % 3.92/1.36 | % 3.92/1.36 | Case 1: % 3.92/1.36 | | % 3.92/1.36 | | (10) $lesseq(1, $difference(a, c)) % 3.92/1.36 | | % 3.92/1.36 | | COMBINE_INEQS: (9), (10) imply: % 3.92/1.36 | | (11) $false % 3.92/1.36 | | % 3.92/1.36 | | CLOSE: (11) is inconsistent. % 3.92/1.36 | | % 3.92/1.36 | Case 2: % 3.92/1.36 | | % 3.92/1.36 | | (12) $lesseq(all_3_0, all_3_1) % 3.92/1.36 | | % 3.92/1.36 | | COMBINE_INEQS: (4), (12) imply: % 3.92/1.36 | | (13) $false % 3.92/1.36 | | % 3.92/1.36 | | CLOSE: (13) is inconsistent. % 3.92/1.36 | | % 3.92/1.36 | End of split % 3.92/1.36 | % 3.92/1.36 End of proof % 3.92/1.36 % SZS output end Proof for theBenchmark % 3.92/1.36 % 3.92/1.36 709ms %------------------------------------------------------------------------------