TSTP Solution File: SYN395+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN395+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 : n026.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.79s 1.17s
% Output : Proof 3.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN395+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 17:32:03 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.62 ________ _____
% 0.19/0.62 ___ __ \_________(_)________________________________
% 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.62
% 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.62 (2023-06-19)
% 0.19/0.62
% 0.19/0.62 (c) Philipp Rümmer, 2009-2023
% 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.62 Amanda Stjerna.
% 0.19/0.62 Free software under BSD-3-Clause.
% 0.19/0.62
% 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.62
% 0.19/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.63 Running up to 7 provers in parallel.
% 0.19/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.79/1.00 Prover 1: Preprocessing ...
% 1.79/1.00 Prover 4: Preprocessing ...
% 2.09/1.04 Prover 6: Preprocessing ...
% 2.09/1.04 Prover 5: Preprocessing ...
% 2.09/1.04 Prover 3: Preprocessing ...
% 2.09/1.04 Prover 2: Preprocessing ...
% 2.09/1.05 Prover 0: Preprocessing ...
% 2.28/1.10 Prover 1: Constructing countermodel ...
% 2.28/1.10 Prover 4: Constructing countermodel ...
% 2.28/1.10 Prover 5: Constructing countermodel ...
% 2.28/1.10 Prover 2: Constructing countermodel ...
% 2.28/1.10 Prover 6: Proving ...
% 2.28/1.11 Prover 3: Constructing countermodel ...
% 2.28/1.11 Prover 0: Proving ...
% 2.79/1.17 Prover 5: proved (526ms)
% 2.79/1.17
% 2.79/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.79/1.17
% 2.79/1.18 Prover 3: gave up
% 2.79/1.18 Prover 2: proved (529ms)
% 2.79/1.18
% 2.79/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.79/1.18
% 2.79/1.18 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.79/1.18 Prover 1: gave up
% 3.09/1.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.09/1.18 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.09/1.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.09/1.18 Prover 0: stopped
% 3.09/1.19 Prover 6: stopped
% 3.09/1.20 Prover 10: Preprocessing ...
% 3.09/1.20 Prover 7: Preprocessing ...
% 3.09/1.20 Prover 8: Preprocessing ...
% 3.09/1.20 Prover 11: Preprocessing ...
% 3.09/1.20 Prover 10: Constructing countermodel ...
% 3.09/1.20 Prover 7: Constructing countermodel ...
% 3.09/1.20 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.09/1.20 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 3.09/1.22 Prover 13: Preprocessing ...
% 3.09/1.22 Prover 4: Found proof (size 5)
% 3.09/1.22 Prover 4: proved (575ms)
% 3.09/1.23 Prover 16: Preprocessing ...
% 3.09/1.23 Prover 13: Constructing countermodel ...
% 3.09/1.23 Prover 13: stopped
% 3.09/1.23 Prover 10: stopped
% 3.09/1.23 Prover 7: stopped
% 3.09/1.23 Prover 8: Warning: ignoring some quantifiers
% 3.09/1.23 Prover 16: Constructing countermodel ...
% 3.09/1.24 Prover 16: stopped
% 3.09/1.24 Prover 8: Constructing countermodel ...
% 3.09/1.24 Prover 11: Constructing countermodel ...
% 3.09/1.24 Prover 11: stopped
% 3.09/1.24 Prover 8: stopped
% 3.09/1.24
% 3.09/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/1.24
% 3.48/1.24 % SZS output start Proof for theBenchmark
% 3.48/1.25 Assumptions after simplification:
% 3.48/1.25 ---------------------------------
% 3.48/1.25
% 3.48/1.25 (kalish202)
% 3.54/1.29 ? [v0: $i] : (f(v0) = 0 & $i(v0) & ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~
% 3.54/1.29 (g(v1) = v2) | ~ $i(v1) | ? [v3: int] : ( ~ (v3 = 0) & f(v1) = v3)) & !
% 3.54/1.29 [v1: $i] : ( ~ (g(v1) = 0) | ~ $i(v1)) & ! [v1: $i] : ( ~ (f(v1) = 0) | ~
% 3.54/1.29 $i(v1) | g(v1) = 0))
% 3.54/1.29
% 3.54/1.29 Those formulas are unsatisfiable:
% 3.54/1.29 ---------------------------------
% 3.54/1.29
% 3.54/1.29 Begin of proof
% 3.54/1.29 |
% 3.54/1.30 | DELTA: instantiating (kalish202) with fresh symbol all_3_0 gives:
% 3.54/1.30 | (1) f(all_3_0) = 0 & $i(all_3_0) & ! [v0: $i] : ! [v1: int] : (v1 = 0 |
% 3.54/1.30 | ~ (g(v0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & f(v0) =
% 3.54/1.30 | v2)) & ! [v0: $i] : ( ~ (g(v0) = 0) | ~ $i(v0)) & ! [v0: $i] : (
% 3.54/1.30 | ~ (f(v0) = 0) | ~ $i(v0) | g(v0) = 0)
% 3.54/1.30 |
% 3.54/1.30 | ALPHA: (1) implies:
% 3.54/1.30 | (2) $i(all_3_0)
% 3.54/1.30 | (3) f(all_3_0) = 0
% 3.54/1.30 | (4) ! [v0: $i] : ( ~ (f(v0) = 0) | ~ $i(v0) | g(v0) = 0)
% 3.54/1.30 | (5) ! [v0: $i] : ( ~ (g(v0) = 0) | ~ $i(v0))
% 3.54/1.30 |
% 3.54/1.31 | GROUND_INST: instantiating (4) with all_3_0, simplifying with (2), (3) gives:
% 3.54/1.31 | (6) g(all_3_0) = 0
% 3.54/1.31 |
% 3.54/1.31 | GROUND_INST: instantiating (5) with all_3_0, simplifying with (2), (6) gives:
% 3.54/1.31 | (7) $false
% 3.54/1.31 |
% 3.54/1.31 | CLOSE: (7) is inconsistent.
% 3.54/1.31 |
% 3.54/1.31 End of proof
% 3.54/1.31 % SZS output end Proof for theBenchmark
% 3.54/1.31
% 3.54/1.31 685ms
%------------------------------------------------------------------------------