TSTP Solution File: GEO251+3 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n017.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:46 EDT 2023
% Result : Theorem 9.43s 2.00s
% Output : Proof 14.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 22:29:43 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.58 ________ _____
% 0.18/0.58 ___ __ \_________(_)________________________________
% 0.18/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.58
% 0.18/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.58 (2023-06-19)
% 0.18/0.58
% 0.18/0.58 (c) Philipp Rümmer, 2009-2023
% 0.18/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.58 Amanda Stjerna.
% 0.18/0.58 Free software under BSD-3-Clause.
% 0.18/0.58
% 0.18/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.58
% 0.18/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.59 Running up to 7 provers in parallel.
% 0.18/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.47/1.17 Prover 4: Preprocessing ...
% 3.47/1.17 Prover 1: Preprocessing ...
% 3.47/1.19 Prover 0: Preprocessing ...
% 3.47/1.19 Prover 5: Preprocessing ...
% 3.47/1.19 Prover 3: Preprocessing ...
% 3.47/1.19 Prover 2: Preprocessing ...
% 3.47/1.19 Prover 6: Preprocessing ...
% 7.41/1.68 Prover 5: Proving ...
% 8.04/1.76 Prover 2: Proving ...
% 8.24/1.78 Prover 6: Constructing countermodel ...
% 8.24/1.82 Prover 3: Constructing countermodel ...
% 8.56/1.83 Prover 1: Constructing countermodel ...
% 8.68/1.90 Prover 3: gave up
% 8.68/1.91 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.68/1.91 Prover 6: gave up
% 8.68/1.91 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.68/1.91 Prover 1: gave up
% 8.68/1.93 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 9.43/2.00 Prover 2: proved (1399ms)
% 9.43/2.00
% 9.43/2.00 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.43/2.00
% 9.43/2.02 Prover 5: stopped
% 9.43/2.02 Prover 9: Preprocessing ...
% 9.43/2.02 Prover 8: Preprocessing ...
% 9.43/2.02 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.43/2.02 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.43/2.02 Prover 7: Preprocessing ...
% 9.99/2.08 Prover 10: Preprocessing ...
% 9.99/2.08 Prover 11: Preprocessing ...
% 10.66/2.15 Prover 7: Warning: ignoring some quantifiers
% 10.66/2.17 Prover 10: Warning: ignoring some quantifiers
% 10.66/2.18 Prover 7: Constructing countermodel ...
% 11.16/2.21 Prover 10: Constructing countermodel ...
% 11.16/2.24 Prover 4: Constructing countermodel ...
% 11.16/2.25 Prover 8: Warning: ignoring some quantifiers
% 11.78/2.27 Prover 8: Constructing countermodel ...
% 12.15/2.33 Prover 10: gave up
% 12.15/2.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 12.31/2.35 Prover 0: Proving ...
% 12.31/2.38 Prover 0: stopped
% 12.31/2.38 Prover 13: Preprocessing ...
% 12.31/2.39 Prover 8: gave up
% 12.31/2.39 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 12.31/2.40 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 12.31/2.40 Prover 7: gave up
% 12.96/2.46 Prover 16: Preprocessing ...
% 12.96/2.46 Prover 19: Preprocessing ...
% 13.44/2.53 Prover 16: Warning: ignoring some quantifiers
% 13.44/2.54 Prover 13: Warning: ignoring some quantifiers
% 13.44/2.55 Prover 16: Constructing countermodel ...
% 13.44/2.56 Prover 13: Constructing countermodel ...
% 14.05/2.57 Prover 9: Constructing countermodel ...
% 14.05/2.58 Prover 11: Constructing countermodel ...
% 14.05/2.58 Prover 9: stopped
% 14.05/2.64 Prover 19: Warning: ignoring some quantifiers
% 14.05/2.65 Prover 4: Found proof (size 10)
% 14.05/2.65 Prover 4: proved (2033ms)
% 14.05/2.65 Prover 13: stopped
% 14.05/2.65 Prover 16: stopped
% 14.48/2.66 Prover 11: stopped
% 14.48/2.66 Prover 19: Constructing countermodel ...
% 14.48/2.67 Prover 19: stopped
% 14.48/2.67
% 14.48/2.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.48/2.67
% 14.48/2.67 % SZS output start Proof for theBenchmark
% 14.48/2.68 Assumptions after simplification:
% 14.48/2.68 ---------------------------------
% 14.48/2.68
% 14.48/2.68 (a2_defns)
% 14.95/2.72 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 14.95/2.72 (left_apart_point(v0, v2) = v3) | ~ (reverse_line(v1) = v2) | ~ $i(v1) |
% 14.95/2.72 ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & right_apart_point(v0, v1) = v4)) &
% 14.95/2.72 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (right_apart_point(v0,
% 14.95/2.72 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4
% 14.95/2.72 = 0) & left_apart_point(v0, v3) = v4 & reverse_line(v1) = v3 & $i(v3)))
% 14.95/2.72 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0)
% 14.95/2.72 | ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0) | right_apart_point(v0,
% 14.95/2.72 v1) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (right_apart_point(v0, v1) = 0)
% 14.95/2.72 | ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : (left_apart_point(v0, v2) = 0 &
% 14.95/2.72 reverse_line(v1) = v2 & $i(v2)))
% 14.95/2.72
% 14.95/2.72 (ax10_basics)
% 14.95/2.72 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0) |
% 14.95/2.72 ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1:
% 14.95/2.72 $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0))
% 14.95/2.72
% 14.95/2.72 (con)
% 14.95/2.73 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 14.95/2.73 int] : ( ~ (v5 = 0) & parallel_through_point(v2, v1) = v4 &
% 14.95/2.73 parallel_through_point(v2, v0) = v3 & left_apart_point(v0, v4) = v5 &
% 14.95/2.73 right_apart_point(v1, v3) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 14.95/2.73
% 14.95/2.73 Further assumptions not needed in the proof:
% 14.95/2.73 --------------------------------------------
% 14.95/2.73 a1_defns, a3_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns, a9_defns,
% 14.95/2.73 ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs, ax1_uniq_cons,
% 14.95/2.73 ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, ax3_cons_objs,
% 14.95/2.73 ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, ax5_cons_objs,
% 14.95/2.73 ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics, ax8_cons_objs,
% 14.95/2.73 ax9_basics, ax9_cons_objs
% 14.95/2.73
% 14.95/2.73 Those formulas are unsatisfiable:
% 14.95/2.73 ---------------------------------
% 14.95/2.73
% 14.95/2.73 Begin of proof
% 14.95/2.73 |
% 14.95/2.73 | ALPHA: (a2_defns) implies:
% 14.95/2.73 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (right_apart_point(v0, v1) = 0) | ~
% 14.95/2.73 | $i(v1) | ~ $i(v0) | ? [v2: $i] : (left_apart_point(v0, v2) = 0 &
% 14.95/2.73 | reverse_line(v1) = v2 & $i(v2)))
% 14.95/2.73 |
% 14.95/2.73 | ALPHA: (ax10_basics) implies:
% 14.95/2.73 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~
% 14.95/2.73 | $i(v1) | ~ $i(v0))
% 14.95/2.73 |
% 14.95/2.73 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2,
% 14.95/2.73 | all_39_3, all_39_4, all_39_5 gives:
% 14.95/2.74 | (3) ~ (all_39_0 = 0) & parallel_through_point(all_39_3, all_39_4) =
% 14.95/2.74 | all_39_1 & parallel_through_point(all_39_3, all_39_5) = all_39_2 &
% 14.95/2.74 | left_apart_point(all_39_5, all_39_1) = all_39_0 &
% 14.95/2.74 | right_apart_point(all_39_4, all_39_2) = 0 & $i(all_39_1) & $i(all_39_2)
% 14.95/2.74 | & $i(all_39_3) & $i(all_39_4) & $i(all_39_5)
% 14.95/2.74 |
% 14.95/2.74 | ALPHA: (3) implies:
% 14.95/2.74 | (4) $i(all_39_4)
% 14.95/2.74 | (5) $i(all_39_2)
% 14.95/2.74 | (6) right_apart_point(all_39_4, all_39_2) = 0
% 14.95/2.74 |
% 14.95/2.74 | GROUND_INST: instantiating (1) with all_39_4, all_39_2, simplifying with (4),
% 14.95/2.74 | (5), (6) gives:
% 14.95/2.74 | (7) ? [v0: $i] : (left_apart_point(all_39_4, v0) = 0 &
% 14.95/2.74 | reverse_line(all_39_2) = v0 & $i(v0))
% 14.95/2.74 |
% 14.95/2.74 | DELTA: instantiating (7) with fresh symbol all_53_0 gives:
% 14.95/2.74 | (8) left_apart_point(all_39_4, all_53_0) = 0 & reverse_line(all_39_2) =
% 14.95/2.74 | all_53_0 & $i(all_53_0)
% 14.95/2.74 |
% 14.95/2.74 | ALPHA: (8) implies:
% 14.95/2.74 | (9) $i(all_53_0)
% 14.95/2.74 | (10) left_apart_point(all_39_4, all_53_0) = 0
% 14.95/2.74 |
% 14.95/2.74 | GROUND_INST: instantiating (2) with all_39_4, all_53_0, simplifying with (4),
% 14.95/2.74 | (9), (10) gives:
% 14.95/2.74 | (11) $false
% 14.95/2.74 |
% 14.95/2.74 | CLOSE: (11) is inconsistent.
% 14.95/2.74 |
% 14.95/2.74 End of proof
% 14.95/2.74 % SZS output end Proof for theBenchmark
% 14.95/2.74
% 14.95/2.74 2162ms
%------------------------------------------------------------------------------