%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU116+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 : n016.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:34 EDT 2023 % Result : Theorem 6.55s 1.71s % Output : Proof 8.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SEU116+1 : TPTP v8.1.2. Released v3.2.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n016.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Wed Aug 23 16:51:07 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.76/1.10 Prover 4: Preprocessing ... % 2.76/1.10 Prover 1: Preprocessing ... % 2.76/1.15 Prover 6: Preprocessing ... % 2.76/1.15 Prover 3: Preprocessing ... % 2.76/1.15 Prover 5: Preprocessing ... % 2.76/1.15 Prover 2: Preprocessing ... % 2.76/1.15 Prover 0: Preprocessing ... % 4.73/1.54 Prover 2: Proving ... % 4.73/1.56 Prover 5: Proving ... % 5.31/1.59 Prover 1: Warning: ignoring some quantifiers % 5.31/1.62 Prover 1: Constructing countermodel ... % 5.31/1.66 Prover 6: Proving ... % 5.31/1.66 Prover 3: Warning: ignoring some quantifiers % 5.31/1.66 Prover 4: Warning: ignoring some quantifiers % 5.31/1.68 Prover 3: Constructing countermodel ... % 6.55/1.70 Prover 5: proved (1060ms) % 6.55/1.70 Prover 2: proved (1064ms) % 6.55/1.71 % 6.55/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.55/1.71 % 6.55/1.71 % 6.55/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.55/1.71 % 6.79/1.71 Prover 6: stopped % 6.79/1.71 Prover 3: stopped % 6.79/1.71 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.79/1.71 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.79/1.71 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.79/1.72 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.79/1.72 Prover 4: Constructing countermodel ... % 6.93/1.77 Prover 7: Preprocessing ... % 6.93/1.77 Prover 0: Proving ... % 6.93/1.77 Prover 0: stopped % 6.93/1.78 Prover 10: Preprocessing ... % 6.93/1.78 Prover 11: Preprocessing ... % 6.93/1.78 Prover 8: Preprocessing ... % 6.93/1.79 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.57/1.82 Prover 1: Found proof (size 8) % 7.57/1.82 Prover 1: proved (1179ms) % 7.57/1.82 Prover 4: stopped % 7.57/1.82 Prover 13: Preprocessing ... % 7.57/1.84 Prover 10: Warning: ignoring some quantifiers % 7.57/1.85 Prover 11: stopped % 7.57/1.85 Prover 10: Constructing countermodel ... % 7.57/1.85 Prover 7: Warning: ignoring some quantifiers % 7.57/1.86 Prover 10: stopped % 7.57/1.86 Prover 7: Constructing countermodel ... % 7.57/1.87 Prover 13: stopped % 7.57/1.87 Prover 7: stopped % 8.01/1.93 Prover 8: Warning: ignoring some quantifiers % 8.01/1.94 Prover 8: Constructing countermodel ... % 8.01/1.94 Prover 8: stopped % 8.01/1.94 % 8.01/1.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.01/1.95 % 8.01/1.95 % SZS output start Proof for theBenchmark % 8.01/1.95 Assumptions after simplification: % 8.01/1.95 --------------------------------- % 8.01/1.95 % 8.01/1.95 (cc3_finsub_1) % 8.42/1.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (finite_subsets(v0) = v2) | ~ % 8.42/1.98 (element(v1, v2) = 0) | ~ $i(v1) | ~ $i(v0) | finite(v1) = 0) % 8.42/1.98 % 8.42/1.98 (t30_finsub_1) % 8.48/1.98 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 8.48/1.98 finite_subsets(v0) = v2 & finite(v1) = v3 & element(v1, v2) = 0 & $i(v2) & % 8.48/1.98 $i(v1) & $i(v0)) % 8.48/1.98 % 8.48/1.98 (function-axioms) % 8.48/2.00 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 8.48/2.00 [v3: $i] : (v1 = v0 | ~ (element(v3, v2) = v1) | ~ (element(v3, v2) = v0)) & % 8.48/2.00 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 8.48/2.00 [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 8.48/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.48/2.00 : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0: % 8.48/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.48/2.00 ~ (relation(v2) = v1) | ~ (relation(v2) = v0)) & ! [v0: MultipleValueBool] % 8.48/2.00 : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (function(v2) = v1) % 8.48/2.00 | ~ (function(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.48/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (one_to_one(v2) = v1) | ~ % 8.48/2.00 (one_to_one(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.48/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (epsilon_transitive(v2) = % 8.48/2.00 v1) | ~ (epsilon_transitive(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 8.48/2.00 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (epsilon_connected(v2) = % 8.48/2.00 v1) | ~ (epsilon_connected(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 8.48/2.00 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ordinal(v2) = v1) | ~ % 8.48/2.00 (ordinal(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.48/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (natural(v2) = v1) | ~ % 8.48/2.00 (natural(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.48/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cap_closed(v2) = v1) | ~ % 8.48/2.00 (cap_closed(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 8.48/2.00 | ~ (finite_subsets(v2) = v1) | ~ (finite_subsets(v2) = v0)) & ! [v0: % 8.48/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.48/2.00 ~ (finite(v2) = v1) | ~ (finite(v2) = v0)) & ! [v0: MultipleValueBool] : % 8.48/2.00 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (preboolean(v2) = v1) % 8.48/2.00 | ~ (preboolean(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.48/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (diff_closed(v2) = v1) | ~ % 8.48/2.00 (diff_closed(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.48/2.00 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cup_closed(v2) = v1) | ~ % 8.48/2.00 (cup_closed(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 8.48/2.00 | ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0)) & ! [v0: % 8.48/2.00 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.48/2.00 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) % 8.48/2.00 % 8.48/2.00 Further assumptions not needed in the proof: % 8.48/2.00 -------------------------------------------- % 8.48/2.00 antisymmetry_r2_hidden, cc1_finset_1, cc1_finsub_1, cc2_finset_1, cc2_finsub_1, % 8.48/2.00 dt_k5_finsub_1, existence_m1_subset_1, fc1_finsub_1, fc1_subset_1, fc1_xboole_0, % 8.48/2.00 fc2_finsub_1, rc1_finset_1, rc1_finsub_1, rc1_subset_1, rc1_xboole_0, % 8.48/2.00 rc2_finset_1, rc2_subset_1, rc2_xboole_0, rc3_finset_1, rc4_finset_1, % 8.48/2.00 reflexivity_r1_tarski, t1_subset, t2_subset, t3_subset, t4_subset, t5_subset, % 8.48/2.00 t6_boole, t7_boole, t8_boole % 8.48/2.00 % 8.48/2.00 Those formulas are unsatisfiable: % 8.48/2.00 --------------------------------- % 8.48/2.00 % 8.48/2.00 Begin of proof % 8.48/2.00 | % 8.48/2.00 | ALPHA: (function-axioms) implies: % 8.48/2.00 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 8.48/2.00 | (v1 = v0 | ~ (finite(v2) = v1) | ~ (finite(v2) = v0)) % 8.48/2.00 | % 8.48/2.00 | DELTA: instantiating (t30_finsub_1) with fresh symbols all_36_0, all_36_1, % 8.48/2.00 | all_36_2, all_36_3 gives: % 8.48/2.01 | (2) ~ (all_36_0 = 0) & finite_subsets(all_36_3) = all_36_1 & % 8.48/2.01 | finite(all_36_2) = all_36_0 & element(all_36_2, all_36_1) = 0 & % 8.48/2.01 | $i(all_36_1) & $i(all_36_2) & $i(all_36_3) % 8.48/2.01 | % 8.48/2.01 | ALPHA: (2) implies: % 8.48/2.01 | (3) ~ (all_36_0 = 0) % 8.48/2.01 | (4) $i(all_36_3) % 8.48/2.01 | (5) $i(all_36_2) % 8.48/2.01 | (6) element(all_36_2, all_36_1) = 0 % 8.48/2.01 | (7) finite(all_36_2) = all_36_0 % 8.48/2.01 | (8) finite_subsets(all_36_3) = all_36_1 % 8.48/2.01 | % 8.63/2.01 | GROUND_INST: instantiating (cc3_finsub_1) with all_36_3, all_36_2, all_36_1, % 8.63/2.01 | simplifying with (4), (5), (6), (8) gives: % 8.63/2.01 | (9) finite(all_36_2) = 0 % 8.63/2.01 | % 8.63/2.01 | GROUND_INST: instantiating (1) with all_36_0, 0, all_36_2, simplifying with % 8.63/2.01 | (7), (9) gives: % 8.63/2.01 | (10) all_36_0 = 0 % 8.63/2.01 | % 8.63/2.01 | REDUCE: (3), (10) imply: % 8.63/2.01 | (11) $false % 8.63/2.01 | % 8.63/2.01 | CLOSE: (11) is inconsistent. % 8.63/2.01 | % 8.63/2.01 End of proof % 8.63/2.01 % SZS output end Proof for theBenchmark % 8.63/2.01 % 8.63/2.01 1391ms %------------------------------------------------------------------------------