%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO209+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n020.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:20 EDT 2023 % Result : Theorem 5.77s 1.59s % Output : Proof 7.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : GEO209+1 : TPTP v8.1.2. Released v3.3.0. % 0.08/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n020.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Wed Aug 30 00:02:28 EDT 2023 % 0.13/0.34 % CPUTime : % 0.62/0.67 ________ _____ % 0.62/0.67 ___ __ \_________(_)________________________________ % 0.62/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.62/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.62/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.62/0.67 % 0.62/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.62/0.67 (2023-06-19) % 0.62/0.67 % 0.62/0.67 (c) Philipp Rümmer, 2009-2023 % 0.62/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.62/0.67 Amanda Stjerna. % 0.62/0.67 Free software under BSD-3-Clause. % 0.62/0.67 % 0.62/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.62/0.67 % 0.62/0.67 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.62/0.68 Running up to 7 provers in parallel. % 0.62/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.62/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.62/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.62/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.62/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.62/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.62/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.84/1.15 Prover 4: Preprocessing ... % 2.84/1.15 Prover 1: Preprocessing ... % 2.84/1.18 Prover 5: Preprocessing ... % 2.84/1.18 Prover 2: Preprocessing ... % 3.18/1.18 Prover 0: Preprocessing ... % 3.18/1.18 Prover 3: Preprocessing ... % 3.18/1.18 Prover 6: Preprocessing ... % 5.04/1.46 Prover 5: Proving ... % 5.04/1.46 Prover 2: Proving ... % 5.13/1.46 Prover 3: Constructing countermodel ... % 5.13/1.47 Prover 1: Constructing countermodel ... % 5.13/1.48 Prover 6: Constructing countermodel ... % 5.77/1.59 Prover 3: proved (898ms) % 5.77/1.59 % 5.77/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.77/1.59 % 5.77/1.59 Prover 5: stopped % 5.77/1.59 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.77/1.59 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.77/1.60 Prover 6: stopped % 5.77/1.60 Prover 2: stopped % 5.77/1.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.77/1.60 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.77/1.61 Prover 0: Proving ... % 5.77/1.61 Prover 4: Constructing countermodel ... % 5.77/1.63 Prover 0: stopped % 5.77/1.63 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.39/1.66 Prover 7: Preprocessing ... % 6.39/1.66 Prover 8: Preprocessing ... % 6.39/1.66 Prover 11: Preprocessing ... % 6.39/1.66 Prover 10: Preprocessing ... % 6.39/1.67 Prover 1: Found proof (size 22) % 6.39/1.67 Prover 1: proved (978ms) % 6.39/1.67 Prover 4: stopped % 6.39/1.68 Prover 13: Preprocessing ... % 6.76/1.68 Prover 10: stopped % 6.76/1.69 Prover 7: stopped % 6.76/1.70 Prover 13: stopped % 6.76/1.71 Prover 11: stopped % 7.11/1.75 Prover 8: Warning: ignoring some quantifiers % 7.17/1.76 Prover 8: Constructing countermodel ... % 7.17/1.77 Prover 8: stopped % 7.17/1.77 % 7.17/1.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.17/1.77 % 7.17/1.77 % SZS output start Proof for theBenchmark % 7.17/1.78 Assumptions after simplification: % 7.17/1.78 --------------------------------- % 7.17/1.78 % 7.17/1.78 (ax6) % 7.17/1.81 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 7.17/1.81 (convergent_lines(v0, v2) = v3) | ~ (convergent_lines(v0, v1) = 0) | ~ % 7.17/1.81 $i(v2) | ~ $i(v1) | ~ $i(v0) | convergent_lines(v1, v2) = 0) % 7.17/1.81 % 7.17/1.81 (con) % 7.17/1.81 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ? [v5: % 7.17/1.81 int] : ? [v6: int] : ? [v7: int] : ( ~ (v7 = 0) & ~ (v6 = 0) & ~ (v5 = % 7.17/1.81 0) & ~ (v4 = 0) & apart_point_and_line(v0, v3) = v5 & % 7.17/1.81 apart_point_and_line(v0, v2) = v4 & apart_point_and_line(v0, v1) = 0 & % 7.17/1.81 convergent_lines(v3, v1) = v7 & convergent_lines(v2, v1) = v6 & % 7.17/1.81 distinct_lines(v2, v3) = 0 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 7.17/1.81 % 7.17/1.81 (cup1) % 7.17/1.81 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 7.17/1.81 (apart_point_and_line(v0, v1) = v3) | ~ (distinct_lines(v1, v2) = 0) | ~ % 7.17/1.81 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : % 7.17/1.81 (apart_point_and_line(v0, v2) = v4 & convergent_lines(v1, v2) = v5 & (v5 = 0 % 7.17/1.81 | v4 = 0))) % 7.17/1.81 % 7.17/1.81 (function-axioms) % 7.17/1.82 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.17/1.82 (parallel_through_point(v3, v2) = v1) | ~ (parallel_through_point(v3, v2) = % 7.17/1.82 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 7.17/1.82 ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) % 7.17/1.82 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.17/1.82 (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & ! % 7.17/1.82 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 7.17/1.82 $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 7.17/1.82 (apart_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.17/1.82 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.17/1.82 (convergent_lines(v3, v2) = v1) | ~ (convergent_lines(v3, v2) = v0)) & ! % 7.17/1.82 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 7.17/1.82 $i] : (v1 = v0 | ~ (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, % 7.17/1.82 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 7.17/1.82 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ % 7.17/1.82 (distinct_points(v3, v2) = v0)) % 7.17/1.82 % 7.17/1.82 Further assumptions not needed in the proof: % 7.17/1.82 -------------------------------------------- % 7.17/1.82 apart1, apart2, apart3, apart4, apart5, ceq1, ceq2, ceq3, ci1, ci2, ci3, ci4, % 7.17/1.82 cp1, cp2, cu1 % 7.17/1.82 % 7.17/1.82 Those formulas are unsatisfiable: % 7.17/1.82 --------------------------------- % 7.17/1.82 % 7.17/1.82 Begin of proof % 7.17/1.82 | % 7.17/1.82 | ALPHA: (function-axioms) implies: % 7.17/1.82 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.17/1.82 | ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 7.17/1.82 | (convergent_lines(v3, v2) = v0)) % 7.17/1.83 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.17/1.83 | ! [v3: $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 7.17/1.83 | (apart_point_and_line(v3, v2) = v0)) % 7.17/1.83 | % 7.17/1.83 | DELTA: instantiating (con) with fresh symbols all_20_0, all_20_1, all_20_2, % 7.17/1.83 | all_20_3, all_20_4, all_20_5, all_20_6, all_20_7 gives: % 7.17/1.83 | (3) ~ (all_20_0 = 0) & ~ (all_20_1 = 0) & ~ (all_20_2 = 0) & ~ % 7.17/1.83 | (all_20_3 = 0) & apart_point_and_line(all_20_7, all_20_4) = all_20_2 & % 7.17/1.83 | apart_point_and_line(all_20_7, all_20_5) = all_20_3 & % 7.17/1.83 | apart_point_and_line(all_20_7, all_20_6) = 0 & % 7.17/1.83 | convergent_lines(all_20_4, all_20_6) = all_20_0 & % 7.17/1.83 | convergent_lines(all_20_5, all_20_6) = all_20_1 & % 7.17/1.83 | distinct_lines(all_20_5, all_20_4) = 0 & $i(all_20_4) & $i(all_20_5) & % 7.17/1.83 | $i(all_20_6) & $i(all_20_7) % 7.17/1.83 | % 7.17/1.83 | ALPHA: (3) implies: % 7.17/1.83 | (4) ~ (all_20_3 = 0) % 7.17/1.83 | (5) ~ (all_20_2 = 0) % 7.17/1.83 | (6) ~ (all_20_1 = 0) % 7.17/1.83 | (7) ~ (all_20_0 = 0) % 7.17/1.83 | (8) $i(all_20_7) % 7.17/1.83 | (9) $i(all_20_6) % 7.17/1.83 | (10) $i(all_20_5) % 7.17/1.83 | (11) $i(all_20_4) % 7.17/1.83 | (12) distinct_lines(all_20_5, all_20_4) = 0 % 7.17/1.83 | (13) convergent_lines(all_20_5, all_20_6) = all_20_1 % 7.17/1.83 | (14) convergent_lines(all_20_4, all_20_6) = all_20_0 % 7.17/1.83 | (15) apart_point_and_line(all_20_7, all_20_5) = all_20_3 % 7.17/1.83 | (16) apart_point_and_line(all_20_7, all_20_4) = all_20_2 % 7.17/1.83 | % 7.17/1.83 | GROUND_INST: instantiating (cup1) with all_20_7, all_20_5, all_20_4, all_20_3, % 7.17/1.83 | simplifying with (8), (10), (11), (12), (15) gives: % 7.17/1.83 | (17) all_20_3 = 0 | ? [v0: any] : ? [v1: any] : % 7.17/1.83 | (apart_point_and_line(all_20_7, all_20_4) = v0 & % 7.17/1.83 | convergent_lines(all_20_5, all_20_4) = v1 & (v1 = 0 | v0 = 0)) % 7.17/1.83 | % 7.17/1.83 | BETA: splitting (17) gives: % 7.17/1.83 | % 7.17/1.83 | Case 1: % 7.17/1.83 | | % 7.17/1.83 | | (18) all_20_3 = 0 % 7.17/1.83 | | % 7.17/1.84 | | REDUCE: (4), (18) imply: % 7.17/1.84 | | (19) $false % 7.17/1.84 | | % 7.17/1.84 | | CLOSE: (19) is inconsistent. % 7.17/1.84 | | % 7.17/1.84 | Case 2: % 7.17/1.84 | | % 7.17/1.84 | | (20) ? [v0: any] : ? [v1: any] : (apart_point_and_line(all_20_7, % 7.17/1.84 | | all_20_4) = v0 & convergent_lines(all_20_5, all_20_4) = v1 & (v1 % 7.17/1.84 | | = 0 | v0 = 0)) % 7.17/1.84 | | % 7.17/1.84 | | DELTA: instantiating (20) with fresh symbols all_29_0, all_29_1 gives: % 7.17/1.84 | | (21) apart_point_and_line(all_20_7, all_20_4) = all_29_1 & % 7.17/1.84 | | convergent_lines(all_20_5, all_20_4) = all_29_0 & (all_29_0 = 0 | % 7.17/1.84 | | all_29_1 = 0) % 7.17/1.84 | | % 7.17/1.84 | | ALPHA: (21) implies: % 7.17/1.84 | | (22) convergent_lines(all_20_5, all_20_4) = all_29_0 % 7.17/1.84 | | (23) apart_point_and_line(all_20_7, all_20_4) = all_29_1 % 7.17/1.84 | | (24) all_29_0 = 0 | all_29_1 = 0 % 7.17/1.84 | | % 7.17/1.84 | | GROUND_INST: instantiating (2) with all_20_2, all_29_1, all_20_4, all_20_7, % 7.17/1.84 | | simplifying with (16), (23) gives: % 7.17/1.84 | | (25) all_29_1 = all_20_2 % 7.17/1.84 | | % 7.17/1.84 | | BETA: splitting (24) gives: % 7.17/1.84 | | % 7.17/1.84 | | Case 1: % 7.17/1.84 | | | % 7.17/1.84 | | | (26) all_29_0 = 0 % 7.17/1.84 | | | % 7.17/1.84 | | | REDUCE: (22), (26) imply: % 7.17/1.84 | | | (27) convergent_lines(all_20_5, all_20_4) = 0 % 7.17/1.84 | | | % 7.17/1.84 | | | GROUND_INST: instantiating (ax6) with all_20_5, all_20_4, all_20_6, % 7.17/1.84 | | | all_20_1, simplifying with (9), (10), (11), (13), (27) gives: % 7.17/1.84 | | | (28) all_20_1 = 0 | convergent_lines(all_20_4, all_20_6) = 0 % 7.17/1.84 | | | % 7.17/1.84 | | | BETA: splitting (28) gives: % 7.17/1.84 | | | % 7.17/1.84 | | | Case 1: % 7.17/1.84 | | | | % 7.17/1.84 | | | | (29) convergent_lines(all_20_4, all_20_6) = 0 % 7.17/1.84 | | | | % 7.17/1.84 | | | | GROUND_INST: instantiating (1) with all_20_0, 0, all_20_6, all_20_4, % 7.17/1.84 | | | | simplifying with (14), (29) gives: % 7.17/1.84 | | | | (30) all_20_0 = 0 % 7.17/1.84 | | | | % 7.17/1.84 | | | | REDUCE: (7), (30) imply: % 7.17/1.84 | | | | (31) $false % 7.17/1.84 | | | | % 7.17/1.84 | | | | CLOSE: (31) is inconsistent. % 7.17/1.84 | | | | % 7.17/1.84 | | | Case 2: % 7.17/1.84 | | | | % 7.17/1.84 | | | | (32) all_20_1 = 0 % 7.17/1.84 | | | | % 7.17/1.84 | | | | REDUCE: (6), (32) imply: % 7.17/1.84 | | | | (33) $false % 7.17/1.84 | | | | % 7.17/1.84 | | | | CLOSE: (33) is inconsistent. % 7.17/1.84 | | | | % 7.17/1.84 | | | End of split % 7.17/1.84 | | | % 7.17/1.84 | | Case 2: % 7.17/1.84 | | | % 7.17/1.84 | | | (34) all_29_1 = 0 % 7.17/1.84 | | | % 7.17/1.84 | | | COMBINE_EQS: (25), (34) imply: % 7.17/1.84 | | | (35) all_20_2 = 0 % 7.17/1.84 | | | % 7.17/1.84 | | | REDUCE: (5), (35) imply: % 7.17/1.84 | | | (36) $false % 7.17/1.84 | | | % 7.17/1.84 | | | CLOSE: (36) is inconsistent. % 7.17/1.84 | | | % 7.17/1.84 | | End of split % 7.17/1.84 | | % 7.17/1.84 | End of split % 7.17/1.84 | % 7.17/1.84 End of proof % 7.17/1.84 % SZS output end Proof for theBenchmark % 7.17/1.84 % 7.17/1.84 1176ms %------------------------------------------------------------------------------