%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO208+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 : n015.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:19 EDT 2023 % Result : Theorem 5.59s 1.55s % Output : Proof 7.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GEO208+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n015.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:03:26 EDT 2023 % 0.14/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.13/1.05 Prover 4: Preprocessing ... % 2.57/1.06 Prover 1: Preprocessing ... % 2.57/1.10 Prover 2: Preprocessing ... % 2.57/1.10 Prover 6: Preprocessing ... % 2.87/1.10 Prover 0: Preprocessing ... % 2.87/1.10 Prover 3: Preprocessing ... % 2.87/1.10 Prover 5: Preprocessing ... % 4.51/1.39 Prover 2: Proving ... % 4.51/1.39 Prover 5: Proving ... % 4.51/1.42 Prover 1: Constructing countermodel ... % 4.51/1.43 Prover 6: Constructing countermodel ... % 4.51/1.44 Prover 3: Constructing countermodel ... % 5.59/1.54 Prover 3: proved (922ms) % 5.59/1.54 % 5.59/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.59/1.55 % 5.59/1.55 Prover 6: stopped % 5.59/1.55 Prover 2: stopped % 5.59/1.55 Prover 5: stopped % 5.87/1.56 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.87/1.56 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.87/1.56 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.87/1.57 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.87/1.58 Prover 8: Preprocessing ... % 5.87/1.58 Prover 7: Preprocessing ... % 5.87/1.59 Prover 11: Preprocessing ... % 5.87/1.59 Prover 4: Constructing countermodel ... % 5.87/1.61 Prover 10: Preprocessing ... % 5.87/1.61 Prover 1: Found proof (size 19) % 5.87/1.61 Prover 1: proved (997ms) % 5.87/1.62 Prover 4: stopped % 5.87/1.62 Prover 7: stopped % 5.87/1.62 Prover 10: stopped % 5.87/1.63 Prover 0: Proving ... % 5.87/1.63 Prover 11: stopped % 6.50/1.64 Prover 0: stopped % 6.50/1.67 Prover 8: Warning: ignoring some quantifiers % 6.50/1.68 Prover 8: Constructing countermodel ... % 6.73/1.69 Prover 8: stopped % 6.73/1.69 % 6.73/1.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.73/1.69 % 6.73/1.69 % SZS output start Proof for theBenchmark % 6.73/1.70 Assumptions after simplification: % 6.73/1.70 --------------------------------- % 6.73/1.70 % 6.73/1.70 (con) % 6.73/1.72 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ? [v4: int] : ? % 6.73/1.72 [v5: int] : ( ~ (v5 = 0) & ~ (v4 = 0) & ~ (v3 = 0) & % 6.73/1.72 apart_point_and_line(v0, v2) = v4 & apart_point_and_line(v0, v1) = v3 & % 6.73/1.72 convergent_lines(v1, v2) = v5 & distinct_lines(v1, v2) = 0 & $i(v2) & $i(v1) % 6.73/1.72 & $i(v0)) % 6.73/1.72 % 6.73/1.72 (cup1) % 6.73/1.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 6.73/1.73 (apart_point_and_line(v0, v1) = v3) | ~ (distinct_lines(v1, v2) = 0) | ~ % 6.73/1.73 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : % 6.73/1.73 (apart_point_and_line(v0, v2) = v4 & convergent_lines(v1, v2) = v5 & (v5 = 0 % 6.73/1.73 | v4 = 0))) % 6.73/1.73 % 6.73/1.73 (function-axioms) % 6.73/1.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.73/1.73 (parallel_through_point(v3, v2) = v1) | ~ (parallel_through_point(v3, v2) = % 6.73/1.73 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 6.73/1.73 ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) % 6.73/1.73 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.73/1.73 (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & ! % 6.73/1.73 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.73/1.73 $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 6.73/1.73 (apart_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.73/1.73 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.73/1.73 (convergent_lines(v3, v2) = v1) | ~ (convergent_lines(v3, v2) = v0)) & ! % 6.73/1.73 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.73/1.74 $i] : (v1 = v0 | ~ (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, % 6.73/1.74 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 6.73/1.74 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ % 6.73/1.74 (distinct_points(v3, v2) = v0)) % 6.73/1.74 % 6.73/1.74 Further assumptions not needed in the proof: % 6.73/1.74 -------------------------------------------- % 6.73/1.74 apart1, apart2, apart3, apart4, apart5, ax6, ceq1, ceq2, ceq3, ci1, ci2, ci3, % 6.73/1.74 ci4, cp1, cp2, cu1 % 6.73/1.74 % 6.73/1.74 Those formulas are unsatisfiable: % 6.73/1.74 --------------------------------- % 6.73/1.74 % 6.73/1.74 Begin of proof % 6.73/1.74 | % 6.73/1.74 | ALPHA: (function-axioms) implies: % 6.73/1.74 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.73/1.74 | ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 6.73/1.74 | (convergent_lines(v3, v2) = v0)) % 6.73/1.74 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.73/1.74 | ! [v3: $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 6.73/1.74 | (apart_point_and_line(v3, v2) = v0)) % 6.73/1.74 | % 6.73/1.74 | DELTA: instantiating (con) with fresh symbols all_20_0, all_20_1, all_20_2, % 6.73/1.74 | all_20_3, all_20_4, all_20_5 gives: % 7.02/1.74 | (3) ~ (all_20_0 = 0) & ~ (all_20_1 = 0) & ~ (all_20_2 = 0) & % 7.02/1.74 | apart_point_and_line(all_20_5, all_20_3) = all_20_1 & % 7.02/1.74 | apart_point_and_line(all_20_5, all_20_4) = all_20_2 & % 7.02/1.74 | convergent_lines(all_20_4, all_20_3) = all_20_0 & % 7.02/1.74 | distinct_lines(all_20_4, all_20_3) = 0 & $i(all_20_3) & $i(all_20_4) & % 7.02/1.74 | $i(all_20_5) % 7.02/1.74 | % 7.02/1.74 | ALPHA: (3) implies: % 7.02/1.74 | (4) ~ (all_20_2 = 0) % 7.02/1.74 | (5) ~ (all_20_1 = 0) % 7.02/1.74 | (6) ~ (all_20_0 = 0) % 7.02/1.74 | (7) $i(all_20_5) % 7.02/1.74 | (8) $i(all_20_4) % 7.02/1.74 | (9) $i(all_20_3) % 7.02/1.74 | (10) distinct_lines(all_20_4, all_20_3) = 0 % 7.02/1.75 | (11) convergent_lines(all_20_4, all_20_3) = all_20_0 % 7.02/1.75 | (12) apart_point_and_line(all_20_5, all_20_4) = all_20_2 % 7.02/1.75 | (13) apart_point_and_line(all_20_5, all_20_3) = all_20_1 % 7.02/1.75 | % 7.02/1.75 | GROUND_INST: instantiating (cup1) with all_20_5, all_20_4, all_20_3, all_20_2, % 7.02/1.75 | simplifying with (7), (8), (9), (10), (12) gives: % 7.02/1.75 | (14) all_20_2 = 0 | ? [v0: any] : ? [v1: any] : % 7.02/1.75 | (apart_point_and_line(all_20_5, all_20_3) = v0 & % 7.02/1.75 | convergent_lines(all_20_4, all_20_3) = v1 & (v1 = 0 | v0 = 0)) % 7.02/1.75 | % 7.02/1.75 | BETA: splitting (14) gives: % 7.02/1.75 | % 7.02/1.75 | Case 1: % 7.02/1.75 | | % 7.02/1.75 | | (15) all_20_2 = 0 % 7.02/1.75 | | % 7.02/1.75 | | REDUCE: (4), (15) imply: % 7.02/1.75 | | (16) $false % 7.02/1.75 | | % 7.02/1.75 | | CLOSE: (16) is inconsistent. % 7.02/1.75 | | % 7.02/1.75 | Case 2: % 7.02/1.75 | | % 7.02/1.75 | | (17) ? [v0: any] : ? [v1: any] : (apart_point_and_line(all_20_5, % 7.02/1.75 | | all_20_3) = v0 & convergent_lines(all_20_4, all_20_3) = v1 & (v1 % 7.02/1.75 | | = 0 | v0 = 0)) % 7.02/1.75 | | % 7.02/1.75 | | DELTA: instantiating (17) with fresh symbols all_29_0, all_29_1 gives: % 7.02/1.75 | | (18) apart_point_and_line(all_20_5, all_20_3) = all_29_1 & % 7.02/1.75 | | convergent_lines(all_20_4, all_20_3) = all_29_0 & (all_29_0 = 0 | % 7.02/1.75 | | all_29_1 = 0) % 7.02/1.75 | | % 7.02/1.75 | | ALPHA: (18) implies: % 7.02/1.75 | | (19) convergent_lines(all_20_4, all_20_3) = all_29_0 % 7.02/1.75 | | (20) apart_point_and_line(all_20_5, all_20_3) = all_29_1 % 7.02/1.75 | | (21) all_29_0 = 0 | all_29_1 = 0 % 7.02/1.75 | | % 7.02/1.75 | | GROUND_INST: instantiating (1) with all_20_0, all_29_0, all_20_3, all_20_4, % 7.02/1.75 | | simplifying with (11), (19) gives: % 7.02/1.75 | | (22) all_29_0 = all_20_0 % 7.02/1.75 | | % 7.02/1.75 | | GROUND_INST: instantiating (2) with all_20_1, all_29_1, all_20_3, all_20_5, % 7.02/1.75 | | simplifying with (13), (20) gives: % 7.02/1.75 | | (23) all_29_1 = all_20_1 % 7.02/1.75 | | % 7.02/1.75 | | BETA: splitting (21) gives: % 7.02/1.75 | | % 7.02/1.75 | | Case 1: % 7.02/1.75 | | | % 7.02/1.75 | | | (24) all_29_0 = 0 % 7.02/1.75 | | | % 7.02/1.75 | | | COMBINE_EQS: (22), (24) imply: % 7.02/1.75 | | | (25) all_20_0 = 0 % 7.02/1.75 | | | % 7.02/1.75 | | | REDUCE: (6), (25) imply: % 7.02/1.75 | | | (26) $false % 7.02/1.75 | | | % 7.02/1.75 | | | CLOSE: (26) is inconsistent. % 7.02/1.75 | | | % 7.02/1.75 | | Case 2: % 7.02/1.75 | | | % 7.02/1.76 | | | (27) all_29_1 = 0 % 7.02/1.76 | | | % 7.02/1.76 | | | COMBINE_EQS: (23), (27) imply: % 7.02/1.76 | | | (28) all_20_1 = 0 % 7.02/1.76 | | | % 7.02/1.76 | | | SIMP: (28) implies: % 7.02/1.76 | | | (29) all_20_1 = 0 % 7.02/1.76 | | | % 7.02/1.76 | | | REDUCE: (5), (29) imply: % 7.02/1.76 | | | (30) $false % 7.02/1.76 | | | % 7.02/1.76 | | | CLOSE: (30) is inconsistent. % 7.02/1.76 | | | % 7.02/1.76 | | End of split % 7.02/1.76 | | % 7.02/1.76 | End of split % 7.02/1.76 | % 7.02/1.76 End of proof % 7.02/1.76 % SZS output end Proof for theBenchmark % 7.10/1.76 % 7.10/1.76 1159ms %------------------------------------------------------------------------------