TSTP Solution File: SYN959+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN959+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:22 EDT 2023
% Result : Theorem 2.43s 1.10s
% Output : Proof 3.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : SYN959+1 : TPTP v8.1.2. Released v3.1.0.
% 0.16/0.16 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.16/0.38 % Computer : n004.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sat Aug 26 20:28:08 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.64 ________ _____
% 0.23/0.64 ___ __ \_________(_)________________________________
% 0.23/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.23/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.23/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.23/0.64
% 0.23/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.23/0.64 (2023-06-19)
% 0.23/0.64
% 0.23/0.64 (c) Philipp Rümmer, 2009-2023
% 0.23/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.23/0.64 Amanda Stjerna.
% 0.23/0.64 Free software under BSD-3-Clause.
% 0.23/0.64
% 0.23/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.23/0.64
% 0.23/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.23/0.65 Running up to 7 provers in parallel.
% 0.23/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.23/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.23/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.23/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.23/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.23/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.23/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.50/0.96 Prover 1: Preprocessing ...
% 1.50/0.96 Prover 4: Preprocessing ...
% 2.09/1.01 Prover 6: Preprocessing ...
% 2.09/1.01 Prover 5: Preprocessing ...
% 2.09/1.01 Prover 2: Preprocessing ...
% 2.09/1.01 Prover 0: Preprocessing ...
% 2.09/1.01 Prover 3: Preprocessing ...
% 2.43/1.04 Prover 5: Constructing countermodel ...
% 2.43/1.04 Prover 3: Constructing countermodel ...
% 2.43/1.04 Prover 2: Constructing countermodel ...
% 2.43/1.04 Prover 4: Constructing countermodel ...
% 2.43/1.04 Prover 1: Constructing countermodel ...
% 2.43/1.05 Prover 6: Proving ...
% 2.43/1.05 Prover 0: Proving ...
% 2.43/1.10 Prover 5: proved (421ms)
% 2.43/1.10
% 2.43/1.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.43/1.10
% 2.43/1.10 Prover 2: proved (433ms)
% 2.43/1.10
% 2.43/1.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.43/1.10
% 2.43/1.10 Prover 3: proved (434ms)
% 2.43/1.10
% 2.43/1.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.43/1.10
% 2.43/1.10 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.43/1.10 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.43/1.10 Prover 6: stopped
% 2.43/1.11 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.43/1.11 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.43/1.11 Prover 0: proved (447ms)
% 2.43/1.11
% 2.43/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.43/1.11
% 2.43/1.11 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.43/1.11 Prover 8: Preprocessing ...
% 2.43/1.11 Prover 7: Preprocessing ...
% 2.43/1.11 Prover 11: Preprocessing ...
% 2.43/1.11 Prover 10: Preprocessing ...
% 2.99/1.12 Prover 1: Found proof (size 5)
% 2.99/1.12 Prover 4: Found proof (size 4)
% 2.99/1.12 Prover 13: Preprocessing ...
% 2.99/1.12 Prover 1: proved (455ms)
% 2.99/1.12 Prover 4: proved (440ms)
% 2.99/1.12 Prover 7: Constructing countermodel ...
% 2.99/1.12 Prover 7: stopped
% 2.99/1.12 Prover 13: Constructing countermodel ...
% 2.99/1.13 Prover 13: stopped
% 2.99/1.13 Prover 10: Constructing countermodel ...
% 2.99/1.13 Prover 10: stopped
% 2.99/1.14 Prover 11: Constructing countermodel ...
% 2.99/1.14 Prover 11: stopped
% 2.99/1.14 Prover 8: Warning: ignoring some quantifiers
% 2.99/1.14 Prover 8: Constructing countermodel ...
% 2.99/1.15 Prover 8: stopped
% 2.99/1.15
% 2.99/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.15
% 2.99/1.15 % SZS output start Proof for theBenchmark
% 2.99/1.15 Assumptions after simplification:
% 2.99/1.15 ---------------------------------
% 2.99/1.15
% 2.99/1.15 (prove_this)
% 3.24/1.19 ! [v0: $i] : ( ~ (a(v0) = 0) | ~ $i(v0)) & ! [v0: $i] : ( ~ (b(v0) = 0) |
% 3.24/1.19 ~ $i(v0)) & ? [v0: $i] : (b(v0) = 0 & $i(v0))
% 3.24/1.19
% 3.24/1.19 Those formulas are unsatisfiable:
% 3.24/1.19 ---------------------------------
% 3.24/1.19
% 3.24/1.19 Begin of proof
% 3.24/1.19 |
% 3.24/1.19 | ALPHA: (prove_this) implies:
% 3.24/1.19 | (1) ! [v0: $i] : ( ~ (b(v0) = 0) | ~ $i(v0))
% 3.24/1.20 | (2) ? [v0: $i] : (b(v0) = 0 & $i(v0))
% 3.24/1.20 |
% 3.24/1.20 | DELTA: instantiating (2) with fresh symbol all_4_0 gives:
% 3.24/1.20 | (3) b(all_4_0) = 0 & $i(all_4_0)
% 3.24/1.20 |
% 3.24/1.20 | ALPHA: (3) implies:
% 3.24/1.20 | (4) $i(all_4_0)
% 3.24/1.20 | (5) b(all_4_0) = 0
% 3.24/1.20 |
% 3.24/1.20 | GROUND_INST: instantiating (1) with all_4_0, simplifying with (4), (5) gives:
% 3.24/1.20 | (6) $false
% 3.24/1.20 |
% 3.24/1.20 | CLOSE: (6) is inconsistent.
% 3.24/1.20 |
% 3.24/1.20 End of proof
% 3.24/1.20 % SZS output end Proof for theBenchmark
% 3.24/1.20
% 3.24/1.20 559ms
%------------------------------------------------------------------------------