%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW588_2 : TPTP v8.1.2. Released v6.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n020.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 : Fri Sep 1 00:50:49 EDT 2023 % Result : Theorem 5.25s 1.51s % Output : Proof 6.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWW588_2 : TPTP v8.1.2. Released v6.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n020.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 : Sun Aug 27 19:07:29 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.52/1.04 Prover 0: Preprocessing ... % 2.52/1.04 Prover 4: Preprocessing ... % 2.52/1.04 Prover 1: Preprocessing ... % 2.52/1.04 Prover 6: Preprocessing ... % 2.52/1.04 Prover 5: Preprocessing ... % 2.86/1.05 Prover 2: Preprocessing ... % 2.86/1.05 Prover 3: Preprocessing ... % 4.19/1.29 Prover 3: Warning: ignoring some quantifiers % 4.54/1.30 Prover 3: Constructing countermodel ... % 4.54/1.32 Prover 1: Warning: ignoring some quantifiers % 4.54/1.32 Prover 4: Warning: ignoring some quantifiers % 4.54/1.33 Prover 4: Constructing countermodel ... % 4.54/1.33 Prover 6: Proving ... % 4.54/1.33 Prover 2: Proving ... % 4.54/1.33 Prover 1: Constructing countermodel ... % 4.54/1.34 Prover 0: Proving ... % 4.54/1.34 Prover 5: Proving ... % 5.25/1.50 Prover 3: proved (888ms) % 5.25/1.51 % 5.25/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.25/1.51 % 5.25/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.25/1.51 Prover 6: proved (889ms) % 5.25/1.51 Prover 2: proved (897ms) % 5.25/1.51 % 5.25/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.25/1.51 % 5.25/1.51 % 5.25/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.25/1.51 % 5.25/1.51 Prover 5: proved (892ms) % 5.25/1.51 % 5.25/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.25/1.51 % 5.25/1.51 Prover 0: proved (897ms) % 5.25/1.51 % 5.25/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.25/1.51 % 5.25/1.51 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.25/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.25/1.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.25/1.52 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.25/1.52 Prover 1: Found proof (size 10) % 5.25/1.52 Prover 4: Found proof (size 6) % 5.25/1.52 Prover 4: proved (906ms) % 5.25/1.52 Prover 1: proved (908ms) % 5.25/1.57 Prover 7: Preprocessing ... % 5.25/1.57 Prover 11: Preprocessing ... % 5.25/1.57 Prover 13: Preprocessing ... % 5.25/1.58 Prover 8: Preprocessing ... % 5.25/1.59 Prover 10: Preprocessing ... % 6.48/1.60 Prover 7: stopped % 6.48/1.60 Prover 11: stopped % 6.48/1.60 Prover 10: stopped % 6.48/1.62 Prover 13: stopped % 6.48/1.64 Prover 8: Warning: ignoring some quantifiers % 6.75/1.65 Prover 8: Constructing countermodel ... % 6.75/1.65 Prover 8: stopped % 6.75/1.65 % 6.75/1.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.75/1.65 % 6.75/1.65 % SZS output start Proof for theBenchmark % 6.75/1.66 Assumptions after simplification: % 6.75/1.66 --------------------------------- % 6.75/1.66 % 6.75/1.66 (wP_parameter_division) % 6.75/1.66 ? [v0: int] : ? [v1: int] : ($lesseq(1, v1) & $lesseq(0, v0) & ? [v2: int] % 6.75/1.66 : ? [v3: int] : ($lesseq(v1, v2) & $lesseq(0, v2) & $product(v3, v1) = % 6.75/1.66 $difference(v0, v2) & ? [v4: int] : ( ~ ($difference($sum(v4, v2), v1) = % 6.75/1.66 v0) & $product($sum(v3, 1), v1) = v4))) % 6.75/1.66 % 6.75/1.66 Further assumptions not needed in the proof: % 6.75/1.66 -------------------------------------------- % 6.75/1.66 bool_inversion, compatOrderMult, contents_def1, contents_sort1, % 6.75/1.66 match_bool_False, match_bool_True, match_bool_sort1, mk_ref_sort1, % 6.75/1.66 ref_inversion1, true_False, tuple0_inversion, witness_sort1 % 6.75/1.66 % 6.75/1.66 Those formulas are unsatisfiable: % 6.75/1.66 --------------------------------- % 6.75/1.66 % 6.75/1.66 Begin of proof % 6.75/1.66 | % 6.75/1.67 | DELTA: instantiating (wP_parameter_division) with fresh symbols all_23_0, % 6.75/1.67 | all_23_1 gives: % 6.75/1.67 | (1) $lesseq(1, all_23_0) & $lesseq(0, all_23_1) & ? [v0: int] : ? [v1: % 6.75/1.67 | int] : ($lesseq(all_23_0, v0) & $lesseq(0, v0) & $product(v1, % 6.75/1.67 | all_23_0) = $difference(all_23_1, v0) & ? [v2: int] : ( ~ % 6.75/1.67 | ($difference($sum(v2, v0), all_23_0) = all_23_1) & % 6.75/1.67 | $product($sum(v1, 1), all_23_0) = v2)) % 6.75/1.67 | % 6.75/1.67 | ALPHA: (1) implies: % 6.75/1.67 | (2) ? [v0: int] : ? [v1: int] : ($lesseq(all_23_0, v0) & $lesseq(0, v0) & % 6.75/1.67 | $product(v1, all_23_0) = $difference(all_23_1, v0) & ? [v2: int] : ( % 6.75/1.67 | ~ ($difference($sum(v2, v0), all_23_0) = all_23_1) & % 6.75/1.67 | $product($sum(v1, 1), all_23_0) = v2)) % 6.75/1.67 | % 6.75/1.67 | DELTA: instantiating (2) with fresh symbols all_26_0, all_26_1 gives: % 6.75/1.67 | (3) $lesseq(all_23_0, all_26_1) & $lesseq(0, all_26_1) & $product(all_26_0, % 6.75/1.67 | all_23_0) = $difference(all_23_1, all_26_1) & ? [v0: int] : ( ~ % 6.75/1.67 | ($difference($sum(v0, all_26_1), all_23_0) = all_23_1) & % 6.75/1.67 | $product($sum(all_26_0, 1), all_23_0) = v0) % 6.75/1.67 | % 6.75/1.67 | ALPHA: (3) implies: % 6.75/1.67 | (4) $product(all_26_0, all_23_0) = $difference(all_23_1, all_26_1) % 6.75/1.67 | (5) ? [v0: int] : ( ~ ($difference($sum(v0, all_26_1), all_23_0) = % 6.75/1.67 | all_23_1) & $product($sum(all_26_0, 1), all_23_0) = v0) % 6.75/1.67 | % 6.75/1.67 | DELTA: instantiating (5) with fresh symbol all_29_0 gives: % 6.75/1.67 | (6) ~ ($difference($sum(all_29_0, all_26_1), all_23_0) = all_23_1) & % 6.75/1.67 | $product($sum(all_26_0, 1), all_23_0) = all_29_0 % 6.75/1.67 | % 6.75/1.67 | ALPHA: (6) implies: % 6.75/1.67 | (7) ~ ($difference($sum(all_29_0, all_26_1), all_23_0) = all_23_1) % 6.75/1.67 | (8) $product($sum(all_26_0, 1), all_23_0) = all_29_0 % 6.75/1.67 | % 6.75/1.67 | THEORY_AXIOM GroebnerMultiplication: % 6.75/1.67 | (9) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: % 6.75/1.67 | int] : ($difference($sum(v4, v2), v1) = v0 | ~ ($product($sum(v3, % 6.75/1.67 | 1), v1) = v4) | ~ ($product(v3, v1) = $difference(v0, v2))) % 6.75/1.68 | % 6.75/1.68 | GROUND_INST: instantiating (9) with all_23_1, all_23_0, all_26_1, all_26_0, % 6.75/1.68 | all_29_0, simplifying with (4), (8) gives: % 6.75/1.68 | (10) $difference($sum(all_29_0, all_26_1), all_23_0) = all_23_1 % 6.75/1.68 | % 6.75/1.68 | REDUCE: (7), (10) imply: % 6.75/1.68 | (11) $false % 6.75/1.68 | % 6.75/1.68 | CLOSE: (11) is inconsistent. % 6.75/1.68 | % 6.75/1.68 End of proof % 6.75/1.68 % SZS output end Proof for theBenchmark % 6.75/1.68 % 6.75/1.68 1081ms %------------------------------------------------------------------------------