%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET077+1 : TPTP v8.1.2. Bugfixed v5.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n017.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 15:23:38 EDT 2023 % Result : Theorem 12.91s 2.46s % Output : Proof 17.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SET077+1 : TPTP v8.1.2. Bugfixed v5.4.0. % 0.10/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n017.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 14:03:56 EDT 2023 % 0.13/0.34 % CPUTime : % 0.21/0.60 ________ _____ % 0.21/0.60 ___ __ \_________(_)________________________________ % 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.60 % 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.60 (2023-06-19) % 0.21/0.60 % 0.21/0.60 (c) Philipp Rümmer, 2009-2023 % 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.60 Amanda Stjerna. % 0.21/0.60 Free software under BSD-3-Clause. % 0.21/0.60 % 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.60 % 0.21/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.38/1.17 Prover 4: Preprocessing ... % 3.38/1.18 Prover 1: Preprocessing ... % 3.38/1.22 Prover 6: Preprocessing ... % 3.38/1.22 Prover 5: Preprocessing ... % 3.38/1.22 Prover 3: Preprocessing ... % 3.38/1.22 Prover 0: Preprocessing ... % 3.38/1.22 Prover 2: Preprocessing ... % 9.72/2.00 Prover 1: Warning: ignoring some quantifiers % 10.01/2.03 Prover 3: Warning: ignoring some quantifiers % 10.09/2.05 Prover 1: Constructing countermodel ... % 10.09/2.06 Prover 3: Constructing countermodel ... % 10.09/2.06 Prover 5: Proving ... % 10.09/2.07 Prover 6: Proving ... % 10.09/2.09 Prover 4: Warning: ignoring some quantifiers % 10.64/2.14 Prover 4: Constructing countermodel ... % 11.19/2.19 Prover 2: Proving ... % 11.19/2.21 Prover 0: Proving ... % 12.91/2.46 Prover 5: proved (1830ms) % 12.91/2.46 % 12.91/2.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.91/2.46 % 12.91/2.47 Prover 2: stopped % 12.91/2.47 Prover 3: stopped % 12.91/2.47 Prover 6: stopped % 12.91/2.47 Prover 0: stopped % 12.91/2.48 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.91/2.48 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.91/2.48 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.91/2.48 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.91/2.48 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.66/2.58 Prover 7: Preprocessing ... % 13.66/2.59 Prover 10: Preprocessing ... % 13.66/2.61 Prover 11: Preprocessing ... % 13.66/2.61 Prover 13: Preprocessing ... % 13.66/2.61 Prover 8: Preprocessing ... % 15.51/2.80 Prover 7: Warning: ignoring some quantifiers % 15.51/2.83 Prover 7: Constructing countermodel ... % 15.51/2.83 Prover 10: Warning: ignoring some quantifiers % 15.51/2.84 Prover 10: Constructing countermodel ... % 16.43/2.89 Prover 8: Warning: ignoring some quantifiers % 16.43/2.90 Prover 8: Constructing countermodel ... % 16.87/2.94 Prover 13: Warning: ignoring some quantifiers % 17.00/2.97 Prover 13: Constructing countermodel ... % 17.50/3.04 Prover 11: Warning: ignoring some quantifiers % 17.50/3.05 Prover 7: Found proof (size 10) % 17.50/3.05 Prover 7: proved (576ms) % 17.50/3.05 Prover 13: stopped % 17.50/3.05 Prover 4: stopped % 17.50/3.05 Prover 1: stopped % 17.50/3.05 Prover 8: stopped % 17.50/3.05 Prover 10: stopped % 17.50/3.06 Prover 11: Constructing countermodel ... % 17.83/3.07 Prover 11: stopped % 17.83/3.07 % 17.83/3.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.83/3.07 % 17.83/3.07 % SZS output start Proof for theBenchmark % 17.83/3.08 Assumptions after simplification: % 17.83/3.08 --------------------------------- % 17.83/3.08 % 17.83/3.08 (singleton_set_defn) % 17.83/3.10 ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v0) | % 17.83/3.10 (unordered_pair(v0, v0) = v1 & $i(v1))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 17.83/3.10 (unordered_pair(v0, v0) = v1) | ~ $i(v0) | (singleton(v0) = v1 & $i(v1))) % 17.83/3.10 % 17.83/3.10 (singletons_are_sets) % 17.83/3.10 $i(universal_class) & ? [v0: $i] : ? [v1: $i] : (singleton(v0) = v1 & $i(v1) % 17.83/3.10 & $i(v0) & ~ member(v1, universal_class)) % 17.83/3.10 % 17.83/3.10 (unordered_pair) % 17.83/3.10 $i(universal_class) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 17.83/3.10 (unordered_pair(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | member(v2, % 17.83/3.10 universal_class)) % 17.83/3.10 % 17.83/3.10 Further assumptions not needed in the proof: % 17.83/3.10 -------------------------------------------- % 17.83/3.10 apply_defn, choice, class_elements_are_sets, complement, compose_defn1, % 17.83/3.10 compose_defn2, cross_product, cross_product_defn, disjoint_defn, domain_of, % 17.83/3.10 element_relation, element_relation_defn, extensionality, first_second, flip, % 17.83/3.10 flip_defn, function_defn, identity_relation, image_defn, inductive_defn, % 17.83/3.10 infinity, intersection, inverse_defn, null_class_defn, ordered_pair_defn, % 17.83/3.10 power_class, power_class_defn, range_of_defn, regularity, replacement, % 17.83/3.10 restrict_defn, rotate, rotate_defn, subclass_defn, successor_defn, % 17.83/3.10 successor_relation_defn1, successor_relation_defn2, sum_class, sum_class_defn, % 17.83/3.10 union_defn, unordered_pair_defn % 17.83/3.10 % 17.83/3.10 Those formulas are unsatisfiable: % 17.83/3.10 --------------------------------- % 17.83/3.10 % 17.83/3.10 Begin of proof % 17.83/3.11 | % 17.83/3.11 | ALPHA: (unordered_pair) implies: % 17.83/3.11 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v0, v1) = % 17.83/3.11 | v2) | ~ $i(v1) | ~ $i(v0) | member(v2, universal_class)) % 17.83/3.11 | % 17.83/3.11 | ALPHA: (singleton_set_defn) implies: % 17.83/3.11 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v0) | % 17.83/3.11 | (unordered_pair(v0, v0) = v1 & $i(v1))) % 17.83/3.11 | % 17.83/3.11 | ALPHA: (singletons_are_sets) implies: % 17.83/3.11 | (3) ? [v0: $i] : ? [v1: $i] : (singleton(v0) = v1 & $i(v1) & $i(v0) & ~ % 17.83/3.11 | member(v1, universal_class)) % 17.83/3.11 | % 17.83/3.11 | DELTA: instantiating (3) with fresh symbols all_41_0, all_41_1 gives: % 17.83/3.11 | (4) singleton(all_41_1) = all_41_0 & $i(all_41_0) & $i(all_41_1) & ~ % 17.83/3.11 | member(all_41_0, universal_class) % 17.83/3.11 | % 17.83/3.11 | ALPHA: (4) implies: % 17.83/3.11 | (5) ~ member(all_41_0, universal_class) % 17.83/3.11 | (6) $i(all_41_1) % 17.83/3.11 | (7) singleton(all_41_1) = all_41_0 % 17.83/3.11 | % 17.83/3.11 | GROUND_INST: instantiating (2) with all_41_1, all_41_0, simplifying with (6), % 17.83/3.11 | (7) gives: % 17.83/3.11 | (8) unordered_pair(all_41_1, all_41_1) = all_41_0 & $i(all_41_0) % 17.83/3.11 | % 17.83/3.11 | ALPHA: (8) implies: % 17.83/3.11 | (9) unordered_pair(all_41_1, all_41_1) = all_41_0 % 17.83/3.11 | % 17.83/3.11 | GROUND_INST: instantiating (1) with all_41_1, all_41_1, all_41_0, simplifying % 17.83/3.11 | with (5), (6), (9) gives: % 17.83/3.11 | (10) $false % 17.83/3.12 | % 17.83/3.12 | CLOSE: (10) is inconsistent. % 17.83/3.12 | % 17.83/3.12 End of proof % 17.83/3.12 % SZS output end Proof for theBenchmark % 17.83/3.12 % 17.83/3.12 2512ms %------------------------------------------------------------------------------