TSTP Solution File: GEO235+3 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO235+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 : n018.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:38 EDT 2023
% Result : Theorem 7.79s 1.87s
% Output : Proof 10.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO235+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 21:15:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.62 ________ _____
% 0.19/0.62 ___ __ \_________(_)________________________________
% 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.62
% 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.62 (2023-06-19)
% 0.19/0.62
% 0.19/0.62 (c) Philipp Rümmer, 2009-2023
% 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.62 Amanda Stjerna.
% 0.19/0.62 Free software under BSD-3-Clause.
% 0.19/0.62
% 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.62
% 0.19/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.63 Running up to 7 provers in parallel.
% 0.19/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.47/1.19 Prover 4: Preprocessing ...
% 3.47/1.19 Prover 1: Preprocessing ...
% 3.47/1.23 Prover 0: Preprocessing ...
% 3.47/1.25 Prover 3: Preprocessing ...
% 3.47/1.25 Prover 5: Preprocessing ...
% 3.47/1.25 Prover 6: Preprocessing ...
% 3.47/1.25 Prover 2: Preprocessing ...
% 7.01/1.72 Prover 5: Proving ...
% 7.01/1.77 Prover 2: Proving ...
% 7.79/1.81 Prover 6: Constructing countermodel ...
% 7.79/1.81 Prover 3: Constructing countermodel ...
% 7.79/1.82 Prover 1: Constructing countermodel ...
% 7.79/1.87 Prover 5: proved (1209ms)
% 7.79/1.87
% 7.79/1.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.79/1.87
% 7.79/1.88 Prover 2: stopped
% 7.79/1.89 Prover 3: stopped
% 7.79/1.89 Prover 6: proved (1214ms)
% 7.79/1.89
% 8.53/1.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.53/1.91
% 8.53/1.92 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.53/1.92 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.53/1.92 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.53/1.92 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 8.53/1.95 Prover 1: Found proof (size 5)
% 8.53/1.95 Prover 1: proved (1297ms)
% 9.20/1.99 Prover 8: Preprocessing ...
% 9.20/2.01 Prover 10: Preprocessing ...
% 9.20/2.01 Prover 11: Preprocessing ...
% 9.20/2.03 Prover 7: Preprocessing ...
% 9.20/2.05 Prover 10: stopped
% 9.20/2.06 Prover 7: stopped
% 10.03/2.10 Prover 4: Constructing countermodel ...
% 10.13/2.12 Prover 11: stopped
% 10.13/2.13 Prover 4: stopped
% 10.13/2.16 Prover 8: Warning: ignoring some quantifiers
% 10.13/2.17 Prover 8: Constructing countermodel ...
% 10.13/2.18 Prover 8: stopped
% 10.13/2.18 Prover 0: Proving ...
% 10.13/2.19 Prover 0: stopped
% 10.13/2.19
% 10.13/2.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.13/2.19
% 10.13/2.19 % SZS output start Proof for theBenchmark
% 10.68/2.20 Assumptions after simplification:
% 10.68/2.20 ---------------------------------
% 10.68/2.20
% 10.68/2.20 (ax10_basics)
% 10.68/2.22 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0) |
% 10.68/2.22 ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1:
% 10.68/2.23 $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0))
% 10.68/2.23
% 10.68/2.23 (con)
% 10.68/2.23 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) &
% 10.68/2.23 distinct_points(v0, v1) = v3 & left_apart_point(v0, v2) = 0 &
% 10.68/2.23 right_apart_point(v1, v2) = 0 & $i(v2) & $i(v1) & $i(v0))
% 10.68/2.23
% 10.68/2.23 Further assumptions not needed in the proof:
% 10.68/2.23 --------------------------------------------
% 10.68/2.23 a1_defns, a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns,
% 10.68/2.23 a9_defns, ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs,
% 10.68/2.23 ax1_uniq_cons, ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics,
% 10.68/2.23 ax3_cons_objs, ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics,
% 10.68/2.23 ax5_cons_objs, ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics,
% 10.68/2.23 ax8_cons_objs, ax9_basics, ax9_cons_objs
% 10.68/2.23
% 10.68/2.23 Those formulas are unsatisfiable:
% 10.68/2.23 ---------------------------------
% 10.68/2.23
% 10.68/2.23 Begin of proof
% 10.68/2.23 |
% 10.68/2.23 | ALPHA: (ax10_basics) implies:
% 10.68/2.23 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~
% 10.68/2.23 | $i(v1) | ~ $i(v0))
% 10.68/2.23 |
% 10.68/2.23 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2,
% 10.68/2.23 | all_39_3 gives:
% 10.68/2.23 | (2) ~ (all_39_0 = 0) & distinct_points(all_39_3, all_39_2) = all_39_0 &
% 10.68/2.23 | left_apart_point(all_39_3, all_39_1) = 0 & right_apart_point(all_39_2,
% 10.68/2.23 | all_39_1) = 0 & $i(all_39_1) & $i(all_39_2) & $i(all_39_3)
% 10.68/2.23 |
% 10.68/2.23 | ALPHA: (2) implies:
% 10.68/2.24 | (3) $i(all_39_3)
% 10.68/2.24 | (4) $i(all_39_1)
% 10.68/2.24 | (5) left_apart_point(all_39_3, all_39_1) = 0
% 10.68/2.24 |
% 10.68/2.24 | GROUND_INST: instantiating (1) with all_39_3, all_39_1, simplifying with (3),
% 10.68/2.24 | (4), (5) gives:
% 10.68/2.24 | (6) $false
% 10.68/2.24 |
% 10.68/2.24 | CLOSE: (6) is inconsistent.
% 10.68/2.24 |
% 10.68/2.24 End of proof
% 10.68/2.24 % SZS output end Proof for theBenchmark
% 10.68/2.24
% 10.68/2.24 1618ms
%------------------------------------------------------------------------------