%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO246+3 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n022.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 : Wed Aug 30 23:22:43 EDT 2023 % Result : Theorem 9.22s 1.95s % Output : Proof 16.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO246+3 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n022.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Tue Aug 29 21:20:53 EDT 2023 % 0.13/0.34 % CPUTime : % 0.47/0.61 ________ _____ % 0.47/0.61 ___ __ \_________(_)________________________________ % 0.47/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.47/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.47/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.47/0.61 % 0.47/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.47/0.61 (2023-06-19) % 0.47/0.61 % 0.47/0.61 (c) Philipp Rümmer, 2009-2023 % 0.47/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.47/0.61 Amanda Stjerna. % 0.47/0.61 Free software under BSD-3-Clause. % 0.47/0.61 % 0.47/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.47/0.61 % 0.47/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.47/0.62 Running up to 7 provers in parallel. % 0.47/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.47/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.47/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.47/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.47/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.47/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.47/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.27/1.13 Prover 4: Preprocessing ... % 3.27/1.13 Prover 1: Preprocessing ... % 3.50/1.17 Prover 5: Preprocessing ... % 3.50/1.17 Prover 3: Preprocessing ... % 3.50/1.17 Prover 2: Preprocessing ... % 3.50/1.17 Prover 0: Preprocessing ... % 3.50/1.17 Prover 6: Preprocessing ... % 6.61/1.64 Prover 5: Proving ... % 7.19/1.68 Prover 2: Proving ... % 7.19/1.69 Prover 6: Constructing countermodel ... % 7.19/1.71 Prover 3: Constructing countermodel ... % 7.59/1.73 Prover 1: Constructing countermodel ... % 7.80/1.79 Prover 3: gave up % 7.80/1.81 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.80/1.82 Prover 6: gave up % 8.31/1.83 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.66/1.89 Prover 1: gave up % 8.66/1.90 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 8.66/1.92 Prover 7: Preprocessing ... % 8.66/1.92 Prover 8: Preprocessing ... % 9.22/1.95 Prover 2: proved (1327ms) % 9.22/1.95 % 9.22/1.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.22/1.95 % 9.22/1.97 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.39/1.98 Prover 5: stopped % 9.39/1.99 Prover 9: Preprocessing ... % 9.39/1.99 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.96/2.05 Prover 11: Preprocessing ... % 9.96/2.06 Prover 7: Warning: ignoring some quantifiers % 9.96/2.07 Prover 10: Preprocessing ... % 9.96/2.11 Prover 7: Constructing countermodel ... % 10.53/2.16 Prover 10: Warning: ignoring some quantifiers % 10.95/2.20 Prover 10: Constructing countermodel ... % 10.95/2.25 Prover 8: Warning: ignoring some quantifiers % 11.50/2.27 Prover 8: Constructing countermodel ... % 11.69/2.29 Prover 4: Constructing countermodel ... % 12.14/2.35 Prover 0: Proving ... % 12.14/2.37 Prover 0: stopped % 12.14/2.37 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.14/2.40 Prover 10: gave up % 12.14/2.41 Prover 13: Preprocessing ... % 12.72/2.42 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 12.72/2.42 Prover 8: gave up % 12.72/2.45 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 12.72/2.45 Prover 16: Preprocessing ... % 13.15/2.51 Prover 19: Preprocessing ... % 13.77/2.56 Prover 13: Warning: ignoring some quantifiers % 13.77/2.57 Prover 16: Warning: ignoring some quantifiers % 13.77/2.57 Prover 9: Constructing countermodel ... % 13.77/2.58 Prover 9: stopped % 13.97/2.58 Prover 16: Constructing countermodel ... % 13.97/2.60 Prover 13: Constructing countermodel ... % 13.97/2.62 Prover 11: Constructing countermodel ... % 14.37/2.66 Prover 19: Warning: ignoring some quantifiers % 14.37/2.68 Prover 19: Constructing countermodel ... % 15.53/2.85 Prover 11: Found proof (size 10) % 15.53/2.85 Prover 11: proved (862ms) % 15.53/2.85 Prover 16: gave up % 15.53/2.85 Prover 7: stopped % 15.53/2.85 Prover 4: stopped % 15.53/2.85 Prover 13: stopped % 15.53/2.85 Prover 19: stopped % 15.53/2.85 % 15.53/2.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.53/2.85 % 15.53/2.86 % SZS output start Proof for theBenchmark % 15.53/2.86 Assumptions after simplification: % 15.53/2.86 --------------------------------- % 15.53/2.86 % 15.53/2.86 (a2_defns) % 16.14/2.89 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 16.14/2.89 (left_apart_point(v0, v2) = v3) | ~ (reverse_line(v1) = v2) | ~ $i(v1) | % 16.14/2.89 ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & right_apart_point(v0, v1) = v4)) & % 16.14/2.89 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (right_apart_point(v0, % 16.14/2.89 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 16.14/2.89 = 0) & left_apart_point(v0, v3) = v4 & reverse_line(v1) = v3 & $i(v3))) % 16.14/2.89 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0) % 16.14/2.89 | ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0) | right_apart_point(v0, % 16.14/2.89 v1) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (right_apart_point(v0, v1) = 0) % 16.14/2.89 | ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : (left_apart_point(v0, v2) = 0 & % 16.14/2.89 reverse_line(v1) = v2 & $i(v2))) % 16.14/2.89 % 16.14/2.89 (ax10_basics) % 16.14/2.89 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0) | % 16.14/2.89 ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1: % 16.14/2.89 $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 16.14/2.89 % 16.14/2.89 (con) % 16.14/2.89 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 16.14/2.89 int] : ( ~ (v5 = 0) & line_connecting(v0, v2) = v4 & line_connecting(v0, v1) % 16.14/2.89 = v3 & distinct_points(v0, v1) = 0 & left_apart_point(v1, v4) = v5 & % 16.14/2.89 right_apart_point(v2, v3) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 16.14/2.89 % 16.14/2.89 Further assumptions not needed in the proof: % 16.14/2.89 -------------------------------------------- % 16.14/2.89 a1_defns, a3_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns, a9_defns, % 16.14/2.89 ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs, ax1_uniq_cons, % 16.14/2.89 ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, ax3_cons_objs, % 16.14/2.89 ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, ax5_cons_objs, % 16.14/2.89 ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics, ax8_cons_objs, % 16.14/2.89 ax9_basics, ax9_cons_objs % 16.14/2.89 % 16.14/2.89 Those formulas are unsatisfiable: % 16.14/2.89 --------------------------------- % 16.14/2.89 % 16.14/2.89 Begin of proof % 16.14/2.89 | % 16.14/2.89 | ALPHA: (a2_defns) implies: % 16.14/2.89 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (right_apart_point(v0, v1) = 0) | ~ % 16.14/2.89 | $i(v1) | ~ $i(v0) | ? [v2: $i] : (left_apart_point(v0, v2) = 0 & % 16.14/2.89 | reverse_line(v1) = v2 & $i(v2))) % 16.14/2.89 | % 16.14/2.89 | ALPHA: (ax10_basics) implies: % 16.14/2.89 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ % 16.14/2.89 | $i(v1) | ~ $i(v0)) % 16.14/2.89 | % 16.14/2.89 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2, % 16.14/2.89 | all_39_3, all_39_4, all_39_5 gives: % 16.14/2.90 | (3) ~ (all_39_0 = 0) & line_connecting(all_39_5, all_39_3) = all_39_1 & % 16.14/2.90 | line_connecting(all_39_5, all_39_4) = all_39_2 & % 16.14/2.90 | distinct_points(all_39_5, all_39_4) = 0 & left_apart_point(all_39_4, % 16.14/2.90 | all_39_1) = all_39_0 & right_apart_point(all_39_3, all_39_2) = 0 & % 16.14/2.90 | $i(all_39_1) & $i(all_39_2) & $i(all_39_3) & $i(all_39_4) & % 16.14/2.90 | $i(all_39_5) % 16.14/2.90 | % 16.14/2.90 | ALPHA: (3) implies: % 16.14/2.90 | (4) $i(all_39_3) % 16.14/2.90 | (5) $i(all_39_2) % 16.14/2.90 | (6) right_apart_point(all_39_3, all_39_2) = 0 % 16.14/2.90 | % 16.14/2.90 | GROUND_INST: instantiating (1) with all_39_3, all_39_2, simplifying with (4), % 16.14/2.90 | (5), (6) gives: % 16.14/2.90 | (7) ? [v0: $i] : (left_apart_point(all_39_3, v0) = 0 & % 16.14/2.90 | reverse_line(all_39_2) = v0 & $i(v0)) % 16.14/2.90 | % 16.14/2.90 | DELTA: instantiating (7) with fresh symbol all_47_0 gives: % 16.14/2.90 | (8) left_apart_point(all_39_3, all_47_0) = 0 & reverse_line(all_39_2) = % 16.14/2.90 | all_47_0 & $i(all_47_0) % 16.14/2.90 | % 16.14/2.90 | ALPHA: (8) implies: % 16.14/2.90 | (9) $i(all_47_0) % 16.14/2.90 | (10) left_apart_point(all_39_3, all_47_0) = 0 % 16.14/2.90 | % 16.14/2.90 | GROUND_INST: instantiating (2) with all_39_3, all_47_0, simplifying with (4), % 16.14/2.90 | (9), (10) gives: % 16.14/2.90 | (11) $false % 16.24/2.90 | % 16.24/2.90 | CLOSE: (11) is inconsistent. % 16.24/2.90 | % 16.24/2.90 End of proof % 16.24/2.90 % SZS output end Proof for theBenchmark % 16.24/2.90 % 16.24/2.90 2293ms %------------------------------------------------------------------------------