%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO216+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 : n018.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:26 EDT 2023 % Result : Theorem 5.46s 1.47s % Output : Proof 6.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GEO216+2 : TPTP v8.1.2. Released v3.3.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n018.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:24:03 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.50/1.09 Prover 4: Preprocessing ... % 2.50/1.09 Prover 1: Preprocessing ... % 2.85/1.13 Prover 6: Preprocessing ... % 2.85/1.13 Prover 2: Preprocessing ... % 2.85/1.13 Prover 5: Preprocessing ... % 2.85/1.13 Prover 3: Preprocessing ... % 2.85/1.13 Prover 0: Preprocessing ... % 4.72/1.37 Prover 5: Proving ... % 4.72/1.37 Prover 2: Proving ... % 4.72/1.38 Prover 1: Constructing countermodel ... % 4.72/1.38 Prover 6: Constructing countermodel ... % 4.72/1.38 Prover 3: Constructing countermodel ... % 5.46/1.46 Prover 3: proved (820ms) % 5.46/1.46 Prover 6: proved (815ms) % 5.46/1.46 % 5.46/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.46/1.47 % 5.46/1.47 % 5.46/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.46/1.47 % 5.46/1.47 Prover 2: stopped % 5.46/1.47 Prover 5: stopped % 5.46/1.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.46/1.48 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.46/1.48 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.46/1.48 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.46/1.51 Prover 8: Preprocessing ... % 5.46/1.51 Prover 7: Preprocessing ... % 5.46/1.52 Prover 11: Preprocessing ... % 5.46/1.55 Prover 10: Preprocessing ... % 5.46/1.57 Prover 1: Found proof (size 16) % 5.46/1.57 Prover 1: proved (928ms) % 5.46/1.57 Prover 7: Warning: ignoring some quantifiers % 5.46/1.57 Prover 11: stopped % 5.46/1.58 Prover 10: stopped % 5.98/1.58 Prover 4: Constructing countermodel ... % 5.98/1.58 Prover 7: Constructing countermodel ... % 5.98/1.58 Prover 7: stopped % 5.98/1.59 Prover 0: Proving ... % 5.98/1.59 Prover 4: stopped % 5.98/1.59 Prover 0: stopped % 5.98/1.60 Prover 8: Warning: ignoring some quantifiers % 5.98/1.60 Prover 8: Constructing countermodel ... % 5.98/1.61 Prover 8: stopped % 5.98/1.61 % 5.98/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.98/1.61 % 5.98/1.61 % SZS output start Proof for theBenchmark % 5.98/1.62 Assumptions after simplification: % 5.98/1.62 --------------------------------- % 5.98/1.62 % 5.98/1.62 (coipo1) % 6.64/1.64 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 6.64/1.64 (unorthogonal_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | % 6.64/1.64 convergent_lines(v0, v1) = 0) % 6.64/1.64 % 6.64/1.64 (con) % 6.64/1.64 ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & unorthogonal_lines(v0, v0) = v1 & % 6.64/1.64 $i(v0)) % 6.64/1.64 % 6.64/1.64 (couo1) % 6.64/1.65 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : ! [v4: int] : (v4 = % 6.64/1.65 0 | v3 = 0 | ~ (unorthogonal_lines(v0, v2) = v4) | ~ % 6.64/1.65 (unorthogonal_lines(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 6.64/1.65 [v5: int] : ( ~ (v5 = 0) & convergent_lines(v1, v2) = v5)) % 6.64/1.65 % 6.64/1.65 (function-axioms) % 6.64/1.65 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 6.64/1.65 [v3: $i] : (v1 = v0 | ~ (unorthogonal_lines(v3, v2) = v1) | ~ % 6.64/1.65 (unorthogonal_lines(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 6.64/1.65 : ! [v3: $i] : (v1 = v0 | ~ (intersection_point(v3, v2) = v1) | ~ % 6.64/1.65 (intersection_point(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 6.64/1.65 : ! [v3: $i] : (v1 = v0 | ~ (line_connecting(v3, v2) = v1) | ~ % 6.64/1.65 (line_connecting(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.64/1.65 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.64/1.65 (apart_point_and_line(v3, v2) = v1) | ~ (apart_point_and_line(v3, v2) = % 6.64/1.65 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 6.64/1.65 $i] : ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 6.64/1.65 (convergent_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.64/1.65 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.64/1.65 (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, v2) = v0)) & ! [v0: % 6.64/1.65 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 6.64/1.65 : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ (distinct_points(v3, v2) = % 6.64/1.65 v0)) % 6.64/1.65 % 6.64/1.65 Further assumptions not needed in the proof: % 6.64/1.65 -------------------------------------------- % 6.64/1.65 apart1, apart2, apart3, apart4, apart5, apart6, ceq1, ceq2, ceq3, con1, con2, % 6.64/1.65 cotno1, cu1 % 6.64/1.65 % 6.64/1.65 Those formulas are unsatisfiable: % 6.64/1.65 --------------------------------- % 6.64/1.65 % 6.64/1.65 Begin of proof % 6.64/1.65 | % 6.64/1.66 | ALPHA: (function-axioms) implies: % 6.64/1.66 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.64/1.66 | ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 6.64/1.66 | (convergent_lines(v3, v2) = v0)) % 6.64/1.66 | % 6.64/1.66 | DELTA: instantiating (con) with fresh symbols all_18_0, all_18_1 gives: % 6.64/1.66 | (2) ~ (all_18_0 = 0) & unorthogonal_lines(all_18_1, all_18_1) = all_18_0 & % 6.64/1.66 | $i(all_18_1) % 6.64/1.66 | % 6.64/1.66 | ALPHA: (2) implies: % 6.64/1.66 | (3) ~ (all_18_0 = 0) % 6.64/1.66 | (4) $i(all_18_1) % 6.64/1.66 | (5) unorthogonal_lines(all_18_1, all_18_1) = all_18_0 % 6.64/1.66 | % 6.64/1.66 | GROUND_INST: instantiating (couo1) with all_18_1, all_18_1, all_18_1, % 6.64/1.66 | all_18_0, all_18_0, simplifying with (4), (5) gives: % 6.64/1.66 | (6) all_18_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & convergent_lines(all_18_1, % 6.64/1.66 | all_18_1) = v0) % 6.64/1.66 | % 6.64/1.66 | GROUND_INST: instantiating (coipo1) with all_18_1, all_18_1, all_18_0, % 6.64/1.66 | simplifying with (4), (5) gives: % 6.64/1.66 | (7) all_18_0 = 0 | convergent_lines(all_18_1, all_18_1) = 0 % 6.64/1.66 | % 6.64/1.66 | BETA: splitting (7) gives: % 6.64/1.66 | % 6.64/1.66 | Case 1: % 6.64/1.66 | | % 6.64/1.66 | | (8) convergent_lines(all_18_1, all_18_1) = 0 % 6.64/1.66 | | % 6.64/1.66 | | BETA: splitting (6) gives: % 6.64/1.66 | | % 6.64/1.66 | | Case 1: % 6.64/1.66 | | | % 6.64/1.66 | | | (9) all_18_0 = 0 % 6.64/1.66 | | | % 6.64/1.66 | | | REDUCE: (3), (9) imply: % 6.64/1.66 | | | (10) $false % 6.64/1.66 | | | % 6.64/1.66 | | | CLOSE: (10) is inconsistent. % 6.64/1.66 | | | % 6.64/1.66 | | Case 2: % 6.64/1.66 | | | % 6.64/1.66 | | | (11) ? [v0: int] : ( ~ (v0 = 0) & convergent_lines(all_18_1, all_18_1) % 6.64/1.67 | | | = v0) % 6.64/1.67 | | | % 6.64/1.67 | | | DELTA: instantiating (11) with fresh symbol all_35_0 gives: % 6.64/1.67 | | | (12) ~ (all_35_0 = 0) & convergent_lines(all_18_1, all_18_1) = % 6.64/1.67 | | | all_35_0 % 6.64/1.67 | | | % 6.64/1.67 | | | ALPHA: (12) implies: % 6.64/1.67 | | | (13) ~ (all_35_0 = 0) % 6.64/1.67 | | | (14) convergent_lines(all_18_1, all_18_1) = all_35_0 % 6.64/1.67 | | | % 6.64/1.67 | | | GROUND_INST: instantiating (1) with 0, all_35_0, all_18_1, all_18_1, % 6.64/1.67 | | | simplifying with (8), (14) gives: % 6.64/1.67 | | | (15) all_35_0 = 0 % 6.64/1.67 | | | % 6.64/1.67 | | | REDUCE: (13), (15) imply: % 6.64/1.67 | | | (16) $false % 6.64/1.67 | | | % 6.64/1.67 | | | CLOSE: (16) is inconsistent. % 6.64/1.67 | | | % 6.64/1.67 | | End of split % 6.64/1.67 | | % 6.64/1.67 | Case 2: % 6.64/1.67 | | % 6.64/1.67 | | (17) all_18_0 = 0 % 6.64/1.67 | | % 6.64/1.67 | | REDUCE: (3), (17) imply: % 6.64/1.67 | | (18) $false % 6.64/1.67 | | % 6.64/1.67 | | CLOSE: (18) is inconsistent. % 6.64/1.67 | | % 6.64/1.67 | End of split % 6.64/1.67 | % 6.64/1.67 End of proof % 6.64/1.67 % SZS output end Proof for theBenchmark % 6.64/1.67 % 6.64/1.67 1048ms %------------------------------------------------------------------------------