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