%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN936+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 : n022.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.79s 1.13s % Output : Proof 3.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN936+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n022.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.20/0.34 % CPULimit : 300 % 0.20/0.34 % WCLimit : 300 % 0.20/0.34 % DateTime : Sat Aug 26 19:27:10 EDT 2023 % 0.20/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 1.84/0.96 Prover 4: Preprocessing ... % 1.84/0.96 Prover 1: Preprocessing ... % 1.84/1.01 Prover 5: Preprocessing ... % 1.84/1.01 Prover 3: Preprocessing ... % 1.84/1.01 Prover 2: Preprocessing ... % 1.84/1.01 Prover 0: Preprocessing ... % 1.84/1.01 Prover 6: Preprocessing ... % 2.39/1.05 Prover 4: Constructing countermodel ... % 2.39/1.05 Prover 3: Constructing countermodel ... % 2.39/1.05 Prover 1: Constructing countermodel ... % 2.39/1.06 Prover 5: Proving ... % 2.39/1.06 Prover 2: Proving ... % 2.39/1.06 Prover 0: Proving ... % 2.39/1.06 Prover 6: Proving ... % 2.79/1.13 Prover 2: proved (491ms) % 2.79/1.13 % 2.79/1.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.79/1.13 % 2.79/1.13 Prover 6: stopped % 2.79/1.13 Prover 5: stopped % 2.79/1.13 Prover 0: stopped % 2.79/1.13 Prover 3: stopped % 2.79/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.79/1.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.79/1.14 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.79/1.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.79/1.14 Prover 8: Preprocessing ... % 2.79/1.14 Prover 10: Preprocessing ... % 2.79/1.14 Prover 11: Preprocessing ... % 2.79/1.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.29/1.16 Prover 8: Warning: ignoring some quantifiers % 3.29/1.16 Prover 8: Constructing countermodel ... % 3.29/1.16 Prover 13: Preprocessing ... % 3.34/1.17 Prover 4: Found proof (size 11) % 3.34/1.17 Prover 4: proved (532ms) % 3.34/1.17 Prover 1: stopped % 3.34/1.17 Prover 10: Warning: ignoring some quantifiers % 3.34/1.17 Prover 8: stopped % 3.34/1.17 Prover 7: Preprocessing ... % 3.34/1.17 Prover 10: Constructing countermodel ... % 3.34/1.17 Prover 10: stopped % 3.34/1.17 Prover 11: Constructing countermodel ... % 3.34/1.17 Prover 11: stopped % 3.34/1.18 Prover 7: Warning: ignoring some quantifiers % 3.34/1.18 Prover 13: Warning: ignoring some quantifiers % 3.34/1.18 Prover 13: Constructing countermodel ... % 3.34/1.18 Prover 7: Constructing countermodel ... % 3.34/1.18 Prover 13: stopped % 3.34/1.18 Prover 7: stopped % 3.34/1.18 % 3.34/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.34/1.18 % 3.34/1.18 % SZS output start Proof for theBenchmark % 3.34/1.19 Assumptions after simplification: % 3.34/1.19 --------------------------------- % 3.34/1.19 % 3.34/1.19 (prove_this) % 3.49/1.23 ? [v0: $i] : ? [v1: int] : ? [v2: $i] : ? [v3: int] : ($i(v2) & $i(v0) & % 3.49/1.23 (( ~ (v3 = 0) & p(v2) = v3 & c & ! [v4: $i] : ! [v5: int] : (v5 = 0 | ~ % 3.49/1.23 (p(v4) = v5) | ~ $i(v4))) | ( ~ (v1 = 0) & p(v0) = v1 & c & ! [v4: % 3.49/1.23 $i] : ! [v5: int] : (v5 = 0 | ~ (p(v4) = v5) | ~ $i(v4))))) % 3.49/1.23 % 3.49/1.23 Those formulas are unsatisfiable: % 3.49/1.23 --------------------------------- % 3.49/1.23 % 3.49/1.23 Begin of proof % 3.49/1.23 | % 3.49/1.23 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1, % 3.49/1.23 | all_3_2, all_3_3 gives: % 3.49/1.23 | (1) $i(all_3_1) & $i(all_3_3) & (( ~ (all_3_0 = 0) & p(all_3_1) = all_3_0 & % 3.49/1.23 | c & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ % 3.49/1.23 | $i(v0))) | ( ~ (all_3_2 = 0) & p(all_3_3) = all_3_2 & c & ! [v0: % 3.49/1.23 | $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)))) % 3.58/1.23 | % 3.58/1.23 | ALPHA: (1) implies: % 3.58/1.24 | (2) $i(all_3_3) % 3.58/1.24 | (3) $i(all_3_1) % 3.58/1.24 | (4) ( ~ (all_3_0 = 0) & p(all_3_1) = all_3_0 & c & ! [v0: $i] : ! [v1: % 3.58/1.24 | int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0))) | ( ~ (all_3_2 = 0) % 3.58/1.24 | & p(all_3_3) = all_3_2 & c & ! [v0: $i] : ! [v1: int] : (v1 = 0 | % 3.58/1.24 | ~ (p(v0) = v1) | ~ $i(v0))) % 3.58/1.24 | % 3.58/1.24 | BETA: splitting (4) gives: % 3.58/1.24 | % 3.58/1.24 | Case 1: % 3.58/1.24 | | % 3.58/1.24 | | (5) ~ (all_3_0 = 0) & p(all_3_1) = all_3_0 & c & ! [v0: $i] : ! [v1: % 3.58/1.24 | | int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.58/1.24 | | % 3.58/1.24 | | ALPHA: (5) implies: % 3.58/1.24 | | (6) ~ (all_3_0 = 0) % 3.58/1.24 | | (7) p(all_3_1) = all_3_0 % 3.58/1.24 | | (8) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.58/1.24 | | % 3.58/1.24 | | GROUND_INST: instantiating (8) with all_3_1, all_3_0, simplifying with (3), % 3.58/1.24 | | (7) gives: % 3.58/1.24 | | (9) all_3_0 = 0 % 3.58/1.24 | | % 3.58/1.24 | | REDUCE: (6), (9) imply: % 3.58/1.24 | | (10) $false % 3.58/1.24 | | % 3.58/1.24 | | CLOSE: (10) is inconsistent. % 3.58/1.24 | | % 3.58/1.24 | Case 2: % 3.58/1.24 | | % 3.58/1.24 | | (11) ~ (all_3_2 = 0) & p(all_3_3) = all_3_2 & c & ! [v0: $i] : ! [v1: % 3.58/1.24 | | int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.58/1.24 | | % 3.58/1.24 | | ALPHA: (11) implies: % 3.58/1.25 | | (12) ~ (all_3_2 = 0) % 3.58/1.25 | | (13) p(all_3_3) = all_3_2 % 3.58/1.25 | | (14) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.58/1.25 | | % 3.58/1.25 | | GROUND_INST: instantiating (14) with all_3_3, all_3_2, simplifying with (2), % 3.58/1.25 | | (13) gives: % 3.58/1.25 | | (15) all_3_2 = 0 % 3.58/1.25 | | % 3.58/1.25 | | REDUCE: (12), (15) imply: % 3.58/1.25 | | (16) $false % 3.58/1.25 | | % 3.58/1.25 | | CLOSE: (16) is inconsistent. % 3.58/1.25 | | % 3.58/1.25 | End of split % 3.58/1.25 | % 3.58/1.25 End of proof % 3.58/1.25 % SZS output end Proof for theBenchmark % 3.58/1.25 % 3.58/1.25 634ms %------------------------------------------------------------------------------