%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN367+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 : 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:27:23 EDT 2023 % Result : Theorem 3.45s 1.23s % Output : Proof 3.91s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN367+1 : TPTP v8.1.2. Released v2.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.35 % Computer : n022.cluster.edu % 0.12/0.35 % Model : x86_64 x86_64 % 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.35 % Memory : 8042.1875MB % 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.35 % CPULimit : 300 % 0.12/0.35 % WCLimit : 300 % 0.12/0.35 % DateTime : Sat Aug 26 17:32:25 EDT 2023 % 0.12/0.35 % 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.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.06/1.01 Prover 1: Preprocessing ... % 2.06/1.01 Prover 4: Preprocessing ... % 2.06/1.05 Prover 3: Preprocessing ... % 2.06/1.05 Prover 2: Preprocessing ... % 2.06/1.05 Prover 0: Preprocessing ... % 2.06/1.05 Prover 5: Preprocessing ... % 2.06/1.05 Prover 6: Preprocessing ... % 2.46/1.10 Prover 1: Constructing countermodel ... % 2.46/1.10 Prover 3: Constructing countermodel ... % 2.46/1.10 Prover 2: Proving ... % 2.46/1.10 Prover 5: Proving ... % 2.46/1.11 Prover 6: Proving ... % 2.46/1.11 Prover 4: Constructing countermodel ... % 2.46/1.12 Prover 0: Proving ... % 3.45/1.23 Prover 3: gave up % 3.45/1.23 Prover 1: gave up % 3.45/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.45/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.45/1.23 Prover 0: proved (584ms) % 3.45/1.23 % 3.45/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.45/1.23 % 3.45/1.23 Prover 5: stopped % 3.45/1.23 Prover 6: stopped % 3.45/1.23 Prover 2: stopped % 3.45/1.24 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.45/1.24 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.45/1.24 Prover 7: Preprocessing ... % 3.45/1.24 Prover 8: Preprocessing ... % 3.45/1.24 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 3.45/1.25 Prover 10: Preprocessing ... % 3.45/1.25 Prover 16: Preprocessing ... % 3.45/1.25 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.45/1.26 Prover 13: Preprocessing ... % 3.45/1.26 Prover 11: Preprocessing ... % 3.45/1.26 Prover 16: Warning: ignoring some quantifiers % 3.45/1.26 Prover 16: Constructing countermodel ... % 3.45/1.26 Prover 8: Warning: ignoring some quantifiers % 3.45/1.26 Prover 8: Constructing countermodel ... % 3.45/1.27 Prover 7: Warning: ignoring some quantifiers % 3.45/1.27 Prover 13: Warning: ignoring some quantifiers % 3.45/1.27 Prover 7: Constructing countermodel ... % 3.45/1.27 Prover 4: Found proof (size 10) % 3.45/1.27 Prover 4: proved (618ms) % 3.45/1.27 Prover 13: Constructing countermodel ... % 3.45/1.27 Prover 7: stopped % 3.45/1.27 Prover 8: stopped % 3.45/1.27 Prover 13: stopped % 3.45/1.27 Prover 10: Warning: ignoring some quantifiers % 3.45/1.27 Prover 16: stopped % 3.45/1.27 Prover 10: Constructing countermodel ... % 3.45/1.27 Prover 10: stopped % 3.45/1.29 Prover 11: Constructing countermodel ... % 3.45/1.29 Prover 11: stopped % 3.45/1.29 % 3.45/1.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.45/1.30 % 3.45/1.30 % SZS output start Proof for theBenchmark % 3.45/1.30 Assumptions after simplification: % 3.45/1.30 --------------------------------- % 3.45/1.30 % 3.45/1.30 (x2118) % 3.91/1.34 ? [v0: $i] : ? [v1: int] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & ~ % 3.91/1.34 (v1 = 0) & big_r(v0) = v1 & big_q(v2) = v3 & $i(v2) & $i(v0) & ! [v4: $i] : % 3.91/1.34 ! [v5: int] : (v5 = 0 | ~ (big_r(v4) = v5) | ~ $i(v4) | big_q(v4) = 0) & % 3.91/1.34 ! [v4: $i] : ! [v5: int] : (v5 = 0 | ~ (big_r(v4) = v5) | ~ $i(v4) | p) & % 3.91/1.34 ! [v4: $i] : ! [v5: int] : (v5 = 0 | ~ (big_q(v4) = v5) | ~ $i(v4) | ~ % 3.91/1.34 p) & ! [v4: $i] : ! [v5: int] : (v5 = 0 | ~ (big_q(v4) = v5) | ~ % 3.91/1.34 $i(v4) | big_r(v4) = 0) & ! [v4: $i] : ! [v5: MultipleValueBool] : ( ~ % 3.91/1.34 (big_r(v4) = v5) | ~ $i(v4) | ~ p | big_q(v4) = 0) & ! [v4: $i] : ! % 3.91/1.34 [v5: MultipleValueBool] : ( ~ (big_q(v4) = v5) | ~ $i(v4) | big_r(v4) = 0 | % 3.91/1.34 p)) % 3.91/1.34 % 3.91/1.34 Those formulas are unsatisfiable: % 3.91/1.34 --------------------------------- % 3.91/1.34 % 3.91/1.34 Begin of proof % 3.91/1.34 | % 3.91/1.34 | DELTA: instantiating (x2118) with fresh symbols all_3_0, all_3_1, all_3_2, % 3.91/1.34 | all_3_3 gives: % 3.91/1.35 | (1) ~ (all_3_0 = 0) & ~ (all_3_2 = 0) & big_r(all_3_3) = all_3_2 & % 3.91/1.35 | big_q(all_3_1) = all_3_0 & $i(all_3_1) & $i(all_3_3) & ! [v0: $i] : ! % 3.91/1.35 | [v1: int] : (v1 = 0 | ~ (big_r(v0) = v1) | ~ $i(v0) | big_q(v0) = 0) % 3.91/1.35 | & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_r(v0) = v1) | ~ % 3.91/1.35 | $i(v0) | p) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_q(v0) = % 3.91/1.35 | v1) | ~ $i(v0) | ~ p) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 3.91/1.35 | (big_q(v0) = v1) | ~ $i(v0) | big_r(v0) = 0) & ! [v0: $i] : ! [v1: % 3.91/1.35 | MultipleValueBool] : ( ~ (big_r(v0) = v1) | ~ $i(v0) | ~ p | % 3.91/1.35 | big_q(v0) = 0) & ! [v0: $i] : ! [v1: MultipleValueBool] : ( ~ % 3.91/1.35 | (big_q(v0) = v1) | ~ $i(v0) | big_r(v0) = 0 | p) % 3.91/1.35 | % 3.91/1.35 | ALPHA: (1) implies: % 3.91/1.35 | (2) ~ (all_3_2 = 0) % 3.91/1.35 | (3) ~ (all_3_0 = 0) % 3.91/1.35 | (4) $i(all_3_3) % 3.91/1.35 | (5) $i(all_3_1) % 3.91/1.35 | (6) big_q(all_3_1) = all_3_0 % 3.91/1.35 | (7) big_r(all_3_3) = all_3_2 % 3.91/1.35 | (8) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_q(v0) = v1) | ~ $i(v0) % 3.91/1.35 | | ~ p) % 3.91/1.36 | (9) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_r(v0) = v1) | ~ $i(v0) % 3.91/1.36 | | p) % 3.91/1.36 | % 3.91/1.36 | GROUND_INST: instantiating (9) with all_3_3, all_3_2, simplifying with (4), % 3.91/1.36 | (7) gives: % 3.91/1.36 | (10) all_3_2 = 0 | p % 3.91/1.36 | % 3.91/1.36 | BETA: splitting (10) gives: % 3.91/1.36 | % 3.91/1.36 | Case 1: % 3.91/1.36 | | % 3.91/1.36 | | (11) p % 3.91/1.36 | | % 3.91/1.36 | | GROUND_INST: instantiating (8) with all_3_1, all_3_0, simplifying with (5), % 3.91/1.36 | | (6), (11) gives: % 3.91/1.36 | | (12) all_3_0 = 0 % 3.91/1.36 | | % 3.91/1.36 | | REDUCE: (3), (12) imply: % 3.91/1.36 | | (13) $false % 3.91/1.36 | | % 3.91/1.36 | | CLOSE: (13) is inconsistent. % 3.91/1.36 | | % 3.91/1.36 | Case 2: % 3.91/1.36 | | % 3.91/1.36 | | (14) all_3_2 = 0 % 3.91/1.36 | | % 3.91/1.36 | | REDUCE: (2), (14) imply: % 3.91/1.36 | | (15) $false % 3.91/1.36 | | % 3.91/1.36 | | CLOSE: (15) is inconsistent. % 3.91/1.36 | | % 3.91/1.36 | End of split % 3.91/1.36 | % 3.91/1.36 End of proof % 3.91/1.36 % SZS output end Proof for theBenchmark % 3.91/1.36 % 3.91/1.36 743ms %------------------------------------------------------------------------------