%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO243+1 : TPTP v8.1.2. Bugfixed v6.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n007.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.09s 1.89s % Output : Proof 11.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GEO243+1 : TPTP v8.1.2. Bugfixed v6.4.0. % 0.08/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n007.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Tue Aug 29 23:31:59 EDT 2023 % 0.14/0.35 % CPUTime : % 0.63/0.67 ________ _____ % 0.63/0.67 ___ __ \_________(_)________________________________ % 0.63/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.63/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.63/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.63/0.67 % 0.63/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.63/0.67 (2023-06-19) % 0.63/0.67 % 0.63/0.67 (c) Philipp Rümmer, 2009-2023 % 0.63/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.63/0.67 Amanda Stjerna. % 0.63/0.67 Free software under BSD-3-Clause. % 0.63/0.67 % 0.63/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.63/0.67 % 0.63/0.68 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.63/0.69 Running up to 7 provers in parallel. % 0.63/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.63/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.63/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.63/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.63/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.63/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.63/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.52/1.23 Prover 1: Preprocessing ... % 3.52/1.23 Prover 4: Preprocessing ... % 3.76/1.27 Prover 2: Preprocessing ... % 3.76/1.27 Prover 6: Preprocessing ... % 3.76/1.27 Prover 5: Preprocessing ... % 3.76/1.27 Prover 3: Preprocessing ... % 3.76/1.27 Prover 0: Preprocessing ... % 6.69/1.69 Prover 5: Proving ... % 7.58/1.80 Prover 2: Proving ... % 7.58/1.80 Prover 1: Constructing countermodel ... % 7.58/1.80 Prover 3: Constructing countermodel ... % 7.89/1.82 Prover 6: Constructing countermodel ... % 8.09/1.89 Prover 5: proved (1193ms) % 8.09/1.89 % 8.09/1.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.09/1.89 % 8.09/1.89 Prover 3: stopped % 8.09/1.90 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.09/1.90 Prover 6: stopped % 8.09/1.90 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.09/1.90 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.09/1.91 Prover 2: stopped % 8.09/1.91 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.09/2.02 Prover 8: Preprocessing ... % 9.09/2.02 Prover 10: Preprocessing ... % 9.09/2.02 Prover 7: Preprocessing ... % 9.09/2.03 Prover 11: Preprocessing ... % 9.09/2.03 Prover 1: Found proof (size 5) % 9.09/2.03 Prover 1: proved (1338ms) % 9.09/2.05 Prover 10: stopped % 9.80/2.07 Prover 7: stopped % 10.12/2.13 Prover 11: stopped % 10.32/2.15 Prover 8: Warning: ignoring some quantifiers % 10.32/2.17 Prover 8: Constructing countermodel ... % 10.32/2.18 Prover 8: stopped % 10.32/2.19 Prover 4: Constructing countermodel ... % 10.32/2.22 Prover 4: stopped % 10.86/2.24 Prover 0: Proving ... % 10.86/2.24 Prover 0: stopped % 10.86/2.24 % 10.86/2.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.86/2.24 % 10.86/2.25 % SZS output start Proof for theBenchmark % 10.86/2.25 Assumptions after simplification: % 10.86/2.25 --------------------------------- % 10.86/2.25 % 10.86/2.25 (con) % 10.86/2.28 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 10.86/2.28 $i] : ? [v6: int] : ( ~ (v6 = 0) & line_connecting(v1, v0) = v4 & % 10.86/2.28 line_connecting(v0, v1) = v3 & distinct_points(v0, v1) = 0 & % 10.86/2.28 reverse_line(v4) = v5 & left_apart_point(v2, v5) = v6 & left_apart_point(v2, % 10.86/2.28 v3) = 0 & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 10.86/2.28 % 10.86/2.28 (oag10) % 10.86/2.29 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 10.86/2.29 (left_apart_point(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! % 10.86/2.29 [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 10.86/2.29 % 10.86/2.29 Further assumptions not needed in the proof: % 10.86/2.29 -------------------------------------------- % 10.86/2.29 apt_def, bet_def, bf_def, con_def, div_def, oag1, oag11, oag2, oag3, oag4, oag5, % 10.86/2.29 oag6, oag7, oag8, oag9, oagco1, oagco10, oagco2, oagco3, oagco4, oagco5, oagco6, % 10.86/2.29 oagco7, oagco8, oagco9, oagsub1, oagsub2, oagsub3, oaguc1, oaguc2 % 10.86/2.29 % 10.86/2.29 Those formulas are unsatisfiable: % 10.86/2.29 --------------------------------- % 10.86/2.29 % 10.86/2.29 Begin of proof % 10.86/2.29 | % 10.86/2.29 | ALPHA: (oag10) implies: % 10.86/2.29 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ % 10.86/2.29 | $i(v1) | ~ $i(v0)) % 10.86/2.29 | % 11.19/2.29 | DELTA: instantiating (con) with fresh symbols all_34_0, all_34_1, all_34_2, % 11.19/2.29 | all_34_3, all_34_4, all_34_5, all_34_6 gives: % 11.19/2.30 | (2) ~ (all_34_0 = 0) & line_connecting(all_34_5, all_34_6) = all_34_2 & % 11.19/2.30 | line_connecting(all_34_6, all_34_5) = all_34_3 & % 11.19/2.30 | distinct_points(all_34_6, all_34_5) = 0 & reverse_line(all_34_2) = % 11.19/2.30 | all_34_1 & left_apart_point(all_34_4, all_34_1) = all_34_0 & % 11.19/2.30 | left_apart_point(all_34_4, all_34_3) = 0 & $i(all_34_1) & $i(all_34_2) % 11.19/2.30 | & $i(all_34_3) & $i(all_34_4) & $i(all_34_5) & $i(all_34_6) % 11.19/2.30 | % 11.19/2.30 | ALPHA: (2) implies: % 11.19/2.30 | (3) $i(all_34_4) % 11.19/2.30 | (4) $i(all_34_3) % 11.19/2.30 | (5) left_apart_point(all_34_4, all_34_3) = 0 % 11.19/2.30 | % 11.19/2.30 | GROUND_INST: instantiating (1) with all_34_4, all_34_3, simplifying with (3), % 11.19/2.30 | (4), (5) gives: % 11.19/2.30 | (6) $false % 11.19/2.30 | % 11.19/2.30 | CLOSE: (6) is inconsistent. % 11.19/2.30 | % 11.19/2.30 End of proof % 11.19/2.30 % SZS output end Proof for theBenchmark % 11.19/2.30 % 11.19/2.30 1626ms %------------------------------------------------------------------------------