%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO171+2 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n023.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:21:49 EDT 2023 % Result : Theorem 5.05s 1.43s % Output : Proof 6.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : GEO171+2 : TPTP v8.1.2. Released v3.3.0. % 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n023.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Tue Aug 29 19:12:10 EDT 2023 % 0.12/0.33 % CPUTime : % 0.46/0.59 ________ _____ % 0.46/0.59 ___ __ \_________(_)________________________________ % 0.46/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.46/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.46/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.46/0.59 % 0.46/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.46/0.59 (2023-06-19) % 0.46/0.59 % 0.46/0.59 (c) Philipp Rümmer, 2009-2023 % 0.46/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.46/0.59 Amanda Stjerna. % 0.46/0.59 Free software under BSD-3-Clause. % 0.46/0.59 % 0.46/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.46/0.59 % 0.46/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.46/0.61 Running up to 7 provers in parallel. % 0.46/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.46/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.46/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.46/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.46/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.46/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.46/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.14/1.05 Prover 1: Preprocessing ... % 2.14/1.05 Prover 4: Preprocessing ... % 2.74/1.09 Prover 2: Preprocessing ... % 2.74/1.09 Prover 6: Preprocessing ... % 2.74/1.09 Prover 3: Preprocessing ... % 2.74/1.09 Prover 0: Preprocessing ... % 2.74/1.09 Prover 5: Preprocessing ... % 4.16/1.32 Prover 6: Constructing countermodel ... % 4.16/1.34 Prover 5: Proving ... % 4.16/1.34 Prover 2: Proving ... % 4.16/1.34 Prover 1: Constructing countermodel ... % 4.16/1.34 Prover 3: Constructing countermodel ... % 5.05/1.42 Prover 4: Constructing countermodel ... % 5.05/1.43 Prover 2: proved (814ms) % 5.05/1.43 % 5.05/1.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.05/1.43 % 5.05/1.43 Prover 5: proved (814ms) % 5.05/1.43 % 5.05/1.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.05/1.43 % 5.05/1.43 Prover 6: stopped % 5.05/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.05/1.44 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.05/1.44 Prover 3: proved (817ms) % 5.05/1.44 % 5.26/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.26/1.45 % 5.26/1.47 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.26/1.47 Prover 0: Proving ... % 5.26/1.47 Prover 0: stopped % 5.26/1.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.26/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.26/1.48 Prover 8: Preprocessing ... % 5.26/1.49 Prover 7: Preprocessing ... % 5.26/1.49 Prover 1: Found proof (size 7) % 5.26/1.49 Prover 1: proved (878ms) % 5.26/1.49 Prover 4: stopped % 5.26/1.49 Prover 10: Preprocessing ... % 5.26/1.50 Prover 11: Preprocessing ... % 5.26/1.51 Prover 7: stopped % 5.26/1.51 Prover 10: stopped % 5.26/1.51 Prover 13: Preprocessing ... % 5.26/1.52 Prover 13: stopped % 5.87/1.55 Prover 11: stopped % 5.87/1.55 Prover 8: Warning: ignoring some quantifiers % 5.87/1.56 Prover 8: Constructing countermodel ... % 5.87/1.56 Prover 8: stopped % 5.87/1.56 % 5.87/1.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.87/1.56 % 5.87/1.56 % SZS output start Proof for theBenchmark % 5.87/1.57 Assumptions after simplification: % 5.87/1.57 --------------------------------- % 5.87/1.57 % 5.87/1.57 (ceq3) % 6.17/1.59 ! [v0: $i] : ! [v1: $i] : ( ~ (convergent_lines(v0, v1) = 0) | ~ $i(v1) | % 6.17/1.59 ~ $i(v0) | distinct_lines(v0, v1) = 0) % 6.17/1.59 % 6.17/1.59 (con) % 6.17/1.59 ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & convergent_lines(v0, % 6.17/1.60 v1) = 0 & distinct_lines(v0, v1) = v2 & $i(v1) & $i(v0)) % 6.17/1.60 % 6.17/1.60 (function-axioms) % 6.17/1.60 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.17/1.60 (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) & % 6.17/1.60 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.17/1.60 (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & ! % 6.17/1.60 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.17/1.60 $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 6.17/1.60 (apart_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.17/1.60 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.17/1.60 (convergent_lines(v3, v2) = v1) | ~ (convergent_lines(v3, v2) = v0)) & ! % 6.17/1.60 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.17/1.60 $i] : (v1 = v0 | ~ (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, % 6.17/1.60 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 6.17/1.60 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ % 6.17/1.60 (distinct_points(v3, v2) = v0)) % 6.17/1.60 % 6.17/1.60 Further assumptions not needed in the proof: % 6.17/1.60 -------------------------------------------- % 6.17/1.60 apart1, apart2, apart3, apart4, apart5, apart6, ceq1, ceq2, con1, con2, cu1 % 6.17/1.60 % 6.17/1.60 Those formulas are unsatisfiable: % 6.17/1.60 --------------------------------- % 6.17/1.60 % 6.17/1.60 Begin of proof % 6.17/1.60 | % 6.17/1.60 | ALPHA: (function-axioms) implies: % 6.17/1.61 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.17/1.61 | ! [v3: $i] : (v1 = v0 | ~ (distinct_lines(v3, v2) = v1) | ~ % 6.17/1.61 | (distinct_lines(v3, v2) = v0)) % 6.17/1.61 | % 6.17/1.61 | DELTA: instantiating (con) with fresh symbols all_15_0, all_15_1, all_15_2 % 6.17/1.61 | gives: % 6.17/1.61 | (2) ~ (all_15_0 = 0) & convergent_lines(all_15_2, all_15_1) = 0 & % 6.17/1.61 | distinct_lines(all_15_2, all_15_1) = all_15_0 & $i(all_15_1) & % 6.17/1.61 | $i(all_15_2) % 6.17/1.61 | % 6.17/1.61 | ALPHA: (2) implies: % 6.17/1.61 | (3) ~ (all_15_0 = 0) % 6.17/1.61 | (4) $i(all_15_2) % 6.17/1.61 | (5) $i(all_15_1) % 6.17/1.61 | (6) distinct_lines(all_15_2, all_15_1) = all_15_0 % 6.17/1.61 | (7) convergent_lines(all_15_2, all_15_1) = 0 % 6.17/1.61 | % 6.17/1.61 | GROUND_INST: instantiating (ceq3) with all_15_2, all_15_1, simplifying with % 6.17/1.61 | (4), (5), (7) gives: % 6.17/1.61 | (8) distinct_lines(all_15_2, all_15_1) = 0 % 6.17/1.61 | % 6.17/1.61 | GROUND_INST: instantiating (1) with all_15_0, 0, all_15_1, all_15_2, % 6.17/1.61 | simplifying with (6), (8) gives: % 6.17/1.61 | (9) all_15_0 = 0 % 6.17/1.61 | % 6.17/1.61 | REDUCE: (3), (9) imply: % 6.17/1.62 | (10) $false % 6.17/1.62 | % 6.17/1.62 | CLOSE: (10) is inconsistent. % 6.17/1.62 | % 6.17/1.62 End of proof % 6.17/1.62 % SZS output end Proof for theBenchmark % 6.17/1.62 % 6.17/1.62 1023ms %------------------------------------------------------------------------------