TSTP Solution File: SEU217+2 by Princess---230619

View Problem - Process Solution

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

% Computer : n020.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:43:20 EDT 2023

% Result   : Theorem 28.07s 4.59s
% Output   : Proof 41.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU217+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n020.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 : Wed Aug 23 13:22:30 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.60  ________       _____
% 0.19/0.60  ___  __ \_________(_)________________________________
% 0.19/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.60  
% 0.19/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.60  (2023-06-19)
% 0.19/0.60  
% 0.19/0.60  (c) Philipp Rümmer, 2009-2023
% 0.19/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.60                Amanda Stjerna.
% 0.19/0.60  Free software under BSD-3-Clause.
% 0.19/0.60  
% 0.19/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.60  
% 0.19/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.62  Running up to 7 provers in parallel.
% 0.19/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.83/1.53  Prover 1: Preprocessing ...
% 4.83/1.53  Prover 4: Preprocessing ...
% 5.52/1.56  Prover 6: Preprocessing ...
% 5.52/1.56  Prover 5: Preprocessing ...
% 5.52/1.56  Prover 2: Preprocessing ...
% 5.52/1.56  Prover 3: Preprocessing ...
% 5.52/1.56  Prover 0: Preprocessing ...
% 18.43/3.25  Prover 1: Warning: ignoring some quantifiers
% 18.70/3.31  Prover 3: Warning: ignoring some quantifiers
% 19.10/3.34  Prover 3: Constructing countermodel ...
% 19.19/3.35  Prover 1: Constructing countermodel ...
% 19.19/3.35  Prover 6: Proving ...
% 19.19/3.39  Prover 5: Proving ...
% 20.24/3.68  Prover 2: Proving ...
% 21.99/3.77  Prover 4: Warning: ignoring some quantifiers
% 22.76/3.87  Prover 4: Constructing countermodel ...
% 23.23/3.90  Prover 0: Proving ...
% 28.07/4.59  Prover 3: proved (3959ms)
% 28.07/4.59  
% 28.07/4.59  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.07/4.59  
% 28.07/4.59  Prover 6: stopped
% 28.53/4.61  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 28.53/4.61  Prover 5: stopped
% 28.53/4.61  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 28.53/4.61  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 28.53/4.62  Prover 0: stopped
% 28.53/4.62  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 28.93/4.66  Prover 2: stopped
% 28.93/4.68  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 30.31/4.92  Prover 7: Preprocessing ...
% 30.31/4.93  Prover 8: Preprocessing ...
% 30.31/4.99  Prover 10: Preprocessing ...
% 30.31/5.00  Prover 11: Preprocessing ...
% 30.99/5.01  Prover 13: Preprocessing ...
% 34.26/5.45  Prover 8: Warning: ignoring some quantifiers
% 35.05/5.47  Prover 7: Warning: ignoring some quantifiers
% 35.05/5.49  Prover 8: Constructing countermodel ...
% 35.28/5.51  Prover 7: Constructing countermodel ...
% 35.63/5.55  Prover 10: Warning: ignoring some quantifiers
% 35.63/5.60  Prover 10: Constructing countermodel ...
% 36.17/5.75  Prover 13: Warning: ignoring some quantifiers
% 37.96/5.85  Prover 13: Constructing countermodel ...
% 38.65/6.00  Prover 11: Warning: ignoring some quantifiers
% 39.41/6.06  Prover 11: Constructing countermodel ...
% 41.35/6.40  Prover 10: Found proof (size 11)
% 41.35/6.41  Prover 10: proved (1792ms)
% 41.35/6.41  Prover 11: stopped
% 41.35/6.41  Prover 8: stopped
% 41.35/6.41  Prover 7: stopped
% 41.35/6.41  Prover 13: stopped
% 41.35/6.41  Prover 4: stopped
% 41.35/6.41  Prover 1: stopped
% 41.35/6.41  
% 41.35/6.41  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 41.35/6.41  
% 41.35/6.41  % SZS output start Proof for theBenchmark
% 41.35/6.42  Assumptions after simplification:
% 41.35/6.42  ---------------------------------
% 41.35/6.42  
% 41.35/6.42    (fc2_funct_1)
% 41.35/6.45     ! [v0: $i] :  ! [v1: $i] : ( ~ (identity_relation(v0) = v1) |  ~ $i(v0) |
% 41.35/6.45      relation(v1)) &  ! [v0: $i] :  ! [v1: $i] : ( ~ (identity_relation(v0) = v1)
% 41.35/6.45      |  ~ $i(v0) | function(v1))
% 41.35/6.45  
% 41.35/6.45    (t34_funct_1)
% 41.35/6.45     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : (v4 = v3
% 41.35/6.45      |  ~ (relation_dom(v1) = v2) |  ~ (apply(v1, v3) = v4) |  ~
% 41.35/6.45      (identity_relation(v0) = v1) |  ~ $i(v3) |  ~ $i(v1) |  ~ $i(v0) |  ~
% 41.35/6.45      relation(v1) |  ~ function(v1) |  ~ in(v3, v0)) &  ! [v0: $i] :  ! [v1: $i]
% 41.35/6.45    :  ! [v2: $i] : (v2 = v1 |  ~ (relation_dom(v1) = v0) |  ~
% 41.35/6.45      (identity_relation(v0) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ relation(v1) |  ~
% 41.35/6.45      function(v1) |  ? [v3: $i] :  ? [v4: $i] : ( ~ (v4 = v3) & apply(v1, v3) =
% 41.35/6.45        v4 & $i(v4) & $i(v3) & in(v3, v0))) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2:
% 41.35/6.45      $i] : (v2 = v0 |  ~ (relation_dom(v1) = v2) |  ~ (identity_relation(v0) =
% 41.35/6.45        v1) |  ~ $i(v1) |  ~ $i(v0) |  ~ relation(v1) |  ~ function(v1))
% 41.35/6.45  
% 41.35/6.45    (t35_funct_1)
% 41.35/6.45     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] : ( ~ (v3 = v1) &
% 41.35/6.45      apply(v2, v1) = v3 & identity_relation(v0) = v2 & $i(v3) & $i(v2) & $i(v1) &
% 41.35/6.45      $i(v0) & in(v1, v0))
% 41.35/6.45  
% 41.35/6.45    (t71_relat_1)
% 41.35/6.45     ! [v0: $i] :  ! [v1: $i] : ( ~ (identity_relation(v0) = v1) |  ~ $i(v0) |
% 41.35/6.45      relation_rng(v1) = v0) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 41.35/6.45      (identity_relation(v0) = v1) |  ~ $i(v0) | relation_dom(v1) = v0)
% 41.35/6.45  
% 41.35/6.45  Further assumptions not needed in the proof:
% 41.35/6.45  --------------------------------------------
% 41.35/6.45  antisymmetry_r2_hidden, antisymmetry_r2_xboole_0, cc1_funct_1, cc1_relat_1,
% 41.35/6.45  commutativity_k2_tarski, commutativity_k2_xboole_0, commutativity_k3_xboole_0,
% 41.35/6.45  d10_relat_1, d10_xboole_0, d11_relat_1, d12_relat_1, d13_relat_1, d14_relat_1,
% 41.35/6.45  d1_relat_1, d1_setfam_1, d1_tarski, d1_xboole_0, d1_zfmisc_1, d2_relat_1,
% 41.35/6.45  d2_subset_1, d2_tarski, d2_xboole_0, d2_zfmisc_1, d3_relat_1, d3_tarski,
% 41.35/6.46  d3_xboole_0, d4_funct_1, d4_relat_1, d4_subset_1, d4_tarski, d4_xboole_0,
% 41.35/6.46  d5_relat_1, d5_subset_1, d5_tarski, d6_relat_1, d7_relat_1, d7_xboole_0,
% 41.35/6.46  d8_relat_1, d8_setfam_1, d8_xboole_0, dt_k10_relat_1, dt_k1_funct_1,
% 41.35/6.46  dt_k1_relat_1, dt_k1_setfam_1, dt_k1_tarski, dt_k1_xboole_0, dt_k1_zfmisc_1,
% 41.35/6.46  dt_k2_relat_1, dt_k2_subset_1, dt_k2_tarski, dt_k2_xboole_0, dt_k2_zfmisc_1,
% 41.35/6.46  dt_k3_relat_1, dt_k3_subset_1, dt_k3_tarski, dt_k3_xboole_0, dt_k4_relat_1,
% 41.35/6.46  dt_k4_tarski, dt_k4_xboole_0, dt_k5_relat_1, dt_k5_setfam_1, dt_k6_relat_1,
% 41.35/6.46  dt_k6_setfam_1, dt_k6_subset_1, dt_k7_relat_1, dt_k7_setfam_1, dt_k8_relat_1,
% 41.35/6.46  dt_k9_relat_1, dt_m1_subset_1, existence_m1_subset_1, fc10_relat_1,
% 41.35/6.46  fc12_relat_1, fc1_funct_1, fc1_relat_1, fc1_subset_1, fc1_xboole_0,
% 41.35/6.46  fc1_zfmisc_1, fc2_relat_1, fc2_subset_1, fc2_xboole_0, fc3_subset_1,
% 41.35/6.46  fc3_xboole_0, fc4_relat_1, fc4_subset_1, fc5_relat_1, fc6_relat_1, fc7_relat_1,
% 41.35/6.46  fc8_relat_1, fc9_relat_1, idempotence_k2_xboole_0, idempotence_k3_xboole_0,
% 41.35/6.46  involutiveness_k3_subset_1, involutiveness_k4_relat_1,
% 41.35/6.46  involutiveness_k7_setfam_1, irreflexivity_r2_xboole_0, l1_zfmisc_1,
% 41.35/6.46  l23_zfmisc_1, l25_zfmisc_1, l28_zfmisc_1, l2_zfmisc_1, l32_xboole_1,
% 41.35/6.46  l3_subset_1, l3_zfmisc_1, l4_zfmisc_1, l50_zfmisc_1, l55_zfmisc_1, l71_subset_1,
% 41.35/6.46  rc1_funct_1, rc1_relat_1, rc1_subset_1, rc1_xboole_0, rc2_relat_1, rc2_subset_1,
% 41.35/6.46  rc2_xboole_0, rc3_relat_1, redefinition_k5_setfam_1, redefinition_k6_setfam_1,
% 41.35/6.46  redefinition_k6_subset_1, reflexivity_r1_tarski, symmetry_r1_xboole_0,
% 41.35/6.46  t106_zfmisc_1, t10_zfmisc_1, t115_relat_1, t116_relat_1, t117_relat_1,
% 41.35/6.46  t118_relat_1, t118_zfmisc_1, t119_relat_1, t119_zfmisc_1, t12_xboole_1,
% 41.35/6.46  t136_zfmisc_1, t140_relat_1, t143_relat_1, t144_relat_1, t145_relat_1,
% 41.35/6.46  t146_relat_1, t160_relat_1, t166_relat_1, t167_relat_1, t174_relat_1,
% 41.35/6.46  t178_relat_1, t17_xboole_1, t19_xboole_1, t1_boole, t1_subset, t1_xboole_1,
% 41.35/6.46  t1_zfmisc_1, t20_relat_1, t21_funct_1, t21_relat_1, t22_funct_1, t23_funct_1,
% 41.35/6.46  t25_relat_1, t26_xboole_1, t28_xboole_1, t2_boole, t2_subset, t2_tarski,
% 41.35/6.46  t2_xboole_1, t30_relat_1, t33_xboole_1, t33_zfmisc_1, t36_xboole_1, t37_relat_1,
% 41.35/6.46  t37_xboole_1, t37_zfmisc_1, t38_zfmisc_1, t39_xboole_1, t39_zfmisc_1, t3_boole,
% 41.35/6.46  t3_subset, t3_xboole_0, t3_xboole_1, t40_xboole_1, t43_subset_1, t44_relat_1,
% 41.35/6.46  t45_relat_1, t45_xboole_1, t46_relat_1, t46_setfam_1, t46_zfmisc_1, t47_relat_1,
% 41.35/6.46  t47_setfam_1, t48_setfam_1, t48_xboole_1, t4_boole, t4_subset, t4_xboole_0,
% 41.35/6.46  t50_subset_1, t54_subset_1, t56_relat_1, t5_subset, t60_relat_1, t60_xboole_1,
% 41.35/6.46  t63_xboole_1, t64_relat_1, t65_relat_1, t65_zfmisc_1, t69_enumset1, t6_boole,
% 41.35/6.46  t6_zfmisc_1, t74_relat_1, t7_boole, t7_xboole_1, t83_xboole_1, t86_relat_1,
% 41.35/6.46  t88_relat_1, t8_boole, t8_funct_1, t8_xboole_1, t8_zfmisc_1, t90_relat_1,
% 41.35/6.46  t92_zfmisc_1, t94_relat_1, t99_relat_1, t99_zfmisc_1, t9_tarski, t9_zfmisc_1
% 41.35/6.46  
% 41.35/6.46  Those formulas are unsatisfiable:
% 41.35/6.46  ---------------------------------
% 41.35/6.46  
% 41.35/6.46  Begin of proof
% 41.35/6.46  | 
% 41.35/6.46  | ALPHA: (fc2_funct_1) implies:
% 41.35/6.46  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (identity_relation(v0) = v1) |  ~
% 41.35/6.46  |          $i(v0) | function(v1))
% 41.35/6.46  |   (2)   ! [v0: $i] :  ! [v1: $i] : ( ~ (identity_relation(v0) = v1) |  ~
% 41.35/6.46  |          $i(v0) | relation(v1))
% 41.35/6.46  | 
% 41.35/6.46  | ALPHA: (t34_funct_1) implies:
% 41.35/6.46  |   (3)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] :
% 41.35/6.46  |        (v4 = v3 |  ~ (relation_dom(v1) = v2) |  ~ (apply(v1, v3) = v4) |  ~
% 41.35/6.46  |          (identity_relation(v0) = v1) |  ~ $i(v3) |  ~ $i(v1) |  ~ $i(v0) |  ~
% 41.35/6.46  |          relation(v1) |  ~ function(v1) |  ~ in(v3, v0))
% 41.35/6.46  | 
% 41.35/6.46  | ALPHA: (t71_relat_1) implies:
% 41.35/6.46  |   (4)   ! [v0: $i] :  ! [v1: $i] : ( ~ (identity_relation(v0) = v1) |  ~
% 41.35/6.46  |          $i(v0) | relation_dom(v1) = v0)
% 41.35/6.46  | 
% 41.35/6.46  | DELTA: instantiating (t35_funct_1) with fresh symbols all_210_0, all_210_1,
% 41.35/6.46  |        all_210_2, all_210_3 gives:
% 41.35/6.46  |   (5)   ~ (all_210_0 = all_210_2) & apply(all_210_1, all_210_2) = all_210_0 &
% 41.35/6.46  |        identity_relation(all_210_3) = all_210_1 & $i(all_210_0) &
% 41.35/6.46  |        $i(all_210_1) & $i(all_210_2) & $i(all_210_3) & in(all_210_2,
% 41.35/6.46  |          all_210_3)
% 41.35/6.46  | 
% 41.35/6.46  | ALPHA: (5) implies:
% 41.35/6.46  |   (6)   ~ (all_210_0 = all_210_2)
% 41.35/6.46  |   (7)  in(all_210_2, all_210_3)
% 41.35/6.46  |   (8)  $i(all_210_3)
% 41.35/6.46  |   (9)  $i(all_210_2)
% 41.35/6.46  |   (10)  $i(all_210_1)
% 41.35/6.46  |   (11)  identity_relation(all_210_3) = all_210_1
% 41.35/6.46  |   (12)  apply(all_210_1, all_210_2) = all_210_0
% 41.35/6.46  | 
% 41.35/6.47  | GROUND_INST: instantiating (4) with all_210_3, all_210_1, simplifying with
% 41.35/6.47  |              (8), (11) gives:
% 41.35/6.47  |   (13)  relation_dom(all_210_1) = all_210_3
% 41.35/6.47  | 
% 41.35/6.47  | GROUND_INST: instantiating (2) with all_210_3, all_210_1, simplifying with
% 41.35/6.47  |              (8), (11) gives:
% 41.35/6.47  |   (14)  relation(all_210_1)
% 41.35/6.47  | 
% 41.35/6.47  | GROUND_INST: instantiating (1) with all_210_3, all_210_1, simplifying with
% 41.35/6.47  |              (8), (11) gives:
% 41.35/6.47  |   (15)  function(all_210_1)
% 41.35/6.47  | 
% 41.35/6.47  | GROUND_INST: instantiating (3) with all_210_3, all_210_1, all_210_3,
% 41.35/6.47  |              all_210_2, all_210_0, simplifying with (7), (8), (9), (10), (11),
% 41.35/6.47  |              (12), (13), (14), (15) gives:
% 41.35/6.47  |   (16)  all_210_0 = all_210_2
% 41.35/6.47  | 
% 41.35/6.47  | REDUCE: (6), (16) imply:
% 41.35/6.47  |   (17)  $false
% 41.35/6.47  | 
% 41.35/6.47  | CLOSE: (17) is inconsistent.
% 41.35/6.47  | 
% 41.35/6.47  End of proof
% 41.35/6.47  % SZS output end Proof for theBenchmark
% 41.35/6.47  
% 41.35/6.47  5864ms
%------------------------------------------------------------------------------