TSTP Solution File: GEO239+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO239+1 : TPTP v8.1.2. Bugfixed v6.4.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:40 EDT 2023
% Result : Theorem 7.49s 1.80s
% Output : Proof 10.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GEO239+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.07/0.12 % 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 18:33:58 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.59 ________ _____
% 0.19/0.59 ___ __ \_________(_)________________________________
% 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.59
% 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.59 (2023-06-19)
% 0.19/0.59
% 0.19/0.59 (c) Philipp Rümmer, 2009-2023
% 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.59 Amanda Stjerna.
% 0.19/0.59 Free software under BSD-3-Clause.
% 0.19/0.59
% 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.59
% 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.61 Running up to 7 provers in parallel.
% 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.98/1.16 Prover 4: Preprocessing ...
% 2.98/1.17 Prover 1: Preprocessing ...
% 3.37/1.20 Prover 6: Preprocessing ...
% 3.37/1.20 Prover 2: Preprocessing ...
% 3.37/1.20 Prover 5: Preprocessing ...
% 3.37/1.20 Prover 0: Preprocessing ...
% 3.37/1.21 Prover 3: Preprocessing ...
% 7.05/1.65 Prover 5: Proving ...
% 7.49/1.72 Prover 1: Constructing countermodel ...
% 7.49/1.73 Prover 6: Constructing countermodel ...
% 7.49/1.73 Prover 3: Constructing countermodel ...
% 7.49/1.73 Prover 2: Proving ...
% 7.49/1.80 Prover 6: proved (1182ms)
% 7.49/1.80 Prover 3: proved (1186ms)
% 7.49/1.80
% 7.49/1.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.49/1.80
% 7.49/1.80
% 7.49/1.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.49/1.80
% 7.96/1.81 Prover 2: stopped
% 7.96/1.81 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.96/1.81 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.96/1.81 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 7.96/1.81 Prover 5: proved (1193ms)
% 7.96/1.81
% 7.96/1.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.96/1.81
% 7.96/1.82 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 7.96/1.82 Prover 1: Found proof (size 5)
% 7.96/1.82 Prover 1: proved (1200ms)
% 8.79/1.91 Prover 7: Preprocessing ...
% 8.79/1.91 Prover 10: Preprocessing ...
% 8.79/1.91 Prover 11: Preprocessing ...
% 8.79/1.92 Prover 8: Preprocessing ...
% 8.79/1.94 Prover 7: stopped
% 8.79/1.94 Prover 10: stopped
% 9.63/2.01 Prover 11: stopped
% 9.63/2.04 Prover 4: Constructing countermodel ...
% 9.63/2.04 Prover 8: Warning: ignoring some quantifiers
% 9.96/2.06 Prover 4: stopped
% 9.96/2.06 Prover 8: Constructing countermodel ...
% 9.96/2.07 Prover 8: stopped
% 9.96/2.09 Prover 0: Proving ...
% 9.96/2.10 Prover 0: stopped
% 9.96/2.10
% 9.96/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.96/2.10
% 9.96/2.10 % SZS output start Proof for theBenchmark
% 9.96/2.10 Assumptions after simplification:
% 9.96/2.10 ---------------------------------
% 9.96/2.10
% 9.96/2.10 (con)
% 9.96/2.13 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ? [v4: $i] : ? [v5:
% 9.96/2.13 int] : ( ~ (v5 = 0) & ~ (v3 = 0) & left_convergent_lines(v2, v4) = v5 &
% 9.96/2.13 line_connecting(v0, v1) = v4 & apart_point_and_line(v0, v2) = v3 &
% 9.96/2.13 left_apart_point(v1, v2) = 0 & $i(v4) & $i(v2) & $i(v1) & $i(v0))
% 9.96/2.13
% 9.96/2.13 (oag10)
% 9.96/2.14 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~
% 9.96/2.14 (left_apart_point(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : !
% 9.96/2.14 [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0))
% 9.96/2.14
% 9.96/2.14 Further assumptions not needed in the proof:
% 9.96/2.14 --------------------------------------------
% 9.96/2.14 apt_def, bet_def, bf_def, con_def, div_def, oag1, oag11, oag2, oag3, oag4, oag5,
% 9.96/2.14 oag6, oag7, oag8, oag9, oagco1, oagco10, oagco2, oagco3, oagco4, oagco5, oagco6,
% 9.96/2.14 oagco7, oagco8, oagco9, oagsub1, oagsub2, oagsub3, oaguc1, oaguc2
% 9.96/2.14
% 9.96/2.14 Those formulas are unsatisfiable:
% 9.96/2.14 ---------------------------------
% 9.96/2.14
% 9.96/2.14 Begin of proof
% 9.96/2.14 |
% 9.96/2.14 | ALPHA: (oag10) implies:
% 9.96/2.14 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~
% 9.96/2.14 | $i(v1) | ~ $i(v0))
% 9.96/2.14 |
% 9.96/2.14 | DELTA: instantiating (con) with fresh symbols all_34_0, all_34_1, all_34_2,
% 9.96/2.14 | all_34_3, all_34_4, all_34_5 gives:
% 10.45/2.14 | (2) ~ (all_34_0 = 0) & ~ (all_34_2 = 0) & left_convergent_lines(all_34_3,
% 10.45/2.14 | all_34_1) = all_34_0 & line_connecting(all_34_5, all_34_4) = all_34_1
% 10.45/2.14 | & apart_point_and_line(all_34_5, all_34_3) = all_34_2 &
% 10.45/2.14 | left_apart_point(all_34_4, all_34_3) = 0 & $i(all_34_1) & $i(all_34_3)
% 10.45/2.14 | & $i(all_34_4) & $i(all_34_5)
% 10.45/2.14 |
% 10.45/2.14 | ALPHA: (2) implies:
% 10.45/2.15 | (3) $i(all_34_4)
% 10.45/2.15 | (4) $i(all_34_3)
% 10.45/2.15 | (5) left_apart_point(all_34_4, all_34_3) = 0
% 10.45/2.15 |
% 10.45/2.15 | GROUND_INST: instantiating (1) with all_34_4, all_34_3, simplifying with (3),
% 10.45/2.15 | (4), (5) gives:
% 10.45/2.15 | (6) $false
% 10.45/2.15 |
% 10.45/2.15 | CLOSE: (6) is inconsistent.
% 10.45/2.15 |
% 10.45/2.15 End of proof
% 10.45/2.15 % SZS output end Proof for theBenchmark
% 10.45/2.15
% 10.45/2.15 1553ms
%------------------------------------------------------------------------------