%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN935+1 : TPTP v8.1.2. Released v3.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n025.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 03:29:17 EDT 2023 % Result : Theorem 2.26s 1.61s % Output : Proof 2.91s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.21 % Problem : SYN935+1 : TPTP v8.1.2. Released v3.1.0. % 0.02/0.23 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.08/0.44 % Computer : n025.cluster.edu % 0.08/0.44 % Model : x86_64 x86_64 % 0.08/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.44 % Memory : 8042.1875MB % 0.08/0.44 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.44 % CPULimit : 300 % 0.08/0.44 % WCLimit : 300 % 0.08/0.44 % DateTime : Sat Aug 26 21:46:23 EDT 2023 % 0.08/0.44 % CPUTime : % 0.38/0.80 ________ _____ % 0.38/0.80 ___ __ \_________(_)________________________________ % 0.38/0.80 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.38/0.80 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.38/0.80 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.38/0.80 % 0.38/0.80 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.38/0.80 (2023-06-19) % 0.38/0.80 % 0.38/0.80 (c) Philipp Rümmer, 2009-2023 % 0.38/0.80 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.38/0.80 Amanda Stjerna. % 0.38/0.80 Free software under BSD-3-Clause. % 0.38/0.80 % 0.38/0.80 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.38/0.80 % 0.38/0.80 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.48/0.82 Running up to 7 provers in parallel. % 0.48/0.85 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.48/0.85 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.48/0.85 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.48/0.85 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.48/0.85 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.48/0.85 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.48/0.85 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.16/1.22 Prover 4: Preprocessing ... % 1.16/1.22 Prover 1: Preprocessing ... % 1.53/1.33 Prover 5: Preprocessing ... % 1.53/1.33 Prover 3: Preprocessing ... % 1.53/1.33 Prover 0: Preprocessing ... % 1.53/1.33 Prover 2: Preprocessing ... % 1.53/1.33 Prover 6: Preprocessing ... % 1.53/1.43 Prover 1: Warning: ignoring some quantifiers % 1.53/1.46 Prover 1: Constructing countermodel ... % 1.53/1.46 Prover 4: Constructing countermodel ... % 1.53/1.48 Prover 0: Proving ... % 1.53/1.48 Prover 2: Proving ... % 1.53/1.49 Prover 3: Warning: ignoring some quantifiers % 1.53/1.49 Prover 3: Constructing countermodel ... % 1.53/1.50 Prover 6: Proving ... % 1.53/1.50 Prover 5: Proving ... % 2.26/1.60 Prover 0: proved (772ms) % 2.26/1.60 Prover 2: proved (765ms) % 2.26/1.61 % 2.26/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.26/1.61 % 2.26/1.62 % 2.26/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.26/1.62 % 2.26/1.63 Prover 3: gave up % 2.26/1.63 Prover 6: stopped % 2.47/1.67 Prover 5: stopped % 2.49/1.69 Prover 1: gave up % 2.49/1.70 Prover 4: Found proof (size 11) % 2.49/1.70 Prover 4: proved (783ms) % 2.49/1.70 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.49/1.70 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.49/1.70 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.49/1.70 Prover 7: Preprocessing ... % 2.49/1.70 Prover 10: Preprocessing ... % 2.49/1.70 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.49/1.70 Prover 8: Preprocessing ... % 2.49/1.70 Prover 7: Warning: ignoring some quantifiers % 2.49/1.70 Prover 7: Constructing countermodel ... % 2.49/1.70 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.49/1.70 Prover 13: Preprocessing ... % 2.49/1.71 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 2.59/1.72 Prover 7: stopped % 2.59/1.72 Prover 10: Warning: ignoring some quantifiers % 2.59/1.72 Prover 10: Constructing countermodel ... % 2.59/1.72 Prover 10: stopped % 2.59/1.73 Prover 11: Preprocessing ... % 2.59/1.73 Prover 8: Warning: ignoring some quantifiers % 2.59/1.73 Prover 16: Preprocessing ... % 2.59/1.73 Prover 8: Constructing countermodel ... % 2.59/1.73 Prover 13: Warning: ignoring some quantifiers % 2.59/1.73 Prover 8: stopped % 2.59/1.73 Prover 13: Constructing countermodel ... % 2.59/1.73 Prover 13: stopped % 2.59/1.73 Prover 16: Warning: ignoring some quantifiers % 2.67/1.74 Prover 16: Constructing countermodel ... % 2.67/1.74 Prover 16: stopped % 2.67/1.75 Prover 11: Constructing countermodel ... % 2.67/1.75 Prover 11: stopped % 2.67/1.75 % 2.67/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.67/1.75 % 2.67/1.75 % SZS output start Proof for theBenchmark % 2.67/1.76 Assumptions after simplification: % 2.67/1.76 --------------------------------- % 2.67/1.76 % 2.67/1.76 (prove_this) % 2.86/1.83 ? [v0: $i] : ? [v1: int] : ? [v2: $i] : ? [v3: int] : ($i(v2) & $i(v0) & % 2.86/1.83 ! [v4: $i] : ! [v5: int] : (v5 = 0 | ~ (p(v4) = v5) | ~ $i(v4)) & (( ~ % 2.86/1.83 (v3 = 0) & p(v2) = v3 & ~ c) | ( ~ (v1 = 0) & p(v0) = v1 & ~ c))) % 2.86/1.83 % 2.86/1.83 Those formulas are unsatisfiable: % 2.86/1.83 --------------------------------- % 2.86/1.83 % 2.86/1.83 Begin of proof % 2.86/1.83 | % 2.86/1.85 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1, % 2.86/1.85 | all_3_2, all_3_3 gives: % 2.86/1.87 | (1) $i(all_3_1) & $i(all_3_3) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 2.86/1.87 | (p(v0) = v1) | ~ $i(v0)) & (( ~ (all_3_0 = 0) & p(all_3_1) = all_3_0 % 2.86/1.87 | & ~ c) | ( ~ (all_3_2 = 0) & p(all_3_3) = all_3_2 & ~ c)) % 2.91/1.88 | % 2.91/1.88 | ALPHA: (1) implies: % 2.91/1.88 | (2) $i(all_3_3) % 2.91/1.88 | (3) $i(all_3_1) % 2.91/1.88 | (4) ( ~ (all_3_0 = 0) & p(all_3_1) = all_3_0 & ~ c) | ( ~ (all_3_2 = 0) & % 2.91/1.88 | p(all_3_3) = all_3_2 & ~ c) % 2.91/1.88 | (5) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 2.91/1.88 | % 2.91/1.88 | BETA: splitting (4) gives: % 2.91/1.88 | % 2.91/1.88 | Case 1: % 2.91/1.88 | | % 2.91/1.88 | | (6) ~ (all_3_0 = 0) & p(all_3_1) = all_3_0 & ~ c % 2.91/1.88 | | % 2.91/1.88 | | ALPHA: (6) implies: % 2.91/1.88 | | (7) ~ (all_3_0 = 0) % 2.91/1.88 | | (8) p(all_3_1) = all_3_0 % 2.91/1.88 | | % 2.91/1.88 | | GROUND_INST: instantiating (5) with all_3_1, all_3_0, simplifying with (3), % 2.91/1.88 | | (8) gives: % 2.91/1.88 | | (9) all_3_0 = 0 % 2.91/1.88 | | % 2.91/1.88 | | REDUCE: (7), (9) imply: % 2.91/1.88 | | (10) $false % 2.91/1.88 | | % 2.91/1.88 | | CLOSE: (10) is inconsistent. % 2.91/1.88 | | % 2.91/1.88 | Case 2: % 2.91/1.88 | | % 2.91/1.88 | | (11) ~ (all_3_2 = 0) & p(all_3_3) = all_3_2 & ~ c % 2.91/1.88 | | % 2.91/1.88 | | ALPHA: (11) implies: % 2.91/1.88 | | (12) ~ (all_3_2 = 0) % 2.91/1.88 | | (13) p(all_3_3) = all_3_2 % 2.91/1.88 | | % 2.91/1.88 | | GROUND_INST: instantiating (5) with all_3_3, all_3_2, simplifying with (2), % 2.91/1.88 | | (13) gives: % 2.91/1.88 | | (14) all_3_2 = 0 % 2.91/1.88 | | % 2.91/1.88 | | REDUCE: (12), (14) imply: % 2.91/1.88 | | (15) $false % 2.91/1.88 | | % 2.91/1.88 | | CLOSE: (15) is inconsistent. % 2.91/1.88 | | % 2.91/1.88 | End of split % 2.91/1.88 | % 2.91/1.88 End of proof % 2.91/1.88 % SZS output end Proof for theBenchmark % 2.91/1.89 % 2.91/1.89 1088ms %------------------------------------------------------------------------------