TSTP Solution File: MSC011+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : MSC011+1 : TPTP v8.1.2. Released v3.2.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 : Thu Aug 31 09:26:45 EDT 2023
% Result : Theorem 3.03s 1.13s
% Output : Proof 3.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC011+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.17/0.33 % Computer : n004.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu Aug 24 13:38:38 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.83/0.93 Prover 4: Preprocessing ...
% 1.83/0.93 Prover 1: Preprocessing ...
% 2.16/0.97 Prover 6: Preprocessing ...
% 2.16/0.97 Prover 5: Preprocessing ...
% 2.16/0.97 Prover 0: Preprocessing ...
% 2.16/0.97 Prover 3: Preprocessing ...
% 2.16/0.97 Prover 2: Preprocessing ...
% 2.16/1.02 Prover 1: Warning: ignoring some quantifiers
% 2.16/1.03 Prover 3: Warning: ignoring some quantifiers
% 2.16/1.03 Prover 2: Proving ...
% 2.16/1.03 Prover 5: Proving ...
% 2.16/1.04 Prover 3: Constructing countermodel ...
% 2.16/1.04 Prover 1: Constructing countermodel ...
% 2.16/1.04 Prover 4: Constructing countermodel ...
% 2.16/1.04 Prover 6: Proving ...
% 2.79/1.06 Prover 0: Proving ...
% 3.03/1.13 Prover 5: proved (489ms)
% 3.03/1.13 Prover 6: proved (485ms)
% 3.03/1.13 Prover 0: proved (490ms)
% 3.03/1.13
% 3.03/1.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.03/1.13
% 3.03/1.13 Prover 3: stopped
% 3.03/1.13 Prover 2: proved (497ms)
% 3.03/1.13
% 3.03/1.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.03/1.13
% 3.32/1.13
% 3.32/1.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/1.13
% 3.36/1.14
% 3.36/1.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/1.14
% 3.36/1.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.36/1.15 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.36/1.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.36/1.15 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.36/1.15 Prover 7: Preprocessing ...
% 3.36/1.15 Prover 10: Preprocessing ...
% 3.36/1.15 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.36/1.15 Prover 8: Preprocessing ...
% 3.36/1.15 Prover 10: Warning: ignoring some quantifiers
% 3.36/1.15 Prover 4: Found proof (size 14)
% 3.36/1.15 Prover 4: proved (524ms)
% 3.36/1.15 Prover 11: Preprocessing ...
% 3.36/1.15 Prover 10: Constructing countermodel ...
% 3.36/1.15 Prover 1: gave up
% 3.36/1.15 Prover 10: stopped
% 3.36/1.16 Prover 7: Warning: ignoring some quantifiers
% 3.36/1.16 Prover 7: Constructing countermodel ...
% 3.36/1.16 Prover 7: stopped
% 3.36/1.17 Prover 13: Preprocessing ...
% 3.36/1.17 Prover 13: Warning: ignoring some quantifiers
% 3.36/1.18 Prover 13: Constructing countermodel ...
% 3.36/1.18 Prover 8: Warning: ignoring some quantifiers
% 3.36/1.18 Prover 11: Constructing countermodel ...
% 3.36/1.18 Prover 13: stopped
% 3.36/1.18 Prover 8: Constructing countermodel ...
% 3.36/1.18 Prover 11: stopped
% 3.36/1.18 Prover 8: stopped
% 3.36/1.18
% 3.36/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/1.18
% 3.36/1.19 % SZS output start Proof for theBenchmark
% 3.36/1.19 Assumptions after simplification:
% 3.36/1.19 ---------------------------------
% 3.36/1.19
% 3.36/1.19 (d_cons)
% 3.76/1.23 ! [v0: $i] : ( ~ (drunk(v0) = 0) | ~ $i(v0) | goal | ? [v1: int] : ( ~ (v1
% 3.76/1.23 = 0) & not_drunk(v0) = v1)) & ! [v0: $i] : ( ~ (not_drunk(v0) = 0) | ~
% 3.76/1.23 $i(v0) | goal | ? [v1: int] : ( ~ (v1 = 0) & drunk(v0) = v1))
% 3.76/1.23
% 3.76/1.23 (goal_to_be_proved)
% 3.76/1.23 ~ goal
% 3.76/1.23
% 3.76/1.23 (neg_phi)
% 3.76/1.23 neg_psi & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (drunk(v0) = v1) | ~
% 3.76/1.23 $i(v0))
% 3.76/1.23
% 3.76/1.23 (neg_psi_ax)
% 3.76/1.23 ? [v0: $i] : ? [v1: int] : ($i(v0) & ( ~ neg_psi | (v1 = 0 & not_drunk(v0) =
% 3.76/1.23 0)))
% 3.76/1.23
% 3.76/1.23 Those formulas are unsatisfiable:
% 3.76/1.23 ---------------------------------
% 3.76/1.23
% 3.76/1.23 Begin of proof
% 3.76/1.23 |
% 3.76/1.23 | ALPHA: (d_cons) implies:
% 3.76/1.23 | (1) ! [v0: $i] : ( ~ (not_drunk(v0) = 0) | ~ $i(v0) | goal | ? [v1: int]
% 3.76/1.23 | : ( ~ (v1 = 0) & drunk(v0) = v1))
% 3.76/1.23 |
% 3.76/1.23 | ALPHA: (neg_phi) implies:
% 3.76/1.23 | (2) neg_psi
% 3.76/1.23 | (3) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (drunk(v0) = v1) | ~ $i(v0))
% 3.76/1.23 |
% 3.76/1.23 | DELTA: instantiating (neg_psi_ax) with fresh symbols all_6_0, all_6_1 gives:
% 3.76/1.23 | (4) $i(all_6_1) & ( ~ neg_psi | (all_6_0 = 0 & not_drunk(all_6_1) = 0))
% 3.76/1.23 |
% 3.76/1.23 | ALPHA: (4) implies:
% 3.76/1.23 | (5) $i(all_6_1)
% 3.76/1.24 | (6) ~ neg_psi | (all_6_0 = 0 & not_drunk(all_6_1) = 0)
% 3.76/1.24 |
% 3.76/1.24 | BETA: splitting (6) gives:
% 3.76/1.24 |
% 3.76/1.24 | Case 1:
% 3.76/1.24 | |
% 3.76/1.24 | | (7) ~ neg_psi
% 3.76/1.24 | |
% 3.76/1.24 | | PRED_UNIFY: (2), (7) imply:
% 3.76/1.24 | | (8) $false
% 3.76/1.24 | |
% 3.76/1.24 | | CLOSE: (8) is inconsistent.
% 3.76/1.24 | |
% 3.76/1.24 | Case 2:
% 3.76/1.24 | |
% 3.76/1.24 | | (9) all_6_0 = 0 & not_drunk(all_6_1) = 0
% 3.76/1.24 | |
% 3.76/1.24 | | ALPHA: (9) implies:
% 3.76/1.24 | | (10) not_drunk(all_6_1) = 0
% 3.76/1.24 | |
% 3.76/1.24 | | GROUND_INST: instantiating (1) with all_6_1, simplifying with (5), (10),
% 3.76/1.24 | | (goal_to_be_proved) gives:
% 3.76/1.24 | | (11) ? [v0: int] : ( ~ (v0 = 0) & drunk(all_6_1) = v0)
% 3.76/1.24 | |
% 3.76/1.24 | | DELTA: instantiating (11) with fresh symbol all_17_0 gives:
% 3.76/1.24 | | (12) ~ (all_17_0 = 0) & drunk(all_6_1) = all_17_0
% 3.76/1.24 | |
% 3.76/1.24 | | ALPHA: (12) implies:
% 3.76/1.24 | | (13) ~ (all_17_0 = 0)
% 3.76/1.24 | | (14) drunk(all_6_1) = all_17_0
% 3.76/1.24 | |
% 3.76/1.24 | | GROUND_INST: instantiating (3) with all_6_1, all_17_0, simplifying with (5),
% 3.76/1.24 | | (14) gives:
% 3.76/1.24 | | (15) all_17_0 = 0
% 3.76/1.24 | |
% 3.76/1.24 | | REDUCE: (13), (15) imply:
% 3.76/1.24 | | (16) $false
% 3.76/1.24 | |
% 3.76/1.24 | | CLOSE: (16) is inconsistent.
% 3.76/1.24 | |
% 3.76/1.24 | End of split
% 3.76/1.24 |
% 3.76/1.24 End of proof
% 3.76/1.24 % SZS output end Proof for theBenchmark
% 3.76/1.24
% 3.76/1.24 634ms
%------------------------------------------------------------------------------