TSTP Solution File: SYN971+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN971+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 : n032.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:25 EDT 2023
% Result : Theorem 2.08s 0.93s
% Output : Proof 2.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN971+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.09 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Sat Aug 26 18:15:14 EDT 2023
% 0.08/0.28 % CPUTime :
% 0.12/0.47 ________ _____
% 0.12/0.47 ___ __ \_________(_)________________________________
% 0.12/0.47 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.12/0.47 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.12/0.47 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.12/0.47
% 0.12/0.47 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.12/0.47 (2023-06-19)
% 0.12/0.47
% 0.12/0.47 (c) Philipp Rümmer, 2009-2023
% 0.12/0.47 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.12/0.47 Amanda Stjerna.
% 0.12/0.47 Free software under BSD-3-Clause.
% 0.12/0.47
% 0.12/0.47 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.12/0.47
% 0.12/0.47 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.12/0.48 Running up to 7 provers in parallel.
% 0.12/0.49 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.12/0.49 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.12/0.49 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.12/0.49 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.12/0.49 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.12/0.49 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.12/0.49 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.23/0.79 Prover 1: Preprocessing ...
% 1.23/0.79 Prover 4: Preprocessing ...
% 1.23/0.83 Prover 5: Preprocessing ...
% 1.23/0.83 Prover 6: Preprocessing ...
% 1.23/0.83 Prover 0: Preprocessing ...
% 1.23/0.83 Prover 2: Preprocessing ...
% 1.23/0.83 Prover 3: Preprocessing ...
% 1.73/0.86 Prover 1: Warning: ignoring some quantifiers
% 1.73/0.86 Prover 3: Warning: ignoring some quantifiers
% 1.73/0.87 Prover 2: Constructing countermodel ...
% 1.73/0.87 Prover 3: Constructing countermodel ...
% 1.73/0.87 Prover 4: Constructing countermodel ...
% 1.73/0.87 Prover 1: Constructing countermodel ...
% 1.73/0.87 Prover 6: Proving ...
% 1.73/0.87 Prover 5: Proving ...
% 1.73/0.87 Prover 0: Proving ...
% 2.08/0.92 Prover 2: proved (435ms)
% 2.08/0.92
% 2.08/0.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.93
% 2.08/0.93 Prover 3: stopped
% 2.08/0.93 Prover 5: stopped
% 2.08/0.93 Prover 6: stopped
% 2.08/0.93 Prover 0: stopped
% 2.08/0.93 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.08/0.93 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.08/0.93 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.08/0.93 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.08/0.93 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.08/0.94 Prover 10: Preprocessing ...
% 2.08/0.94 Prover 13: Preprocessing ...
% 2.08/0.94 Prover 4: Found proof (size 5)
% 2.08/0.94 Prover 4: proved (450ms)
% 2.08/0.94 Prover 11: Preprocessing ...
% 2.08/0.94 Prover 1: stopped
% 2.08/0.94 Prover 13: Constructing countermodel ...
% 2.08/0.95 Prover 8: Preprocessing ...
% 2.08/0.95 Prover 7: Preprocessing ...
% 2.08/0.95 Prover 13: stopped
% 2.08/0.95 Prover 10: Constructing countermodel ...
% 2.08/0.95 Prover 10: stopped
% 2.46/0.95 Prover 7: Constructing countermodel ...
% 2.47/0.96 Prover 8: Warning: ignoring some quantifiers
% 2.47/0.96 Prover 7: stopped
% 2.47/0.96 Prover 8: Constructing countermodel ...
% 2.47/0.97 Prover 11: Constructing countermodel ...
% 2.47/0.97 Prover 8: stopped
% 2.47/0.97 Prover 11: stopped
% 2.47/0.97
% 2.47/0.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/0.97
% 2.47/0.97 % SZS output start Proof for theBenchmark
% 2.47/0.97 Assumptions after simplification:
% 2.47/0.97 ---------------------------------
% 2.47/0.97
% 2.47/0.97 (prove_this)
% 2.65/1.02 ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0)) & ? [v0: $i] : (p(v0) = 0 &
% 2.65/1.02 $i(v0))
% 2.65/1.02
% 2.65/1.02 Those formulas are unsatisfiable:
% 2.65/1.02 ---------------------------------
% 2.65/1.02
% 2.65/1.02 Begin of proof
% 2.65/1.02 |
% 2.65/1.02 | ALPHA: (prove_this) implies:
% 2.65/1.02 | (1) ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0))
% 2.65/1.02 | (2) ? [v0: $i] : (p(v0) = 0 & $i(v0))
% 2.65/1.02 |
% 2.65/1.03 | DELTA: instantiating (2) with fresh symbol all_4_0 gives:
% 2.65/1.03 | (3) p(all_4_0) = 0 & $i(all_4_0)
% 2.65/1.03 |
% 2.65/1.03 | ALPHA: (3) implies:
% 2.65/1.03 | (4) $i(all_4_0)
% 2.65/1.03 | (5) p(all_4_0) = 0
% 2.65/1.03 |
% 2.65/1.03 | GROUND_INST: instantiating (1) with all_4_0, simplifying with (4), (5) gives:
% 2.65/1.03 | (6) $false
% 2.65/1.03 |
% 2.65/1.03 | CLOSE: (6) is inconsistent.
% 2.65/1.03 |
% 2.65/1.03 End of proof
% 2.65/1.03 % SZS output end Proof for theBenchmark
% 2.65/1.03
% 2.65/1.03 558ms
%------------------------------------------------------------------------------