%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO247+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 : n014.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:44 EDT 2023 % Result : Theorem 8.67s 1.91s % Output : Proof 11.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : GEO247+3 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.36 % Computer : n014.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 300 % 0.14/0.36 % DateTime : Tue Aug 29 19:48:44 EDT 2023 % 0.14/0.36 % CPUTime : % 0.21/0.63 ________ _____ % 0.21/0.63 ___ __ \_________(_)________________________________ % 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.63 % 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.63 (2023-06-19) % 0.21/0.63 % 0.21/0.63 (c) Philipp Rümmer, 2009-2023 % 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.63 Amanda Stjerna. % 0.21/0.63 Free software under BSD-3-Clause. % 0.21/0.63 % 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.63 % 0.21/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.64 Running up to 7 provers in parallel. % 0.21/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.14/1.18 Prover 1: Preprocessing ... % 3.67/1.20 Prover 4: Preprocessing ... % 3.67/1.23 Prover 5: Preprocessing ... % 3.67/1.24 Prover 2: Preprocessing ... % 3.67/1.24 Prover 3: Preprocessing ... % 3.67/1.24 Prover 6: Preprocessing ... % 3.67/1.24 Prover 0: Preprocessing ... % 7.53/1.74 Prover 5: Proving ... % 7.78/1.80 Prover 2: Proving ... % 8.34/1.85 Prover 3: Constructing countermodel ... % 8.34/1.85 Prover 6: Constructing countermodel ... % 8.34/1.85 Prover 1: Constructing countermodel ... % 8.67/1.91 Prover 5: proved (1255ms) % 8.67/1.91 % 8.67/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.67/1.91 % 8.67/1.91 Prover 6: stopped % 8.67/1.92 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.67/1.94 Prover 2: stopped % 9.12/1.95 Prover 3: stopped % 9.12/1.95 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.26/1.96 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.26/1.97 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.68/2.02 Prover 7: Preprocessing ... % 9.68/2.04 Prover 1: Found proof (size 5) % 9.68/2.04 Prover 1: proved (1385ms) % 9.68/2.04 Prover 8: Preprocessing ... % 9.68/2.05 Prover 11: Preprocessing ... % 9.68/2.06 Prover 10: Preprocessing ... % 9.68/2.08 Prover 7: stopped % 9.68/2.09 Prover 10: stopped % 10.18/2.17 Prover 11: stopped % 10.18/2.19 Prover 4: Constructing countermodel ... % 10.18/2.21 Prover 8: Warning: ignoring some quantifiers % 10.18/2.22 Prover 4: stopped % 10.18/2.22 Prover 8: Constructing countermodel ... % 10.18/2.23 Prover 8: stopped % 11.18/2.27 Prover 0: Proving ... % 11.41/2.28 Prover 0: stopped % 11.41/2.28 % 11.41/2.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.41/2.28 % 11.41/2.29 % SZS output start Proof for theBenchmark % 11.41/2.29 Assumptions after simplification: % 11.41/2.29 --------------------------------- % 11.41/2.29 % 11.41/2.29 (ax10_basics) % 11.41/2.32 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0) | % 11.41/2.32 ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1: % 11.41/2.32 $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 11.41/2.32 % 11.41/2.32 (con) % 11.41/2.32 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 11.41/2.32 $i] : ? [v6: int] : ( ~ (v6 = 0) & convergent_lines(v4, v5) = v6 & % 11.41/2.32 left_apart_point(v3, v5) = 0 & left_apart_point(v2, v4) = 0 & % 11.41/2.32 left_apart_point(v0, v5) = 0 & left_apart_point(v0, v4) = 0 & % 11.41/2.32 right_apart_point(v3, v4) = 0 & right_apart_point(v2, v5) = 0 & % 11.41/2.32 right_apart_point(v1, v5) = 0 & right_apart_point(v1, v4) = 0 & $i(v5) & % 11.41/2.32 $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 11.41/2.32 % 11.41/2.32 Further assumptions not needed in the proof: % 11.41/2.32 -------------------------------------------- % 11.41/2.32 a1_defns, a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns, % 11.41/2.32 a9_defns, ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs, % 11.41/2.32 ax1_uniq_cons, ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, % 11.41/2.32 ax3_cons_objs, ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, % 11.41/2.32 ax5_cons_objs, ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics, % 11.41/2.32 ax8_cons_objs, ax9_basics, ax9_cons_objs % 11.41/2.32 % 11.41/2.32 Those formulas are unsatisfiable: % 11.41/2.32 --------------------------------- % 11.41/2.32 % 11.41/2.32 Begin of proof % 11.41/2.32 | % 11.41/2.32 | ALPHA: (ax10_basics) implies: % 11.41/2.32 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ % 11.41/2.32 | $i(v1) | ~ $i(v0)) % 11.41/2.32 | % 11.41/2.33 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2, % 11.41/2.33 | all_39_3, all_39_4, all_39_5, all_39_6 gives: % 11.41/2.33 | (2) ~ (all_39_0 = 0) & convergent_lines(all_39_2, all_39_1) = all_39_0 & % 11.41/2.33 | left_apart_point(all_39_3, all_39_1) = 0 & left_apart_point(all_39_4, % 11.41/2.33 | all_39_2) = 0 & left_apart_point(all_39_6, all_39_1) = 0 & % 11.41/2.33 | left_apart_point(all_39_6, all_39_2) = 0 & right_apart_point(all_39_3, % 11.41/2.33 | all_39_2) = 0 & right_apart_point(all_39_4, all_39_1) = 0 & % 11.41/2.33 | right_apart_point(all_39_5, all_39_1) = 0 & right_apart_point(all_39_5, % 11.41/2.33 | all_39_2) = 0 & $i(all_39_1) & $i(all_39_2) & $i(all_39_3) & % 11.41/2.33 | $i(all_39_4) & $i(all_39_5) & $i(all_39_6) % 11.41/2.33 | % 11.41/2.33 | ALPHA: (2) implies: % 11.41/2.33 | (3) $i(all_39_3) % 11.41/2.33 | (4) $i(all_39_1) % 11.41/2.33 | (5) left_apart_point(all_39_3, all_39_1) = 0 % 11.41/2.33 | % 11.41/2.33 | GROUND_INST: instantiating (1) with all_39_3, all_39_1, simplifying with (3), % 11.41/2.33 | (4), (5) gives: % 11.41/2.33 | (6) $false % 11.41/2.33 | % 11.41/2.33 | CLOSE: (6) is inconsistent. % 11.41/2.33 | % 11.41/2.33 End of proof % 11.41/2.33 % SZS output end Proof for theBenchmark % 11.41/2.33 % 11.41/2.33 1701ms %------------------------------------------------------------------------------