%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO242+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 : n028.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:41 EDT 2023 % Result : Theorem 9.35s 1.97s % Output : Proof 15.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO242+3 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n028.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 22:44:56 EDT 2023 % 0.13/0.33 % CPUTime : % 0.19/0.58 ________ _____ % 0.19/0.58 ___ __ \_________(_)________________________________ % 0.19/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.58 (2023-06-19) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2023 % 0.19/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.58 Amanda Stjerna. % 0.19/0.58 Free software under BSD-3-Clause. % 0.19/0.58 % 0.19/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.59 Running up to 7 provers in parallel. % 0.19/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.88/1.14 Prover 1: Preprocessing ... % 2.88/1.14 Prover 4: Preprocessing ... % 3.57/1.18 Prover 6: Preprocessing ... % 3.57/1.18 Prover 5: Preprocessing ... % 3.57/1.18 Prover 3: Preprocessing ... % 3.57/1.18 Prover 0: Preprocessing ... % 3.57/1.18 Prover 2: Preprocessing ... % 7.27/1.72 Prover 5: Proving ... % 7.27/1.74 Prover 6: Constructing countermodel ... % 7.95/1.77 Prover 2: Proving ... % 7.95/1.78 Prover 3: Constructing countermodel ... % 8.08/1.81 Prover 1: Constructing countermodel ... % 8.08/1.87 Prover 3: gave up % 8.48/1.88 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.48/1.88 Prover 6: gave up % 8.75/1.91 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.75/1.95 Prover 1: gave up % 8.75/1.95 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 8.75/1.95 Prover 7: Preprocessing ... % 9.35/1.97 Prover 2: proved (1363ms) % 9.35/1.97 % 9.35/1.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.35/1.97 % 9.35/1.98 Prover 5: stopped % 9.35/1.98 Prover 8: Preprocessing ... % 9.35/1.98 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.44/1.98 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.44/2.00 Prover 9: Preprocessing ... % 9.79/2.03 Prover 11: Preprocessing ... % 9.79/2.05 Prover 10: Preprocessing ... % 9.79/2.07 Prover 7: Warning: ignoring some quantifiers % 10.48/2.13 Prover 7: Constructing countermodel ... % 10.48/2.16 Prover 10: Warning: ignoring some quantifiers % 10.48/2.18 Prover 4: Constructing countermodel ... % 11.02/2.20 Prover 10: Constructing countermodel ... % 11.02/2.22 Prover 8: Warning: ignoring some quantifiers % 11.02/2.25 Prover 8: Constructing countermodel ... % 11.66/2.27 Prover 0: Proving ... % 11.75/2.29 Prover 0: stopped % 11.75/2.29 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 11.96/2.36 Prover 13: Preprocessing ... % 12.35/2.40 Prover 10: gave up % 12.35/2.40 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 12.35/2.43 Prover 8: gave up % 12.35/2.44 Prover 16: Preprocessing ... % 12.35/2.45 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 13.26/2.50 Prover 19: Preprocessing ... % 13.26/2.52 Prover 13: Warning: ignoring some quantifiers % 13.26/2.54 Prover 13: Constructing countermodel ... % 13.26/2.55 Prover 16: Warning: ignoring some quantifiers % 13.90/2.58 Prover 16: Constructing countermodel ... % 13.90/2.59 Prover 9: Constructing countermodel ... % 13.90/2.60 Prover 9: stopped % 14.21/2.62 Prover 7: gave up % 14.43/2.64 Prover 11: Constructing countermodel ... % 14.43/2.66 Prover 19: Warning: ignoring some quantifiers % 14.43/2.68 Prover 19: Constructing countermodel ... % 15.12/2.78 Prover 4: Found proof (size 10) % 15.12/2.78 Prover 4: proved (2168ms) % 15.12/2.78 Prover 19: stopped % 15.12/2.78 Prover 11: stopped % 15.12/2.78 Prover 16: stopped % 15.12/2.78 Prover 13: stopped % 15.12/2.78 % 15.12/2.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.12/2.78 % 15.12/2.78 % SZS output start Proof for theBenchmark % 15.59/2.79 Assumptions after simplification: % 15.59/2.79 --------------------------------- % 15.59/2.79 % 15.59/2.79 (a3_defns) % 15.59/2.81 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 15.59/2.81 (left_convergent_lines(v0, v2) = v3) | ~ (reverse_line(v1) = v2) | ~ % 15.59/2.81 $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & % 15.59/2.81 right_convergent_lines(v0, v1) = v4)) & ! [v0: $i] : ! [v1: $i] : ! % 15.59/2.81 [v2: int] : (v2 = 0 | ~ (right_convergent_lines(v0, v1) = v2) | ~ $i(v1) | % 15.59/2.81 ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & % 15.59/2.81 left_convergent_lines(v0, v3) = v4 & reverse_line(v1) = v3 & $i(v3))) & ! % 15.59/2.81 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_convergent_lines(v0, v2) = 0) % 15.59/2.81 | ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0) | % 15.59/2.81 right_convergent_lines(v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ % 15.59/2.81 (right_convergent_lines(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : % 15.59/2.81 (left_convergent_lines(v0, v2) = 0 & reverse_line(v1) = v2 & $i(v2))) % 15.59/2.82 % 15.59/2.82 (ax11_basics) % 15.59/2.82 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_convergent_lines(v0, v2) = % 15.59/2.82 0) | ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : % 15.59/2.82 ! [v1: $i] : ( ~ (left_convergent_lines(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 15.59/2.82 % 15.59/2.82 (con) % 15.59/2.82 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 15.59/2.82 = 0) & line_connecting(v0, v1) = v3 & distinct_points(v0, v1) = 0 & % 15.59/2.82 incident_point_and_line(v0, v2) = 0 & right_convergent_lines(v2, v3) = 0 & % 15.59/2.82 right_apart_point(v1, v2) = v4 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 15.59/2.82 % 15.59/2.82 Further assumptions not needed in the proof: % 15.59/2.82 -------------------------------------------- % 15.59/2.82 a1_defns, a2_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns, a9_defns, % 15.59/2.82 ax10_basics, ax10_cons_objs, ax1_basics, ax1_cons_objs, ax1_subs, ax1_uniq_cons, % 15.59/2.82 ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, ax3_cons_objs, % 15.59/2.82 ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, ax5_cons_objs, % 15.59/2.82 ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics, ax8_cons_objs, % 15.59/2.82 ax9_basics, ax9_cons_objs % 15.59/2.82 % 15.59/2.82 Those formulas are unsatisfiable: % 15.59/2.82 --------------------------------- % 15.59/2.82 % 15.59/2.82 Begin of proof % 15.59/2.82 | % 15.59/2.82 | ALPHA: (a3_defns) implies: % 15.59/2.82 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (right_convergent_lines(v0, v1) = 0) | % 15.59/2.82 | ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : (left_convergent_lines(v0, v2) = % 15.59/2.82 | 0 & reverse_line(v1) = v2 & $i(v2))) % 15.59/2.82 | % 15.59/2.82 | ALPHA: (ax11_basics) implies: % 15.59/2.82 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (left_convergent_lines(v0, v1) = 0) | % 15.59/2.82 | ~ $i(v1) | ~ $i(v0)) % 15.59/2.82 | % 15.59/2.82 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2, % 15.59/2.82 | all_39_3, all_39_4 gives: % 15.59/2.83 | (3) ~ (all_39_0 = 0) & line_connecting(all_39_4, all_39_3) = all_39_1 & % 15.59/2.83 | distinct_points(all_39_4, all_39_3) = 0 & % 15.59/2.83 | incident_point_and_line(all_39_4, all_39_2) = 0 & % 15.59/2.83 | right_convergent_lines(all_39_2, all_39_1) = 0 & % 15.59/2.83 | right_apart_point(all_39_3, all_39_2) = all_39_0 & $i(all_39_1) & % 15.59/2.83 | $i(all_39_2) & $i(all_39_3) & $i(all_39_4) % 15.59/2.83 | % 15.59/2.83 | ALPHA: (3) implies: % 15.59/2.83 | (4) $i(all_39_2) % 15.59/2.83 | (5) $i(all_39_1) % 15.59/2.83 | (6) right_convergent_lines(all_39_2, all_39_1) = 0 % 15.59/2.83 | % 15.59/2.83 | GROUND_INST: instantiating (1) with all_39_2, all_39_1, simplifying with (4), % 15.59/2.83 | (5), (6) gives: % 15.59/2.83 | (7) ? [v0: $i] : (left_convergent_lines(all_39_2, v0) = 0 & % 15.59/2.83 | reverse_line(all_39_1) = v0 & $i(v0)) % 15.59/2.83 | % 15.59/2.83 | DELTA: instantiating (7) with fresh symbol all_46_0 gives: % 15.59/2.83 | (8) left_convergent_lines(all_39_2, all_46_0) = 0 & reverse_line(all_39_1) % 15.59/2.83 | = all_46_0 & $i(all_46_0) % 15.59/2.83 | % 15.59/2.83 | ALPHA: (8) implies: % 15.59/2.83 | (9) $i(all_46_0) % 15.59/2.83 | (10) left_convergent_lines(all_39_2, all_46_0) = 0 % 15.59/2.83 | % 15.59/2.83 | GROUND_INST: instantiating (2) with all_39_2, all_46_0, simplifying with (4), % 15.59/2.83 | (9), (10) gives: % 15.59/2.83 | (11) $false % 15.59/2.83 | % 15.59/2.83 | CLOSE: (11) is inconsistent. % 15.59/2.83 | % 15.59/2.83 End of proof % 15.59/2.83 % SZS output end Proof for theBenchmark % 15.59/2.83 % 15.59/2.83 2248ms %------------------------------------------------------------------------------