%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM393+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 11:47:33 EDT 2023 % Result : Theorem 8.47s 1.89s % Output : Proof 11.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : NUM393+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.13/0.35 % Computer : n016.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Fri Aug 25 11:24:10 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.75/1.09 Prover 1: Preprocessing ... % 2.75/1.09 Prover 4: Preprocessing ... % 3.20/1.13 Prover 5: Preprocessing ... % 3.20/1.13 Prover 6: Preprocessing ... % 3.20/1.13 Prover 0: Preprocessing ... % 3.20/1.13 Prover 3: Preprocessing ... % 3.20/1.13 Prover 2: Preprocessing ... % 4.69/1.46 Prover 2: Proving ... % 4.69/1.47 Prover 5: Proving ... % 5.37/1.52 Prover 1: Warning: ignoring some quantifiers % 5.37/1.55 Prover 1: Constructing countermodel ... % 5.37/1.55 Prover 6: Proving ... % 6.20/1.57 Prover 3: Warning: ignoring some quantifiers % 6.20/1.58 Prover 3: Constructing countermodel ... % 6.43/1.59 Prover 4: Warning: ignoring some quantifiers % 6.43/1.62 Prover 4: Constructing countermodel ... % 6.79/1.65 Prover 0: Proving ... % 7.67/1.78 Prover 3: gave up % 7.67/1.78 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.67/1.84 Prover 7: Preprocessing ... % 8.26/1.86 Prover 1: gave up % 8.26/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.47/1.89 Prover 2: proved (1251ms) % 8.47/1.89 % 8.47/1.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.47/1.89 % 8.47/1.90 Prover 0: stopped % 8.47/1.90 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.47/1.90 Prover 6: stopped % 8.47/1.91 Prover 7: Warning: ignoring some quantifiers % 8.47/1.91 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.47/1.91 Prover 8: Preprocessing ... % 8.47/1.91 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.47/1.91 Prover 5: stopped % 8.79/1.93 Prover 7: Constructing countermodel ... % 8.79/1.93 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.86/1.98 Prover 10: Preprocessing ... % 8.86/1.98 Prover 13: Preprocessing ... % 8.86/1.98 Prover 16: Preprocessing ... % 8.86/1.99 Prover 11: Preprocessing ... % 8.86/2.02 Prover 8: Warning: ignoring some quantifiers % 8.86/2.03 Prover 10: Warning: ignoring some quantifiers % 8.86/2.03 Prover 8: Constructing countermodel ... % 8.86/2.04 Prover 13: Warning: ignoring some quantifiers % 8.86/2.05 Prover 10: Constructing countermodel ... % 8.86/2.05 Prover 13: Constructing countermodel ... % 8.86/2.06 Prover 16: Warning: ignoring some quantifiers % 8.86/2.07 Prover 16: Constructing countermodel ... % 10.05/2.20 Prover 8: gave up % 10.05/2.21 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 10.05/2.22 Prover 11: Warning: ignoring some quantifiers % 10.05/2.22 Prover 7: Found proof (size 13) % 10.05/2.22 Prover 7: proved (442ms) % 10.05/2.23 Prover 13: stopped % 10.05/2.23 Prover 16: stopped % 10.05/2.23 Prover 10: stopped % 10.05/2.23 Prover 4: stopped % 10.05/2.24 Prover 19: Preprocessing ... % 10.05/2.24 Prover 11: Constructing countermodel ... % 11.02/2.25 Prover 11: stopped % 11.02/2.32 Prover 19: Warning: ignoring some quantifiers % 11.02/2.33 Prover 19: Constructing countermodel ... % 11.02/2.33 Prover 19: stopped % 11.02/2.33 % 11.02/2.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.02/2.33 % 11.02/2.34 % SZS output start Proof for theBenchmark % 11.47/2.34 Assumptions after simplification: % 11.47/2.34 --------------------------------- % 11.47/2.34 % 11.47/2.34 (connectedness_r1_ordinal1) % 11.47/2.34 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ordinal(v1) | ~ % 11.47/2.34 ordinal(v0) | ordinal_subset(v1, v0) | ordinal_subset(v0, v1)) % 11.47/2.34 % 11.47/2.34 (d9_xboole_0) % 11.47/2.35 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ subset(v1, v0) | % 11.47/2.35 inclusion_comparable(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ % 11.47/2.35 $i(v0) | ~ subset(v0, v1) | inclusion_comparable(v0, v1)) & ! [v0: $i] : % 11.47/2.35 ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ inclusion_comparable(v0, v1) | % 11.47/2.35 subset(v1, v0) | subset(v0, v1)) % 11.47/2.35 % 11.47/2.35 (redefinition_r1_ordinal1) % 11.47/2.35 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ subset(v0, v1) | ~ % 11.47/2.35 ordinal(v1) | ~ ordinal(v0) | ordinal_subset(v0, v1)) & ! [v0: $i] : ! % 11.47/2.35 [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ordinal_subset(v0, v1) | ~ ordinal(v1) % 11.47/2.35 | ~ ordinal(v0) | subset(v0, v1)) % 11.47/2.35 % 11.47/2.35 (t25_ordinal1) % 11.47/2.35 ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & ordinal(v1) & ordinal(v0) & ~ % 11.47/2.35 inclusion_comparable(v0, v1)) % 11.47/2.35 % 11.47/2.35 Further assumptions not needed in the proof: % 11.47/2.35 -------------------------------------------- % 11.47/2.35 antisymmetry_r2_hidden, cc1_funct_1, cc1_ordinal1, cc1_relat_1, cc2_funct_1, % 11.47/2.35 cc2_ordinal1, existence_m1_subset_1, fc12_relat_1, fc1_xboole_0, fc4_relat_1, % 11.47/2.35 rc1_funct_1, rc1_ordinal1, rc1_relat_1, rc1_xboole_0, rc2_funct_1, rc2_relat_1, % 11.47/2.35 rc2_xboole_0, rc3_funct_1, rc3_relat_1, rc4_funct_1, rc5_funct_1, % 11.47/2.35 reflexivity_r1_ordinal1, reflexivity_r1_tarski, reflexivity_r3_xboole_0, % 11.47/2.35 symmetry_r3_xboole_0, t1_subset, t2_subset, t3_subset, t4_subset, t5_subset, % 11.47/2.35 t6_boole, t7_boole, t8_boole % 11.47/2.35 % 11.47/2.35 Those formulas are unsatisfiable: % 11.47/2.35 --------------------------------- % 11.47/2.35 % 11.47/2.35 Begin of proof % 11.47/2.35 | % 11.47/2.35 | ALPHA: (d9_xboole_0) implies: % 11.47/2.36 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ subset(v0, v1) % 11.47/2.36 | | inclusion_comparable(v0, v1)) % 11.47/2.36 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ subset(v1, v0) % 11.47/2.36 | | inclusion_comparable(v0, v1)) % 11.47/2.36 | % 11.47/2.36 | ALPHA: (redefinition_r1_ordinal1) implies: % 11.47/2.36 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 11.47/2.36 | ordinal_subset(v0, v1) | ~ ordinal(v1) | ~ ordinal(v0) | subset(v0, % 11.47/2.36 | v1)) % 11.47/2.36 | % 11.47/2.36 | DELTA: instantiating (t25_ordinal1) with fresh symbols all_48_0, all_48_1 % 11.47/2.36 | gives: % 11.47/2.36 | (4) $i(all_48_0) & $i(all_48_1) & ordinal(all_48_0) & ordinal(all_48_1) & % 11.47/2.36 | ~ inclusion_comparable(all_48_1, all_48_0) % 11.47/2.36 | % 11.47/2.36 | ALPHA: (4) implies: % 11.47/2.36 | (5) ~ inclusion_comparable(all_48_1, all_48_0) % 11.47/2.36 | (6) ordinal(all_48_1) % 11.47/2.36 | (7) ordinal(all_48_0) % 11.47/2.36 | (8) $i(all_48_1) % 11.47/2.36 | (9) $i(all_48_0) % 11.47/2.36 | % 11.47/2.36 | GROUND_INST: instantiating (connectedness_r1_ordinal1) with all_48_1, % 11.47/2.36 | all_48_0, simplifying with (6), (7), (8), (9) gives: % 11.47/2.36 | (10) ordinal_subset(all_48_0, all_48_1) | ordinal_subset(all_48_1, % 11.47/2.36 | all_48_0) % 11.47/2.36 | % 11.47/2.36 | BETA: splitting (10) gives: % 11.47/2.36 | % 11.47/2.36 | Case 1: % 11.47/2.36 | | % 11.47/2.36 | | (11) ordinal_subset(all_48_0, all_48_1) % 11.47/2.36 | | % 11.47/2.36 | | GROUND_INST: instantiating (3) with all_48_0, all_48_1, simplifying with % 11.47/2.36 | | (6), (7), (8), (9), (11) gives: % 11.47/2.36 | | (12) subset(all_48_0, all_48_1) % 11.47/2.36 | | % 11.47/2.36 | | GROUND_INST: instantiating (2) with all_48_1, all_48_0, simplifying with % 11.47/2.36 | | (5), (8), (9), (12) gives: % 11.47/2.36 | | (13) $false % 11.47/2.36 | | % 11.47/2.36 | | CLOSE: (13) is inconsistent. % 11.47/2.36 | | % 11.47/2.36 | Case 2: % 11.47/2.36 | | % 11.47/2.36 | | (14) ordinal_subset(all_48_1, all_48_0) % 11.47/2.36 | | % 11.47/2.36 | | GROUND_INST: instantiating (3) with all_48_1, all_48_0, simplifying with % 11.47/2.36 | | (6), (7), (8), (9), (14) gives: % 11.47/2.36 | | (15) subset(all_48_1, all_48_0) % 11.47/2.36 | | % 11.47/2.36 | | GROUND_INST: instantiating (1) with all_48_1, all_48_0, simplifying with % 11.47/2.36 | | (5), (8), (9), (15) gives: % 11.47/2.36 | | (16) $false % 11.47/2.36 | | % 11.47/2.36 | | CLOSE: (16) is inconsistent. % 11.47/2.36 | | % 11.47/2.36 | End of split % 11.47/2.36 | % 11.47/2.36 End of proof % 11.47/2.37 % SZS output end Proof for theBenchmark % 11.47/2.37 % 11.47/2.37 1744ms %------------------------------------------------------------------------------