TSTP Solution File: GEO211+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO211+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 : n006.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:22 EDT 2023
% Result : Theorem 5.79s 1.52s
% Output : Proof 7.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO211+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n006.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 22:29:21 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.59 ________ _____
% 0.20/0.59 ___ __ \_________(_)________________________________
% 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.59
% 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.59 (2023-06-19)
% 0.20/0.59
% 0.20/0.59 (c) Philipp Rümmer, 2009-2023
% 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.59 Amanda Stjerna.
% 0.20/0.59 Free software under BSD-3-Clause.
% 0.20/0.59
% 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.59
% 0.20/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.61 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.13/1.06 Prover 4: Preprocessing ...
% 2.13/1.06 Prover 1: Preprocessing ...
% 2.91/1.10 Prover 5: Preprocessing ...
% 2.91/1.10 Prover 2: Preprocessing ...
% 2.91/1.10 Prover 3: Preprocessing ...
% 2.91/1.10 Prover 6: Preprocessing ...
% 2.91/1.10 Prover 0: Preprocessing ...
% 4.71/1.42 Prover 5: Proving ...
% 4.71/1.43 Prover 2: Proving ...
% 5.38/1.44 Prover 3: Constructing countermodel ...
% 5.38/1.46 Prover 6: Constructing countermodel ...
% 5.38/1.46 Prover 1: Constructing countermodel ...
% 5.79/1.52 Prover 3: proved (901ms)
% 5.79/1.52
% 5.79/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.79/1.52
% 5.79/1.52 Prover 5: stopped
% 5.79/1.52 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.79/1.52 Prover 6: stopped
% 5.79/1.53 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.79/1.53 Prover 2: stopped
% 5.79/1.53 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.79/1.53 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.31/1.58 Prover 11: Preprocessing ...
% 6.31/1.58 Prover 1: Found proof (size 8)
% 6.31/1.58 Prover 1: proved (969ms)
% 6.31/1.59 Prover 7: Preprocessing ...
% 6.31/1.59 Prover 10: Preprocessing ...
% 6.31/1.60 Prover 8: Preprocessing ...
% 6.31/1.60 Prover 7: stopped
% 6.66/1.62 Prover 10: stopped
% 6.93/1.65 Prover 11: stopped
% 6.93/1.66 Prover 4: Constructing countermodel ...
% 6.93/1.67 Prover 0: Proving ...
% 6.93/1.68 Prover 4: stopped
% 6.93/1.68 Prover 0: stopped
% 6.93/1.68 Prover 8: Warning: ignoring some quantifiers
% 6.93/1.69 Prover 8: Constructing countermodel ...
% 6.93/1.69 Prover 8: stopped
% 6.93/1.69
% 6.93/1.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.93/1.69
% 6.93/1.70 % SZS output start Proof for theBenchmark
% 6.93/1.70 Assumptions after simplification:
% 6.93/1.70 ---------------------------------
% 6.93/1.70
% 6.93/1.70 (apart3)
% 6.93/1.73 ! [v0: $i] : ( ~ (convergent_lines(v0, v0) = 0) | ~ $i(v0))
% 6.93/1.73
% 6.93/1.73 (con)
% 6.93/1.73 ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & unorthogonal_lines(v0, v0) = v1 &
% 6.93/1.73 $i(v0))
% 6.93/1.73
% 6.93/1.73 (occu1)
% 6.93/1.73 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~
% 6.93/1.73 (unorthogonal_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) |
% 6.93/1.73 convergent_lines(v0, v1) = 0)
% 6.93/1.73
% 6.93/1.73 Further assumptions not needed in the proof:
% 6.93/1.73 --------------------------------------------
% 7.44/1.73 apart1, apart2, apart4, apart5, apart6, ceq1, ceq2, ceq3, con1, con2, cp1, cp2,
% 7.44/1.73 cu1, cup1, oac1, ooc1, ooc2, ouo1
% 7.44/1.73
% 7.44/1.73 Those formulas are unsatisfiable:
% 7.44/1.73 ---------------------------------
% 7.44/1.73
% 7.44/1.73 Begin of proof
% 7.44/1.73 |
% 7.44/1.73 | DELTA: instantiating (con) with fresh symbols all_23_0, all_23_1 gives:
% 7.44/1.73 | (1) ~ (all_23_0 = 0) & unorthogonal_lines(all_23_1, all_23_1) = all_23_0 &
% 7.44/1.73 | $i(all_23_1)
% 7.44/1.73 |
% 7.44/1.74 | ALPHA: (1) implies:
% 7.44/1.74 | (2) ~ (all_23_0 = 0)
% 7.44/1.74 | (3) $i(all_23_1)
% 7.44/1.74 | (4) unorthogonal_lines(all_23_1, all_23_1) = all_23_0
% 7.44/1.74 |
% 7.44/1.74 | GROUND_INST: instantiating (occu1) with all_23_1, all_23_1, all_23_0,
% 7.44/1.74 | simplifying with (3), (4) gives:
% 7.44/1.74 | (5) all_23_0 = 0 | convergent_lines(all_23_1, all_23_1) = 0
% 7.44/1.74 |
% 7.44/1.74 | BETA: splitting (5) gives:
% 7.44/1.74 |
% 7.44/1.74 | Case 1:
% 7.44/1.74 | |
% 7.44/1.74 | | (6) convergent_lines(all_23_1, all_23_1) = 0
% 7.44/1.74 | |
% 7.44/1.74 | | GROUND_INST: instantiating (apart3) with all_23_1, simplifying with (3), (6)
% 7.44/1.74 | | gives:
% 7.44/1.74 | | (7) $false
% 7.44/1.74 | |
% 7.44/1.74 | | CLOSE: (7) is inconsistent.
% 7.44/1.74 | |
% 7.44/1.74 | Case 2:
% 7.44/1.74 | |
% 7.44/1.74 | | (8) all_23_0 = 0
% 7.44/1.74 | |
% 7.44/1.74 | | REDUCE: (2), (8) imply:
% 7.44/1.74 | | (9) $false
% 7.44/1.74 | |
% 7.44/1.74 | | CLOSE: (9) is inconsistent.
% 7.44/1.74 | |
% 7.44/1.74 | End of split
% 7.44/1.74 |
% 7.44/1.74 End of proof
% 7.44/1.74 % SZS output end Proof for theBenchmark
% 7.44/1.74
% 7.44/1.74 1147ms
%------------------------------------------------------------------------------