%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN979+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 : n005.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:27 EDT 2023 % Result : Theorem 3.52s 1.19s % Output : Proof 4.04s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN979+1 : TPTP v8.1.2. Released v3.1.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n005.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 : Sat Aug 26 20:06:38 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.57/0.94 Prover 1: Preprocessing ... % 1.57/0.95 Prover 4: Preprocessing ... % 2.18/0.99 Prover 3: Preprocessing ... % 2.18/0.99 Prover 0: Preprocessing ... % 2.18/0.99 Prover 5: Preprocessing ... % 2.18/0.99 Prover 2: Preprocessing ... % 2.18/0.99 Prover 6: Preprocessing ... % 2.55/1.06 Prover 2: Proving ... % 2.55/1.06 Prover 5: Proving ... % 2.55/1.09 Prover 1: Warning: ignoring some quantifiers % 2.55/1.09 Prover 4: Constructing countermodel ... % 2.55/1.09 Prover 1: Constructing countermodel ... % 2.55/1.10 Prover 3: Warning: ignoring some quantifiers % 2.55/1.11 Prover 3: Constructing countermodel ... % 2.55/1.11 Prover 6: Proving ... % 3.10/1.12 Prover 0: Proving ... % 3.52/1.19 Prover 2: proved (567ms) % 3.52/1.19 % 3.52/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.52/1.19 % 3.52/1.19 Prover 0: proved (568ms) % 3.52/1.19 % 3.52/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.52/1.19 % 3.52/1.20 Prover 3: stopped % 3.52/1.20 Prover 6: stopped % 3.52/1.20 Prover 5: stopped % 3.52/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.52/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.52/1.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.52/1.20 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.52/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.52/1.21 Prover 4: Found proof (size 5) % 3.52/1.22 Prover 4: proved (579ms) % 3.52/1.22 Prover 8: Preprocessing ... % 3.52/1.22 Prover 13: Preprocessing ... % 3.52/1.22 Prover 10: Preprocessing ... % 3.52/1.22 Prover 11: Preprocessing ... % 3.52/1.23 Prover 13: Warning: ignoring some quantifiers % 3.52/1.23 Prover 13: Constructing countermodel ... % 3.52/1.23 Prover 10: Warning: ignoring some quantifiers % 3.52/1.23 Prover 10: Constructing countermodel ... % 3.52/1.23 Prover 13: stopped % 3.52/1.23 Prover 10: stopped % 3.52/1.24 Prover 1: stopped % 3.52/1.24 Prover 7: Preprocessing ... % 3.52/1.25 Prover 11: stopped % 3.52/1.25 Prover 7: Warning: ignoring some quantifiers % 3.52/1.25 Prover 7: Constructing countermodel ... % 3.52/1.25 Prover 7: stopped % 3.52/1.26 Prover 8: Warning: ignoring some quantifiers % 4.04/1.26 Prover 8: Constructing countermodel ... % 4.04/1.27 Prover 8: stopped % 4.04/1.27 % 4.04/1.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.04/1.27 % 4.04/1.27 % SZS output start Proof for theBenchmark % 4.04/1.27 Assumptions after simplification: % 4.04/1.27 --------------------------------- % 4.04/1.27 % 4.04/1.27 (prove_this) % 4.04/1.30 ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & s(v0) = 0 & r(v1) = % 4.04/1.30 0 & r(v0) = 0 & p(v0, v1) = v2 & q(v1) = 0 & q(v0) = 0 & $i(v1) & $i(v0) & % 4.04/1.31 ! [v3: $i] : ! [v4: $i] : ! [v5: int] : (v5 = 0 | ~ (p(v3, v4) = v5) | ~ % 4.04/1.31 $i(v4) | ~ $i(v3)) & ! [v3: $i] : ! [v4: int] : (v4 = 0 | ~ (p(v3, v0) % 4.04/1.31 = v4) | ~ $i(v3) | ? [v5: int] : ( ~ (v5 = 0) & q(v3) = v5)) & ! [v3: % 4.04/1.31 $i] : ! [v4: int] : (v4 = 0 | ~ (p(v1, v3) = v4) | ~ $i(v3) | ? [v5: % 4.04/1.31 int] : ( ~ (v5 = 0) & r(v3) = v5)) & ! [v3: $i] : ( ~ (r(v3) = 0) | ~ % 4.04/1.31 $i(v3) | p(v1, v3) = 0) & ! [v3: $i] : ( ~ (q(v3) = 0) | ~ $i(v3) | % 4.04/1.31 p(v3, v0) = 0)) % 4.04/1.31 % 4.04/1.31 Those formulas are unsatisfiable: % 4.04/1.31 --------------------------------- % 4.04/1.31 % 4.04/1.31 Begin of proof % 4.04/1.31 | % 4.04/1.31 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1, all_3_2 % 4.04/1.31 | gives: % 4.04/1.32 | (1) ~ (all_3_0 = 0) & s(all_3_2) = 0 & r(all_3_1) = 0 & r(all_3_2) = 0 & % 4.04/1.32 | p(all_3_2, all_3_1) = all_3_0 & q(all_3_1) = 0 & q(all_3_2) = 0 & % 4.04/1.32 | $i(all_3_1) & $i(all_3_2) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : % 4.04/1.32 | (v2 = 0 | ~ (p(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : % 4.04/1.32 | ! [v1: int] : (v1 = 0 | ~ (p(v0, all_3_2) = v1) | ~ $i(v0) | ? [v2: % 4.04/1.32 | int] : ( ~ (v2 = 0) & q(v0) = v2)) & ! [v0: $i] : ! [v1: int] : % 4.04/1.32 | (v1 = 0 | ~ (p(all_3_1, v0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 % 4.04/1.32 | = 0) & r(v0) = v2)) & ! [v0: $i] : ( ~ (r(v0) = 0) | ~ $i(v0) | % 4.04/1.32 | p(all_3_1, v0) = 0) & ! [v0: $i] : ( ~ (q(v0) = 0) | ~ $i(v0) | % 4.04/1.32 | p(v0, all_3_2) = 0) % 4.04/1.32 | % 4.04/1.32 | ALPHA: (1) implies: % 4.04/1.32 | (2) ~ (all_3_0 = 0) % 4.04/1.32 | (3) $i(all_3_2) % 4.04/1.32 | (4) $i(all_3_1) % 4.04/1.32 | (5) p(all_3_2, all_3_1) = all_3_0 % 4.04/1.32 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (p(v0, v1) = % 4.04/1.32 | v2) | ~ $i(v1) | ~ $i(v0)) % 4.04/1.32 | % 4.04/1.32 | GROUND_INST: instantiating (6) with all_3_2, all_3_1, all_3_0, simplifying % 4.04/1.32 | with (3), (4), (5) gives: % 4.04/1.32 | (7) all_3_0 = 0 % 4.04/1.32 | % 4.04/1.32 | REDUCE: (2), (7) imply: % 4.04/1.32 | (8) $false % 4.04/1.32 | % 4.04/1.32 | CLOSE: (8) is inconsistent. % 4.04/1.32 | % 4.04/1.32 End of proof % 4.04/1.32 % SZS output end Proof for theBenchmark % 4.04/1.32 % 4.04/1.32 719ms %------------------------------------------------------------------------------