%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI606_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.47s 1.31s % Output : Proof 4.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : ARI606_1 : TPTP v8.1.2. Released v5.1.0. % 0.08/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n019.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 17:47:27 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.19/1.05 Prover 1: Preprocessing ... % 2.19/1.05 Prover 4: Preprocessing ... % 2.30/1.10 Prover 6: Preprocessing ... % 2.30/1.10 Prover 0: Preprocessing ... % 2.30/1.10 Prover 2: Preprocessing ... % 2.30/1.10 Prover 3: Preprocessing ... % 2.30/1.10 Prover 5: Preprocessing ... % 2.68/1.15 Prover 3: Constructing countermodel ... % 2.68/1.15 Prover 4: Constructing countermodel ... % 2.68/1.15 Prover 5: Proving ... % 2.68/1.15 Prover 2: Proving ... % 2.68/1.15 Prover 1: Constructing countermodel ... % 2.68/1.15 Prover 6: Proving ... % 2.68/1.15 Prover 0: Proving ... % 3.47/1.30 Prover 3: proved (646ms) % 3.47/1.30 % 3.47/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.47/1.31 % 3.47/1.31 Prover 5: stopped % 3.47/1.31 Prover 6: stopped % 3.47/1.31 Prover 0: proved (654ms) % 3.47/1.31 % 3.47/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.47/1.31 % 3.47/1.31 Prover 2: proved (653ms) % 3.47/1.31 % 3.47/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.47/1.31 % 3.47/1.31 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.47/1.31 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.47/1.31 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.47/1.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.47/1.32 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.47/1.33 Prover 8: Preprocessing ... % 3.47/1.33 Prover 11: Preprocessing ... % 3.47/1.34 Prover 10: Preprocessing ... % 3.47/1.34 Prover 7: Preprocessing ... % 3.47/1.34 Prover 13: Preprocessing ... % 3.47/1.35 Prover 8: Warning: ignoring some quantifiers % 3.47/1.36 Prover 11: Constructing countermodel ... % 3.47/1.36 Prover 8: Constructing countermodel ... % 3.47/1.36 Prover 4: Found proof (size 9) % 3.47/1.36 Prover 4: proved (704ms) % 3.47/1.36 Prover 10: Constructing countermodel ... % 3.47/1.36 Prover 10: stopped % 3.47/1.36 Prover 8: stopped % 3.47/1.36 Prover 11: stopped % 3.47/1.36 Prover 1: stopped % 3.47/1.37 Prover 7: Constructing countermodel ... % 3.47/1.37 Prover 7: stopped % 3.47/1.38 Prover 13: Warning: ignoring some quantifiers % 3.47/1.39 Prover 13: Constructing countermodel ... % 3.47/1.39 Prover 13: stopped % 3.47/1.39 % 3.47/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.47/1.39 % 3.90/1.39 % SZS output start Proof for theBenchmark % 3.90/1.40 Assumptions after simplification: % 3.90/1.40 --------------------------------- % 3.90/1.40 % 3.90/1.40 (f_mon_implies_ff2_gt_ff5) % 3.90/1.44 ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ($lesseq(1, % 3.90/1.44 $difference(v3, v1)) & f(v2) = v3 & f(v0) = v1 & f(5) = v0 & f(2) = v2 & % 3.90/1.44 ! [v4: int] : ! [v5: int] : ! [v6: int] : ! [v7: int] : ( ~ ($lesseq(1, % 3.90/1.44 $difference(v7, v6))) | ~ ($lesseq(v4, v5)) | ~ (f(v5) = v6) | ~ % 3.90/1.44 (f(v4) = v7))) % 3.90/1.44 % 3.90/1.44 Those formulas are unsatisfiable: % 3.90/1.44 --------------------------------- % 3.90/1.44 % 3.90/1.44 Begin of proof % 4.57/1.45 | % 4.57/1.45 | DELTA: instantiating (f_mon_implies_ff2_gt_ff5) with fresh symbols all_3_0, % 4.57/1.45 | all_3_1, all_3_2, all_3_3 gives: % 4.57/1.45 | (1) $lesseq(1, $difference(all_3_0, all_3_2)) & f(all_3_1) = all_3_0 & % 4.57/1.45 | f(all_3_3) = all_3_2 & f(5) = all_3_3 & f(2) = all_3_1 & ! [v0: int] : % 4.57/1.45 | ! [v1: int] : ! [v2: int] : ! [v3: int] : ( ~ ($lesseq(1, % 4.57/1.45 | $difference(v3, v2))) | ~ ($lesseq(v0, v1)) | ~ (f(v1) = v2) | % 4.57/1.45 | ~ (f(v0) = v3)) % 4.57/1.45 | % 4.57/1.46 | ALPHA: (1) implies: % 4.57/1.46 | (2) $lesseq(1, $difference(all_3_0, all_3_2)) % 4.57/1.46 | (3) f(2) = all_3_1 % 4.57/1.46 | (4) f(5) = all_3_3 % 4.57/1.46 | (5) f(all_3_3) = all_3_2 % 4.57/1.46 | (6) f(all_3_1) = all_3_0 % 4.57/1.46 | (7) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ( ~ % 4.63/1.46 | ($lesseq(1, $difference(v3, v2))) | ~ ($lesseq(v0, v1)) | ~ (f(v1) % 4.63/1.46 | = v2) | ~ (f(v0) = v3)) % 4.63/1.46 | % 4.63/1.46 | GROUND_INST: instantiating (7) with 2, 5, all_3_3, all_3_1, simplifying with % 4.63/1.46 | (3), (4) gives: % 4.63/1.46 | (8) $lesseq(all_3_1, all_3_3) % 4.63/1.47 | % 4.63/1.47 | GROUND_INST: instantiating (7) with all_3_1, all_3_3, all_3_2, all_3_0, % 4.63/1.47 | simplifying with (5), (6) gives: % 4.63/1.47 | (9) ~ ($lesseq(1, $difference(all_3_0, all_3_2))) | ~ ($lesseq(all_3_1, % 4.63/1.47 | all_3_3)) % 4.63/1.47 | % 4.63/1.47 | BETA: splitting (9) gives: % 4.63/1.47 | % 4.63/1.47 | Case 1: % 4.63/1.47 | | % 4.63/1.47 | | (10) $lesseq(1, $difference(all_3_1, all_3_3)) % 4.63/1.47 | | % 4.63/1.47 | | COMBINE_INEQS: (8), (10) imply: % 4.63/1.47 | | (11) $false % 4.63/1.47 | | % 4.63/1.47 | | CLOSE: (11) is inconsistent. % 4.63/1.47 | | % 4.63/1.47 | Case 2: % 4.63/1.47 | | % 4.63/1.47 | | (12) $lesseq(all_3_0, all_3_2) % 4.63/1.47 | | % 4.63/1.47 | | COMBINE_INEQS: (2), (12) imply: % 4.63/1.47 | | (13) $false % 4.63/1.47 | | % 4.63/1.47 | | CLOSE: (13) is inconsistent. % 4.63/1.47 | | % 4.63/1.47 | End of split % 4.63/1.47 | % 4.63/1.47 End of proof % 4.63/1.47 % SZS output end Proof for theBenchmark % 4.63/1.47 % 4.63/1.47 840ms %------------------------------------------------------------------------------