%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO256+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 : n004.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:48 EDT 2023 % Result : Theorem 7.60s 1.82s % Output : Proof 10.08s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GEO256+1 : TPTP v8.1.2. Bugfixed v6.4.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n004.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 21:53:37 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.61/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.61/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.61/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.61/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.61/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.61/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.61/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.99/1.10 Prover 4: Preprocessing ... % 2.99/1.10 Prover 1: Preprocessing ... % 3.47/1.17 Prover 3: Preprocessing ... % 3.47/1.17 Prover 5: Preprocessing ... % 3.47/1.17 Prover 0: Preprocessing ... % 3.47/1.17 Prover 6: Preprocessing ... % 3.47/1.17 Prover 2: Preprocessing ... % 6.48/1.64 Prover 5: Proving ... % 7.20/1.72 Prover 1: Constructing countermodel ... % 7.20/1.73 Prover 3: Constructing countermodel ... % 7.20/1.73 Prover 6: Constructing countermodel ... % 7.20/1.74 Prover 2: Proving ... % 7.60/1.82 Prover 5: proved (1173ms) % 7.60/1.82 % 7.60/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.60/1.82 % 7.60/1.82 Prover 3: stopped % 7.60/1.82 Prover 2: stopped % 7.60/1.83 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.60/1.83 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.60/1.83 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.60/1.83 Prover 6: stopped % 7.60/1.84 Prover 1: Found proof (size 5) % 7.60/1.84 Prover 1: proved (1208ms) % 7.60/1.84 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.48/1.91 Prover 8: Preprocessing ... % 8.48/1.91 Prover 10: Preprocessing ... % 8.48/1.92 Prover 7: Preprocessing ... % 8.48/1.92 Prover 11: Preprocessing ... % 8.48/1.96 Prover 10: stopped % 8.48/1.97 Prover 7: stopped % 9.54/2.03 Prover 11: stopped % 9.54/2.05 Prover 8: Warning: ignoring some quantifiers % 9.54/2.05 Prover 4: Constructing countermodel ... % 9.54/2.06 Prover 8: Constructing countermodel ... % 9.54/2.07 Prover 4: stopped % 9.54/2.07 Prover 8: stopped % 10.08/2.12 Prover 0: Proving ... % 10.08/2.13 Prover 0: stopped % 10.08/2.13 % 10.08/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.08/2.13 % 10.08/2.13 % SZS output start Proof for theBenchmark % 10.08/2.14 Assumptions after simplification: % 10.08/2.14 --------------------------------- % 10.08/2.14 % 10.08/2.14 (con) % 10.08/2.16 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 10.08/2.16 int] : ? [v6: int] : ? [v7: int] : ( ~ (v7 = 0) & ~ (v6 = 0) & ~ (v5 = % 10.08/2.16 0) & before_on_line(v0, v3, v2) = v7 & before_on_line(v0, v1, v3) = v6 & % 10.08/2.16 before_on_line(v0, v1, v2) = 0 & distinct_points(v2, v3) = 0 & % 10.08/2.16 distinct_points(v1, v3) = 0 & apart_point_and_line(v3, v0) = v5 & % 10.08/2.16 left_apart_point(v4, v0) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 10.08/2.16 % 10.08/2.16 (oag10) % 10.08/2.16 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 10.08/2.16 (left_apart_point(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! % 10.08/2.16 [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 10.08/2.16 % 10.08/2.16 Further assumptions not needed in the proof: % 10.08/2.16 -------------------------------------------- % 10.08/2.16 apt_def, bet_def, bf_def, con_def, div_def, oag1, oag11, oag2, oag3, oag4, oag5, % 10.08/2.16 oag6, oag7, oag8, oag9, oagco1, oagco10, oagco2, oagco3, oagco4, oagco5, oagco6, % 10.08/2.16 oagco7, oagco8, oagco9, oagsub1, oagsub2, oagsub3, oaguc1, oaguc2 % 10.08/2.16 % 10.08/2.16 Those formulas are unsatisfiable: % 10.08/2.16 --------------------------------- % 10.08/2.16 % 10.08/2.16 Begin of proof % 10.08/2.16 | % 10.08/2.17 | ALPHA: (oag10) implies: % 10.08/2.17 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ % 10.08/2.17 | $i(v1) | ~ $i(v0)) % 10.08/2.17 | % 10.08/2.17 | DELTA: instantiating (con) with fresh symbols all_34_0, all_34_1, all_34_2, % 10.08/2.17 | all_34_3, all_34_4, all_34_5, all_34_6, all_34_7 gives: % 10.08/2.17 | (2) ~ (all_34_0 = 0) & ~ (all_34_1 = 0) & ~ (all_34_2 = 0) & % 10.08/2.17 | before_on_line(all_34_7, all_34_4, all_34_5) = all_34_0 & % 10.08/2.17 | before_on_line(all_34_7, all_34_6, all_34_4) = all_34_1 & % 10.08/2.17 | before_on_line(all_34_7, all_34_6, all_34_5) = 0 & % 10.08/2.17 | distinct_points(all_34_5, all_34_4) = 0 & distinct_points(all_34_6, % 10.08/2.17 | all_34_4) = 0 & apart_point_and_line(all_34_4, all_34_7) = all_34_2 & % 10.08/2.17 | left_apart_point(all_34_3, all_34_7) = 0 & $i(all_34_3) & $i(all_34_4) % 10.08/2.17 | & $i(all_34_5) & $i(all_34_6) & $i(all_34_7) % 10.08/2.17 | % 10.08/2.17 | ALPHA: (2) implies: % 10.08/2.17 | (3) $i(all_34_7) % 10.08/2.17 | (4) $i(all_34_3) % 10.08/2.17 | (5) left_apart_point(all_34_3, all_34_7) = 0 % 10.08/2.17 | % 10.08/2.17 | GROUND_INST: instantiating (1) with all_34_3, all_34_7, simplifying with (3), % 10.08/2.17 | (4), (5) gives: % 10.08/2.17 | (6) $false % 10.08/2.17 | % 10.08/2.17 | CLOSE: (6) is inconsistent. % 10.08/2.17 | % 10.08/2.17 End of proof % 10.08/2.17 % SZS output end Proof for theBenchmark % 10.08/2.18 % 10.08/2.18 1560ms %------------------------------------------------------------------------------