TSTP Solution File: SYN401+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN401+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n021.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:27:32 EDT 2023
% Result : Theorem 2.81s 1.07s
% Output : Proof 3.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN401+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n021.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:46:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 ________ _____
% 0.20/0.59 ___ __ \_________(_)________________________________
% 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.60
% 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.60 (2023-06-19)
% 0.20/0.60
% 0.20/0.60 (c) Philipp Rümmer, 2009-2023
% 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.60 Amanda Stjerna.
% 0.20/0.60 Free software under BSD-3-Clause.
% 0.20/0.60
% 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.60
% 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.61 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.68/0.91 Prover 4: Preprocessing ...
% 1.68/0.91 Prover 1: Preprocessing ...
% 2.07/0.96 Prover 5: Preprocessing ...
% 2.07/0.96 Prover 3: Preprocessing ...
% 2.07/0.96 Prover 6: Preprocessing ...
% 2.07/0.96 Prover 2: Preprocessing ...
% 2.07/0.96 Prover 0: Preprocessing ...
% 2.07/1.00 Prover 1: Constructing countermodel ...
% 2.07/1.00 Prover 3: Constructing countermodel ...
% 2.07/1.00 Prover 4: Constructing countermodel ...
% 2.07/1.00 Prover 2: Proving ...
% 2.07/1.00 Prover 0: Proving ...
% 2.07/1.00 Prover 5: Proving ...
% 2.07/1.01 Prover 6: Proving ...
% 2.81/1.07 Prover 3: proved (453ms)
% 2.81/1.07
% 2.81/1.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.81/1.07
% 2.81/1.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.81/1.08 Prover 6: stopped
% 2.81/1.08 Prover 5: stopped
% 2.81/1.08 Prover 2: proved (463ms)
% 2.81/1.08
% 2.81/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.81/1.08
% 2.81/1.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.81/1.08 Prover 0: proved (464ms)
% 2.81/1.08
% 2.81/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.81/1.08
% 2.81/1.09 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.81/1.09 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.81/1.09 Prover 1: Found proof (size 5)
% 2.81/1.09 Prover 4: Found proof (size 5)
% 2.81/1.09 Prover 4: proved (465ms)
% 2.81/1.09 Prover 1: proved (466ms)
% 2.81/1.09 Prover 7: Preprocessing ...
% 2.81/1.09 Prover 8: Preprocessing ...
% 2.81/1.09 Prover 11: Preprocessing ...
% 2.81/1.09 Prover 10: Preprocessing ...
% 2.81/1.09 Prover 7: Warning: ignoring some quantifiers
% 2.81/1.09 Prover 10: Warning: ignoring some quantifiers
% 2.81/1.09 Prover 10: Constructing countermodel ...
% 2.81/1.09 Prover 7: Constructing countermodel ...
% 2.81/1.09 Prover 10: stopped
% 2.81/1.09 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.81/1.10 Prover 7: stopped
% 2.81/1.10 Prover 8: Warning: ignoring some quantifiers
% 2.81/1.10 Prover 8: Constructing countermodel ...
% 2.81/1.10 Prover 11: Constructing countermodel ...
% 2.81/1.10 Prover 13: Preprocessing ...
% 2.81/1.10 Prover 11: stopped
% 2.81/1.10 Prover 8: stopped
% 2.81/1.10 Prover 13: Warning: ignoring some quantifiers
% 2.81/1.11 Prover 13: Constructing countermodel ...
% 2.81/1.11 Prover 13: stopped
% 2.81/1.11
% 2.81/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.81/1.11
% 2.81/1.11 % SZS output start Proof for theBenchmark
% 2.81/1.11 Assumptions after simplification:
% 2.81/1.11 ---------------------------------
% 2.81/1.11
% 2.81/1.11 (kalish229)
% 3.21/1.15 ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & f(v0) = v1 & $i(v0) & ! [v2: $i]
% 3.21/1.15 : ! [v3: int] : (v3 = 0 | ~ (f(v2) = v3) | ~ $i(v2)))
% 3.21/1.15
% 3.21/1.15 Those formulas are unsatisfiable:
% 3.21/1.15 ---------------------------------
% 3.21/1.15
% 3.21/1.15 Begin of proof
% 3.21/1.15 |
% 3.21/1.15 | DELTA: instantiating (kalish229) with fresh symbols all_3_0, all_3_1 gives:
% 3.21/1.15 | (1) ~ (all_3_0 = 0) & f(all_3_1) = all_3_0 & $i(all_3_1) & ! [v0: $i] :
% 3.21/1.15 | ! [v1: int] : (v1 = 0 | ~ (f(v0) = v1) | ~ $i(v0))
% 3.21/1.15 |
% 3.21/1.15 | ALPHA: (1) implies:
% 3.21/1.15 | (2) ~ (all_3_0 = 0)
% 3.21/1.15 | (3) $i(all_3_1)
% 3.21/1.16 | (4) f(all_3_1) = all_3_0
% 3.21/1.16 | (5) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (f(v0) = v1) | ~ $i(v0))
% 3.21/1.16 |
% 3.21/1.16 | GROUND_INST: instantiating (5) with all_3_1, all_3_0, simplifying with (3),
% 3.21/1.16 | (4) gives:
% 3.21/1.16 | (6) all_3_0 = 0
% 3.21/1.16 |
% 3.21/1.16 | REDUCE: (2), (6) imply:
% 3.21/1.16 | (7) $false
% 3.21/1.16 |
% 3.21/1.16 | CLOSE: (7) is inconsistent.
% 3.21/1.16 |
% 3.21/1.16 End of proof
% 3.21/1.16 % SZS output end Proof for theBenchmark
% 3.21/1.16
% 3.21/1.16 562ms
%------------------------------------------------------------------------------