%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PUZ128+2 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n021.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.52s 1.23s % Output : Proof 4.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : PUZ128+2 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n021.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:08:27 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.12/0.96 Prover 1: Preprocessing ... % 2.12/0.96 Prover 4: Preprocessing ... % 2.37/1.00 Prover 5: Preprocessing ... % 2.37/1.00 Prover 0: Preprocessing ... % 2.37/1.01 Prover 3: Preprocessing ... % 2.37/1.01 Prover 2: Preprocessing ... % 2.37/1.01 Prover 6: Preprocessing ... % 3.19/1.12 Prover 5: Constructing countermodel ... % 3.19/1.12 Prover 2: Constructing countermodel ... % 3.19/1.13 Prover 6: Proving ... % 3.19/1.13 Prover 1: Constructing countermodel ... % 3.19/1.15 Prover 3: Constructing countermodel ... % 3.19/1.15 Prover 4: Constructing countermodel ... % 3.52/1.20 Prover 0: Proving ... % 3.52/1.23 Prover 5: proved (598ms) % 3.52/1.23 % 3.52/1.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.52/1.23 % 3.52/1.23 Prover 3: stopped % 3.52/1.23 Prover 6: stopped % 3.52/1.23 Prover 2: stopped % 3.52/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.52/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.52/1.23 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.52/1.23 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.52/1.23 Prover 0: stopped % 4.05/1.25 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.05/1.26 Prover 7: Preprocessing ... % 4.05/1.27 Prover 13: Preprocessing ... % 4.05/1.28 Prover 11: Preprocessing ... % 4.05/1.28 Prover 8: Preprocessing ... % 4.05/1.28 Prover 10: Preprocessing ... % 4.32/1.30 Prover 13: Constructing countermodel ... % 4.32/1.30 Prover 7: Constructing countermodel ... % 4.32/1.31 Prover 10: Constructing countermodel ... % 4.32/1.33 Prover 13: Found proof (size 5) % 4.32/1.33 Prover 13: proved (85ms) % 4.32/1.33 Prover 1: stopped % 4.32/1.33 Prover 4: stopped % 4.32/1.34 Prover 10: stopped % 4.32/1.34 Prover 7: stopped % 4.32/1.34 Prover 8: Warning: ignoring some quantifiers % 4.32/1.34 Prover 8: Constructing countermodel ... % 4.32/1.35 Prover 8: stopped % 4.32/1.37 Prover 11: Constructing countermodel ... % 4.32/1.38 Prover 11: stopped % 4.32/1.38 % 4.32/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.32/1.38 % 4.32/1.38 % SZS output start Proof for theBenchmark % 4.32/1.38 Assumptions after simplification: % 4.32/1.38 --------------------------------- % 4.32/1.38 % 4.32/1.38 (background) % 4.32/1.39 $i(Thersandros) & $i(Polyneikes) & $i(Iokaste) & $i(Oedipus) & $i(of) & % 4.32/1.39 patricide(Oedipus) & relation(Polyneikes, of, Thersandros) & relation(Iokaste, % 4.32/1.39 of, Polyneikes) & relation(Iokaste, of, Oedipus) & relation(Oedipus, of, % 4.32/1.39 Polyneikes) & parent(Polyneikes) & parent(Iokaste) & parent(Oedipus) & ~ % 4.32/1.39 patricide(Thersandros) % 4.32/1.39 % 4.32/1.39 (prove) % 4.32/1.39 $i(Iokaste) & $i(of) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 4.32/1.39 patricide(v0) | ~ relation(v0, of, v1) | ~ relation(Iokaste, of, v0) | ~ % 4.32/1.39 parent(v0) | ~ parent(Iokaste) | patricide(v1)) % 4.32/1.39 % 4.32/1.39 Those formulas are unsatisfiable: % 4.32/1.39 --------------------------------- % 4.32/1.39 % 4.32/1.39 Begin of proof % 4.32/1.39 | % 4.32/1.39 | ALPHA: (prove) implies: % 4.32/1.40 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ patricide(v0) | % 4.32/1.40 | ~ relation(v0, of, v1) | ~ relation(Iokaste, of, v0) | ~ % 4.32/1.40 | parent(v0) | ~ parent(Iokaste) | patricide(v1)) % 4.32/1.40 | % 4.32/1.40 | ALPHA: (background) implies: % 4.32/1.40 | (2) ~ patricide(Thersandros) % 4.32/1.40 | (3) parent(Oedipus) % 4.32/1.40 | (4) parent(Iokaste) % 4.32/1.40 | (5) parent(Polyneikes) % 4.32/1.40 | (6) relation(Oedipus, of, Polyneikes) % 4.32/1.40 | (7) relation(Iokaste, of, Oedipus) % 4.32/1.40 | (8) relation(Iokaste, of, Polyneikes) % 4.32/1.40 | (9) relation(Polyneikes, of, Thersandros) % 4.32/1.40 | (10) patricide(Oedipus) % 4.32/1.40 | (11) $i(Oedipus) % 4.32/1.40 | (12) $i(Polyneikes) % 4.32/1.40 | (13) $i(Thersandros) % 4.32/1.40 | % 4.32/1.40 | GROUND_INST: instantiating (1) with Oedipus, Polyneikes, simplifying with (3), % 4.32/1.40 | (4), (6), (7), (10), (11), (12) gives: % 4.32/1.40 | (14) patricide(Polyneikes) % 4.32/1.40 | % 4.32/1.41 | GROUND_INST: instantiating (1) with Polyneikes, Thersandros, simplifying with % 4.32/1.41 | (2), (4), (5), (8), (9), (12), (13), (14) gives: % 4.32/1.41 | (15) $false % 4.32/1.41 | % 4.32/1.41 | CLOSE: (15) is inconsistent. % 4.32/1.41 | % 4.32/1.41 End of proof % 4.32/1.41 % SZS output end Proof for theBenchmark % 4.32/1.41 % 4.32/1.41 805ms %------------------------------------------------------------------------------