TSTP Solution File: GEO242+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO242+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 : 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:41 EDT 2023
% Result : Theorem 8.11s 1.81s
% Output : Proof 10.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO242+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 20:50:56 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.64/0.63 ________ _____
% 0.64/0.63 ___ __ \_________(_)________________________________
% 0.64/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.64/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.64/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.64/0.63
% 0.64/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.64/0.63 (2023-06-19)
% 0.64/0.63
% 0.64/0.63 (c) Philipp Rümmer, 2009-2023
% 0.64/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.64/0.63 Amanda Stjerna.
% 0.64/0.63 Free software under BSD-3-Clause.
% 0.64/0.63
% 0.64/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.64/0.63
% 0.64/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.64/0.65 Running up to 7 provers in parallel.
% 0.64/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.64/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.64/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.64/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.64/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.64/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.64/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.29/1.14 Prover 4: Preprocessing ...
% 3.29/1.14 Prover 1: Preprocessing ...
% 3.29/1.18 Prover 3: Preprocessing ...
% 3.29/1.18 Prover 0: Preprocessing ...
% 3.29/1.18 Prover 2: Preprocessing ...
% 3.29/1.18 Prover 6: Preprocessing ...
% 3.29/1.18 Prover 5: Preprocessing ...
% 7.12/1.65 Prover 5: Proving ...
% 7.12/1.68 Prover 3: Constructing countermodel ...
% 7.12/1.70 Prover 6: Constructing countermodel ...
% 7.77/1.75 Prover 1: Constructing countermodel ...
% 7.77/1.76 Prover 2: Proving ...
% 8.11/1.81 Prover 3: proved (1156ms)
% 8.11/1.81
% 8.11/1.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.11/1.81
% 8.11/1.81 Prover 6: stopped
% 8.11/1.81 Prover 2: stopped
% 8.11/1.81 Prover 5: stopped
% 8.11/1.82 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.11/1.82 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.11/1.82 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.11/1.84 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 8.93/1.92 Prover 1: Found proof (size 5)
% 8.93/1.92 Prover 1: proved (1269ms)
% 8.93/1.96 Prover 11: Preprocessing ...
% 9.35/1.96 Prover 10: Preprocessing ...
% 9.35/1.97 Prover 7: Preprocessing ...
% 9.35/1.97 Prover 8: Preprocessing ...
% 9.35/1.99 Prover 7: stopped
% 9.35/2.00 Prover 10: stopped
% 9.35/2.04 Prover 4: Constructing countermodel ...
% 10.04/2.06 Prover 4: stopped
% 10.04/2.07 Prover 11: stopped
% 10.28/2.09 Prover 8: Warning: ignoring some quantifiers
% 10.28/2.11 Prover 8: Constructing countermodel ...
% 10.28/2.11 Prover 0: Proving ...
% 10.28/2.11 Prover 8: stopped
% 10.28/2.12 Prover 0: stopped
% 10.28/2.12
% 10.28/2.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.28/2.12
% 10.28/2.12 % SZS output start Proof for theBenchmark
% 10.28/2.13 Assumptions after simplification:
% 10.28/2.13 ---------------------------------
% 10.28/2.13
% 10.28/2.13 (con)
% 10.58/2.16 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ? [v4: $i] : ? [v5:
% 10.58/2.16 $i] : ? [v6: $i] : ? [v7: int] : ( ~ (v7 = 0) & ~ (v3 = 0) &
% 10.58/2.16 left_convergent_lines(v2, v5) = 0 & line_connecting(v0, v1) = v4 &
% 10.58/2.16 distinct_points(v0, v1) = 0 & reverse_line(v4) = v5 & reverse_line(v2) = v6
% 10.58/2.16 & apart_point_and_line(v0, v2) = v3 & left_apart_point(v1, v6) = v7 & $i(v6)
% 10.58/2.16 & $i(v5) & $i(v4) & $i(v2) & $i(v1) & $i(v0))
% 10.58/2.16
% 10.58/2.16 (oag11)
% 10.58/2.16 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_convergent_lines(v0, v2) =
% 10.58/2.16 0) | ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] :
% 10.58/2.16 ! [v1: $i] : ( ~ (left_convergent_lines(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0))
% 10.58/2.16
% 10.58/2.16 Further assumptions not needed in the proof:
% 10.58/2.16 --------------------------------------------
% 10.58/2.16 apt_def, bet_def, bf_def, con_def, div_def, oag1, oag10, oag2, oag3, oag4, oag5,
% 10.58/2.16 oag6, oag7, oag8, oag9, oagco1, oagco10, oagco2, oagco3, oagco4, oagco5, oagco6,
% 10.58/2.16 oagco7, oagco8, oagco9, oagsub1, oagsub2, oagsub3, oaguc1, oaguc2
% 10.58/2.16
% 10.58/2.16 Those formulas are unsatisfiable:
% 10.58/2.16 ---------------------------------
% 10.58/2.16
% 10.58/2.16 Begin of proof
% 10.58/2.16 |
% 10.58/2.16 | ALPHA: (oag11) implies:
% 10.58/2.16 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (left_convergent_lines(v0, v1) = 0) |
% 10.58/2.16 | ~ $i(v1) | ~ $i(v0))
% 10.58/2.16 |
% 10.58/2.16 | DELTA: instantiating (con) with fresh symbols all_34_0, all_34_1, all_34_2,
% 10.58/2.16 | all_34_3, all_34_4, all_34_5, all_34_6, all_34_7 gives:
% 10.58/2.17 | (2) ~ (all_34_0 = 0) & ~ (all_34_4 = 0) & left_convergent_lines(all_34_5,
% 10.58/2.17 | all_34_2) = 0 & line_connecting(all_34_7, all_34_6) = all_34_3 &
% 10.58/2.17 | distinct_points(all_34_7, all_34_6) = 0 & reverse_line(all_34_3) =
% 10.58/2.17 | all_34_2 & reverse_line(all_34_5) = all_34_1 &
% 10.58/2.17 | apart_point_and_line(all_34_7, all_34_5) = all_34_4 &
% 10.58/2.17 | left_apart_point(all_34_6, all_34_1) = all_34_0 & $i(all_34_1) &
% 10.58/2.17 | $i(all_34_2) & $i(all_34_3) & $i(all_34_5) & $i(all_34_6) &
% 10.58/2.17 | $i(all_34_7)
% 10.58/2.17 |
% 10.58/2.17 | ALPHA: (2) implies:
% 10.58/2.17 | (3) $i(all_34_5)
% 10.58/2.17 | (4) $i(all_34_2)
% 10.58/2.17 | (5) left_convergent_lines(all_34_5, all_34_2) = 0
% 10.58/2.17 |
% 10.58/2.17 | GROUND_INST: instantiating (1) with all_34_5, all_34_2, simplifying with (3),
% 10.58/2.17 | (4), (5) gives:
% 10.58/2.17 | (6) $false
% 10.58/2.17 |
% 10.58/2.17 | CLOSE: (6) is inconsistent.
% 10.58/2.17 |
% 10.58/2.17 End of proof
% 10.58/2.17 % SZS output end Proof for theBenchmark
% 10.58/2.17
% 10.58/2.17 1538ms
%------------------------------------------------------------------------------