%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN953+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 : 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:29:21 EDT 2023 % Result : Theorem 3.24s 1.16s % Output : Proof 3.84s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SYN953+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n004.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sat Aug 26 21:17:52 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.60 ________ _____ % 0.21/0.60 ___ __ \_________(_)________________________________ % 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.60 % 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.60 (2023-06-19) % 0.21/0.60 % 0.21/0.60 (c) Philipp Rümmer, 2009-2023 % 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.60 Amanda Stjerna. % 0.21/0.60 Free software under BSD-3-Clause. % 0.21/0.60 % 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.60 % 0.21/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.84/0.97 Prover 4: Preprocessing ... % 1.84/0.97 Prover 1: Preprocessing ... % 2.10/1.02 Prover 0: Preprocessing ... % 2.10/1.02 Prover 6: Preprocessing ... % 2.10/1.02 Prover 5: Preprocessing ... % 2.10/1.02 Prover 3: Preprocessing ... % 2.10/1.02 Prover 2: Preprocessing ... % 2.51/1.07 Prover 1: Constructing countermodel ... % 2.51/1.07 Prover 5: Proving ... % 2.51/1.07 Prover 2: Proving ... % 2.51/1.08 Prover 6: Proving ... % 2.51/1.08 Prover 4: Constructing countermodel ... % 2.51/1.08 Prover 3: Constructing countermodel ... % 2.51/1.09 Prover 0: Proving ... % 2.93/1.16 Prover 5: proved (522ms) % 2.93/1.16 Prover 2: proved (525ms) % 3.24/1.16 % 3.24/1.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.24/1.16 % 3.24/1.16 % 3.24/1.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.24/1.16 % 3.24/1.17 Prover 0: proved (526ms) % 3.24/1.17 % 3.24/1.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.24/1.17 % 3.24/1.17 Prover 3: proved (522ms) % 3.24/1.17 % 3.24/1.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.24/1.17 % 3.24/1.17 Prover 6: stopped % 3.24/1.19 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.24/1.19 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.24/1.19 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.24/1.19 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.24/1.19 Prover 8: Preprocessing ... % 3.24/1.19 Prover 7: Preprocessing ... % 3.24/1.19 Prover 11: Preprocessing ... % 3.24/1.19 Prover 10: Preprocessing ... % 3.24/1.19 Prover 4: Found proof (size 11) % 3.24/1.19 Prover 4: proved (551ms) % 3.24/1.19 Prover 1: Found proof (size 12) % 3.24/1.19 Prover 1: proved (553ms) % 3.24/1.19 Prover 7: Warning: ignoring some quantifiers % 3.24/1.19 Prover 7: Constructing countermodel ... % 3.24/1.19 Prover 10: Warning: ignoring some quantifiers % 3.24/1.19 Prover 7: stopped % 3.24/1.19 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.24/1.19 Prover 10: Constructing countermodel ... % 3.24/1.19 Prover 10: stopped % 3.24/1.20 Prover 13: Preprocessing ... % 3.24/1.20 Prover 13: Warning: ignoring some quantifiers % 3.24/1.21 Prover 8: Warning: ignoring some quantifiers % 3.24/1.21 Prover 13: Constructing countermodel ... % 3.24/1.21 Prover 13: stopped % 3.24/1.21 Prover 8: Constructing countermodel ... % 3.24/1.21 Prover 8: stopped % 3.24/1.21 Prover 11: Constructing countermodel ... % 3.24/1.21 Prover 11: stopped % 3.24/1.21 % 3.24/1.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.24/1.22 % 3.24/1.22 % SZS output start Proof for theBenchmark % 3.24/1.22 Assumptions after simplification: % 3.24/1.22 --------------------------------- % 3.24/1.22 % 3.24/1.22 (prove_this) % 3.70/1.27 ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & q(v0) = v1 & $i(v0) & ! [v2: $i] % 3.70/1.27 : ! [v3: int] : (v3 = 0 | ~ (q(v2) = v3) | ~ $i(v2) | ? [v4: int] : ( ~ % 3.70/1.27 (v4 = 0) & p(v2) = v4)) & ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 3.70/1.27 (p(v2) = v3) | ~ $i(v2)) & ! [v2: $i] : ( ~ (p(v2) = 0) | ~ $i(v2) | % 3.70/1.27 q(v2) = 0)) % 3.70/1.27 % 3.70/1.27 Those formulas are unsatisfiable: % 3.70/1.27 --------------------------------- % 3.70/1.27 % 3.70/1.27 Begin of proof % 3.70/1.27 | % 3.70/1.27 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1 gives: % 3.70/1.28 | (1) ~ (all_3_0 = 0) & q(all_3_1) = all_3_0 & $i(all_3_1) & ! [v0: $i] : % 3.70/1.28 | ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0) | ? [v2: int] : ( % 3.70/1.28 | ~ (v2 = 0) & p(v0) = v2)) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | % 3.70/1.28 | ~ (p(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ( ~ (p(v0) = 0) | ~ % 3.70/1.28 | $i(v0) | q(v0) = 0) % 3.70/1.28 | % 3.70/1.28 | ALPHA: (1) implies: % 3.70/1.28 | (2) ~ (all_3_0 = 0) % 3.84/1.28 | (3) $i(all_3_1) % 3.84/1.28 | (4) q(all_3_1) = all_3_0 % 3.84/1.28 | (5) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.84/1.28 | (6) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0) | ? % 3.84/1.28 | [v2: int] : ( ~ (v2 = 0) & p(v0) = v2)) % 3.84/1.28 | % 3.84/1.28 | GROUND_INST: instantiating (6) with all_3_1, all_3_0, simplifying with (3), % 3.84/1.28 | (4) gives: % 3.84/1.28 | (7) all_3_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & p(all_3_1) = v0) % 3.84/1.28 | % 3.84/1.28 | BETA: splitting (7) gives: % 3.84/1.28 | % 3.84/1.29 | Case 1: % 3.84/1.29 | | % 3.84/1.29 | | (8) all_3_0 = 0 % 3.84/1.29 | | % 3.84/1.29 | | REDUCE: (2), (8) imply: % 3.84/1.29 | | (9) $false % 3.84/1.29 | | % 3.84/1.29 | | CLOSE: (9) is inconsistent. % 3.84/1.29 | | % 3.84/1.29 | Case 2: % 3.84/1.29 | | % 3.84/1.29 | | (10) ? [v0: int] : ( ~ (v0 = 0) & p(all_3_1) = v0) % 3.84/1.29 | | % 3.84/1.29 | | DELTA: instantiating (10) with fresh symbol all_13_0 gives: % 3.84/1.29 | | (11) ~ (all_13_0 = 0) & p(all_3_1) = all_13_0 % 3.84/1.29 | | % 3.84/1.29 | | ALPHA: (11) implies: % 3.84/1.29 | | (12) ~ (all_13_0 = 0) % 3.84/1.29 | | (13) p(all_3_1) = all_13_0 % 3.84/1.29 | | % 3.84/1.29 | | GROUND_INST: instantiating (5) with all_3_1, all_13_0, simplifying with (3), % 3.84/1.29 | | (13) gives: % 3.84/1.29 | | (14) all_13_0 = 0 % 3.84/1.29 | | % 3.84/1.29 | | REDUCE: (12), (14) imply: % 3.84/1.29 | | (15) $false % 3.84/1.29 | | % 3.84/1.29 | | CLOSE: (15) is inconsistent. % 3.84/1.29 | | % 3.84/1.29 | End of split % 3.84/1.29 | % 3.84/1.29 End of proof % 3.84/1.29 % SZS output end Proof for theBenchmark % 3.84/1.29 % 3.84/1.29 685ms %------------------------------------------------------------------------------