↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : CSR053+1 : TPTP v8.1.2. Released v3.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 21:36:53 EDT 2023

% Result   : Theorem 4.12s 1.27s
% Output   : Proof 6.57s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR053+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33  % Computer : n028.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 : Mon Aug 28 13:30:39 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.18/0.59  ________       _____
% 0.18/0.59  ___  __ \_________(_)________________________________
% 0.18/0.59  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.18/0.59  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.18/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.18/0.60  
% 0.18/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.60  (2023-06-19)
% 0.18/0.60  
% 0.18/0.60  (c) Philipp Rümmer, 2009-2023
% 0.18/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.60                Amanda Stjerna.
% 0.18/0.60  Free software under BSD-3-Clause.
% 0.18/0.60  
% 0.18/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.60  
% 0.18/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.61  Running up to 7 provers in parallel.
% 0.18/0.62  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.62  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.62  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.62  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.62  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.62  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.62  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.41/1.01  Prover 1: Preprocessing ...
% 2.41/1.01  Prover 4: Preprocessing ...
% 2.41/1.05  Prover 5: Preprocessing ...
% 2.41/1.05  Prover 0: Preprocessing ...
% 2.41/1.05  Prover 6: Preprocessing ...
% 2.41/1.05  Prover 2: Preprocessing ...
% 2.41/1.05  Prover 3: Preprocessing ...
% 4.12/1.24  Prover 2: Constructing countermodel ...
% 4.12/1.24  Prover 5: Constructing countermodel ...
% 4.12/1.26  Prover 5: proved (643ms)
% 4.12/1.26  
% 4.12/1.27  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.12/1.27  
% 4.12/1.27  Prover 2: proved (656ms)
% 4.12/1.27  
% 4.12/1.27  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.12/1.27  
% 4.12/1.28  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.12/1.30  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.86/1.37  Prover 7: Preprocessing ...
% 4.86/1.37  Prover 8: Preprocessing ...
% 4.86/1.40  Prover 6: Constructing countermodel ...
% 5.42/1.42  Prover 6: stopped
% 5.42/1.42  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.42/1.43  Prover 3: Constructing countermodel ...
% 5.42/1.44  Prover 1: Constructing countermodel ...
% 5.42/1.45  Prover 3: stopped
% 5.42/1.46  Prover 7: Constructing countermodel ...
% 5.42/1.46  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.42/1.47  Prover 10: Preprocessing ...
% 5.42/1.50  Prover 11: Preprocessing ...
% 6.07/1.52  Prover 4: Constructing countermodel ...
% 6.07/1.52  Prover 0: Proving ...
% 6.07/1.53  Prover 7: Found proof (size 7)
% 6.07/1.53  Prover 7: proved (250ms)
% 6.07/1.53  Prover 1: stopped
% 6.07/1.53  Prover 0: stopped
% 6.07/1.55  Prover 4: stopped
% 6.07/1.55  Prover 8: Warning: ignoring some quantifiers
% 6.07/1.56  Prover 10: Constructing countermodel ...
% 6.07/1.56  Prover 10: stopped
% 6.07/1.56  Prover 8: Constructing countermodel ...
% 6.07/1.57  Prover 11: stopped
% 6.07/1.57  Prover 8: stopped
% 6.07/1.57  
% 6.07/1.57  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.07/1.57  
% 6.07/1.57  % SZS output start Proof for theBenchmark
% 6.07/1.58  Assumptions after simplification:
% 6.07/1.58  ---------------------------------
% 6.07/1.58  
% 6.07/1.58    (just1)
% 6.57/1.58    $i(c_georegion_l4_x35_y7) & $i(c_georegion_l3_x11_y2) &
% 6.57/1.58    $i(c_tptpgeo_member1_mt) & ( ~ mtvisible(c_tptpgeo_member1_mt) |
% 6.57/1.58      geographicalsubregions(c_georegion_l3_x11_y2, c_georegion_l4_x35_y7))
% 6.57/1.58  
% 6.57/1.58    (query53)
% 6.57/1.59    $i(c_georegion_l4_x35_y7) & $i(c_georegion_l3_x11_y2) &
% 6.57/1.59    $i(c_tptpgeo_member1_mt) & mtvisible(c_tptpgeo_member1_mt) &  ~
% 6.57/1.59    geographicalsubregions(c_georegion_l3_x11_y2, c_georegion_l4_x35_y7)
% 6.57/1.59  
% 6.57/1.59  Further assumptions not needed in the proof:
% 6.57/1.59  --------------------------------------------
% 6.57/1.59  just10, just11, just12, just13, just14, just15, just16, just17, just18, just19,
% 6.57/1.59  just2, just20, just21, just22, just23, just24, just25, just26, just27, just28,
% 6.57/1.59  just29, just3, just4, just5, just6, just7, just8, just9
% 6.57/1.59  
% 6.57/1.59  Those formulas are unsatisfiable:
% 6.57/1.59  ---------------------------------
% 6.57/1.59  
% 6.57/1.59  Begin of proof
% 6.57/1.59  | 
% 6.57/1.59  | ALPHA: (query53) implies:
% 6.57/1.59  |   (1)   ~ geographicalsubregions(c_georegion_l3_x11_y2, c_georegion_l4_x35_y7)
% 6.57/1.59  |   (2)  mtvisible(c_tptpgeo_member1_mt)
% 6.57/1.59  | 
% 6.57/1.59  | ALPHA: (just1) implies:
% 6.57/1.59  |   (3)   ~ mtvisible(c_tptpgeo_member1_mt) |
% 6.57/1.59  |        geographicalsubregions(c_georegion_l3_x11_y2, c_georegion_l4_x35_y7)
% 6.57/1.59  | 
% 6.57/1.59  | BETA: splitting (3) gives:
% 6.57/1.59  | 
% 6.57/1.59  | Case 1:
% 6.57/1.59  | | 
% 6.57/1.59  | |   (4)   ~ mtvisible(c_tptpgeo_member1_mt)
% 6.57/1.59  | | 
% 6.57/1.59  | | PRED_UNIFY: (2), (4) imply:
% 6.57/1.59  | |   (5)  $false
% 6.57/1.59  | | 
% 6.57/1.59  | | CLOSE: (5) is inconsistent.
% 6.57/1.59  | | 
% 6.57/1.59  | Case 2:
% 6.57/1.59  | | 
% 6.57/1.59  | |   (6)  geographicalsubregions(c_georegion_l3_x11_y2, c_georegion_l4_x35_y7)
% 6.57/1.59  | | 
% 6.57/1.59  | | PRED_UNIFY: (1), (6) imply:
% 6.57/1.59  | |   (7)  $false
% 6.57/1.59  | | 
% 6.57/1.59  | | CLOSE: (7) is inconsistent.
% 6.57/1.59  | | 
% 6.57/1.59  | End of split
% 6.57/1.59  | 
% 6.57/1.59  End of proof
% 6.57/1.59  % SZS output end Proof for theBenchmark
% 6.57/1.59  
% 6.57/1.59  997ms
%------------------------------------------------------------------------------