↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SET883+1 : TPTP v8.1.2. Released v3.2.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 : Thu Aug 31 15:26:54 EDT 2023

% Result   : Theorem 3.52s 1.21s
% Output   : Proof 3.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET883+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33  % Computer : n006.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 : Sat Aug 26 08:53:22 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.59  ________       _____
% 0.19/0.59  ___  __ \_________(_)________________________________
% 0.19/0.59  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.59  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.59  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.59  
% 0.19/0.59  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.59  (2023-06-19)
% 0.19/0.59  
% 0.19/0.59  (c) Philipp Rümmer, 2009-2023
% 0.19/0.59  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.59                Amanda Stjerna.
% 0.19/0.59  Free software under BSD-3-Clause.
% 0.19/0.59  
% 0.19/0.59  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.59  
% 0.19/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.60  Running up to 7 provers in parallel.
% 0.19/0.62  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.62  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.62  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.62  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.62  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.62  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.62  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.68/0.97  Prover 1: Preprocessing ...
% 1.68/0.97  Prover 4: Preprocessing ...
% 1.68/1.02  Prover 6: Preprocessing ...
% 1.68/1.02  Prover 3: Preprocessing ...
% 1.68/1.02  Prover 5: Preprocessing ...
% 1.68/1.02  Prover 2: Preprocessing ...
% 2.28/1.02  Prover 0: Preprocessing ...
% 2.83/1.10  Prover 1: Warning: ignoring some quantifiers
% 2.83/1.10  Prover 3: Warning: ignoring some quantifiers
% 2.83/1.11  Prover 5: Proving ...
% 2.83/1.11  Prover 2: Proving ...
% 2.83/1.11  Prover 6: Proving ...
% 2.83/1.11  Prover 4: Constructing countermodel ...
% 2.83/1.11  Prover 1: Constructing countermodel ...
% 2.83/1.11  Prover 0: Proving ...
% 2.83/1.12  Prover 3: Constructing countermodel ...
% 3.52/1.20  Prover 0: proved (589ms)
% 3.52/1.21  
% 3.52/1.21  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.52/1.21  
% 3.52/1.21  Prover 3: proved (593ms)
% 3.52/1.21  
% 3.52/1.21  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.52/1.21  
% 3.52/1.21  Prover 6: proved (588ms)
% 3.52/1.21  
% 3.52/1.21  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.52/1.21  
% 3.52/1.22  Prover 2: proved (594ms)
% 3.52/1.22  
% 3.52/1.22  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.52/1.22  
% 3.52/1.22  Prover 5: stopped
% 3.66/1.24  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.66/1.24  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.66/1.24  Prover 7: Preprocessing ...
% 3.66/1.24  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.66/1.24  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.66/1.24  Prover 8: Preprocessing ...
% 3.66/1.24  Prover 11: Preprocessing ...
% 3.66/1.24  Prover 4: Found proof (size 5)
% 3.66/1.24  Prover 4: proved (619ms)
% 3.66/1.24  Prover 10: Preprocessing ...
% 3.66/1.24  Prover 1: Found proof (size 5)
% 3.66/1.24  Prover 1: proved (621ms)
% 3.66/1.24  Prover 7: Warning: ignoring some quantifiers
% 3.66/1.24  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.66/1.24  Prover 7: Constructing countermodel ...
% 3.66/1.24  Prover 7: stopped
% 3.66/1.24  Prover 13: Preprocessing ...
% 3.66/1.25  Prover 10: Warning: ignoring some quantifiers
% 3.66/1.25  Prover 10: Constructing countermodel ...
% 3.66/1.25  Prover 10: stopped
% 3.66/1.26  Prover 11: Constructing countermodel ...
% 3.66/1.27  Prover 11: stopped
% 3.66/1.27  Prover 8: Warning: ignoring some quantifiers
% 3.66/1.27  Prover 8: Constructing countermodel ...
% 3.66/1.27  Prover 8: stopped
% 3.66/1.28  Prover 13: Warning: ignoring some quantifiers
% 3.66/1.28  Prover 13: Constructing countermodel ...
% 3.66/1.28  Prover 13: stopped
% 3.66/1.28  
% 3.66/1.28  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.66/1.28  
% 3.66/1.29  % SZS output start Proof for theBenchmark
% 3.66/1.29  Assumptions after simplification:
% 3.66/1.29  ---------------------------------
% 3.66/1.29  
% 3.66/1.29    (t24_zfmisc_1)
% 3.66/1.33     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] : ( ~ (v1 = v0) &
% 3.66/1.33      singleton(v1) = v3 & singleton(v0) = v2 & subset(v2, v3) = 0 & $i(v3) &
% 3.66/1.33      $i(v2) & $i(v1) & $i(v0))
% 3.66/1.33  
% 3.66/1.33    (t6_zfmisc_1)
% 3.66/1.33     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 3.66/1.33      (singleton(v1) = v3) |  ~ (singleton(v0) = v2) |  ~ (subset(v2, v3) = 0) | 
% 3.66/1.33      ~ $i(v1) |  ~ $i(v0))
% 3.66/1.33  
% 3.66/1.33  Further assumptions not needed in the proof:
% 3.66/1.33  --------------------------------------------
% 3.66/1.33  rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski
% 3.66/1.33  
% 3.66/1.33  Those formulas are unsatisfiable:
% 3.66/1.33  ---------------------------------
% 3.66/1.33  
% 3.66/1.33  Begin of proof
% 3.66/1.33  | 
% 3.66/1.33  | DELTA: instantiating (t24_zfmisc_1) with fresh symbols all_9_0, all_9_1,
% 3.66/1.33  |        all_9_2, all_9_3 gives:
% 3.66/1.33  |   (1)   ~ (all_9_2 = all_9_3) & singleton(all_9_2) = all_9_0 &
% 3.66/1.33  |        singleton(all_9_3) = all_9_1 & subset(all_9_1, all_9_0) = 0 &
% 3.66/1.33  |        $i(all_9_0) & $i(all_9_1) & $i(all_9_2) & $i(all_9_3)
% 3.66/1.34  | 
% 3.66/1.34  | ALPHA: (1) implies:
% 3.66/1.34  |   (2)   ~ (all_9_2 = all_9_3)
% 3.66/1.34  |   (3)  $i(all_9_3)
% 3.66/1.34  |   (4)  $i(all_9_2)
% 3.66/1.34  |   (5)  subset(all_9_1, all_9_0) = 0
% 3.66/1.34  |   (6)  singleton(all_9_3) = all_9_1
% 3.66/1.34  |   (7)  singleton(all_9_2) = all_9_0
% 3.66/1.34  | 
% 3.66/1.34  | GROUND_INST: instantiating (t6_zfmisc_1) with all_9_3, all_9_2, all_9_1,
% 3.66/1.34  |              all_9_0, simplifying with (3), (4), (5), (6), (7) gives:
% 3.66/1.34  |   (8)  all_9_2 = all_9_3
% 3.66/1.34  | 
% 3.66/1.34  | REDUCE: (2), (8) imply:
% 3.66/1.34  |   (9)  $false
% 3.66/1.34  | 
% 3.66/1.34  | CLOSE: (9) is inconsistent.
% 3.66/1.34  | 
% 3.66/1.34  End of proof
% 3.66/1.34  % SZS output end Proof for theBenchmark
% 3.66/1.34  
% 3.66/1.34  750ms
%------------------------------------------------------------------------------