TSTP Solution File: GEO264+3 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : GEO264+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 : n019.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:52 EDT 2023

% Result   : Theorem 8.35s 1.95s
% Output   : Proof 11.08s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : GEO264+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n019.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 23:19:12 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.66  ________       _____
% 0.19/0.66  ___  __ \_________(_)________________________________
% 0.19/0.66  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.66  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.66  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.66  
% 0.19/0.66  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.66  (2023-06-19)
% 0.19/0.66  
% 0.19/0.66  (c) Philipp Rümmer, 2009-2023
% 0.19/0.66  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.66                Amanda Stjerna.
% 0.19/0.66  Free software under BSD-3-Clause.
% 0.19/0.66  
% 0.19/0.66  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.66  
% 0.19/0.66  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.67  Running up to 7 provers in parallel.
% 0.19/0.68  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.68  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.68  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.68  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.68  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.68  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.19/0.68  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 3.09/1.18  Prover 1: Preprocessing ...
% 3.09/1.18  Prover 4: Preprocessing ...
% 3.60/1.23  Prover 5: Preprocessing ...
% 3.60/1.23  Prover 2: Preprocessing ...
% 3.60/1.23  Prover 0: Preprocessing ...
% 3.60/1.23  Prover 3: Preprocessing ...
% 3.60/1.23  Prover 6: Preprocessing ...
% 7.56/1.78  Prover 5: Proving ...
% 7.56/1.81  Prover 2: Proving ...
% 8.04/1.82  Prover 6: Constructing countermodel ...
% 8.04/1.82  Prover 1: Constructing countermodel ...
% 8.04/1.85  Prover 3: Constructing countermodel ...
% 8.35/1.95  Prover 5: proved (1258ms)
% 8.35/1.95  
% 8.35/1.95  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.35/1.95  
% 8.35/1.95  Prover 2: stopped
% 8.35/1.97  Prover 3: proved (1267ms)
% 8.35/1.97  
% 8.35/1.97  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.35/1.97  
% 8.35/1.98  Prover 6: proved (1266ms)
% 8.35/1.98  
% 8.35/1.98  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.35/1.98  
% 8.35/1.99  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.35/1.99  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.35/1.99  Prover 1: Found proof (size 5)
% 8.35/1.99  Prover 1: proved (1299ms)
% 8.35/2.00  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.35/2.00  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.70/2.05  Prover 7: Preprocessing ...
% 9.70/2.06  Prover 8: Preprocessing ...
% 9.70/2.07  Prover 10: Preprocessing ...
% 9.70/2.08  Prover 7: stopped
% 9.70/2.09  Prover 11: Preprocessing ...
% 9.70/2.09  Prover 10: stopped
% 10.13/2.13  Prover 4: Constructing countermodel ...
% 10.49/2.16  Prover 4: stopped
% 10.49/2.19  Prover 8: Warning: ignoring some quantifiers
% 10.49/2.20  Prover 0: Proving ...
% 10.49/2.21  Prover 8: Constructing countermodel ...
% 10.49/2.21  Prover 0: stopped
% 10.49/2.22  Prover 8: stopped
% 10.49/2.22  Prover 11: stopped
% 10.49/2.22  
% 10.49/2.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.49/2.22  
% 10.49/2.22  % SZS output start Proof for theBenchmark
% 10.49/2.23  Assumptions after simplification:
% 10.49/2.23  ---------------------------------
% 10.49/2.23  
% 10.49/2.23    (ax10_basics)
% 11.08/2.25     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (left_apart_point(v0, v2) = 0) |
% 11.08/2.25       ~ (reverse_line(v1) = v2) |  ~ $i(v1) |  ~ $i(v0)) &  ! [v0: $i] :  ! [v1:
% 11.08/2.25      $i] : ( ~ (left_apart_point(v0, v1) = 0) |  ~ $i(v1) |  ~ $i(v0))
% 11.08/2.25  
% 11.08/2.25    (con)
% 11.08/2.26     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 11.08/2.26      $i] :  ? [v6: $i] :  ? [v7: int] : ( ~ (v7 = 0) & line_connecting(v2, v0) =
% 11.08/2.26      v6 & line_connecting(v1, v2) = v5 & line_connecting(v0, v1) = v4 &
% 11.08/2.26      left_apart_point(v3, v4) = v7 & left_apart_point(v2, v4) = 0 &
% 11.08/2.26      right_apart_point(v3, v6) = 0 & right_apart_point(v3, v5) = 0 & $i(v6) &
% 11.08/2.26      $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 11.08/2.26  
% 11.08/2.26  Further assumptions not needed in the proof:
% 11.08/2.26  --------------------------------------------
% 11.08/2.26  a1_defns, a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns,
% 11.08/2.26  a9_defns, ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs,
% 11.08/2.26  ax1_uniq_cons, ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics,
% 11.08/2.26  ax3_cons_objs, ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics,
% 11.08/2.26  ax5_cons_objs, ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics,
% 11.08/2.26  ax8_cons_objs, ax9_basics, ax9_cons_objs
% 11.08/2.26  
% 11.08/2.26  Those formulas are unsatisfiable:
% 11.08/2.26  ---------------------------------
% 11.08/2.26  
% 11.08/2.26  Begin of proof
% 11.08/2.26  | 
% 11.08/2.26  | ALPHA: (ax10_basics) implies:
% 11.08/2.26  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) |  ~
% 11.08/2.26  |          $i(v1) |  ~ $i(v0))
% 11.08/2.26  | 
% 11.08/2.26  | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2,
% 11.08/2.26  |        all_39_3, all_39_4, all_39_5, all_39_6, all_39_7 gives:
% 11.08/2.26  |   (2)   ~ (all_39_0 = 0) & line_connecting(all_39_5, all_39_7) = all_39_1 &
% 11.08/2.26  |        line_connecting(all_39_6, all_39_5) = all_39_2 &
% 11.08/2.26  |        line_connecting(all_39_7, all_39_6) = all_39_3 &
% 11.08/2.26  |        left_apart_point(all_39_4, all_39_3) = all_39_0 &
% 11.08/2.26  |        left_apart_point(all_39_5, all_39_3) = 0 & right_apart_point(all_39_4,
% 11.08/2.26  |          all_39_1) = 0 & right_apart_point(all_39_4, all_39_2) = 0 &
% 11.08/2.26  |        $i(all_39_1) & $i(all_39_2) & $i(all_39_3) & $i(all_39_4) &
% 11.08/2.26  |        $i(all_39_5) & $i(all_39_6) & $i(all_39_7)
% 11.08/2.26  | 
% 11.08/2.26  | ALPHA: (2) implies:
% 11.08/2.26  |   (3)  $i(all_39_5)
% 11.08/2.26  |   (4)  $i(all_39_3)
% 11.08/2.26  |   (5)  left_apart_point(all_39_5, all_39_3) = 0
% 11.08/2.26  | 
% 11.08/2.27  | GROUND_INST: instantiating (1) with all_39_5, all_39_3, simplifying with (3),
% 11.08/2.27  |              (4), (5) gives:
% 11.08/2.27  |   (6)  $false
% 11.08/2.27  | 
% 11.08/2.27  | CLOSE: (6) is inconsistent.
% 11.08/2.27  | 
% 11.08/2.27  End of proof
% 11.08/2.27  % SZS output end Proof for theBenchmark
% 11.08/2.27  
% 11.08/2.27  1609ms
%------------------------------------------------------------------------------