TSTP Solution File: SEU085+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SEU085+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n024.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 17:42:29 EDT 2023
% Result : Theorem 9.90s 2.13s
% Output : Proof 13.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU085+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Aug 23 20:25:24 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.59 ________ _____
% 0.19/0.59 ___ __ \_________(_)________________________________
% 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.59
% 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.59 (2023-06-19)
% 0.19/0.59
% 0.19/0.59 (c) Philipp Rümmer, 2009-2023
% 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.59 Amanda Stjerna.
% 0.19/0.59 Free software under BSD-3-Clause.
% 0.19/0.59
% 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.59
% 0.19/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.61 Running up to 7 provers in parallel.
% 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 3.14/1.15 Prover 1: Preprocessing ...
% 3.14/1.15 Prover 4: Preprocessing ...
% 3.14/1.19 Prover 5: Preprocessing ...
% 3.14/1.19 Prover 6: Preprocessing ...
% 3.14/1.19 Prover 2: Preprocessing ...
% 3.14/1.19 Prover 0: Preprocessing ...
% 3.14/1.19 Prover 3: Preprocessing ...
% 6.88/1.66 Prover 2: Proving ...
% 6.88/1.68 Prover 5: Proving ...
% 7.08/1.70 Prover 1: Warning: ignoring some quantifiers
% 7.35/1.73 Prover 1: Constructing countermodel ...
% 7.35/1.75 Prover 3: Warning: ignoring some quantifiers
% 7.35/1.77 Prover 3: Constructing countermodel ...
% 7.87/1.81 Prover 6: Proving ...
% 7.87/1.93 Prover 4: Warning: ignoring some quantifiers
% 8.96/1.98 Prover 4: Constructing countermodel ...
% 8.96/2.05 Prover 0: Proving ...
% 9.90/2.12 Prover 3: proved (1499ms)
% 9.90/2.13
% 9.90/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.90/2.13
% 10.22/2.13 Prover 0: stopped
% 10.22/2.14 Prover 2: stopped
% 10.22/2.14 Prover 5: proved (1509ms)
% 10.22/2.14
% 10.22/2.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.22/2.14
% 10.22/2.14 Prover 6: stopped
% 10.28/2.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.28/2.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.28/2.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 10.28/2.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 10.28/2.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 10.28/2.20 Prover 7: Preprocessing ...
% 10.81/2.23 Prover 10: Preprocessing ...
% 10.81/2.24 Prover 11: Preprocessing ...
% 10.81/2.26 Prover 8: Preprocessing ...
% 11.28/2.27 Prover 13: Preprocessing ...
% 11.28/2.27 Prover 7: Warning: ignoring some quantifiers
% 11.28/2.30 Prover 7: Constructing countermodel ...
% 11.28/2.35 Prover 10: Warning: ignoring some quantifiers
% 11.93/2.37 Prover 10: Constructing countermodel ...
% 12.17/2.39 Prover 13: Warning: ignoring some quantifiers
% 12.17/2.39 Prover 13: Constructing countermodel ...
% 12.56/2.44 Prover 8: Warning: ignoring some quantifiers
% 12.56/2.48 Prover 8: Constructing countermodel ...
% 12.56/2.54 Prover 10: Found proof (size 4)
% 12.56/2.54 Prover 10: proved (394ms)
% 12.56/2.54 Prover 7: stopped
% 12.56/2.54 Prover 13: stopped
% 12.56/2.54 Prover 4: stopped
% 12.56/2.55 Prover 8: stopped
% 12.56/2.55 Prover 1: stopped
% 12.56/2.55 Prover 11: Warning: ignoring some quantifiers
% 12.56/2.56 Prover 11: Constructing countermodel ...
% 12.56/2.57 Prover 11: stopped
% 12.56/2.57
% 12.56/2.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.56/2.57
% 12.56/2.57 % SZS output start Proof for theBenchmark
% 12.56/2.58 Assumptions after simplification:
% 12.56/2.58 ---------------------------------
% 12.56/2.58
% 12.56/2.58 (fc12_finset_1)
% 12.56/2.60 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_difference(v0, v1) = v2) |
% 12.56/2.60 ~ $i(v1) | ~ $i(v0) | ~ finite(v0) | finite(v2))
% 12.56/2.60
% 12.56/2.60 (t16_finset_1)
% 13.60/2.60 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (set_difference(v0, v1) = v2 &
% 13.60/2.60 $i(v2) & $i(v1) & $i(v0) & finite(v0) & ~ finite(v2))
% 13.60/2.60
% 13.60/2.60 Further assumptions not needed in the proof:
% 13.60/2.60 --------------------------------------------
% 13.60/2.60 antisymmetry_r2_hidden, cc1_arytm_3, cc1_finset_1, cc1_funct_1, cc1_ordinal1,
% 13.60/2.60 cc1_relat_1, cc2_arytm_3, cc2_finset_1, cc2_funct_1, cc2_ordinal1, cc3_ordinal1,
% 13.60/2.60 cc4_arytm_3, existence_m1_subset_1, fc12_relat_1, fc1_subset_1, fc1_xboole_0,
% 13.60/2.60 fc2_ordinal1, fc3_relat_1, fc4_relat_1, fc8_arytm_3, rc1_arytm_3, rc1_finset_1,
% 13.60/2.60 rc1_funcop_1, rc1_funct_1, rc1_ordinal1, rc1_ordinal2, rc1_relat_1,
% 13.60/2.60 rc1_subset_1, rc1_xboole_0, rc2_arytm_3, rc2_finset_1, rc2_funct_1,
% 13.60/2.60 rc2_ordinal1, rc2_ordinal2, rc2_relat_1, rc2_subset_1, rc2_xboole_0,
% 13.60/2.60 rc3_arytm_3, rc3_finset_1, rc3_funct_1, rc3_ordinal1, rc3_relat_1, rc4_funct_1,
% 13.60/2.60 rc4_ordinal1, rc5_funct_1, reflexivity_r1_tarski, t13_finset_1, t1_subset,
% 13.60/2.60 t2_subset, t36_xboole_1, t3_boole, t3_subset, t4_boole, t4_subset, t5_subset,
% 13.60/2.60 t6_boole, t7_boole, t8_boole
% 13.60/2.60
% 13.60/2.60 Those formulas are unsatisfiable:
% 13.60/2.60 ---------------------------------
% 13.60/2.60
% 13.60/2.60 Begin of proof
% 13.60/2.60 |
% 13.60/2.60 | DELTA: instantiating (t16_finset_1) with fresh symbols all_75_0, all_75_1,
% 13.60/2.60 | all_75_2 gives:
% 13.60/2.61 | (1) set_difference(all_75_2, all_75_1) = all_75_0 & $i(all_75_0) &
% 13.60/2.61 | $i(all_75_1) & $i(all_75_2) & finite(all_75_2) & ~ finite(all_75_0)
% 13.60/2.61 |
% 13.60/2.61 | ALPHA: (1) implies:
% 13.60/2.61 | (2) ~ finite(all_75_0)
% 13.60/2.61 | (3) finite(all_75_2)
% 13.60/2.61 | (4) $i(all_75_2)
% 13.60/2.61 | (5) $i(all_75_1)
% 13.60/2.61 | (6) set_difference(all_75_2, all_75_1) = all_75_0
% 13.60/2.61 |
% 13.60/2.61 | GROUND_INST: instantiating (fc12_finset_1) with all_75_2, all_75_1, all_75_0,
% 13.60/2.61 | simplifying with (2), (3), (4), (5), (6) gives:
% 13.60/2.61 | (7) $false
% 13.60/2.61 |
% 13.60/2.61 | CLOSE: (7) is inconsistent.
% 13.60/2.61 |
% 13.60/2.61 End of proof
% 13.60/2.61 % SZS output end Proof for theBenchmark
% 13.60/2.61
% 13.60/2.61 2017ms
%------------------------------------------------------------------------------