%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI650_1 : TPTP v8.1.2. Released v6.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n010.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:41 EDT 2023 % Result : Unsatisfiable 2.85s 1.22s % Output : Proof 3.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ARI650_1 : TPTP v8.1.2. Released v6.3.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n010.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:04:19 EDT 2023 % 0.13/0.34 % CPUTime : % 0.52/0.65 ________ _____ % 0.52/0.65 ___ __ \_________(_)________________________________ % 0.52/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.52/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.52/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.52/0.65 % 0.52/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.52/0.65 (2023-06-19) % 0.52/0.65 % 0.52/0.65 (c) Philipp Rümmer, 2009-2023 % 0.52/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.52/0.65 Amanda Stjerna. % 0.52/0.65 Free software under BSD-3-Clause. % 0.52/0.65 % 0.52/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.52/0.65 % 0.52/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.52/0.67 Running up to 7 provers in parallel. % 0.52/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.52/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.52/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.52/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.52/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.52/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.52/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.13/1.05 Prover 2: Preprocessing ... % 2.13/1.05 Prover 6: Preprocessing ... % 2.13/1.05 Prover 0: Preprocessing ... % 2.13/1.05 Prover 1: Preprocessing ... % 2.13/1.05 Prover 3: Preprocessing ... % 2.13/1.05 Prover 4: Preprocessing ... % 2.13/1.05 Prover 5: Preprocessing ... % 2.51/1.12 Prover 0: Constructing countermodel ... % 2.51/1.12 Prover 6: Constructing countermodel ... % 2.51/1.12 Prover 5: Constructing countermodel ... % 2.51/1.12 Prover 1: Constructing countermodel ... % 2.51/1.12 Prover 3: Constructing countermodel ... % 2.51/1.12 Prover 4: Constructing countermodel ... % 2.51/1.12 Prover 2: Constructing countermodel ... % 2.85/1.22 Prover 6: proved (538ms) % 2.85/1.22 Prover 3: proved (542ms) % 2.85/1.22 Prover 5: proved (539ms) % 2.85/1.22 Prover 2: proved (543ms) % 2.85/1.22 Prover 0: proved (543ms) % 2.85/1.22 % 2.85/1.22 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.22 % 2.85/1.22 % 2.85/1.22 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.22 % 2.85/1.23 % 2.85/1.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.23 % 2.85/1.23 % 2.85/1.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.23 % 2.85/1.23 % 2.85/1.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.23 % 2.85/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.85/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.85/1.23 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.85/1.23 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.85/1.23 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.85/1.23 Prover 8: Preprocessing ... % 2.85/1.24 Prover 7: Preprocessing ... % 2.85/1.24 Prover 8: Constructing countermodel ... % 2.85/1.24 Prover 11: Preprocessing ... % 2.85/1.25 Prover 13: Preprocessing ... % 2.85/1.25 Prover 11: Constructing countermodel ... % 2.85/1.25 Prover 10: Preprocessing ... % 2.85/1.25 Prover 7: Constructing countermodel ... % 2.85/1.26 Prover 10: Constructing countermodel ... % 2.85/1.26 Prover 13: Constructing countermodel ... % 3.69/1.32 Prover 8: Found proof (size 15) % 3.69/1.32 Prover 10: Found proof (size 15) % 3.69/1.32 Prover 10: proved (95ms) % 3.69/1.32 Prover 8: proved (96ms) % 3.69/1.32 Prover 11: Found proof (size 15) % 3.69/1.32 Prover 11: proved (94ms) % 3.69/1.32 Prover 4: Found proof (size 15) % 3.69/1.32 Prover 1: Found proof (size 15) % 3.69/1.32 Prover 4: proved (641ms) % 3.69/1.32 Prover 1: proved (644ms) % 3.69/1.32 Prover 13: Found proof (size 15) % 3.69/1.32 Prover 13: proved (93ms) % 3.69/1.32 Prover 7: Found proof (size 15) % 3.69/1.32 Prover 7: proved (96ms) % 3.69/1.32 % 3.69/1.32 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.69/1.32 % 3.69/1.33 % SZS output start Proof for theBenchmark % 3.69/1.33 Assumptions after simplification: % 3.69/1.33 --------------------------------- % 3.69/1.33 % 3.69/1.33 (conj) % 3.69/1.33 ? [v0: int] : ($lesseq(v0, 60) & $product(a, a) = v0) % 3.69/1.33 % 3.69/1.34 (conj_001) % 3.69/1.34 ? [v0: int] : ($lesseq(50, v0) & $product(a, a) = v0) % 3.69/1.34 % 3.69/1.34 Those formulas are unsatisfiable: % 3.69/1.34 --------------------------------- % 3.69/1.34 % 3.69/1.34 Begin of proof % 3.86/1.34 | % 3.86/1.34 | DELTA: instantiating (conj_001) with fresh symbol all_2_0 gives: % 3.86/1.34 | (1) $lesseq(50, all_2_0) & $product(a, a) = all_2_0 % 3.86/1.34 | % 3.86/1.34 | ALPHA: (1) implies: % 3.86/1.34 | (2) $lesseq(50, all_2_0) % 3.86/1.34 | (3) $product(a, a) = all_2_0 % 3.86/1.34 | % 3.86/1.34 | DELTA: instantiating (conj) with fresh symbol all_5_0 gives: % 3.86/1.34 | (4) $lesseq(all_5_0, 60) & $product(a, a) = all_5_0 % 3.86/1.34 | % 3.86/1.34 | ALPHA: (4) implies: % 3.86/1.34 | (5) $lesseq(all_5_0, 60) % 3.86/1.34 | (6) $product(a, a) = all_5_0 % 3.86/1.34 | % 3.86/1.34 | THEORY_AXIOM GroebnerMultiplication: % 3.86/1.34 | (7) ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = v1 | ~ % 3.86/1.34 | ($product(v0, v0) = v2) | ~ ($product(v0, v0) = v1)) % 3.86/1.34 | % 3.86/1.35 | GROUND_INST: instantiating (7) with a, all_2_0, all_5_0, simplifying with (3), % 3.86/1.35 | (6) gives: % 3.86/1.35 | (8) all_5_0 = all_2_0 % 3.86/1.35 | % 3.86/1.35 | REDUCE: (5), (8) imply: % 3.86/1.35 | (9) $lesseq(all_2_0, 60) % 3.86/1.35 | % 3.86/1.35 | THEORY_AXIOM GroebnerMultiplication: % 3.86/1.35 | (10) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, 60)) | ~ ($lesseq(50, % 3.86/1.35 | v1)) | ~ ($product(v0, v0) = v1)) % 3.86/1.35 | % 3.86/1.35 | GROUND_INST: instantiating (10) with a, all_2_0, simplifying with (3) gives: % 3.86/1.35 | (11) ~ ($lesseq(all_2_0, 60)) | ~ ($lesseq(50, all_2_0)) % 3.86/1.35 | % 3.86/1.35 | BETA: splitting (11) gives: % 3.86/1.35 | % 3.86/1.35 | Case 1: % 3.86/1.35 | | % 3.86/1.35 | | (12) $lesseq(61, all_2_0) % 3.86/1.35 | | % 3.86/1.35 | | COMBINE_INEQS: (9), (12) imply: % 3.86/1.35 | | (13) $false % 3.86/1.35 | | % 3.86/1.35 | | CLOSE: (13) is inconsistent. % 3.86/1.35 | | % 3.86/1.35 | Case 2: % 3.86/1.35 | | % 3.86/1.35 | | (14) $lesseq(all_2_0, 49) % 3.86/1.35 | | % 3.86/1.35 | | COMBINE_INEQS: (2), (14) imply: % 3.86/1.35 | | (15) $false % 3.86/1.35 | | % 3.86/1.35 | | CLOSE: (15) is inconsistent. % 3.86/1.35 | | % 3.86/1.35 | End of split % 3.86/1.35 | % 3.86/1.35 End of proof % 3.86/1.35 % SZS output end Proof for theBenchmark % 3.86/1.35 % 3.86/1.35 701ms %------------------------------------------------------------------------------