%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PHI009+1 : TPTP v8.1.2. Released v7.2.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 12:56:39 EDT 2023 % Result : Theorem 4.67s 1.35s % Output : Proof 6.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.10 % Problem : PHI009+1 : TPTP v8.1.2. Released v7.2.0. % 0.06/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.10/0.32 % Computer : n009.cluster.edu % 0.10/0.32 % Model : x86_64 x86_64 % 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.32 % Memory : 8042.1875MB % 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.32 % CPULimit : 300 % 0.10/0.32 % WCLimit : 300 % 0.10/0.32 % DateTime : Sun Aug 27 08:48:20 EDT 2023 % 0.10/0.32 % CPUTime : % 0.52/0.58 ________ _____ % 0.52/0.58 ___ __ \_________(_)________________________________ % 0.52/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.52/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.52/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.52/0.58 % 0.52/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.52/0.58 (2023-06-19) % 0.52/0.58 % 0.52/0.58 (c) Philipp Rümmer, 2009-2023 % 0.52/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.52/0.58 Amanda Stjerna. % 0.52/0.58 Free software under BSD-3-Clause. % 0.52/0.58 % 0.52/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.52/0.58 % 0.52/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.52/0.59 Running up to 7 provers in parallel. % 0.52/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.52/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.52/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.52/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.52/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.52/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.52/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.93/0.96 Prover 4: Preprocessing ... % 1.93/0.96 Prover 1: Preprocessing ... % 2.30/1.01 Prover 6: Preprocessing ... % 2.30/1.01 Prover 0: Preprocessing ... % 2.30/1.01 Prover 5: Preprocessing ... % 2.30/1.01 Prover 2: Preprocessing ... % 2.30/1.01 Prover 3: Preprocessing ... % 3.15/1.14 Prover 5: Constructing countermodel ... % 3.15/1.14 Prover 2: Constructing countermodel ... % 3.41/1.19 Prover 3: Constructing countermodel ... % 3.41/1.21 Prover 1: Constructing countermodel ... % 3.41/1.21 Prover 6: Proving ... % 3.93/1.25 Prover 3: gave up % 3.93/1.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.93/1.26 Prover 1: gave up % 3.93/1.27 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.93/1.27 Prover 7: Preprocessing ... % 4.25/1.29 Prover 8: Preprocessing ... % 4.25/1.30 Prover 7: Constructing countermodel ... % 4.25/1.34 Prover 2: proved (741ms) % 4.67/1.35 % 4.67/1.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.67/1.35 % 4.67/1.36 Prover 5: stopped % 4.67/1.36 Prover 6: stopped % 4.67/1.36 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.67/1.36 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.67/1.36 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.80/1.37 Prover 8: Warning: ignoring some quantifiers % 4.80/1.37 Prover 8: Constructing countermodel ... % 4.80/1.37 Prover 11: Preprocessing ... % 4.80/1.38 Prover 13: Preprocessing ... % 4.80/1.38 Prover 10: Preprocessing ... % 4.80/1.41 Prover 10: Constructing countermodel ... % 5.23/1.42 Prover 8: gave up % 5.23/1.42 Prover 13: Constructing countermodel ... % 5.23/1.42 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 5.23/1.43 Prover 16: Preprocessing ... % 5.48/1.46 Prover 7: Found proof (size 12) % 5.48/1.46 Prover 7: proved (208ms) % 5.48/1.47 Prover 13: stopped % 5.48/1.47 Prover 10: stopped % 5.48/1.47 Prover 16: Constructing countermodel ... % 5.48/1.47 Prover 16: stopped % 5.48/1.51 Prover 4: Constructing countermodel ... % 5.48/1.51 Prover 0: Proving ... % 5.48/1.51 Prover 4: stopped % 5.48/1.52 Prover 0: stopped % 6.23/1.62 Prover 11: Constructing countermodel ... % 6.23/1.62 Prover 11: stopped % 6.23/1.62 % 6.23/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.23/1.62 % 6.23/1.63 % SZS output start Proof for theBenchmark % 6.23/1.63 Assumptions after simplification: % 6.23/1.63 --------------------------------- % 6.23/1.63 % 6.23/1.63 (description_axiom_schema_instance) % 6.59/1.65 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 6.59/1.65 | ~ $i(v1) | ~ $i(v0) | ~ exemplifies_property(v1, v3) | ~ % 6.59/1.65 exemplifies_property(v0, v3) | ~ object(v3) | ~ object(v2) | ~ % 6.59/1.65 property(v1) | ~ property(v0) | exemplifies_property(v1, v2) | ? [v4: $i] % 6.59/1.65 : ( ~ (v4 = v3) & $i(v4) & exemplifies_property(v0, v4) & object(v4))) & ! % 6.59/1.65 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | % 6.59/1.65 ~ $i(v1) | ~ $i(v0) | ~ exemplifies_property(v1, v3) | ~ % 6.59/1.65 exemplifies_property(v0, v3) | ~ object(v3) | ~ object(v2) | ~ % 6.59/1.65 property(v1) | ~ property(v0) | is_the(v2, v0) | ? [v4: $i] : ( ~ (v4 = % 6.59/1.65 v3) & $i(v4) & exemplifies_property(v0, v4) & object(v4))) & ! [v0: $i] % 6.59/1.65 : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 6.59/1.65 exemplifies_property(v1, v2) | ~ is_the(v2, v0) | ~ object(v2) | ~ % 6.59/1.65 property(v1) | ~ property(v0) | ? [v3: $i] : ($i(v3) & % 6.59/1.65 exemplifies_property(v1, v3) & exemplifies_property(v0, v3) & object(v3) & % 6.59/1.65 ! [v4: $i] : (v4 = v3 | ~ $i(v4) | ~ exemplifies_property(v0, v4) | ~ % 6.59/1.65 object(v4)))) % 6.59/1.65 % 6.59/1.66 (description_theorem_1) % 6.59/1.66 ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & exemplifies_property(v0, v1) & % 6.59/1.66 object(v1) & property(v0) & ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ % 6.59/1.66 exemplifies_property(v0, v2) | ~ object(v2)) & ! [v2: $i] : ( ~ $i(v2) | % 6.59/1.66 ~ is_the(v2, v0) | ~ object(v2))) % 6.59/1.66 % 6.59/1.66 Those formulas are unsatisfiable: % 6.59/1.66 --------------------------------- % 6.59/1.66 % 6.59/1.66 Begin of proof % 6.59/1.66 | % 6.59/1.66 | ALPHA: (description_axiom_schema_instance) implies: % 6.59/1.66 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ % 6.59/1.66 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ exemplifies_property(v1, v3) | ~ % 6.59/1.66 | exemplifies_property(v0, v3) | ~ object(v3) | ~ object(v2) | ~ % 6.59/1.66 | property(v1) | ~ property(v0) | is_the(v2, v0) | ? [v4: $i] : ( ~ % 6.59/1.66 | (v4 = v3) & $i(v4) & exemplifies_property(v0, v4) & object(v4))) % 6.59/1.66 | % 6.59/1.66 | DELTA: instantiating (description_theorem_1) with fresh symbols all_3_0, % 6.59/1.66 | all_3_1 gives: % 6.59/1.67 | (2) $i(all_3_0) & $i(all_3_1) & exemplifies_property(all_3_1, all_3_0) & % 6.59/1.67 | object(all_3_0) & property(all_3_1) & ! [v0: any] : (v0 = all_3_0 | ~ % 6.59/1.67 | $i(v0) | ~ exemplifies_property(all_3_1, v0) | ~ object(v0)) & ! % 6.59/1.67 | [v0: $i] : ( ~ $i(v0) | ~ is_the(v0, all_3_1) | ~ object(v0)) % 6.59/1.67 | % 6.59/1.67 | ALPHA: (2) implies: % 6.59/1.67 | (3) property(all_3_1) % 6.59/1.67 | (4) object(all_3_0) % 6.59/1.67 | (5) exemplifies_property(all_3_1, all_3_0) % 6.59/1.67 | (6) $i(all_3_1) % 6.59/1.67 | (7) $i(all_3_0) % 6.59/1.67 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ is_the(v0, all_3_1) | ~ object(v0)) % 6.59/1.67 | (9) ! [v0: any] : (v0 = all_3_0 | ~ $i(v0) | ~ % 6.59/1.67 | exemplifies_property(all_3_1, v0) | ~ object(v0)) % 6.59/1.67 | % 6.59/1.67 | GROUND_INST: instantiating (1) with all_3_1, all_3_1, all_3_0, all_3_0, % 6.59/1.67 | simplifying with (3), (4), (5), (6), (7) gives: % 6.59/1.67 | (10) is_the(all_3_0, all_3_1) | ? [v0: any] : ( ~ (v0 = all_3_0) & $i(v0) % 6.59/1.67 | & exemplifies_property(all_3_1, v0) & object(v0)) % 6.59/1.67 | % 6.59/1.67 | BETA: splitting (10) gives: % 6.59/1.67 | % 6.59/1.67 | Case 1: % 6.59/1.67 | | % 6.59/1.67 | | (11) is_the(all_3_0, all_3_1) % 6.59/1.67 | | % 6.59/1.67 | | GROUND_INST: instantiating (8) with all_3_0, simplifying with (4), (7), (11) % 6.59/1.67 | | gives: % 6.59/1.67 | | (12) $false % 6.70/1.67 | | % 6.70/1.67 | | CLOSE: (12) is inconsistent. % 6.70/1.67 | | % 6.70/1.67 | Case 2: % 6.70/1.67 | | % 6.70/1.67 | | (13) ? [v0: any] : ( ~ (v0 = all_3_0) & $i(v0) & % 6.70/1.67 | | exemplifies_property(all_3_1, v0) & object(v0)) % 6.70/1.67 | | % 6.70/1.67 | | DELTA: instantiating (13) with fresh symbol all_13_0 gives: % 6.70/1.68 | | (14) ~ (all_13_0 = all_3_0) & $i(all_13_0) & % 6.70/1.68 | | exemplifies_property(all_3_1, all_13_0) & object(all_13_0) % 6.70/1.68 | | % 6.70/1.68 | | ALPHA: (14) implies: % 6.70/1.68 | | (15) ~ (all_13_0 = all_3_0) % 6.70/1.68 | | (16) object(all_13_0) % 6.70/1.68 | | (17) exemplifies_property(all_3_1, all_13_0) % 6.70/1.68 | | (18) $i(all_13_0) % 6.70/1.68 | | % 6.70/1.68 | | GROUND_INST: instantiating (9) with all_13_0, simplifying with (16), (17), % 6.70/1.68 | | (18) gives: % 6.70/1.68 | | (19) all_13_0 = all_3_0 % 6.70/1.68 | | % 6.70/1.68 | | REDUCE: (15), (19) imply: % 6.70/1.68 | | (20) $false % 6.70/1.68 | | % 6.70/1.68 | | CLOSE: (20) is inconsistent. % 6.70/1.68 | | % 6.70/1.68 | End of split % 6.70/1.68 | % 6.70/1.68 End of proof % 6.70/1.68 % SZS output end Proof for theBenchmark % 6.70/1.68 % 6.70/1.68 1098ms %------------------------------------------------------------------------------