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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SEU163+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n021.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 17:42:57 EDT 2023

% Result   : Theorem 3.59s 1.22s
% Output   : Proof 4.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU163+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Aug 23 18:59:09 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/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.60  Running up to 7 provers in parallel.
% 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 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 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 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 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.86/0.98  Prover 1: Preprocessing ...
% 1.86/0.98  Prover 4: Preprocessing ...
% 1.86/1.03  Prover 2: Preprocessing ...
% 1.86/1.03  Prover 0: Preprocessing ...
% 1.86/1.03  Prover 6: Preprocessing ...
% 1.86/1.03  Prover 3: Preprocessing ...
% 2.48/1.04  Prover 5: Preprocessing ...
% 2.84/1.11  Prover 1: Warning: ignoring some quantifiers
% 2.84/1.12  Prover 3: Warning: ignoring some quantifiers
% 2.84/1.13  Prover 2: Proving ...
% 2.84/1.13  Prover 5: Proving ...
% 2.84/1.13  Prover 6: Proving ...
% 2.84/1.13  Prover 1: Constructing countermodel ...
% 2.84/1.13  Prover 3: Constructing countermodel ...
% 2.84/1.13  Prover 4: Constructing countermodel ...
% 3.23/1.15  Prover 0: Proving ...
% 3.59/1.21  Prover 3: proved (600ms)
% 3.59/1.22  
% 3.59/1.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.22  
% 3.59/1.22  Prover 6: stopped
% 3.59/1.22  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.59/1.22  Prover 2: proved (608ms)
% 3.59/1.22  
% 3.59/1.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.22  
% 3.59/1.23  Prover 5: proved (605ms)
% 3.59/1.23  
% 3.59/1.23  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.23  
% 3.59/1.24  Prover 0: stopped
% 3.89/1.25  Prover 7: Preprocessing ...
% 3.89/1.25  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.89/1.25  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.89/1.25  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.89/1.25  Prover 8: Preprocessing ...
% 3.89/1.25  Prover 10: Preprocessing ...
% 3.89/1.25  Prover 7: Warning: ignoring some quantifiers
% 3.89/1.25  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.89/1.25  Prover 7: Constructing countermodel ...
% 3.89/1.26  Prover 13: Preprocessing ...
% 3.89/1.26  Prover 11: Preprocessing ...
% 3.89/1.27  Prover 10: Warning: ignoring some quantifiers
% 3.89/1.27  Prover 10: Constructing countermodel ...
% 3.89/1.28  Prover 8: Warning: ignoring some quantifiers
% 3.89/1.29  Prover 8: Constructing countermodel ...
% 3.89/1.31  Prover 13: Warning: ignoring some quantifiers
% 3.89/1.31  Prover 7: Found proof (size 4)
% 3.89/1.31  Prover 10: Found proof (size 4)
% 3.89/1.31  Prover 1: Found proof (size 12)
% 3.89/1.31  Prover 7: proved (87ms)
% 3.89/1.31  Prover 10: proved (72ms)
% 3.89/1.31  Prover 4: Found proof (size 13)
% 3.89/1.31  Prover 4: proved (690ms)
% 3.89/1.31  Prover 8: stopped
% 3.89/1.31  Prover 1: proved (697ms)
% 3.89/1.31  Prover 13: Constructing countermodel ...
% 3.89/1.31  Prover 13: stopped
% 3.89/1.31  Prover 11: Constructing countermodel ...
% 3.89/1.32  Prover 11: stopped
% 3.89/1.32  
% 3.89/1.32  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.89/1.32  
% 3.89/1.32  % SZS output start Proof for theBenchmark
% 3.89/1.32  Assumptions after simplification:
% 3.89/1.32  ---------------------------------
% 3.89/1.32  
% 3.89/1.33    (l50_zfmisc_1)
% 4.48/1.36     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (union(v1) = v2) |  ~ $i(v1) | 
% 4.48/1.36      ~ $i(v0) |  ~ in(v0, v1) | subset(v0, v2))
% 4.48/1.36  
% 4.48/1.36    (t92_zfmisc_1)
% 4.48/1.36     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : (union(v1) = v2 & $i(v2) & $i(v1) &
% 4.48/1.36      $i(v0) & in(v0, v1) &  ~ subset(v0, v2))
% 4.48/1.36  
% 4.48/1.36  Further assumptions not needed in the proof:
% 4.48/1.36  --------------------------------------------
% 4.48/1.36  antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski
% 4.48/1.36  
% 4.48/1.36  Those formulas are unsatisfiable:
% 4.48/1.36  ---------------------------------
% 4.48/1.36  
% 4.48/1.36  Begin of proof
% 4.48/1.36  | 
% 4.48/1.36  | DELTA: instantiating (t92_zfmisc_1) with fresh symbols all_10_0, all_10_1,
% 4.48/1.36  |        all_10_2 gives:
% 4.48/1.36  |   (1)  union(all_10_1) = all_10_0 & $i(all_10_0) & $i(all_10_1) & $i(all_10_2)
% 4.48/1.36  |        & in(all_10_2, all_10_1) &  ~ subset(all_10_2, all_10_0)
% 4.48/1.36  | 
% 4.48/1.36  | ALPHA: (1) implies:
% 4.48/1.36  |   (2)   ~ subset(all_10_2, all_10_0)
% 4.48/1.36  |   (3)  in(all_10_2, all_10_1)
% 4.48/1.36  |   (4)  $i(all_10_2)
% 4.48/1.36  |   (5)  $i(all_10_1)
% 4.48/1.36  |   (6)  union(all_10_1) = all_10_0
% 4.48/1.36  | 
% 4.48/1.36  | GROUND_INST: instantiating (l50_zfmisc_1) with all_10_2, all_10_1, all_10_0,
% 4.48/1.36  |              simplifying with (2), (3), (4), (5), (6) gives:
% 4.48/1.37  |   (7)  $false
% 4.48/1.37  | 
% 4.48/1.37  | CLOSE: (7) is inconsistent.
% 4.48/1.37  | 
% 4.48/1.37  End of proof
% 4.48/1.37  % SZS output end Proof for theBenchmark
% 4.48/1.37  
% 4.48/1.37  773ms
%------------------------------------------------------------------------------