%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN958+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 : n015.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:22 EDT 2023 % Result : Theorem 2.73s 1.11s % Output : Proof 3.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN958+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 : n015.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 18:29:23 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.59 ________ _____ % 0.20/0.59 ___ __ \_________(_)________________________________ % 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.59 % 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.59 (2023-06-19) % 0.20/0.59 % 0.20/0.59 (c) Philipp Rümmer, 2009-2023 % 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.59 Amanda Stjerna. % 0.20/0.59 Free software under BSD-3-Clause. % 0.20/0.59 % 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.59 % 0.20/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.60 Running up to 7 provers in parallel. % 0.20/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.20/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 1.62/0.92 Prover 1: Preprocessing ... % 1.62/0.92 Prover 4: Preprocessing ... % 2.07/0.98 Prover 3: Preprocessing ... % 2.07/0.98 Prover 0: Preprocessing ... % 2.07/0.98 Prover 5: Preprocessing ... % 2.07/0.98 Prover 6: Preprocessing ... % 2.07/0.98 Prover 2: Preprocessing ... % 2.41/1.02 Prover 1: Constructing countermodel ... % 2.41/1.02 Prover 4: Constructing countermodel ... % 2.41/1.03 Prover 2: Proving ... % 2.41/1.03 Prover 5: Proving ... % 2.41/1.03 Prover 6: Proving ... % 2.41/1.03 Prover 3: Constructing countermodel ... % 2.41/1.04 Prover 0: Proving ... % 2.73/1.11 Prover 1: gave up % 2.73/1.11 Prover 3: gave up % 2.73/1.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.73/1.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.73/1.11 Prover 0: proved (505ms) % 2.73/1.11 % 2.73/1.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.73/1.11 % 2.73/1.11 Prover 2: proved (502ms) % 2.73/1.11 % 2.73/1.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.73/1.11 % 2.73/1.11 Prover 4: Found proof (size 8) % 2.73/1.11 Prover 4: proved (502ms) % 2.73/1.12 Prover 5: proved (502ms) % 2.73/1.12 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.73/1.12 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.73/1.12 Prover 8: Preprocessing ... % 2.73/1.12 Prover 7: Preprocessing ... % 2.73/1.12 Prover 10: Preprocessing ... % 2.73/1.12 Prover 6: stopped % 2.73/1.13 Prover 11: Preprocessing ... % 2.73/1.13 Prover 7: Warning: ignoring some quantifiers % 2.73/1.13 Prover 7: Constructing countermodel ... % 2.73/1.13 Prover 7: stopped % 2.73/1.13 Prover 10: Warning: ignoring some quantifiers % 2.73/1.13 Prover 10: Constructing countermodel ... % 2.73/1.13 Prover 10: stopped % 2.73/1.14 Prover 8: Warning: ignoring some quantifiers % 2.73/1.14 Prover 8: Constructing countermodel ... % 3.31/1.14 Prover 8: stopped % 3.31/1.15 Prover 11: Constructing countermodel ... % 3.31/1.15 Prover 11: stopped % 3.31/1.15 % 3.31/1.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.31/1.15 % 3.31/1.16 % SZS output start Proof for theBenchmark % 3.31/1.16 Assumptions after simplification: % 3.31/1.16 --------------------------------- % 3.31/1.16 % 3.31/1.16 (prove_this) % 3.44/1.20 ? [v0: $i] : (a(v0) = 0 & $i(v0) & ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 3.44/1.20 (b(v1) = v2) | ~ $i(v1)) & ! [v1: $i] : ( ~ (b(v1) = 0) | ~ $i(v1) | ? % 3.44/1.20 [v2: int] : ( ~ (v2 = 0) & a(v1) = v2)) & ! [v1: $i] : ( ~ (a(v1) = 0) | % 3.44/1.20 ~ $i(v1) | ? [v2: int] : ( ~ (v2 = 0) & b(v1) = v2))) % 3.44/1.20 % 3.44/1.20 Those formulas are unsatisfiable: % 3.44/1.20 --------------------------------- % 3.44/1.20 % 3.44/1.20 Begin of proof % 3.44/1.20 | % 3.44/1.20 | DELTA: instantiating (prove_this) with fresh symbol all_3_0 gives: % 3.44/1.20 | (1) a(all_3_0) = 0 & $i(all_3_0) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | % 3.44/1.20 | ~ (b(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ( ~ (b(v0) = 0) | ~ % 3.44/1.20 | $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & a(v0) = v1)) & ! [v0: $i] : ( % 3.44/1.20 | ~ (a(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & b(v0) = % 3.44/1.20 | v1)) % 3.44/1.20 | % 3.44/1.20 | ALPHA: (1) implies: % 3.44/1.20 | (2) $i(all_3_0) % 3.44/1.20 | (3) a(all_3_0) = 0 % 3.44/1.21 | (4) ! [v0: $i] : ( ~ (a(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) % 3.44/1.21 | & b(v0) = v1)) % 3.44/1.21 | (5) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (b(v0) = v1) | ~ $i(v0)) % 3.44/1.21 | % 3.44/1.21 | GROUND_INST: instantiating (4) with all_3_0, simplifying with (2), (3) gives: % 3.44/1.21 | (6) ? [v0: int] : ( ~ (v0 = 0) & b(all_3_0) = v0) % 3.44/1.21 | % 3.44/1.21 | DELTA: instantiating (6) with fresh symbol all_11_0 gives: % 3.44/1.21 | (7) ~ (all_11_0 = 0) & b(all_3_0) = all_11_0 % 3.44/1.21 | % 3.44/1.21 | ALPHA: (7) implies: % 3.44/1.21 | (8) ~ (all_11_0 = 0) % 3.44/1.21 | (9) b(all_3_0) = all_11_0 % 3.44/1.21 | % 3.44/1.21 | GROUND_INST: instantiating (5) with all_3_0, all_11_0, simplifying with (2), % 3.44/1.21 | (9) gives: % 3.44/1.21 | (10) all_11_0 = 0 % 3.44/1.21 | % 3.44/1.21 | REDUCE: (8), (10) imply: % 3.44/1.21 | (11) $false % 3.44/1.21 | % 3.44/1.21 | CLOSE: (11) is inconsistent. % 3.44/1.21 | % 3.44/1.21 End of proof % 3.44/1.21 % SZS output end Proof for theBenchmark % 3.44/1.21 % 3.44/1.21 624ms %------------------------------------------------------------------------------