%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO243+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 : n013.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:42 EDT 2023 % Result : Theorem 8.14s 1.85s % Output : Proof 10.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GEO243+3 : TPTP v8.1.2. Released v4.0.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n013.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Tue Aug 29 23:51:16 EDT 2023 % 0.14/0.35 % CPUTime : % 0.69/0.66 ________ _____ % 0.69/0.66 ___ __ \_________(_)________________________________ % 0.69/0.66 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.69/0.66 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.69/0.66 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.69/0.66 % 0.69/0.66 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.69/0.66 (2023-06-19) % 0.69/0.66 % 0.69/0.66 (c) Philipp Rümmer, 2009-2023 % 0.69/0.66 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.69/0.66 Amanda Stjerna. % 0.69/0.66 Free software under BSD-3-Clause. % 0.69/0.66 % 0.69/0.66 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.69/0.66 % 0.69/0.66 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.69/0.67 Running up to 7 provers in parallel. % 0.69/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.69/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.69/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.69/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.69/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.69/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.69/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.29/1.19 Prover 4: Preprocessing ... % 3.29/1.19 Prover 1: Preprocessing ... % 3.29/1.24 Prover 3: Preprocessing ... % 3.29/1.24 Prover 5: Preprocessing ... % 3.29/1.24 Prover 6: Preprocessing ... % 3.29/1.24 Prover 0: Preprocessing ... % 3.29/1.24 Prover 2: Preprocessing ... % 7.57/1.72 Prover 5: Proving ... % 7.57/1.73 Prover 2: Proving ... % 8.14/1.79 Prover 3: Constructing countermodel ... % 8.14/1.80 Prover 6: Constructing countermodel ... % 8.14/1.82 Prover 1: Constructing countermodel ... % 8.14/1.85 Prover 3: proved (1170ms) % 8.14/1.85 % 8.14/1.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.14/1.85 % 8.14/1.85 Prover 6: stopped % 8.14/1.85 Prover 2: stopped % 8.14/1.86 Prover 5: stopped % 8.14/1.87 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.14/1.87 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.14/1.87 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.14/1.87 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.76/1.93 Prover 1: Found proof (size 5) % 8.76/1.93 Prover 1: proved (1246ms) % 8.76/1.94 Prover 8: Preprocessing ... % 9.22/1.95 Prover 7: Preprocessing ... % 9.22/1.95 Prover 11: Preprocessing ... % 9.22/1.96 Prover 10: Preprocessing ... % 9.54/1.98 Prover 7: stopped % 9.54/1.99 Prover 10: stopped % 9.89/2.07 Prover 11: stopped % 9.89/2.09 Prover 4: Constructing countermodel ... % 9.89/2.10 Prover 8: Warning: ignoring some quantifiers % 9.89/2.11 Prover 8: Constructing countermodel ... % 10.52/2.11 Prover 4: stopped % 10.52/2.12 Prover 8: stopped % 10.52/2.16 Prover 0: Proving ... % 10.52/2.16 Prover 0: stopped % 10.52/2.17 % 10.52/2.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.52/2.17 % 10.52/2.17 % SZS output start Proof for theBenchmark % 10.52/2.17 Assumptions after simplification: % 10.52/2.17 --------------------------------- % 10.52/2.17 % 10.52/2.17 (ax10_basics) % 10.87/2.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0) | % 10.87/2.20 ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1: % 10.87/2.20 $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 10.87/2.20 % 10.87/2.20 (con) % 10.87/2.20 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 10.87/2.20 int] : ( ~ (v5 = 0) & line_connecting(v1, v0) = v4 & line_connecting(v0, v1) % 10.87/2.20 = v3 & distinct_points(v0, v1) = 0 & left_apart_point(v2, v3) = 0 & % 10.87/2.20 right_apart_point(v2, v4) = v5 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 10.87/2.20 % 10.87/2.20 Further assumptions not needed in the proof: % 10.87/2.20 -------------------------------------------- % 10.87/2.20 a1_defns, a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns, % 10.87/2.21 a9_defns, ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs, % 10.87/2.21 ax1_uniq_cons, ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, % 10.87/2.21 ax3_cons_objs, ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, % 10.87/2.21 ax5_cons_objs, ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics, % 10.87/2.21 ax8_cons_objs, ax9_basics, ax9_cons_objs % 10.87/2.21 % 10.87/2.21 Those formulas are unsatisfiable: % 10.87/2.21 --------------------------------- % 10.87/2.21 % 10.87/2.21 Begin of proof % 10.87/2.21 | % 10.87/2.21 | ALPHA: (ax10_basics) implies: % 10.87/2.21 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ % 10.87/2.21 | $i(v1) | ~ $i(v0)) % 10.87/2.21 | % 10.87/2.21 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2, % 10.87/2.21 | all_39_3, all_39_4, all_39_5 gives: % 10.87/2.21 | (2) ~ (all_39_0 = 0) & line_connecting(all_39_4, all_39_5) = all_39_1 & % 10.87/2.21 | line_connecting(all_39_5, all_39_4) = all_39_2 & % 10.87/2.21 | distinct_points(all_39_5, all_39_4) = 0 & left_apart_point(all_39_3, % 10.87/2.21 | all_39_2) = 0 & right_apart_point(all_39_3, all_39_1) = all_39_0 & % 10.87/2.21 | $i(all_39_1) & $i(all_39_2) & $i(all_39_3) & $i(all_39_4) & % 10.87/2.21 | $i(all_39_5) % 10.87/2.21 | % 10.87/2.21 | ALPHA: (2) implies: % 10.87/2.21 | (3) $i(all_39_3) % 10.87/2.21 | (4) $i(all_39_2) % 10.87/2.21 | (5) left_apart_point(all_39_3, all_39_2) = 0 % 10.87/2.21 | % 10.87/2.21 | GROUND_INST: instantiating (1) with all_39_3, all_39_2, simplifying with (3), % 10.87/2.21 | (4), (5) gives: % 10.87/2.22 | (6) $false % 10.87/2.22 | % 10.87/2.22 | CLOSE: (6) is inconsistent. % 10.87/2.22 | % 10.87/2.22 End of proof % 10.87/2.22 % SZS output end Proof for theBenchmark % 10.87/2.22 % 10.87/2.22 1554ms %------------------------------------------------------------------------------