TSTP Solution File: PUZ132+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n024.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 13:23:14 EDT 2023
% Result : Theorem 3.94s 1.29s
% Output : Proof 5.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 22:45:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.64 Running up to 7 provers in parallel.
% 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.02/0.99 Prover 4: Preprocessing ...
% 2.02/0.99 Prover 1: Preprocessing ...
% 2.45/1.03 Prover 5: Preprocessing ...
% 2.45/1.03 Prover 6: Preprocessing ...
% 2.45/1.03 Prover 2: Preprocessing ...
% 2.45/1.03 Prover 0: Preprocessing ...
% 2.45/1.03 Prover 3: Preprocessing ...
% 3.23/1.16 Prover 5: Constructing countermodel ...
% 3.23/1.16 Prover 1: Constructing countermodel ...
% 3.23/1.17 Prover 2: Proving ...
% 3.23/1.17 Prover 3: Constructing countermodel ...
% 3.49/1.18 Prover 0: Proving ...
% 3.49/1.19 Prover 6: Constructing countermodel ...
% 3.49/1.19 Prover 4: Constructing countermodel ...
% 3.94/1.29 Prover 3: proved (640ms)
% 3.94/1.29
% 3.94/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.94/1.29
% 3.94/1.29 Prover 5: stopped
% 3.94/1.29 Prover 6: stopped
% 3.94/1.29 Prover 2: stopped
% 3.94/1.29 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.94/1.29 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.94/1.29 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.94/1.29 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.94/1.30 Prover 0: stopped
% 3.94/1.30 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.94/1.32 Prover 10: Preprocessing ...
% 3.94/1.32 Prover 8: Preprocessing ...
% 4.22/1.33 Prover 7: Preprocessing ...
% 4.22/1.33 Prover 11: Preprocessing ...
% 4.22/1.35 Prover 13: Preprocessing ...
% 4.22/1.35 Prover 7: Constructing countermodel ...
% 4.22/1.36 Prover 10: Constructing countermodel ...
% 4.22/1.38 Prover 13: Constructing countermodel ...
% 4.22/1.38 Prover 8: Warning: ignoring some quantifiers
% 4.22/1.38 Prover 8: Constructing countermodel ...
% 4.97/1.40 Prover 10: Found proof (size 11)
% 4.97/1.40 Prover 10: proved (107ms)
% 4.97/1.40 Prover 13: stopped
% 4.97/1.40 Prover 1: stopped
% 4.97/1.40 Prover 4: stopped
% 4.97/1.40 Prover 7: Found proof (size 11)
% 4.97/1.40 Prover 7: proved (113ms)
% 4.97/1.41 Prover 8: stopped
% 4.97/1.42 Prover 11: Constructing countermodel ...
% 5.20/1.43 Prover 11: stopped
% 5.20/1.43
% 5.20/1.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.20/1.43
% 5.20/1.43 % SZS output start Proof for theBenchmark
% 5.23/1.44 Assumptions after simplification:
% 5.23/1.44 ---------------------------------
% 5.23/1.44
% 5.23/1.44 (beautiful_capital_axiom)
% 5.23/1.47 ! [v0: $i] : ! [v1: $i] : ( ~ (capital_city(v0) = v1) | ~ $i(v0) | ~
% 5.23/1.47 country(v0) | beautiful(v1))
% 5.23/1.47
% 5.23/1.47 (capital_city_type)
% 5.23/1.47 ! [v0: $i] : ( ~ $i(v0) | ~ capital(v0) | city(v0))
% 5.23/1.47
% 5.23/1.47 (crime_axiom)
% 5.23/1.47 ! [v0: $i] : ( ~ $i(v0) | ~ city(v0) | has_crime(v0))
% 5.23/1.47
% 5.23/1.47 (usa_capital_axiom)
% 5.23/1.47 capital_city(usa) = washington & $i(usa) & $i(washington)
% 5.23/1.47
% 5.23/1.47 (usa_type)
% 5.23/1.47 $i(usa) & country(usa)
% 5.23/1.47
% 5.23/1.47 (washington_conjecture)
% 5.23/1.47 $i(washington) & ( ~ beautiful(washington) | ~ has_crime(washington))
% 5.23/1.47
% 5.23/1.47 (washington_type)
% 5.23/1.47 $i(washington) & capital(washington)
% 5.23/1.47
% 5.23/1.47 Further assumptions not needed in the proof:
% 5.23/1.47 --------------------------------------------
% 5.23/1.47 capital_type, city_type, country_capital_type, country_type
% 5.23/1.47
% 5.23/1.47 Those formulas are unsatisfiable:
% 5.23/1.47 ---------------------------------
% 5.23/1.47
% 5.23/1.47 Begin of proof
% 5.23/1.47 |
% 5.23/1.47 | ALPHA: (washington_type) implies:
% 5.23/1.47 | (1) capital(washington)
% 5.23/1.47 |
% 5.23/1.47 | ALPHA: (usa_type) implies:
% 5.23/1.47 | (2) country(usa)
% 5.23/1.47 |
% 5.23/1.47 | ALPHA: (usa_capital_axiom) implies:
% 5.23/1.48 | (3) $i(usa)
% 5.23/1.48 | (4) capital_city(usa) = washington
% 5.23/1.48 |
% 5.23/1.48 | ALPHA: (washington_conjecture) implies:
% 5.23/1.48 | (5) $i(washington)
% 5.23/1.48 | (6) ~ beautiful(washington) | ~ has_crime(washington)
% 5.23/1.48 |
% 5.23/1.48 | GROUND_INST: instantiating (capital_city_type) with washington, simplifying
% 5.23/1.48 | with (1), (5) gives:
% 5.23/1.48 | (7) city(washington)
% 5.23/1.48 |
% 5.23/1.48 | GROUND_INST: instantiating (beautiful_capital_axiom) with usa, washington,
% 5.23/1.48 | simplifying with (2), (3), (4) gives:
% 5.23/1.48 | (8) beautiful(washington)
% 5.23/1.48 |
% 5.23/1.48 | BETA: splitting (6) gives:
% 5.23/1.48 |
% 5.23/1.48 | Case 1:
% 5.23/1.48 | |
% 5.23/1.48 | | (9) ~ beautiful(washington)
% 5.23/1.48 | |
% 5.23/1.48 | | PRED_UNIFY: (8), (9) imply:
% 5.23/1.48 | | (10) $false
% 5.23/1.48 | |
% 5.23/1.48 | | CLOSE: (10) is inconsistent.
% 5.23/1.48 | |
% 5.23/1.48 | Case 2:
% 5.23/1.48 | |
% 5.23/1.48 | | (11) ~ has_crime(washington)
% 5.23/1.48 | |
% 5.23/1.48 | | GROUND_INST: instantiating (crime_axiom) with washington, simplifying with
% 5.23/1.48 | | (5), (7), (11) gives:
% 5.23/1.48 | | (12) $false
% 5.23/1.48 | |
% 5.23/1.48 | | CLOSE: (12) is inconsistent.
% 5.23/1.48 | |
% 5.23/1.48 | End of split
% 5.23/1.48 |
% 5.23/1.48 End of proof
% 5.23/1.48 % SZS output end Proof for theBenchmark
% 5.23/1.48
% 5.23/1.48 859ms
%------------------------------------------------------------------------------