TSTP Solution File: PUZ128+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n009.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:12 EDT 2023
% Result : Theorem 3.08s 1.20s
% Output : Proof 3.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 22:22:50 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.50/0.61 ________ _____
% 0.50/0.61 ___ __ \_________(_)________________________________
% 0.50/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.50/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.50/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.50/0.61
% 0.50/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.50/0.61 (2023-06-19)
% 0.50/0.61
% 0.50/0.61 (c) Philipp Rümmer, 2009-2023
% 0.50/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.50/0.61 Amanda Stjerna.
% 0.50/0.61 Free software under BSD-3-Clause.
% 0.50/0.61
% 0.50/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.50/0.61
% 0.50/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.50/0.62 Running up to 7 provers in parallel.
% 0.71/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.71/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.71/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.71/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.71/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.71/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.71/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.96/0.99 Prover 1: Preprocessing ...
% 1.96/0.99 Prover 4: Preprocessing ...
% 1.96/1.04 Prover 0: Preprocessing ...
% 1.96/1.04 Prover 6: Preprocessing ...
% 1.96/1.04 Prover 2: Preprocessing ...
% 1.96/1.04 Prover 3: Preprocessing ...
% 1.96/1.04 Prover 5: Preprocessing ...
% 2.52/1.10 Prover 5: Constructing countermodel ...
% 2.52/1.10 Prover 2: Constructing countermodel ...
% 2.52/1.11 Prover 3: Constructing countermodel ...
% 2.52/1.11 Prover 6: Proving ...
% 2.52/1.11 Prover 0: Proving ...
% 2.52/1.12 Prover 1: Constructing countermodel ...
% 2.52/1.12 Prover 4: Constructing countermodel ...
% 3.08/1.20 Prover 5: proved (559ms)
% 3.08/1.20
% 3.08/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.08/1.20
% 3.08/1.20 Prover 2: stopped
% 3.08/1.20 Prover 3: stopped
% 3.08/1.20 Prover 0: stopped
% 3.08/1.20 Prover 6: stopped
% 3.08/1.21 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.08/1.21 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.08/1.21 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.08/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.08/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.08/1.22 Prover 13: Preprocessing ...
% 3.08/1.22 Prover 10: Preprocessing ...
% 3.08/1.22 Prover 8: Preprocessing ...
% 3.08/1.22 Prover 7: Preprocessing ...
% 3.08/1.22 Prover 11: Preprocessing ...
% 3.60/1.24 Prover 10: Constructing countermodel ...
% 3.60/1.25 Prover 7: Constructing countermodel ...
% 3.60/1.25 Prover 13: Constructing countermodel ...
% 3.60/1.26 Prover 10: Found proof (size 10)
% 3.60/1.26 Prover 10: proved (62ms)
% 3.60/1.26 Prover 7: stopped
% 3.60/1.27 Prover 4: stopped
% 3.60/1.27 Prover 13: stopped
% 3.60/1.27 Prover 1: stopped
% 3.60/1.27 Prover 8: Warning: ignoring some quantifiers
% 3.60/1.27 Prover 8: Constructing countermodel ...
% 3.60/1.27 Prover 11: Constructing countermodel ...
% 3.60/1.28 Prover 8: stopped
% 3.60/1.28 Prover 11: stopped
% 3.60/1.28
% 3.60/1.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.60/1.28
% 3.93/1.28 % SZS output start Proof for theBenchmark
% 3.93/1.28 Assumptions after simplification:
% 3.93/1.28 ---------------------------------
% 3.93/1.28
% 3.93/1.28 (iokaste_oedipus)
% 3.93/1.29 $i(oedipus) & $i(iokaste) & parent_of(iokaste, oedipus)
% 3.93/1.29
% 3.93/1.29 (iokaste_parent_particide_parent_not_patricide)
% 3.93/1.29 $i(iokaste) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~
% 3.93/1.29 patricide(v0) | ~ parent_of(v0, v1) | ~ parent_of(iokaste, v0) |
% 3.93/1.29 patricide(v1))
% 3.93/1.29
% 3.93/1.29 (iokaste_polyneikes)
% 3.93/1.29 $i(polyneikes) & $i(iokaste) & parent_of(iokaste, polyneikes)
% 3.93/1.29
% 3.93/1.29 (oedipus_patricidal)
% 3.93/1.29 $i(oedipus) & patricide(oedipus)
% 3.93/1.29
% 3.93/1.29 (oedipus_polyneikes)
% 3.93/1.29 $i(polyneikes) & $i(oedipus) & parent_of(oedipus, polyneikes)
% 3.93/1.29
% 3.93/1.29 (polyneikes_thersandros)
% 3.93/1.29 $i(thersandros) & $i(polyneikes) & parent_of(polyneikes, thersandros)
% 3.93/1.29
% 3.93/1.29 (thersandros_not_patricidal)
% 3.93/1.29 $i(thersandros) & ~ patricide(thersandros)
% 3.93/1.29
% 3.93/1.29 Those formulas are unsatisfiable:
% 3.93/1.29 ---------------------------------
% 3.93/1.29
% 3.93/1.29 Begin of proof
% 3.93/1.29 |
% 3.93/1.29 | ALPHA: (iokaste_parent_particide_parent_not_patricide) implies:
% 3.93/1.30 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ patricide(v0) |
% 3.93/1.30 | ~ parent_of(v0, v1) | ~ parent_of(iokaste, v0) | patricide(v1))
% 3.93/1.30 |
% 3.93/1.30 | ALPHA: (thersandros_not_patricidal) implies:
% 3.93/1.30 | (2) ~ patricide(thersandros)
% 3.93/1.30 |
% 3.93/1.30 | ALPHA: (oedipus_patricidal) implies:
% 3.93/1.30 | (3) patricide(oedipus)
% 3.93/1.30 |
% 3.93/1.30 | ALPHA: (polyneikes_thersandros) implies:
% 3.93/1.30 | (4) parent_of(polyneikes, thersandros)
% 3.93/1.30 | (5) $i(thersandros)
% 3.93/1.30 |
% 3.93/1.30 | ALPHA: (oedipus_polyneikes) implies:
% 3.93/1.30 | (6) parent_of(oedipus, polyneikes)
% 3.93/1.30 |
% 3.93/1.30 | ALPHA: (iokaste_polyneikes) implies:
% 3.93/1.30 | (7) parent_of(iokaste, polyneikes)
% 3.93/1.30 | (8) $i(polyneikes)
% 3.93/1.30 |
% 3.93/1.30 | ALPHA: (iokaste_oedipus) implies:
% 3.93/1.30 | (9) parent_of(iokaste, oedipus)
% 3.93/1.30 | (10) $i(oedipus)
% 3.93/1.30 |
% 3.93/1.30 | GROUND_INST: instantiating (1) with oedipus, polyneikes, simplifying with (3),
% 3.93/1.30 | (6), (8), (9), (10) gives:
% 3.93/1.30 | (11) patricide(polyneikes)
% 3.93/1.31 |
% 3.93/1.31 | GROUND_INST: instantiating (1) with polyneikes, thersandros, simplifying with
% 3.93/1.31 | (2), (4), (5), (7), (8), (11) gives:
% 3.93/1.31 | (12) $false
% 3.93/1.31 |
% 3.93/1.31 | CLOSE: (12) is inconsistent.
% 3.93/1.31 |
% 3.93/1.31 End of proof
% 3.93/1.31 % SZS output end Proof for theBenchmark
% 3.93/1.31
% 3.93/1.31 696ms
%------------------------------------------------------------------------------