%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN063+1 : TPTP v8.1.2. Released v2.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n004.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:26:25 EDT 2023 % Result : Theorem 3.48s 1.26s % Output : Proof 4.27s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SYN063+1 : TPTP v8.1.2. Released v2.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.35 % Computer : n004.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Sat Aug 26 20:26:52 EDT 2023 % 0.21/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.64 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.00/1.05 Prover 1: Preprocessing ... % 2.00/1.05 Prover 4: Preprocessing ... % 2.42/1.09 Prover 6: Preprocessing ... % 2.42/1.09 Prover 5: Preprocessing ... % 2.42/1.09 Prover 3: Preprocessing ... % 2.42/1.09 Prover 0: Preprocessing ... % 2.42/1.09 Prover 2: Preprocessing ... % 3.05/1.17 Prover 1: Warning: ignoring some quantifiers % 3.05/1.17 Prover 3: Warning: ignoring some quantifiers % 3.05/1.17 Prover 1: Constructing countermodel ... % 3.05/1.17 Prover 3: Constructing countermodel ... % 3.05/1.17 Prover 4: Constructing countermodel ... % 3.05/1.17 Prover 0: Proving ... % 3.05/1.17 Prover 2: Proving ... % 3.05/1.17 Prover 6: Proving ... % 3.05/1.17 Prover 5: Proving ... % 3.48/1.26 Prover 0: proved (616ms) % 3.48/1.26 % 3.48/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.48/1.26 % 3.48/1.26 Prover 3: proved (613ms) % 3.48/1.26 % 3.48/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.48/1.26 % 3.48/1.26 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.48/1.26 Prover 6: stopped % 3.48/1.26 Prover 5: stopped % 3.48/1.27 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.48/1.27 Prover 2: stopped % 3.48/1.28 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.48/1.28 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.48/1.28 Prover 8: Preprocessing ... % 3.48/1.28 Prover 7: Preprocessing ... % 3.48/1.28 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.48/1.29 Prover 10: Preprocessing ... % 3.48/1.29 Prover 11: Preprocessing ... % 3.48/1.30 Prover 4: Found proof (size 13) % 3.48/1.30 Prover 4: proved (651ms) % 3.48/1.30 Prover 7: Warning: ignoring some quantifiers % 3.48/1.30 Prover 7: Constructing countermodel ... % 3.48/1.30 Prover 13: Preprocessing ... % 3.48/1.30 Prover 1: stopped % 3.48/1.30 Prover 7: stopped % 3.48/1.31 Prover 8: Warning: ignoring some quantifiers % 3.48/1.31 Prover 8: Constructing countermodel ... % 3.48/1.31 Prover 10: Warning: ignoring some quantifiers % 3.48/1.31 Prover 10: Constructing countermodel ... % 3.48/1.31 Prover 8: stopped % 3.48/1.32 Prover 10: stopped % 3.48/1.32 Prover 13: Warning: ignoring some quantifiers % 3.48/1.32 Prover 13: Constructing countermodel ... % 3.48/1.32 Prover 13: stopped % 3.48/1.33 Prover 11: Constructing countermodel ... % 3.48/1.33 Prover 11: stopped % 3.48/1.33 % 3.48/1.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.48/1.33 % 3.48/1.33 % SZS output start Proof for theBenchmark % 3.48/1.34 Assumptions after simplification: % 3.48/1.34 --------------------------------- % 3.48/1.34 % 3.48/1.34 (pel33) % 3.48/1.37 $i(c) & $i(b) & $i(a) & ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: % 3.48/1.37 $i] : ? [v4: int] : ? [v5: $i] : ? [v6: any] : (big_p(c) = v2 & big_p(b) % 3.48/1.37 = v1 & big_p(a) = v0 & $i(v5) & $i(v3) & ((v0 = 0 & ~ (v4 = 0) & ~ (v2 = % 3.48/1.37 0) & ~ (v1 = 0) & big_p(v3) = v4 & ! [v7: $i] : ! [v8: int] : (v8 = % 3.48/1.37 0 | ~ (big_p(v7) = v8) | ~ $i(v7))) | (v0 = 0 & ~ (v2 = 0) & % 3.48/1.37 big_p(v5) = v6 & ! [v7: $i] : ! [v8: MultipleValueBool] : ( ~ (v1 = 0) % 3.48/1.37 | ~ (big_p(v7) = v8) | ~ $i(v7)) & ! [v7: $i] : ! [v8: int] : (v8 % 3.48/1.37 = 0 | ~ (big_p(v7) = v8) | ~ $i(v7)) & ( ~ (v6 = 0) | v1 = 0)))) % 3.48/1.37 % 3.48/1.37 Those formulas are unsatisfiable: % 3.48/1.37 --------------------------------- % 3.48/1.37 % 3.48/1.37 Begin of proof % 3.48/1.37 | % 3.48/1.37 | ALPHA: (pel33) implies: % 3.48/1.38 | (1) $i(b) % 3.48/1.38 | (2) $i(c) % 3.48/1.38 | (3) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: $i] : ? [v4: int] % 3.48/1.38 | : ? [v5: $i] : ? [v6: any] : (big_p(c) = v2 & big_p(b) = v1 & % 3.48/1.38 | big_p(a) = v0 & $i(v5) & $i(v3) & ((v0 = 0 & ~ (v4 = 0) & ~ (v2 = % 3.48/1.38 | 0) & ~ (v1 = 0) & big_p(v3) = v4 & ! [v7: $i] : ! [v8: int] % 3.48/1.38 | : (v8 = 0 | ~ (big_p(v7) = v8) | ~ $i(v7))) | (v0 = 0 & ~ (v2 % 3.48/1.38 | = 0) & big_p(v5) = v6 & ! [v7: $i] : ! [v8: % 3.48/1.38 | MultipleValueBool] : ( ~ (v1 = 0) | ~ (big_p(v7) = v8) | ~ % 3.48/1.38 | $i(v7)) & ! [v7: $i] : ! [v8: int] : (v8 = 0 | ~ (big_p(v7) % 3.48/1.38 | = v8) | ~ $i(v7)) & ( ~ (v6 = 0) | v1 = 0)))) % 3.48/1.38 | % 3.48/1.38 | DELTA: instantiating (3) with fresh symbols all_4_0, all_4_1, all_4_2, % 3.48/1.38 | all_4_3, all_4_4, all_4_5, all_4_6 gives: % 3.48/1.39 | (4) big_p(c) = all_4_4 & big_p(b) = all_4_5 & big_p(a) = all_4_6 & % 3.48/1.39 | $i(all_4_1) & $i(all_4_3) & ((all_4_6 = 0 & ~ (all_4_2 = 0) & ~ % 3.48/1.39 | (all_4_4 = 0) & ~ (all_4_5 = 0) & big_p(all_4_3) = all_4_2 & ! % 3.48/1.39 | [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_p(v0) = v1) | ~ % 3.48/1.39 | $i(v0))) | (all_4_6 = 0 & ~ (all_4_4 = 0) & big_p(all_4_1) = % 3.48/1.39 | all_4_0 & ! [v0: $i] : ! [v1: MultipleValueBool] : ( ~ (all_4_5 = % 3.48/1.39 | 0) | ~ (big_p(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1: % 3.48/1.39 | int] : (v1 = 0 | ~ (big_p(v0) = v1) | ~ $i(v0)) & ( ~ (all_4_0 % 3.48/1.39 | = 0) | all_4_5 = 0))) % 3.48/1.39 | % 3.48/1.39 | ALPHA: (4) implies: % 3.48/1.39 | (5) big_p(b) = all_4_5 % 3.48/1.39 | (6) big_p(c) = all_4_4 % 3.48/1.39 | (7) (all_4_6 = 0 & ~ (all_4_2 = 0) & ~ (all_4_4 = 0) & ~ (all_4_5 = 0) & % 3.48/1.39 | big_p(all_4_3) = all_4_2 & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 3.48/1.39 | (big_p(v0) = v1) | ~ $i(v0))) | (all_4_6 = 0 & ~ (all_4_4 = 0) & % 3.48/1.39 | big_p(all_4_1) = all_4_0 & ! [v0: $i] : ! [v1: MultipleValueBool] : % 3.48/1.39 | ( ~ (all_4_5 = 0) | ~ (big_p(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : % 3.48/1.39 | ! [v1: int] : (v1 = 0 | ~ (big_p(v0) = v1) | ~ $i(v0)) & ( ~ % 3.48/1.39 | (all_4_0 = 0) | all_4_5 = 0)) % 3.48/1.39 | % 3.48/1.39 | BETA: splitting (7) gives: % 3.48/1.39 | % 3.48/1.39 | Case 1: % 3.48/1.39 | | % 3.48/1.39 | | (8) all_4_6 = 0 & ~ (all_4_2 = 0) & ~ (all_4_4 = 0) & ~ (all_4_5 = 0) % 3.48/1.39 | | & big_p(all_4_3) = all_4_2 & ! [v0: $i] : ! [v1: int] : (v1 = 0 | % 3.48/1.39 | | ~ (big_p(v0) = v1) | ~ $i(v0)) % 3.48/1.39 | | % 3.48/1.39 | | ALPHA: (8) implies: % 3.48/1.39 | | (9) ~ (all_4_5 = 0) % 3.48/1.39 | | (10) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_p(v0) = v1) | ~ % 3.48/1.39 | | $i(v0)) % 3.48/1.39 | | % 3.48/1.40 | | GROUND_INST: instantiating (10) with b, all_4_5, simplifying with (1), (5) % 3.48/1.40 | | gives: % 4.27/1.40 | | (11) all_4_5 = 0 % 4.27/1.40 | | % 4.27/1.40 | | REDUCE: (9), (11) imply: % 4.27/1.40 | | (12) $false % 4.27/1.40 | | % 4.27/1.40 | | CLOSE: (12) is inconsistent. % 4.27/1.40 | | % 4.27/1.40 | Case 2: % 4.27/1.40 | | % 4.27/1.40 | | (13) all_4_6 = 0 & ~ (all_4_4 = 0) & big_p(all_4_1) = all_4_0 & ! [v0: % 4.27/1.40 | | $i] : ! [v1: MultipleValueBool] : ( ~ (all_4_5 = 0) | ~ % 4.27/1.40 | | (big_p(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1: int] : (v1 = % 4.27/1.40 | | 0 | ~ (big_p(v0) = v1) | ~ $i(v0)) & ( ~ (all_4_0 = 0) | all_4_5 % 4.27/1.40 | | = 0) % 4.27/1.40 | | % 4.27/1.40 | | ALPHA: (13) implies: % 4.27/1.40 | | (14) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_p(v0) = v1) | ~ % 4.27/1.40 | | $i(v0)) % 4.27/1.40 | | (15) ! [v0: $i] : ! [v1: MultipleValueBool] : ( ~ (all_4_5 = 0) | ~ % 4.27/1.40 | | (big_p(v0) = v1) | ~ $i(v0)) % 4.27/1.40 | | % 4.27/1.40 | | GROUND_INST: instantiating (14) with b, all_4_5, simplifying with (1), (5) % 4.27/1.40 | | gives: % 4.27/1.40 | | (16) all_4_5 = 0 % 4.27/1.40 | | % 4.27/1.40 | | GROUND_INST: instantiating (15) with c, all_4_4, simplifying with (2), (6) % 4.27/1.40 | | gives: % 4.27/1.40 | | (17) ~ (all_4_5 = 0) % 4.27/1.40 | | % 4.27/1.40 | | REDUCE: (16), (17) imply: % 4.27/1.40 | | (18) $false % 4.27/1.40 | | % 4.27/1.40 | | CLOSE: (18) is inconsistent. % 4.27/1.40 | | % 4.27/1.40 | End of split % 4.27/1.40 | % 4.27/1.40 End of proof % 4.27/1.40 % SZS output end Proof for theBenchmark % 4.27/1.40 % 4.27/1.40 776ms %------------------------------------------------------------------------------