%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI607_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 : n009.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.40s 1.19s % Output : Proof 3.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ARI607_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.35 % Computer : n009.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 17:57:05 EDT 2023 % 0.13/0.35 % CPUTime : % 0.55/0.60 ________ _____ % 0.55/0.60 ___ __ \_________(_)________________________________ % 0.55/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.55/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.55/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.55/0.60 % 0.55/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.55/0.60 (2023-06-19) % 0.55/0.60 % 0.55/0.60 (c) Philipp Rümmer, 2009-2023 % 0.55/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.55/0.60 Amanda Stjerna. % 0.55/0.60 Free software under BSD-3-Clause. % 0.55/0.60 % 0.55/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.55/0.60 % 0.55/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.55/0.62 Running up to 7 provers in parallel. % 0.55/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.55/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.55/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.55/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.55/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.55/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.55/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/0.99 Prover 1: Preprocessing ... % 1.90/0.99 Prover 4: Preprocessing ... % 2.23/1.04 Prover 6: Preprocessing ... % 2.23/1.04 Prover 2: Preprocessing ... % 2.23/1.04 Prover 0: Preprocessing ... % 2.23/1.04 Prover 3: Preprocessing ... % 2.23/1.04 Prover 5: Preprocessing ... % 2.57/1.10 Prover 3: Constructing countermodel ... % 2.57/1.10 Prover 1: Constructing countermodel ... % 2.57/1.10 Prover 4: Constructing countermodel ... % 2.57/1.10 Prover 6: Proving ... % 2.57/1.10 Prover 5: Proving ... % 2.57/1.10 Prover 2: Proving ... % 2.57/1.10 Prover 0: Proving ... % 3.12/1.19 Prover 0: proved (566ms) % 3.12/1.19 % 3.40/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.40/1.19 % 3.40/1.19 Prover 2: proved (566ms) % 3.40/1.19 % 3.40/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.40/1.19 % 3.40/1.19 Prover 3: proved (567ms) % 3.40/1.19 % 3.40/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.40/1.20 % 3.40/1.20 Prover 5: stopped % 3.40/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.40/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.40/1.20 Prover 6: stopped % 3.40/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.40/1.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.40/1.21 Prover 7: Preprocessing ... % 3.40/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.40/1.21 Prover 11: Preprocessing ... % 3.40/1.21 Prover 10: Preprocessing ... % 3.40/1.22 Prover 1: Found proof (size 7) % 3.40/1.22 Prover 4: Found proof (size 7) % 3.40/1.22 Prover 1: proved (590ms) % 3.40/1.22 Prover 4: proved (589ms) % 3.40/1.22 Prover 8: Preprocessing ... % 3.40/1.22 Prover 13: Preprocessing ... % 3.40/1.23 Prover 8: Warning: ignoring some quantifiers % 3.40/1.23 Prover 11: Constructing countermodel ... % 3.40/1.23 Prover 7: Constructing countermodel ... % 3.40/1.23 Prover 11: stopped % 3.40/1.23 Prover 8: Constructing countermodel ... % 3.40/1.23 Prover 7: stopped % 3.40/1.23 Prover 10: Constructing countermodel ... % 3.40/1.24 Prover 8: stopped % 3.40/1.24 Prover 10: stopped % 3.73/1.25 Prover 13: Warning: ignoring some quantifiers % 3.73/1.25 Prover 13: Constructing countermodel ... % 3.73/1.25 Prover 13: stopped % 3.73/1.25 % 3.73/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.73/1.25 % 3.73/1.25 % SZS output start Proof for theBenchmark % 3.73/1.25 Assumptions after simplification: % 3.73/1.25 --------------------------------- % 3.73/1.25 % 3.73/1.25 (f_mon_implies_f2plusf5_gt_f7plusf3) % 3.73/1.29 ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ($lesseq(1, % 3.73/1.29 $difference($difference($sum(v3, v2), v1), v0)) & f(7) = v0 & f(5) = v3 & % 3.73/1.29 f(3) = v1 & f(2) = v2 & ! [v4: int] : ! [v5: int] : ! [v6: int] : ! [v7: % 3.73/1.29 int] : ( ~ ($lesseq(1, $difference(v7, v6))) | ~ ($lesseq(v4, v5)) | ~ % 3.73/1.29 (f(v5) = v6) | ~ (f(v4) = v7))) % 3.73/1.29 % 3.73/1.29 Those formulas are unsatisfiable: % 3.73/1.29 --------------------------------- % 3.73/1.29 % 3.73/1.29 Begin of proof % 3.73/1.29 | % 3.73/1.29 | DELTA: instantiating (f_mon_implies_f2plusf5_gt_f7plusf3) with fresh symbols % 3.73/1.29 | all_3_0, all_3_1, all_3_2, all_3_3 gives: % 3.73/1.29 | (1) $lesseq(1, $difference($difference($sum(all_3_0, all_3_1), all_3_2), % 3.73/1.29 | all_3_3)) & f(7) = all_3_3 & f(5) = all_3_0 & f(3) = all_3_2 & f(2) % 3.73/1.29 | = all_3_1 & ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : % 3.73/1.29 | ( ~ ($lesseq(1, $difference(v3, v2))) | ~ ($lesseq(v0, v1)) | ~ % 3.73/1.29 | (f(v1) = v2) | ~ (f(v0) = v3)) % 3.73/1.29 | % 3.73/1.29 | ALPHA: (1) implies: % 3.73/1.30 | (2) $lesseq(1, $difference($difference($sum(all_3_0, all_3_1), all_3_2), % 3.73/1.30 | all_3_3)) % 3.73/1.30 | (3) f(2) = all_3_1 % 3.73/1.30 | (4) f(3) = all_3_2 % 3.73/1.30 | (5) f(5) = all_3_0 % 3.73/1.30 | (6) f(7) = all_3_3 % 3.88/1.30 | (7) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ( ~ % 3.88/1.30 | ($lesseq(1, $difference(v3, v2))) | ~ ($lesseq(v0, v1)) | ~ (f(v1) % 3.88/1.30 | = v2) | ~ (f(v0) = v3)) % 3.88/1.30 | % 3.88/1.30 | GROUND_INST: instantiating (7) with 2, 3, all_3_2, all_3_1, simplifying with % 3.88/1.30 | (3), (4) gives: % 3.88/1.30 | (8) $lesseq(all_3_1, all_3_2) % 3.88/1.30 | % 3.88/1.30 | GROUND_INST: instantiating (7) with 5, 7, all_3_3, all_3_0, simplifying with % 3.88/1.30 | (5), (6) gives: % 3.88/1.30 | (9) $lesseq(all_3_0, all_3_3) % 3.88/1.30 | % 3.88/1.30 | COMBINE_INEQS: (2), (9) imply: % 3.88/1.30 | (10) $lesseq(1, $difference(all_3_1, all_3_2)) % 3.88/1.30 | % 3.88/1.30 | COMBINE_INEQS: (8), (10) imply: % 3.88/1.30 | (11) $false % 3.88/1.30 | % 3.88/1.30 | CLOSE: (11) is inconsistent. % 3.88/1.30 | % 3.88/1.30 End of proof % 3.88/1.30 % SZS output end Proof for theBenchmark % 3.88/1.30 % 3.88/1.30 699ms %------------------------------------------------------------------------------