TSTP Solution File: GEO193+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO193+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 : n028.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:06 EDT 2023
% Result : Theorem 8.73s 1.91s
% Output : Proof 9.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO193+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.34 % Computer : n028.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 : Tue Aug 29 19:38:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.49/0.66 ________ _____
% 0.49/0.66 ___ __ \_________(_)________________________________
% 0.49/0.66 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.49/0.66 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.49/0.66 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.49/0.66
% 0.49/0.66 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.49/0.66 (2023-06-19)
% 0.49/0.66
% 0.49/0.66 (c) Philipp Rümmer, 2009-2023
% 0.49/0.66 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.49/0.66 Amanda Stjerna.
% 0.49/0.66 Free software under BSD-3-Clause.
% 0.49/0.66
% 0.49/0.66 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.49/0.66
% 0.49/0.66 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.73/0.67 Running up to 7 provers in parallel.
% 0.73/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.73/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.73/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.73/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.73/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.73/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.73/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.75/1.09 Prover 1: Preprocessing ...
% 2.75/1.09 Prover 4: Preprocessing ...
% 2.75/1.12 Prover 2: Preprocessing ...
% 2.75/1.12 Prover 5: Preprocessing ...
% 3.08/1.13 Prover 3: Preprocessing ...
% 3.08/1.13 Prover 0: Preprocessing ...
% 3.08/1.13 Prover 6: Preprocessing ...
% 4.62/1.34 Prover 2: Proving ...
% 4.62/1.34 Prover 5: Proving ...
% 4.68/1.36 Prover 3: Constructing countermodel ...
% 4.68/1.37 Prover 6: Constructing countermodel ...
% 4.68/1.39 Prover 1: Constructing countermodel ...
% 5.38/1.49 Prover 6: gave up
% 5.38/1.49 Prover 1: gave up
% 5.38/1.50 Prover 3: gave up
% 5.38/1.50 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.38/1.50 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 5.38/1.51 Prover 4: Constructing countermodel ...
% 5.38/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.38/1.53 Prover 7: Preprocessing ...
% 6.08/1.55 Prover 9: Preprocessing ...
% 6.08/1.55 Prover 8: Preprocessing ...
% 6.08/1.56 Prover 0: Proving ...
% 6.08/1.56 Prover 7: Warning: ignoring some quantifiers
% 6.08/1.57 Prover 7: Constructing countermodel ...
% 6.43/1.64 Prover 8: Warning: ignoring some quantifiers
% 6.84/1.65 Prover 8: Constructing countermodel ...
% 7.31/1.71 Prover 8: gave up
% 7.31/1.72 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 7.31/1.77 Prover 10: Preprocessing ...
% 7.90/1.82 Prover 10: Warning: ignoring some quantifiers
% 7.90/1.82 Prover 10: Constructing countermodel ...
% 7.90/1.84 Prover 9: Constructing countermodel ...
% 8.73/1.91 Prover 7: Found proof (size 18)
% 8.73/1.91 Prover 7: proved (413ms)
% 8.73/1.91 Prover 9: stopped
% 8.73/1.91 Prover 4: stopped
% 8.73/1.91 Prover 5: stopped
% 8.73/1.91 Prover 10: stopped
% 8.73/1.91 Prover 0: stopped
% 8.73/1.91 Prover 2: stopped
% 8.73/1.91
% 8.73/1.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.73/1.91
% 8.73/1.92 % SZS output start Proof for theBenchmark
% 8.73/1.92 Assumptions after simplification:
% 8.73/1.92 ---------------------------------
% 8.73/1.92
% 8.73/1.92 (apart1)
% 8.73/1.93 ! [v0: $i] : ( ~ $i(v0) | ~ distinct_points(v0, v0))
% 8.73/1.93
% 8.73/1.93 (ceq3)
% 8.73/1.93 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ convergent_lines(v0,
% 8.73/1.93 v1) | distinct_lines(v0, v1))
% 8.73/1.93
% 8.73/1.93 (con)
% 9.00/1.95 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] :
% 9.00/1.95 (intersection_point(v2, v1) = v4 & intersection_point(v0, v1) = v3 & $i(v4) &
% 9.00/1.95 $i(v3) & $i(v2) & $i(v1) & $i(v0) & apart_point_and_line(v3, v2) &
% 9.00/1.95 convergent_lines(v2, v1) & convergent_lines(v0, v2) & convergent_lines(v0,
% 9.00/1.95 v1) & ~ apart_point_and_line(v4, v0))
% 9.00/1.95
% 9.00/1.95 (con2)
% 9.00/1.96 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~
% 9.00/1.96 (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~
% 9.00/1.96 apart_point_and_line(v2, v1) | ~ convergent_lines(v0, v1) |
% 9.00/1.96 distinct_points(v2, v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3:
% 9.00/1.96 $i] : ( ~ (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~
% 9.00/1.96 $i(v0) | ~ apart_point_and_line(v2, v0) | ~ convergent_lines(v0, v1) |
% 9.00/1.96 distinct_points(v2, v3))
% 9.00/1.96
% 9.00/1.96 (cu1)
% 9.00/1.96 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2)
% 9.00/1.96 | ~ $i(v1) | ~ $i(v0) | ~ distinct_lines(v2, v3) | ~ distinct_points(v0,
% 9.00/1.96 v1) | apart_point_and_line(v1, v3) | apart_point_and_line(v1, v2) |
% 9.00/1.96 apart_point_and_line(v0, v3) | apart_point_and_line(v0, v2))
% 9.00/1.96
% 9.00/1.96 Further assumptions not needed in the proof:
% 9.00/1.96 --------------------------------------------
% 9.00/1.96 apart2, apart3, apart4, apart5, apart6, ceq1, ceq2, con1
% 9.00/1.96
% 9.00/1.96 Those formulas are unsatisfiable:
% 9.00/1.96 ---------------------------------
% 9.00/1.96
% 9.00/1.96 Begin of proof
% 9.00/1.96 |
% 9.00/1.96 | ALPHA: (con2) implies:
% 9.00/1.96 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~
% 9.00/1.96 | (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)
% 9.00/1.96 | | ~ apart_point_and_line(v2, v0) | ~ convergent_lines(v0, v1) |
% 9.00/1.96 | distinct_points(v2, v3))
% 9.00/1.96 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~
% 9.00/1.96 | (intersection_point(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)
% 9.00/1.96 | | ~ apart_point_and_line(v2, v1) | ~ convergent_lines(v0, v1) |
% 9.00/1.96 | distinct_points(v2, v3))
% 9.00/1.96 |
% 9.00/1.97 | DELTA: instantiating (con) with fresh symbols all_20_0, all_20_1, all_20_2,
% 9.00/1.97 | all_20_3, all_20_4 gives:
% 9.00/1.97 | (3) intersection_point(all_20_2, all_20_3) = all_20_0 &
% 9.00/1.97 | intersection_point(all_20_4, all_20_3) = all_20_1 & $i(all_20_0) &
% 9.00/1.97 | $i(all_20_1) & $i(all_20_2) & $i(all_20_3) & $i(all_20_4) &
% 9.00/1.97 | apart_point_and_line(all_20_1, all_20_2) & convergent_lines(all_20_2,
% 9.00/1.97 | all_20_3) & convergent_lines(all_20_4, all_20_2) &
% 9.00/1.97 | convergent_lines(all_20_4, all_20_3) & ~
% 9.00/1.97 | apart_point_and_line(all_20_0, all_20_4)
% 9.00/1.97 |
% 9.00/1.97 | ALPHA: (3) implies:
% 9.00/1.97 | (4) ~ apart_point_and_line(all_20_0, all_20_4)
% 9.00/1.97 | (5) convergent_lines(all_20_4, all_20_3)
% 9.00/1.97 | (6) convergent_lines(all_20_2, all_20_3)
% 9.00/1.97 | (7) apart_point_and_line(all_20_1, all_20_2)
% 9.00/1.97 | (8) $i(all_20_4)
% 9.00/1.97 | (9) $i(all_20_3)
% 9.00/1.97 | (10) $i(all_20_2)
% 9.00/1.97 | (11) $i(all_20_1)
% 9.00/1.97 | (12) $i(all_20_0)
% 9.00/1.97 | (13) intersection_point(all_20_4, all_20_3) = all_20_1
% 9.00/1.97 | (14) intersection_point(all_20_2, all_20_3) = all_20_0
% 9.00/1.97 |
% 9.00/1.97 | GROUND_INST: instantiating (ceq3) with all_20_4, all_20_3, simplifying with
% 9.00/1.97 | (5), (8), (9) gives:
% 9.00/1.97 | (15) distinct_lines(all_20_4, all_20_3)
% 9.00/1.97 |
% 9.00/1.97 | GROUND_INST: instantiating (1) with all_20_2, all_20_3, all_20_1, all_20_0,
% 9.00/1.97 | simplifying with (6), (7), (9), (10), (11), (14) gives:
% 9.00/1.97 | (16) distinct_points(all_20_1, all_20_0)
% 9.00/1.97 |
% 9.00/1.97 | GROUND_INST: instantiating (apart1) with all_20_1, simplifying with (11)
% 9.00/1.97 | gives:
% 9.00/1.97 | (17) ~ distinct_points(all_20_1, all_20_1)
% 9.00/1.97 |
% 9.00/1.98 | GROUND_INST: instantiating (cu1) with all_20_1, all_20_0, all_20_4, all_20_3,
% 9.00/1.98 | simplifying with (4), (8), (9), (11), (12), (15), (16) gives:
% 9.00/1.98 | (18) apart_point_and_line(all_20_0, all_20_3) |
% 9.00/1.98 | apart_point_and_line(all_20_1, all_20_3) |
% 9.00/1.98 | apart_point_and_line(all_20_1, all_20_4)
% 9.00/1.98 |
% 9.00/1.98 | BETA: splitting (18) gives:
% 9.00/1.98 |
% 9.00/1.98 | Case 1:
% 9.00/1.98 | |
% 9.00/1.98 | | (19) apart_point_and_line(all_20_0, all_20_3)
% 9.00/1.98 | |
% 9.00/1.98 | | GROUND_INST: instantiating (2) with all_20_2, all_20_3, all_20_0, all_20_0,
% 9.00/1.98 | | simplifying with (6), (9), (10), (12), (14), (19) gives:
% 9.00/1.98 | | (20) distinct_points(all_20_0, all_20_0)
% 9.00/1.98 | |
% 9.00/1.98 | | GROUND_INST: instantiating (apart1) with all_20_0, simplifying with (12),
% 9.00/1.98 | | (20) gives:
% 9.00/1.98 | | (21) $false
% 9.00/1.98 | |
% 9.00/1.98 | | CLOSE: (21) is inconsistent.
% 9.00/1.98 | |
% 9.00/1.98 | Case 2:
% 9.00/1.98 | |
% 9.00/1.98 | | (22) apart_point_and_line(all_20_1, all_20_3) |
% 9.00/1.98 | | apart_point_and_line(all_20_1, all_20_4)
% 9.00/1.98 | |
% 9.00/1.98 | | BETA: splitting (22) gives:
% 9.00/1.98 | |
% 9.00/1.98 | | Case 1:
% 9.00/1.98 | | |
% 9.00/1.98 | | | (23) apart_point_and_line(all_20_1, all_20_3)
% 9.00/1.98 | | |
% 9.00/1.98 | | | GROUND_INST: instantiating (2) with all_20_4, all_20_3, all_20_1,
% 9.00/1.98 | | | all_20_1, simplifying with (5), (8), (9), (11), (13), (17),
% 9.00/1.98 | | | (23) gives:
% 9.00/1.98 | | | (24) $false
% 9.00/1.98 | | |
% 9.00/1.98 | | | CLOSE: (24) is inconsistent.
% 9.00/1.98 | | |
% 9.00/1.98 | | Case 2:
% 9.00/1.98 | | |
% 9.00/1.98 | | | (25) apart_point_and_line(all_20_1, all_20_4)
% 9.00/1.98 | | |
% 9.00/1.98 | | | GROUND_INST: instantiating (1) with all_20_4, all_20_3, all_20_1,
% 9.00/1.98 | | | all_20_1, simplifying with (5), (8), (9), (11), (13), (17),
% 9.00/1.98 | | | (25) gives:
% 9.00/1.98 | | | (26) $false
% 9.00/1.98 | | |
% 9.00/1.98 | | | CLOSE: (26) is inconsistent.
% 9.00/1.98 | | |
% 9.00/1.98 | | End of split
% 9.00/1.98 | |
% 9.00/1.98 | End of split
% 9.00/1.98 |
% 9.00/1.98 End of proof
% 9.00/1.98 % SZS output end Proof for theBenchmark
% 9.00/1.98
% 9.00/1.98 1320ms
%------------------------------------------------------------------------------