TSTP Solution File: SYN394+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN394+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 : 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:27:31 EDT 2023
% Result : Theorem 2.64s 1.20s
% Output : Proof 3.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN394+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/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 20:52:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.45/0.62 ________ _____
% 0.45/0.62 ___ __ \_________(_)________________________________
% 0.45/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.45/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.45/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.45/0.62
% 0.45/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.45/0.62 (2023-06-19)
% 0.45/0.62
% 0.45/0.62 (c) Philipp Rümmer, 2009-2023
% 0.45/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.45/0.62 Amanda Stjerna.
% 0.45/0.62 Free software under BSD-3-Clause.
% 0.45/0.62
% 0.45/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.45/0.62
% 0.45/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.45/0.63 Running up to 7 provers in parallel.
% 0.68/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.68/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.68/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.68/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.68/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.68/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.68/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.68/0.95 Prover 1: Preprocessing ...
% 1.68/0.95 Prover 4: Preprocessing ...
% 1.93/1.00 Prover 6: Preprocessing ...
% 1.93/1.00 Prover 2: Preprocessing ...
% 1.93/1.00 Prover 0: Preprocessing ...
% 1.93/1.00 Prover 5: Preprocessing ...
% 1.93/1.00 Prover 3: Preprocessing ...
% 2.25/1.08 Prover 3: Constructing countermodel ...
% 2.25/1.09 Prover 2: Proving ...
% 2.25/1.09 Prover 5: Proving ...
% 2.25/1.09 Prover 1: Constructing countermodel ...
% 2.25/1.10 Prover 6: Proving ...
% 2.25/1.10 Prover 4: Constructing countermodel ...
% 2.25/1.11 Prover 0: Proving ...
% 2.64/1.20 Prover 3: proved (551ms)
% 2.64/1.20
% 2.64/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.20
% 2.64/1.21 Prover 2: proved (561ms)
% 2.64/1.21
% 2.64/1.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.21
% 2.64/1.21 Prover 0: proved (561ms)
% 2.64/1.21
% 2.64/1.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.21
% 2.64/1.22 Prover 5: proved (548ms)
% 2.64/1.22
% 2.64/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.22
% 2.64/1.22 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.64/1.22 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.64/1.22 Prover 1: Found proof (size 12)
% 2.64/1.22 Prover 1: proved (571ms)
% 2.64/1.22 Prover 4: Found proof (size 11)
% 2.64/1.22 Prover 4: proved (561ms)
% 2.64/1.22 Prover 6: stopped
% 2.64/1.22 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.64/1.22 Prover 8: Preprocessing ...
% 2.64/1.22 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.64/1.22 Prover 7: Preprocessing ...
% 2.64/1.23 Prover 7: Warning: ignoring some quantifiers
% 2.64/1.23 Prover 10: Preprocessing ...
% 2.64/1.23 Prover 7: Constructing countermodel ...
% 3.04/1.23 Prover 7: stopped
% 3.04/1.24 Prover 11: Preprocessing ...
% 3.04/1.24 Prover 8: Warning: ignoring some quantifiers
% 3.04/1.24 Prover 8: Constructing countermodel ...
% 3.04/1.24 Prover 10: Warning: ignoring some quantifiers
% 3.04/1.24 Prover 8: stopped
% 3.04/1.24 Prover 10: Constructing countermodel ...
% 3.04/1.24 Prover 10: stopped
% 3.04/1.27 Prover 11: Constructing countermodel ...
% 3.04/1.28 Prover 11: stopped
% 3.04/1.28
% 3.04/1.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.04/1.28
% 3.04/1.28 % SZS output start Proof for theBenchmark
% 3.21/1.28 Assumptions after simplification:
% 3.21/1.28 ---------------------------------
% 3.21/1.28
% 3.21/1.28 (kalish201)
% 3.21/1.32 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (g(v0) = v1) | ~ $i(v0) | ? [v2:
% 3.21/1.32 int] : ( ~ (v2 = 0) & f(v0) = v2)) & ! [v0: $i] : ! [v1: int] : (v1 = 0
% 3.21/1.32 | ~ (f(v0) = v1) | ~ $i(v0)) & ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) &
% 3.21/1.32 g(v0) = v1 & $i(v0))
% 3.21/1.32
% 3.21/1.32 Those formulas are unsatisfiable:
% 3.21/1.32 ---------------------------------
% 3.21/1.32
% 3.21/1.32 Begin of proof
% 3.21/1.32 |
% 3.21/1.32 | ALPHA: (kalish201) implies:
% 3.21/1.33 | (1) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (f(v0) = v1) | ~ $i(v0))
% 3.21/1.33 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (g(v0) = v1) | ~ $i(v0) | ?
% 3.21/1.33 | [v2: int] : ( ~ (v2 = 0) & f(v0) = v2))
% 3.21/1.33 | (3) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & g(v0) = v1 & $i(v0))
% 3.21/1.33 |
% 3.21/1.33 | DELTA: instantiating (3) with fresh symbols all_4_0, all_4_1 gives:
% 3.21/1.33 | (4) ~ (all_4_0 = 0) & g(all_4_1) = all_4_0 & $i(all_4_1)
% 3.21/1.33 |
% 3.21/1.33 | ALPHA: (4) implies:
% 3.21/1.33 | (5) ~ (all_4_0 = 0)
% 3.21/1.33 | (6) $i(all_4_1)
% 3.21/1.33 | (7) g(all_4_1) = all_4_0
% 3.21/1.33 |
% 3.21/1.33 | GROUND_INST: instantiating (2) with all_4_1, all_4_0, simplifying with (6),
% 3.21/1.33 | (7) gives:
% 3.21/1.33 | (8) all_4_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & f(all_4_1) = v0)
% 3.21/1.33 |
% 3.21/1.33 | BETA: splitting (8) gives:
% 3.21/1.33 |
% 3.21/1.33 | Case 1:
% 3.21/1.33 | |
% 3.21/1.34 | | (9) all_4_0 = 0
% 3.21/1.34 | |
% 3.21/1.34 | | REDUCE: (5), (9) imply:
% 3.21/1.34 | | (10) $false
% 3.21/1.34 | |
% 3.21/1.34 | | CLOSE: (10) is inconsistent.
% 3.21/1.34 | |
% 3.21/1.34 | Case 2:
% 3.21/1.34 | |
% 3.21/1.34 | | (11) ? [v0: int] : ( ~ (v0 = 0) & f(all_4_1) = v0)
% 3.21/1.34 | |
% 3.21/1.34 | | DELTA: instantiating (11) with fresh symbol all_13_0 gives:
% 3.21/1.34 | | (12) ~ (all_13_0 = 0) & f(all_4_1) = all_13_0
% 3.21/1.34 | |
% 3.21/1.34 | | ALPHA: (12) implies:
% 3.21/1.34 | | (13) ~ (all_13_0 = 0)
% 3.21/1.34 | | (14) f(all_4_1) = all_13_0
% 3.21/1.34 | |
% 3.21/1.34 | | GROUND_INST: instantiating (1) with all_4_1, all_13_0, simplifying with (6),
% 3.21/1.34 | | (14) gives:
% 3.21/1.34 | | (15) all_13_0 = 0
% 3.21/1.34 | |
% 3.21/1.34 | | REDUCE: (13), (15) imply:
% 3.21/1.34 | | (16) $false
% 3.21/1.34 | |
% 3.21/1.34 | | CLOSE: (16) is inconsistent.
% 3.21/1.34 | |
% 3.21/1.34 | End of split
% 3.21/1.34 |
% 3.21/1.34 End of proof
% 3.21/1.34 % SZS output end Proof for theBenchmark
% 3.21/1.34
% 3.21/1.34 721ms
%------------------------------------------------------------------------------