%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO172+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 : n008.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.22s 1.60s % Output : Proof 7.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GEO172+2 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n008.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Tue Aug 29 21:23:02 EDT 2023 % 0.12/0.34 % 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/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.58/1.05 Prover 4: Preprocessing ... % 2.58/1.05 Prover 1: Preprocessing ... % 2.58/1.09 Prover 3: Preprocessing ... % 2.58/1.09 Prover 0: Preprocessing ... % 2.58/1.09 Prover 6: Preprocessing ... % 2.58/1.09 Prover 5: Preprocessing ... % 2.58/1.09 Prover 2: Preprocessing ... % 4.34/1.31 Prover 5: Proving ... % 4.34/1.32 Prover 2: Proving ... % 4.64/1.33 Prover 6: Constructing countermodel ... % 4.72/1.34 Prover 1: Constructing countermodel ... % 4.72/1.35 Prover 3: Constructing countermodel ... % 5.22/1.44 Prover 4: Constructing countermodel ... % 5.22/1.44 Prover 1: gave up % 5.22/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.22/1.45 Prover 3: gave up % 5.22/1.46 Prover 6: gave up % 5.22/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.22/1.46 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 5.22/1.47 Prover 7: Preprocessing ... % 5.22/1.50 Prover 0: Proving ... % 5.22/1.50 Prover 9: Preprocessing ... % 5.22/1.50 Prover 8: Preprocessing ... % 5.22/1.51 Prover 7: Warning: ignoring some quantifiers % 5.22/1.53 Prover 7: Constructing countermodel ... % 5.22/1.60 Prover 2: proved (967ms) % 5.22/1.60 % 5.22/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.22/1.60 % 5.22/1.61 Prover 0: stopped % 5.22/1.61 Prover 5: stopped % 5.22/1.62 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.22/1.62 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.22/1.62 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.08/1.65 Prover 13: Preprocessing ... % 6.08/1.67 Prover 10: Preprocessing ... % 6.08/1.67 Prover 8: Warning: ignoring some quantifiers % 6.08/1.68 Prover 11: Preprocessing ... % 6.08/1.69 Prover 8: Constructing countermodel ... % 6.08/1.69 Prover 7: Found proof (size 13) % 6.08/1.69 Prover 7: proved (253ms) % 6.08/1.69 Prover 4: stopped % 6.08/1.69 Prover 10: Warning: ignoring some quantifiers % 6.08/1.70 Prover 8: stopped % 6.08/1.70 Prover 10: Constructing countermodel ... % 6.08/1.70 Prover 13: Warning: ignoring some quantifiers % 6.08/1.70 Prover 10: stopped % 6.08/1.71 Prover 13: Constructing countermodel ... % 6.08/1.71 Prover 11: stopped % 7.33/1.72 Prover 13: stopped % 7.33/1.74 Prover 9: Constructing countermodel ... % 7.33/1.74 Prover 9: stopped % 7.33/1.74 % 7.33/1.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.33/1.74 % 7.48/1.75 % SZS output start Proof for theBenchmark % 7.48/1.75 Assumptions after simplification: % 7.48/1.75 --------------------------------- % 7.48/1.75 % 7.48/1.75 (apart1) % 7.48/1.75 ! [v0: $i] : ( ~ $i(v0) | ~ distinct_points(v0, v0)) % 7.48/1.75 % 7.48/1.75 (ceq3) % 7.48/1.76 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ convergent_lines(v0, % 7.48/1.76 v1) | distinct_lines(v0, v1)) % 7.48/1.76 % 7.48/1.76 (con) % 7.48/1.78 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : % 7.48/1.78 (intersection_point(v0, v1) = v3 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 7.48/1.78 convergent_lines(v0, v1) & distinct_points(v2, v3) & ~ % 7.48/1.78 apart_point_and_line(v2, v1) & ~ apart_point_and_line(v2, v0)) % 7.48/1.78 % 7.48/1.78 (con2) % 7.48/1.78 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 7.48/1.78 (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 7.48/1.78 apart_point_and_line(v2, v1) | ~ convergent_lines(v0, v1) | % 7.48/1.78 distinct_points(v2, v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 7.48/1.78 $i] : ( ~ (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 7.48/1.78 $i(v0) | ~ apart_point_and_line(v2, v0) | ~ convergent_lines(v0, v1) | % 7.48/1.78 distinct_points(v2, v3)) % 7.48/1.78 % 7.48/1.78 (cu1) % 7.48/1.78 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 7.48/1.78 | ~ $i(v1) | ~ $i(v0) | ~ distinct_lines(v2, v3) | ~ distinct_points(v0, % 7.48/1.79 v1) | apart_point_and_line(v1, v3) | apart_point_and_line(v1, v2) | % 7.48/1.79 apart_point_and_line(v0, v3) | apart_point_and_line(v0, v2)) % 7.48/1.79 % 7.48/1.79 Further assumptions not needed in the proof: % 7.48/1.79 -------------------------------------------- % 7.48/1.79 apart2, apart3, apart4, apart5, apart6, ceq1, ceq2, con1 % 7.48/1.79 % 7.48/1.79 Those formulas are unsatisfiable: % 7.48/1.79 --------------------------------- % 7.48/1.79 % 7.48/1.79 Begin of proof % 7.48/1.79 | % 7.48/1.79 | ALPHA: (con2) implies: % 7.48/1.79 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 7.48/1.79 | (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 7.48/1.79 | | ~ apart_point_and_line(v2, v0) | ~ convergent_lines(v0, v1) | % 7.48/1.79 | distinct_points(v2, v3)) % 7.48/1.79 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 7.48/1.79 | (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 7.48/1.79 | | ~ apart_point_and_line(v2, v1) | ~ convergent_lines(v0, v1) | % 7.48/1.79 | distinct_points(v2, v3)) % 7.48/1.79 | % 7.48/1.79 | DELTA: instantiating (con) with fresh symbols all_20_0, all_20_1, all_20_2, % 7.48/1.79 | all_20_3 gives: % 7.48/1.79 | (3) intersection_point(all_20_3, all_20_2) = all_20_0 & $i(all_20_0) & % 7.48/1.79 | $i(all_20_1) & $i(all_20_2) & $i(all_20_3) & convergent_lines(all_20_3, % 7.48/1.79 | all_20_2) & distinct_points(all_20_1, all_20_0) & ~ % 7.48/1.79 | apart_point_and_line(all_20_1, all_20_2) & ~ % 7.48/1.79 | apart_point_and_line(all_20_1, all_20_3) % 7.48/1.79 | % 7.48/1.79 | ALPHA: (3) implies: % 7.48/1.79 | (4) ~ apart_point_and_line(all_20_1, all_20_3) % 7.48/1.79 | (5) ~ apart_point_and_line(all_20_1, all_20_2) % 7.48/1.79 | (6) distinct_points(all_20_1, all_20_0) % 7.48/1.79 | (7) convergent_lines(all_20_3, all_20_2) % 7.48/1.79 | (8) $i(all_20_3) % 7.48/1.79 | (9) $i(all_20_2) % 7.48/1.80 | (10) $i(all_20_1) % 7.48/1.80 | (11) $i(all_20_0) % 7.48/1.80 | (12) intersection_point(all_20_3, all_20_2) = all_20_0 % 7.48/1.80 | % 7.48/1.80 | GROUND_INST: instantiating (ceq3) with all_20_3, all_20_2, simplifying with % 7.48/1.80 | (7), (8), (9) gives: % 7.48/1.80 | (13) distinct_lines(all_20_3, all_20_2) % 7.48/1.80 | % 7.48/1.80 | GROUND_INST: instantiating (cu1) with all_20_1, all_20_0, all_20_3, all_20_2, % 7.48/1.80 | simplifying with (4), (5), (6), (8), (9), (10), (11), (13) gives: % 7.48/1.80 | (14) apart_point_and_line(all_20_0, all_20_2) | % 7.48/1.80 | apart_point_and_line(all_20_0, all_20_3) % 7.48/1.80 | % 7.48/1.80 | BETA: splitting (14) gives: % 7.48/1.80 | % 7.48/1.80 | Case 1: % 7.48/1.80 | | % 7.48/1.80 | | (15) apart_point_and_line(all_20_0, all_20_2) % 7.48/1.80 | | % 7.48/1.80 | | GROUND_INST: instantiating (2) with all_20_3, all_20_2, all_20_0, all_20_0, % 7.48/1.80 | | simplifying with (7), (8), (9), (11), (12), (15) gives: % 7.48/1.80 | | (16) distinct_points(all_20_0, all_20_0) % 7.48/1.80 | | % 7.48/1.80 | | GROUND_INST: instantiating (apart1) with all_20_0, simplifying with (11), % 7.48/1.80 | | (16) gives: % 7.48/1.80 | | (17) $false % 7.48/1.80 | | % 7.48/1.80 | | CLOSE: (17) is inconsistent. % 7.48/1.80 | | % 7.48/1.80 | Case 2: % 7.48/1.80 | | % 7.48/1.80 | | (18) apart_point_and_line(all_20_0, all_20_3) % 7.48/1.80 | | % 7.48/1.80 | | GROUND_INST: instantiating (1) with all_20_3, all_20_2, all_20_0, all_20_0, % 7.48/1.80 | | simplifying with (7), (8), (9), (11), (12), (18) gives: % 7.48/1.80 | | (19) distinct_points(all_20_0, all_20_0) % 7.48/1.80 | | % 7.48/1.80 | | GROUND_INST: instantiating (apart1) with all_20_0, simplifying with (11), % 7.48/1.80 | | (19) gives: % 7.48/1.80 | | (20) $false % 7.48/1.80 | | % 7.48/1.80 | | CLOSE: (20) is inconsistent. % 7.48/1.80 | | % 7.48/1.80 | End of split % 7.48/1.80 | % 7.48/1.80 End of proof % 7.48/1.80 % SZS output end Proof for theBenchmark % 7.48/1.80 % 7.48/1.80 1190ms %------------------------------------------------------------------------------