%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI602_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 : n002.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:32 EDT 2023 % Result : Theorem 3.24s 1.15s % Output : Proof 3.38s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : ARI602_1 : TPTP v8.1.2. Released v5.1.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n002.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Tue Aug 29 18:05:50 EDT 2023 % 0.21/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.94/0.97 Prover 1: Preprocessing ... % 1.94/0.97 Prover 4: Preprocessing ... % 2.24/1.01 Prover 2: Preprocessing ... % 2.24/1.01 Prover 6: Preprocessing ... % 2.24/1.01 Prover 0: Preprocessing ... % 2.24/1.01 Prover 3: Preprocessing ... % 2.24/1.01 Prover 5: Preprocessing ... % 2.59/1.07 Prover 1: Constructing countermodel ... % 2.59/1.07 Prover 4: Constructing countermodel ... % 2.59/1.07 Prover 3: Constructing countermodel ... % 2.59/1.08 Prover 2: Proving ... % 2.59/1.08 Prover 6: Proving ... % 2.59/1.08 Prover 0: Proving ... % 2.59/1.08 Prover 5: Proving ... % 2.59/1.15 Prover 3: proved (512ms) % 2.59/1.15 % 3.24/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.24/1.15 % 3.24/1.15 Prover 1: Found proof (size 5) % 3.24/1.15 Prover 1: proved (517ms) % 3.24/1.15 Prover 4: Found proof (size 5) % 3.24/1.15 Prover 4: proved (513ms) % 3.24/1.15 Prover 0: proved (517ms) % 3.24/1.15 Prover 2: proved (516ms) % 3.24/1.15 Prover 5: proved (515ms) % 3.24/1.15 Prover 6: stopped % 3.24/1.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.24/1.16 Prover 7: Preprocessing ... % 3.24/1.17 Prover 7: Constructing countermodel ... % 3.24/1.17 Prover 7: stopped % 3.24/1.17 % 3.24/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.24/1.17 % 3.24/1.18 % SZS output start Proof for theBenchmark % 3.24/1.18 Assumptions after simplification: % 3.24/1.18 --------------------------------- % 3.24/1.18 % 3.24/1.18 (fX_gt_X_implies_exist_ineq) % 3.38/1.21 ? [v0: int] : ($lesseq(v0, 5) & f(5) = v0 & ! [v1: int] : ! [v2: int] : ( ~ % 3.38/1.21 ($lesseq(v2, v1)) | ~ (f(v1) = v2))) % 3.38/1.21 % 3.38/1.21 Those formulas are unsatisfiable: % 3.38/1.21 --------------------------------- % 3.38/1.21 % 3.38/1.21 Begin of proof % 3.38/1.21 | % 3.38/1.22 | DELTA: instantiating (fX_gt_X_implies_exist_ineq) with fresh symbol all_3_0 % 3.38/1.22 | gives: % 3.38/1.22 | (1) $lesseq(all_3_0, 5) & f(5) = all_3_0 & ! [v0: int] : ! [v1: int] : ( % 3.38/1.22 | ~ ($lesseq(v1, v0)) | ~ (f(v0) = v1)) % 3.38/1.22 | % 3.38/1.22 | ALPHA: (1) implies: % 3.38/1.22 | (2) $lesseq(all_3_0, 5) % 3.38/1.22 | (3) f(5) = all_3_0 % 3.38/1.22 | (4) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | ~ (f(v0) = v1)) % 3.38/1.22 | % 3.38/1.22 | GROUND_INST: instantiating (4) with 5, all_3_0, simplifying with (3) gives: % 3.38/1.22 | (5) $lesseq(6, all_3_0) % 3.38/1.22 | % 3.38/1.22 | COMBINE_INEQS: (2), (5) imply: % 3.38/1.22 | (6) $false % 3.38/1.22 | % 3.38/1.22 | CLOSE: (6) is inconsistent. % 3.38/1.22 | % 3.38/1.22 End of proof % 3.38/1.22 % SZS output end Proof for theBenchmark % 3.38/1.22 % 3.38/1.22 610ms %------------------------------------------------------------------------------