%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ITP010+1 : TPTP v8.1.2. Bugfixed v7.5.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n015.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 04:08:35 EDT 2023 % Result : Theorem 7.69s 1.86s % Output : Proof 13.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ITP010+1 : TPTP v8.1.2. Bugfixed v7.5.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.34 % Computer : n015.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Sun Aug 27 16:40:39 EDT 2023 % 0.15/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 3.76/1.25 Prover 1: Preprocessing ... % 3.76/1.25 Prover 4: Preprocessing ... % 3.76/1.30 Prover 2: Preprocessing ... % 3.76/1.30 Prover 0: Preprocessing ... % 3.76/1.30 Prover 6: Preprocessing ... % 3.76/1.30 Prover 3: Preprocessing ... % 3.76/1.30 Prover 5: Preprocessing ... % 7.69/1.82 Prover 5: Constructing countermodel ... % 7.69/1.82 Prover 2: Constructing countermodel ... % 7.69/1.85 Prover 2: proved (1222ms) % 7.69/1.85 Prover 5: proved (1213ms) % 7.69/1.85 % 7.69/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.69/1.86 % 7.69/1.86 % 7.69/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.69/1.86 % 7.69/1.86 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.69/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.50/1.90 Prover 3: Constructing countermodel ... % 8.50/1.91 Prover 3: stopped % 8.50/1.91 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.73/1.93 Prover 6: Constructing countermodel ... % 8.73/1.93 Prover 6: stopped % 8.73/1.93 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.73/1.96 Prover 8: Preprocessing ... % 8.73/1.99 Prover 7: Preprocessing ... % 9.65/2.09 Prover 10: Preprocessing ... % 9.65/2.09 Prover 11: Preprocessing ... % 10.28/2.17 Prover 0: Constructing countermodel ... % 10.28/2.17 Prover 0: stopped % 10.28/2.18 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.81/2.21 Prover 1: Warning: ignoring some quantifiers % 10.81/2.23 Prover 1: Constructing countermodel ... % 10.81/2.24 Prover 1: Found proof (size 1) % 10.81/2.24 Prover 1: proved (1607ms) % 10.81/2.25 Prover 13: Preprocessing ... % 11.29/2.35 Prover 8: Warning: ignoring some quantifiers % 12.01/2.38 Prover 8: Constructing countermodel ... % 12.01/2.38 Prover 8: stopped % 12.01/2.39 Prover 4: Constructing countermodel ... % 12.01/2.39 Prover 4: stopped % 12.24/2.43 Prover 10: Constructing countermodel ... % 12.24/2.43 Prover 10: stopped % 12.24/2.43 Prover 7: Constructing countermodel ... % 12.55/2.43 Prover 7: stopped % 12.55/2.43 Prover 13: stopped % 12.90/2.56 Prover 11: Constructing countermodel ... % 12.90/2.56 Prover 11: stopped % 12.90/2.56 % 12.90/2.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.90/2.56 % 12.90/2.56 % SZS output start Proof for theBenchmark % 13.19/2.57 Assumptions after simplification: % 13.19/2.57 --------------------------------- % 13.19/2.57 % 13.19/2.57 (thm_2Ecardinal_2ECARD__NOT__LE) % 13.19/2.57 $false % 13.19/2.57 % 13.19/2.57 Further assumptions not needed in the proof: % 13.19/2.57 -------------------------------------------- % 13.19/2.57 arityeq1_2Ec_2Ebool_2E_21_2E1_2Emono_2EA_27a, % 13.19/2.57 arityeq1_2Ec_2Ebool_2E_3F_2E1_2Emono_2EA_27a, arityeq1_2Ec_2Ebool_2E_7E_2E1, % 13.19/2.57 arityeq2_2Ec_2Ebool_2E_2F_5C_2E2, arityeq2_2Ec_2Ebool_2E_5C_2F_2E2, % 13.19/2.57 arityeq2_2Ec_2Ecardinal_2Ecardleq_2E2_2Emono_2EA_27a_20mono_2EA_27b, % 13.19/2.57 arityeq2_2Ec_2Ecardinal_2Ecardleq_2E2_2Emono_2EA_27b_20mono_2EA_27a, % 13.19/2.57 arityeq2_2Ec_2Emin_2E_3D_2E2_2Emono_2EA_27a, arityeq2_2Ec_2Emin_2E_3D_3D_3E_2E2, % 13.19/2.57 reserved_2Eho_2Ebool__cases__ax, reserved_2Eho_2Eboolext, % 13.19/2.57 reserved_2Eho_2Eeq__ext, reserved_2Eho_2Ei__thm, reserved_2Eho_2Ek__thm, % 13.19/2.57 reserved_2Eho_2Enotfalse, reserved_2Eho_2Es__thm, reserved_2Eho_2Etruth, % 13.19/2.57 reserved_2Elogic_2E_2F_5C, reserved_2Elogic_2E_3D, reserved_2Elogic_2E_3D_3D_3E, % 13.19/2.57 reserved_2Elogic_2E_5C_2F, reserved_2Elogic_2E_7E, reserved_2Equant_2E_21, % 13.19/2.57 reserved_2Equant_2E_3F, thm_2Ebool_2EEQ__CLAUSES, thm_2Ebool_2EFALSITY, % 13.19/2.57 thm_2Ebool_2EFORALL__SIMP, thm_2Ebool_2EIMP__CLAUSES, thm_2Ebool_2ENOT__CLAUSES, % 13.19/2.57 thm_2Ebool_2EREFL__CLAUSE, thm_2Ebool_2ETRUTH, thm_2Ecardinal_2ECARD__LE__TOTAL, % 13.19/2.57 thm_2Esat_2EAND__INV2, thm_2Esat_2EAND__INV__IMP, thm_2Esat_2ENOT__NOT, % 13.19/2.57 thm_2Esat_2EOR__DUAL2, thm_2Esat_2EOR__DUAL3, thm_2Esat_2Edc__eq, % 13.19/2.57 thm_2Esat_2Edc__neg % 13.19/2.57 % 13.19/2.57 Those formulas are unsatisfiable: % 13.19/2.57 --------------------------------- % 13.19/2.57 % 13.19/2.57 Begin of proof % 13.19/2.57 | % 13.19/2.58 | CLOSE: (thm_2Ecardinal_2ECARD__NOT__LE) is inconsistent. % 13.19/2.58 | % 13.19/2.58 End of proof % 13.19/2.58 % SZS output end Proof for theBenchmark % 13.19/2.58 % 13.19/2.58 1964ms %------------------------------------------------------------------------------