↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SEU295+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 : n024.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:55 EDT 2023

% Result   : Theorem 34.89s 5.49s
% Output   : Proof 68.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU295+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33  % Computer : n024.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.34  % DateTime : Wed Aug 23 14:25:09 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.44/0.65  ________       _____
% 0.44/0.65  ___  __ \_________(_)________________________________
% 0.44/0.65  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.44/0.65  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.44/0.65  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.44/0.65  
% 0.44/0.65  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.44/0.65  (2023-06-19)
% 0.44/0.65  
% 0.44/0.65  (c) Philipp Rümmer, 2009-2023
% 0.44/0.65  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.44/0.65                Amanda Stjerna.
% 0.44/0.65  Free software under BSD-3-Clause.
% 0.44/0.65  
% 0.44/0.65  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.44/0.65  
% 0.44/0.65  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.71/0.66  Running up to 7 provers in parallel.
% 0.71/0.68  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.71/0.68  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.71/0.68  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.71/0.68  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.71/0.68  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.71/0.68  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.71/0.68  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 9.21/2.09  Prover 4: Preprocessing ...
% 9.76/2.14  Prover 6: Preprocessing ...
% 9.76/2.14  Prover 3: Preprocessing ...
% 9.76/2.14  Prover 1: Preprocessing ...
% 9.76/2.15  Prover 0: Preprocessing ...
% 9.76/2.17  Prover 5: Preprocessing ...
% 10.34/2.19  Prover 2: Preprocessing ...
% 31.88/5.06  Prover 1: Warning: ignoring some quantifiers
% 32.60/5.16  Prover 3: Warning: ignoring some quantifiers
% 32.60/5.19  Prover 5: Proving ...
% 33.14/5.20  Prover 3: Constructing countermodel ...
% 33.14/5.23  Prover 1: Constructing countermodel ...
% 33.14/5.23  Prover 6: Proving ...
% 34.89/5.48  Prover 3: proved (4810ms)
% 34.89/5.48  
% 34.89/5.49  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.89/5.49  
% 35.47/5.50  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 35.47/5.50  Prover 6: stopped
% 35.47/5.51  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 36.09/5.58  Prover 5: stopped
% 36.09/5.62  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 38.36/5.91  Prover 8: Preprocessing ...
% 39.23/6.01  Prover 7: Preprocessing ...
% 39.48/6.03  Prover 10: Preprocessing ...
% 43.72/6.62  Prover 2: Proving ...
% 43.72/6.62  Prover 2: stopped
% 43.72/6.63  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 44.21/6.65  Prover 10: Warning: ignoring some quantifiers
% 45.00/6.78  Prover 10: Constructing countermodel ...
% 46.61/7.01  Prover 7: Warning: ignoring some quantifiers
% 47.44/7.09  Prover 8: Warning: ignoring some quantifiers
% 47.44/7.11  Prover 7: Constructing countermodel ...
% 48.18/7.20  Prover 11: Preprocessing ...
% 48.18/7.21  Prover 8: Constructing countermodel ...
% 55.23/8.08  Prover 4: Warning: ignoring some quantifiers
% 57.42/8.38  Prover 4: Constructing countermodel ...
% 61.36/8.89  Prover 10: Found proof (size 4)
% 61.36/8.89  Prover 10: proved (3269ms)
% 61.36/8.89  Prover 4: stopped
% 61.36/8.89  Prover 1: stopped
% 61.36/8.89  Prover 7: stopped
% 61.36/8.89  Prover 8: stopped
% 63.50/9.37  Prover 0: Proving ...
% 63.50/9.37  Prover 0: stopped
% 67.00/10.18  Prover 11: Warning: ignoring some quantifiers
% 67.95/10.39  Prover 11: Constructing countermodel ...
% 68.38/10.43  Prover 11: stopped
% 68.38/10.43  
% 68.38/10.43  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 68.38/10.43  
% 68.38/10.43  % SZS output start Proof for theBenchmark
% 68.38/10.47  Assumptions after simplification:
% 68.38/10.47  ---------------------------------
% 68.38/10.47  
% 68.38/10.47    (fc11_finset_1)
% 68.75/10.52     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (set_intersection2(v0, v1) = v2)
% 68.75/10.52      |  ~ $i(v1) |  ~ $i(v0) |  ~ finite(v0) | finite(v2))
% 68.75/10.52  
% 68.75/10.52    (t15_finset_1)
% 68.75/10.52     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : (set_intersection2(v0, v1) = v2 &
% 68.75/10.52      $i(v2) & $i(v1) & $i(v0) & finite(v0) &  ~ finite(v2))
% 68.75/10.52  
% 68.75/10.52  Further assumptions not needed in the proof:
% 68.75/10.52  --------------------------------------------
% 68.75/10.52  antisymmetry_r2_hidden, antisymmetry_r2_xboole_0, cc1_arytm_3, cc1_finset_1,
% 68.75/10.52  cc1_funct_1, cc1_ordinal1, cc1_relat_1, cc1_relset_1, cc2_arytm_3, cc2_finset_1,
% 68.75/10.52  cc2_funct_1, cc2_ordinal1, cc3_ordinal1, commutativity_k2_tarski,
% 68.75/10.52  commutativity_k2_xboole_0, commutativity_k3_xboole_0, connectedness_r1_ordinal1,
% 68.75/10.52  d10_relat_1, d10_xboole_0, d11_relat_1, d12_funct_1, d12_relat_1, d12_relat_2,
% 68.75/10.52  d13_funct_1, d13_relat_1, d14_relat_1, d14_relat_2, d16_relat_2, d1_enumset1,
% 68.75/10.52  d1_funct_1, d1_funct_2, d1_mcart_1, d1_ordinal1, d1_relat_1, d1_relat_2,
% 68.75/10.52  d1_relset_1, d1_setfam_1, d1_tarski, d1_wellord1, d1_wellord2, d1_xboole_0,
% 68.75/10.52  d1_zfmisc_1, d2_mcart_1, d2_ordinal1, d2_relat_1, d2_subset_1, d2_tarski,
% 68.75/10.52  d2_wellord1, d2_xboole_0, d2_zfmisc_1, d3_ordinal1, d3_relat_1, d3_tarski,
% 68.75/10.52  d3_wellord1, d3_xboole_0, d4_funct_1, d4_ordinal1, d4_relat_1, d4_relat_2,
% 68.75/10.52  d4_subset_1, d4_tarski, d4_wellord1, d4_wellord2, d4_xboole_0, d5_funct_1,
% 68.75/10.52  d5_relat_1, d5_subset_1, d5_tarski, d5_wellord1, d6_ordinal1, d6_relat_1,
% 68.75/10.52  d6_relat_2, d6_wellord1, d7_relat_1, d7_wellord1, d7_xboole_0, d8_funct_1,
% 68.75/10.52  d8_relat_1, d8_relat_2, d8_setfam_1, d8_xboole_0, d9_funct_1, d9_relat_2,
% 68.75/10.52  dt_k10_relat_1, dt_k1_enumset1, dt_k1_funct_1, dt_k1_mcart_1, dt_k1_ordinal1,
% 68.75/10.52  dt_k1_relat_1, dt_k1_setfam_1, dt_k1_tarski, dt_k1_wellord1, dt_k1_wellord2,
% 68.75/10.52  dt_k1_xboole_0, dt_k1_zfmisc_1, dt_k2_funct_1, dt_k2_mcart_1, dt_k2_relat_1,
% 68.75/10.52  dt_k2_subset_1, dt_k2_tarski, dt_k2_wellord1, dt_k2_xboole_0, dt_k2_zfmisc_1,
% 68.75/10.52  dt_k3_relat_1, dt_k3_subset_1, dt_k3_tarski, dt_k3_xboole_0, dt_k4_relat_1,
% 68.75/10.52  dt_k4_relset_1, dt_k4_tarski, dt_k4_xboole_0, dt_k5_relat_1, dt_k5_relset_1,
% 68.75/10.52  dt_k5_setfam_1, dt_k6_relat_1, dt_k6_setfam_1, dt_k6_subset_1, dt_k7_relat_1,
% 68.75/10.52  dt_k7_setfam_1, dt_k8_relat_1, dt_k9_relat_1, dt_m1_relset_1, dt_m1_subset_1,
% 68.75/10.52  dt_m2_relset_1, existence_m1_relset_1, existence_m1_subset_1,
% 68.75/10.52  existence_m2_relset_1, fc10_finset_1, fc10_relat_1, fc11_relat_1, fc12_relat_1,
% 68.75/10.52  fc13_relat_1, fc1_funct_1, fc1_ordinal1, fc1_relat_1, fc1_subset_1,
% 68.75/10.52  fc1_xboole_0, fc1_zfmisc_1, fc2_funct_1, fc2_ordinal1, fc2_relat_1,
% 68.75/10.52  fc2_subset_1, fc2_xboole_0, fc3_funct_1, fc3_ordinal1, fc3_relat_1,
% 68.75/10.52  fc3_subset_1, fc3_xboole_0, fc4_funct_1, fc4_ordinal1, fc4_relat_1,
% 68.75/10.52  fc4_subset_1, fc5_funct_1, fc5_relat_1, fc6_relat_1, fc7_relat_1, fc8_relat_1,
% 68.75/10.52  fc9_relat_1, idempotence_k2_xboole_0, idempotence_k3_xboole_0,
% 68.75/10.52  involutiveness_k3_subset_1, involutiveness_k4_relat_1,
% 68.75/10.52  involutiveness_k7_setfam_1, irreflexivity_r2_xboole_0, l1_wellord1, l1_zfmisc_1,
% 68.75/10.52  l23_zfmisc_1, l25_zfmisc_1, l28_zfmisc_1, l29_wellord1, l2_wellord1,
% 68.75/10.52  l2_zfmisc_1, l30_wellord2, l32_xboole_1, l3_subset_1, l3_wellord1, l3_zfmisc_1,
% 68.75/10.52  l4_wellord1, l4_zfmisc_1, l50_zfmisc_1, l55_zfmisc_1, l71_subset_1, l82_funct_1,
% 68.75/10.53  rc1_arytm_3, rc1_finset_1, rc1_funct_1, rc1_funct_2, rc1_ordinal1, rc1_partfun1,
% 68.75/10.53  rc1_relat_1, rc1_subset_1, rc1_xboole_0, rc2_finset_1, rc2_funct_1,
% 68.75/10.53  rc2_ordinal1, rc2_partfun1, rc2_relat_1, rc2_subset_1, rc2_xboole_0,
% 68.75/10.53  rc3_finset_1, rc3_funct_1, rc3_ordinal1, rc3_relat_1, rc4_funct_1,
% 68.75/10.53  redefinition_k4_relset_1, redefinition_k5_relset_1, redefinition_k5_setfam_1,
% 68.75/10.53  redefinition_k6_setfam_1, redefinition_k6_subset_1, redefinition_m2_relset_1,
% 68.75/10.53  redefinition_r1_ordinal1, redefinition_r2_wellord2, reflexivity_r1_ordinal1,
% 68.75/10.53  reflexivity_r1_tarski, reflexivity_r2_wellord2, s1_funct_1__e10_24__wellord2__1,
% 68.75/10.53  s1_funct_1__e16_22__wellord2__1, s1_ordinal1__e8_6__wellord2,
% 68.75/10.53  s1_relat_1__e6_21__wellord2, s1_tarski__e10_24__wellord2__1,
% 68.75/10.53  s1_tarski__e10_24__wellord2__2, s1_tarski__e16_22__wellord2__1,
% 68.75/10.53  s1_tarski__e16_22__wellord2__2, s1_tarski__e6_21__wellord2__1,
% 68.75/10.53  s1_tarski__e6_22__wellord2__1, s1_tarski__e8_6__wellord2__1,
% 68.75/10.53  s1_xboole_0__e10_24__wellord2__1, s1_xboole_0__e16_22__wellord2__1,
% 68.75/10.53  s1_xboole_0__e6_21__wellord2__1, s1_xboole_0__e6_22__wellord2,
% 68.75/10.53  s1_xboole_0__e8_6__wellord2__1, s2_funct_1__e10_24__wellord2,
% 68.75/10.53  s2_funct_1__e16_22__wellord2__1, s3_funct_1__e16_22__wellord2,
% 68.75/10.53  symmetry_r1_xboole_0, symmetry_r2_wellord2, t106_zfmisc_1, t10_ordinal1,
% 68.75/10.53  t10_zfmisc_1, t115_relat_1, t116_relat_1, t117_relat_1, t118_relat_1,
% 68.75/10.53  t118_zfmisc_1, t119_relat_1, t119_zfmisc_1, t12_relset_1, t12_xboole_1,
% 68.75/10.53  t136_zfmisc_1, t13_finset_1, t140_relat_1, t143_relat_1, t144_relat_1,
% 68.75/10.53  t145_funct_1, t145_relat_1, t146_funct_1, t146_relat_1, t147_funct_1,
% 68.75/10.53  t14_relset_1, t160_relat_1, t166_relat_1, t167_relat_1, t16_relset_1,
% 68.75/10.53  t16_wellord1, t174_relat_1, t178_relat_1, t17_wellord1, t17_xboole_1,
% 68.75/10.53  t18_wellord1, t19_wellord1, t19_xboole_1, t1_boole, t1_subset, t1_xboole_1,
% 68.75/10.53  t1_zfmisc_1, t20_relat_1, t20_wellord1, t21_funct_1, t21_funct_2, t21_ordinal1,
% 68.75/10.53  t21_relat_1, t21_wellord1, t22_funct_1, t22_relset_1, t22_wellord1, t23_funct_1,
% 68.75/10.53  t23_ordinal1, t23_relset_1, t23_wellord1, t24_ordinal1, t24_wellord1,
% 68.75/10.53  t25_relat_1, t25_wellord1, t25_wellord2, t26_wellord2, t26_xboole_1,
% 68.75/10.53  t28_wellord2, t28_xboole_1, t2_boole, t2_subset, t2_tarski, t2_wellord2,
% 68.75/10.53  t2_xboole_1, t30_relat_1, t31_ordinal1, t31_wellord1, t32_ordinal1,
% 68.75/10.53  t32_wellord1, t33_ordinal1, t33_xboole_1, t33_zfmisc_1, t34_funct_1,
% 68.75/10.53  t35_funct_1, t36_xboole_1, t37_relat_1, t37_xboole_1, t37_zfmisc_1,
% 68.75/10.53  t38_zfmisc_1, t39_wellord1, t39_xboole_1, t39_zfmisc_1, t3_boole, t3_ordinal1,
% 68.75/10.53  t3_subset, t3_wellord2, t3_xboole_0, t3_xboole_1, t40_xboole_1, t41_ordinal1,
% 68.75/10.53  t42_ordinal1, t43_subset_1, t44_relat_1, t45_relat_1, t45_xboole_1, t46_funct_2,
% 68.75/10.53  t46_relat_1, t46_setfam_1, t46_zfmisc_1, t47_relat_1, t47_setfam_1,
% 68.75/10.53  t48_setfam_1, t48_xboole_1, t49_wellord1, t4_boole, t4_subset, t4_wellord2,
% 68.75/10.53  t4_xboole_0, t50_subset_1, t53_wellord1, t54_funct_1, t54_subset_1,
% 68.75/10.53  t54_wellord1, t55_funct_1, t56_relat_1, t57_funct_1, t5_subset, t5_wellord1,
% 68.75/10.53  t5_wellord2, t60_relat_1, t60_xboole_1, t62_funct_1, t63_xboole_1, t64_relat_1,
% 68.75/10.53  t65_relat_1, t65_zfmisc_1, t68_funct_1, t69_enumset1, t6_boole, t6_funct_2,
% 68.75/10.53  t6_wellord2, t6_zfmisc_1, t70_funct_1, t71_relat_1, t72_funct_1, t74_relat_1,
% 68.75/10.53  t7_boole, t7_mcart_1, t7_tarski, t7_wellord2, t7_xboole_1, t83_xboole_1,
% 68.75/10.53  t86_relat_1, t88_relat_1, t8_boole, t8_funct_1, t8_wellord1, t8_xboole_1,
% 68.75/10.53  t8_zfmisc_1, t90_relat_1, t92_zfmisc_1, t94_relat_1, t99_relat_1, t99_zfmisc_1,
% 68.75/10.53  t9_funct_2, t9_tarski, t9_zfmisc_1
% 68.75/10.53  
% 68.75/10.53  Those formulas are unsatisfiable:
% 68.75/10.53  ---------------------------------
% 68.75/10.53  
% 68.75/10.53  Begin of proof
% 68.75/10.53  | 
% 68.75/10.53  | DELTA: instantiating (t15_finset_1) with fresh symbols all_359_0, all_359_1,
% 68.75/10.53  |        all_359_2 gives:
% 68.75/10.53  |   (1)  set_intersection2(all_359_2, all_359_1) = all_359_0 & $i(all_359_0) &
% 68.75/10.53  |        $i(all_359_1) & $i(all_359_2) & finite(all_359_2) &  ~
% 68.75/10.53  |        finite(all_359_0)
% 68.75/10.53  | 
% 68.75/10.53  | ALPHA: (1) implies:
% 68.75/10.54  |   (2)   ~ finite(all_359_0)
% 68.75/10.54  |   (3)  finite(all_359_2)
% 68.75/10.54  |   (4)  $i(all_359_2)
% 68.75/10.54  |   (5)  $i(all_359_1)
% 68.75/10.54  |   (6)  set_intersection2(all_359_2, all_359_1) = all_359_0
% 68.75/10.54  | 
% 68.75/10.54  | GROUND_INST: instantiating (fc11_finset_1) with all_359_2, all_359_1,
% 68.75/10.54  |              all_359_0, simplifying with (2), (3), (4), (5), (6) gives:
% 68.75/10.54  |   (7)  $false
% 68.75/10.54  | 
% 68.75/10.54  | CLOSE: (7) is inconsistent.
% 68.75/10.54  | 
% 68.75/10.54  End of proof
% 68.75/10.54  % SZS output end Proof for theBenchmark
% 68.75/10.54  
% 68.75/10.54  9891ms
%------------------------------------------------------------------------------