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