TSTP Solution File: SET117+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SET117+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 : 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 15:23:53 EDT 2023
% Result : Theorem 12.71s 2.54s
% Output : Proof 18.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET117+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 10:47:20 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.66/0.64 ________ _____
% 0.66/0.64 ___ __ \_________(_)________________________________
% 0.66/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.66/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.66/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.66/0.64
% 0.66/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.66/0.64 (2023-06-19)
% 0.66/0.64
% 0.66/0.65 (c) Philipp Rümmer, 2009-2023
% 0.66/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.66/0.65 Amanda Stjerna.
% 0.66/0.65 Free software under BSD-3-Clause.
% 0.66/0.65
% 0.66/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.66/0.65
% 0.66/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.66/0.66 Running up to 7 provers in parallel.
% 0.66/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.66/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.66/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.66/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.66/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.66/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.66/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.12/1.20 Prover 1: Preprocessing ...
% 3.12/1.20 Prover 4: Preprocessing ...
% 3.66/1.23 Prover 3: Preprocessing ...
% 3.66/1.23 Prover 2: Preprocessing ...
% 3.66/1.24 Prover 6: Preprocessing ...
% 3.66/1.25 Prover 5: Preprocessing ...
% 3.66/1.25 Prover 0: Preprocessing ...
% 9.13/1.99 Prover 1: Warning: ignoring some quantifiers
% 9.52/2.03 Prover 3: Warning: ignoring some quantifiers
% 9.64/2.06 Prover 5: Proving ...
% 9.64/2.07 Prover 6: Proving ...
% 9.64/2.07 Prover 3: Constructing countermodel ...
% 9.64/2.07 Prover 1: Constructing countermodel ...
% 9.64/2.08 Prover 4: Warning: ignoring some quantifiers
% 10.07/2.13 Prover 4: Constructing countermodel ...
% 10.52/2.18 Prover 2: Proving ...
% 10.52/2.25 Prover 0: Proving ...
% 12.71/2.53 Prover 5: proved (1860ms)
% 12.71/2.53
% 12.71/2.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.71/2.54
% 12.71/2.54 Prover 6: stopped
% 12.71/2.54 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 12.71/2.54 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 12.71/2.54 Prover 0: stopped
% 12.71/2.55 Prover 2: stopped
% 13.45/2.56 Prover 3: stopped
% 13.45/2.58 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 13.45/2.58 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.45/2.58 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 13.73/2.63 Prover 10: Preprocessing ...
% 14.09/2.65 Prover 8: Preprocessing ...
% 14.09/2.65 Prover 7: Preprocessing ...
% 14.09/2.68 Prover 11: Preprocessing ...
% 14.09/2.69 Prover 13: Preprocessing ...
% 15.09/2.82 Prover 10: Warning: ignoring some quantifiers
% 15.09/2.85 Prover 10: Constructing countermodel ...
% 15.09/2.86 Prover 7: Warning: ignoring some quantifiers
% 15.82/2.87 Prover 8: Warning: ignoring some quantifiers
% 15.82/2.88 Prover 7: Constructing countermodel ...
% 16.00/2.89 Prover 8: Constructing countermodel ...
% 16.00/2.91 Prover 13: Warning: ignoring some quantifiers
% 16.23/2.92 Prover 13: Constructing countermodel ...
% 16.27/2.97 Prover 11: Warning: ignoring some quantifiers
% 16.87/3.00 Prover 11: Constructing countermodel ...
% 17.42/3.08 Prover 10: gave up
% 17.42/3.08 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 17.42/3.14 Prover 16: Preprocessing ...
% 18.26/3.22 Prover 7: Found proof (size 11)
% 18.26/3.22 Prover 7: proved (679ms)
% 18.26/3.22 Prover 13: stopped
% 18.26/3.22 Prover 8: stopped
% 18.26/3.22 Prover 11: stopped
% 18.26/3.22 Prover 1: stopped
% 18.26/3.22 Prover 4: stopped
% 18.42/3.22 Prover 16: stopped
% 18.42/3.22
% 18.42/3.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.42/3.22
% 18.42/3.22 % SZS output start Proof for theBenchmark
% 18.42/3.23 Assumptions after simplification:
% 18.42/3.23 ---------------------------------
% 18.42/3.23
% 18.42/3.23 (corollary_1_to_ordered_pairs_are_sets)
% 18.50/3.25 $i(universal_class) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (first(v0) =
% 18.50/3.25 v1 & second(v0) = v2 & ordered_pair(v1, v2) = v0 & $i(v2) & $i(v1) & $i(v0)
% 18.50/3.25 & ~ member(v0, universal_class))
% 18.50/3.25
% 18.50/3.25 (ordered_pair_defn)
% 18.50/3.26 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (singleton(v1) =
% 18.50/3.26 v2) | ~ (unordered_pair(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? [v4:
% 18.50/3.26 $i] : ? [v5: $i] : (ordered_pair(v0, v1) = v4 & singleton(v0) = v5 &
% 18.50/3.26 unordered_pair(v5, v3) = v4 & $i(v5) & $i(v4))) & ! [v0: $i] : ! [v1:
% 18.50/3.26 $i] : ! [v2: $i] : ( ~ (ordered_pair(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0)
% 18.50/3.26 | ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : (singleton(v1) = v4 &
% 18.50/3.26 singleton(v0) = v3 & unordered_pair(v3, v5) = v2 & unordered_pair(v0, v4)
% 18.50/3.26 = v5 & $i(v5) & $i(v4) & $i(v3) & $i(v2)))
% 18.50/3.26
% 18.50/3.26 (unordered_pair)
% 18.50/3.26 $i(universal_class) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 18.50/3.26 (unordered_pair(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | member(v2,
% 18.50/3.26 universal_class))
% 18.50/3.26
% 18.50/3.26 Further assumptions not needed in the proof:
% 18.50/3.26 --------------------------------------------
% 18.50/3.26 apply_defn, choice, class_elements_are_sets, complement, compose_defn1,
% 18.50/3.26 compose_defn2, cross_product, cross_product_defn, disjoint_defn, domain_of,
% 18.50/3.26 element_relation, element_relation_defn, extensionality, first_second, flip,
% 18.50/3.26 flip_defn, function_defn, identity_relation, image_defn, inductive_defn,
% 18.50/3.26 infinity, intersection, inverse_defn, null_class_defn, power_class,
% 18.50/3.26 power_class_defn, range_of_defn, regularity, replacement, restrict_defn, rotate,
% 18.50/3.26 rotate_defn, singleton_set_defn, subclass_defn, successor_defn,
% 18.50/3.26 successor_relation_defn1, successor_relation_defn2, sum_class, sum_class_defn,
% 18.50/3.26 union_defn, unordered_pair_defn
% 18.50/3.26
% 18.50/3.26 Those formulas are unsatisfiable:
% 18.50/3.26 ---------------------------------
% 18.50/3.26
% 18.50/3.26 Begin of proof
% 18.50/3.26 |
% 18.50/3.26 | ALPHA: (unordered_pair) implies:
% 18.50/3.26 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v0, v1) =
% 18.50/3.26 | v2) | ~ $i(v1) | ~ $i(v0) | member(v2, universal_class))
% 18.50/3.26 |
% 18.50/3.26 | ALPHA: (ordered_pair_defn) implies:
% 18.50/3.26 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (ordered_pair(v0, v1) =
% 18.50/3.26 | v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : ? [v5:
% 18.50/3.26 | $i] : (singleton(v1) = v4 & singleton(v0) = v3 & unordered_pair(v3,
% 18.50/3.26 | v5) = v2 & unordered_pair(v0, v4) = v5 & $i(v5) & $i(v4) & $i(v3)
% 18.50/3.26 | & $i(v2)))
% 18.50/3.26 |
% 18.50/3.26 | ALPHA: (corollary_1_to_ordered_pairs_are_sets) implies:
% 18.50/3.26 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (first(v0) = v1 & second(v0)
% 18.50/3.26 | = v2 & ordered_pair(v1, v2) = v0 & $i(v2) & $i(v1) & $i(v0) & ~
% 18.50/3.26 | member(v0, universal_class))
% 18.50/3.26 |
% 18.50/3.26 | DELTA: instantiating (3) with fresh symbols all_53_0, all_53_1, all_53_2
% 18.50/3.26 | gives:
% 18.50/3.27 | (4) first(all_53_2) = all_53_1 & second(all_53_2) = all_53_0 &
% 18.50/3.27 | ordered_pair(all_53_1, all_53_0) = all_53_2 & $i(all_53_0) &
% 18.50/3.27 | $i(all_53_1) & $i(all_53_2) & ~ member(all_53_2, universal_class)
% 18.50/3.27 |
% 18.50/3.27 | ALPHA: (4) implies:
% 18.50/3.27 | (5) ~ member(all_53_2, universal_class)
% 18.50/3.27 | (6) $i(all_53_1)
% 18.50/3.27 | (7) $i(all_53_0)
% 18.50/3.27 | (8) ordered_pair(all_53_1, all_53_0) = all_53_2
% 18.50/3.27 |
% 18.50/3.27 | GROUND_INST: instantiating (2) with all_53_1, all_53_0, all_53_2, simplifying
% 18.50/3.27 | with (6), (7), (8) gives:
% 18.50/3.27 | (9) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (singleton(all_53_0) = v1 &
% 18.50/3.27 | singleton(all_53_1) = v0 & unordered_pair(v0, v2) = all_53_2 &
% 18.50/3.27 | unordered_pair(all_53_1, v1) = v2 & $i(v2) & $i(v1) & $i(v0) &
% 18.50/3.27 | $i(all_53_2))
% 18.50/3.27 |
% 18.50/3.27 | DELTA: instantiating (9) with fresh symbols all_96_0, all_96_1, all_96_2
% 18.50/3.27 | gives:
% 18.50/3.27 | (10) singleton(all_53_0) = all_96_1 & singleton(all_53_1) = all_96_2 &
% 18.50/3.27 | unordered_pair(all_96_2, all_96_0) = all_53_2 &
% 18.50/3.27 | unordered_pair(all_53_1, all_96_1) = all_96_0 & $i(all_96_0) &
% 18.50/3.27 | $i(all_96_1) & $i(all_96_2) & $i(all_53_2)
% 18.50/3.27 |
% 18.50/3.27 | ALPHA: (10) implies:
% 18.50/3.27 | (11) $i(all_96_2)
% 18.50/3.27 | (12) $i(all_96_0)
% 18.50/3.27 | (13) unordered_pair(all_96_2, all_96_0) = all_53_2
% 18.50/3.27 |
% 18.50/3.27 | GROUND_INST: instantiating (1) with all_96_2, all_96_0, all_53_2, simplifying
% 18.50/3.27 | with (5), (11), (12), (13) gives:
% 18.50/3.27 | (14) $false
% 18.50/3.27 |
% 18.50/3.27 | CLOSE: (14) is inconsistent.
% 18.50/3.27 |
% 18.50/3.27 End of proof
% 18.50/3.27 % SZS output end Proof for theBenchmark
% 18.50/3.27
% 18.50/3.27 2627ms
%------------------------------------------------------------------------------