TSTP Solution File: SYN926+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN926+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 : n003.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:15 EDT 2023
% Result : Theorem 2.45s 1.11s
% Output : Proof 3.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN926+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.32 % Computer : n003.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Sat Aug 26 19:48:09 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.17/0.61 ________ _____
% 0.17/0.61 ___ __ \_________(_)________________________________
% 0.17/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.17/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.17/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.17/0.61
% 0.17/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.17/0.61 (2023-06-19)
% 0.17/0.61
% 0.17/0.61 (c) Philipp Rümmer, 2009-2023
% 0.17/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.17/0.61 Amanda Stjerna.
% 0.17/0.61 Free software under BSD-3-Clause.
% 0.17/0.61
% 0.17/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.17/0.61
% 0.17/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.17/0.63 Running up to 7 provers in parallel.
% 0.17/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.17/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.17/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.17/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.17/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.17/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.17/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.48/0.93 Prover 4: Preprocessing ...
% 1.48/0.93 Prover 1: Preprocessing ...
% 2.08/0.99 Prover 3: Preprocessing ...
% 2.08/0.99 Prover 5: Preprocessing ...
% 2.08/0.99 Prover 2: Preprocessing ...
% 2.08/0.99 Prover 0: Preprocessing ...
% 2.08/0.99 Prover 6: Preprocessing ...
% 2.34/1.03 Prover 4: Constructing countermodel ...
% 2.34/1.03 Prover 1: Constructing countermodel ...
% 2.45/1.04 Prover 0: Proving ...
% 2.45/1.05 Prover 5: Constructing countermodel ...
% 2.45/1.05 Prover 2: Constructing countermodel ...
% 2.45/1.05 Prover 6: Proving ...
% 2.45/1.05 Prover 3: Constructing countermodel ...
% 2.45/1.10 Prover 2: proved (462ms)
% 2.45/1.10 Prover 5: proved (454ms)
% 2.45/1.10
% 2.45/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.45/1.11
% 2.45/1.11
% 2.45/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.45/1.11
% 2.45/1.11 Prover 6: stopped
% 2.45/1.11 Prover 0: stopped
% 2.45/1.11 Prover 3: proved (459ms)
% 2.45/1.11
% 2.45/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.45/1.11
% 2.45/1.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.45/1.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.45/1.11 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.45/1.11 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.95/1.12 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.95/1.12 Prover 7: Preprocessing ...
% 2.95/1.12 Prover 8: Preprocessing ...
% 2.95/1.12 Prover 10: Preprocessing ...
% 2.95/1.13 Prover 11: Preprocessing ...
% 2.95/1.13 Prover 7: Constructing countermodel ...
% 2.95/1.13 Prover 10: Constructing countermodel ...
% 2.95/1.14 Prover 1: Found proof (size 8)
% 2.95/1.14 Prover 4: Found proof (size 7)
% 2.95/1.14 Prover 1: proved (494ms)
% 2.95/1.14 Prover 4: proved (490ms)
% 2.95/1.14 Prover 10: stopped
% 2.95/1.14 Prover 13: Preprocessing ...
% 2.95/1.15 Prover 7: stopped
% 2.95/1.15 Prover 13: Constructing countermodel ...
% 2.95/1.15 Prover 13: stopped
% 2.95/1.15 Prover 8: Warning: ignoring some quantifiers
% 2.95/1.16 Prover 8: Constructing countermodel ...
% 2.95/1.16 Prover 11: Constructing countermodel ...
% 2.95/1.16 Prover 11: stopped
% 2.95/1.16 Prover 8: stopped
% 2.95/1.16
% 2.95/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.95/1.16
% 2.95/1.17 % SZS output start Proof for theBenchmark
% 2.95/1.17 Assumptions after simplification:
% 2.95/1.17 ---------------------------------
% 2.95/1.17
% 2.95/1.17 (prove_this)
% 3.27/1.21 ? [v0: $i] : (p(v0) = 0 & q(v0) = 0 & $i(v0)) & ( ! [v0: $i] : ( ~ (p(v0) =
% 3.27/1.21 0) | ~ $i(v0)) | ! [v0: $i] : ( ~ (q(v0) = 0) | ~ $i(v0)))
% 3.27/1.21
% 3.27/1.21 Those formulas are unsatisfiable:
% 3.27/1.21 ---------------------------------
% 3.27/1.21
% 3.27/1.21 Begin of proof
% 3.27/1.21 |
% 3.27/1.21 | ALPHA: (prove_this) implies:
% 3.27/1.21 | (1) ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0)) | ! [v0: $i] : ( ~ (q(v0) =
% 3.27/1.21 | 0) | ~ $i(v0))
% 3.27/1.22 | (2) ? [v0: $i] : (p(v0) = 0 & q(v0) = 0 & $i(v0))
% 3.27/1.22 |
% 3.27/1.22 | DELTA: instantiating (2) with fresh symbol all_3_0 gives:
% 3.27/1.22 | (3) p(all_3_0) = 0 & q(all_3_0) = 0 & $i(all_3_0)
% 3.27/1.22 |
% 3.27/1.22 | ALPHA: (3) implies:
% 3.27/1.22 | (4) $i(all_3_0)
% 3.27/1.22 | (5) q(all_3_0) = 0
% 3.27/1.22 | (6) p(all_3_0) = 0
% 3.27/1.22 |
% 3.27/1.22 | BETA: splitting (1) gives:
% 3.27/1.22 |
% 3.27/1.22 | Case 1:
% 3.27/1.22 | |
% 3.27/1.22 | | (7) ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0))
% 3.27/1.22 | |
% 3.27/1.22 | | GROUND_INST: instantiating (7) with all_3_0, simplifying with (4), (6)
% 3.27/1.22 | | gives:
% 3.27/1.22 | | (8) $false
% 3.27/1.22 | |
% 3.27/1.22 | | CLOSE: (8) is inconsistent.
% 3.27/1.22 | |
% 3.27/1.22 | Case 2:
% 3.27/1.22 | |
% 3.27/1.22 | | (9) ! [v0: $i] : ( ~ (q(v0) = 0) | ~ $i(v0))
% 3.27/1.22 | |
% 3.27/1.22 | | GROUND_INST: instantiating (9) with all_3_0, simplifying with (4), (5)
% 3.27/1.22 | | gives:
% 3.27/1.22 | | (10) $false
% 3.27/1.22 | |
% 3.27/1.22 | | CLOSE: (10) is inconsistent.
% 3.27/1.22 | |
% 3.27/1.22 | End of split
% 3.27/1.22 |
% 3.27/1.22 End of proof
% 3.27/1.22 % SZS output end Proof for theBenchmark
% 3.27/1.22
% 3.27/1.22 614ms
%------------------------------------------------------------------------------