TSTP Solution File: NUM387+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : NUM387+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 : n015.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 11:47:33 EDT 2023

% Result   : Theorem 6.87s 1.60s
% Output   : Proof 8.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM387+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n015.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 : Fri Aug 25 09:21:51 EDT 2023
% 0.19/0.34  % CPUTime  : 
% 0.19/0.58  ________       _____
% 0.19/0.58  ___  __ \_________(_)________________________________
% 0.19/0.58  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.58  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.58  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.58  
% 0.19/0.58  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.58  (2023-06-19)
% 0.19/0.58  
% 0.19/0.58  (c) Philipp Rümmer, 2009-2023
% 0.19/0.58  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.58                Amanda Stjerna.
% 0.19/0.58  Free software under BSD-3-Clause.
% 0.19/0.58  
% 0.19/0.58  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.58  
% 0.19/0.58  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.59  Running up to 7 provers in parallel.
% 0.19/0.60  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.60  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.60  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.60  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.61  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.61  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.61  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.37/1.00  Prover 1: Preprocessing ...
% 2.37/1.00  Prover 4: Preprocessing ...
% 2.37/1.04  Prover 6: Preprocessing ...
% 2.37/1.04  Prover 0: Preprocessing ...
% 2.37/1.04  Prover 3: Preprocessing ...
% 2.37/1.04  Prover 5: Preprocessing ...
% 2.37/1.04  Prover 2: Preprocessing ...
% 4.49/1.33  Prover 1: Warning: ignoring some quantifiers
% 5.21/1.37  Prover 3: Warning: ignoring some quantifiers
% 5.21/1.37  Prover 1: Constructing countermodel ...
% 5.21/1.37  Prover 5: Proving ...
% 5.21/1.38  Prover 2: Proving ...
% 5.21/1.38  Prover 4: Warning: ignoring some quantifiers
% 5.21/1.39  Prover 3: Constructing countermodel ...
% 5.21/1.39  Prover 6: Proving ...
% 5.21/1.40  Prover 4: Constructing countermodel ...
% 5.21/1.41  Prover 0: Proving ...
% 6.75/1.60  Prover 5: proved (994ms)
% 6.87/1.60  
% 6.87/1.60  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.87/1.60  
% 6.87/1.60  Prover 3: stopped
% 6.87/1.60  Prover 2: stopped
% 6.87/1.60  Prover 6: stopped
% 6.87/1.60  Prover 0: stopped
% 6.87/1.60  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.87/1.60  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.87/1.60  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.87/1.60  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.87/1.60  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.96/1.65  Prover 10: Preprocessing ...
% 6.96/1.65  Prover 7: Preprocessing ...
% 6.96/1.65  Prover 8: Preprocessing ...
% 6.96/1.67  Prover 13: Preprocessing ...
% 6.96/1.68  Prover 1: gave up
% 6.96/1.69  Prover 11: Preprocessing ...
% 6.96/1.69  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 6.96/1.70  Prover 10: Warning: ignoring some quantifiers
% 6.96/1.71  Prover 10: Constructing countermodel ...
% 7.68/1.72  Prover 16: Preprocessing ...
% 7.68/1.74  Prover 7: Warning: ignoring some quantifiers
% 7.68/1.76  Prover 7: Constructing countermodel ...
% 7.68/1.77  Prover 16: Warning: ignoring some quantifiers
% 7.68/1.78  Prover 13: Warning: ignoring some quantifiers
% 7.68/1.78  Prover 16: Constructing countermodel ...
% 7.68/1.79  Prover 10: Found proof (size 5)
% 7.68/1.79  Prover 10: proved (183ms)
% 7.68/1.79  Prover 7: stopped
% 7.68/1.79  Prover 4: stopped
% 7.68/1.79  Prover 16: stopped
% 8.35/1.80  Prover 13: Constructing countermodel ...
% 8.35/1.80  Prover 8: Warning: ignoring some quantifiers
% 8.35/1.80  Prover 13: stopped
% 8.35/1.81  Prover 8: Constructing countermodel ...
% 8.35/1.82  Prover 8: stopped
% 8.35/1.82  Prover 11: Warning: ignoring some quantifiers
% 8.35/1.83  Prover 11: Constructing countermodel ...
% 8.35/1.84  Prover 11: stopped
% 8.35/1.84  
% 8.35/1.84  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.35/1.84  
% 8.35/1.84  % SZS output start Proof for theBenchmark
% 8.35/1.84  Assumptions after simplification:
% 8.35/1.84  ---------------------------------
% 8.35/1.84  
% 8.35/1.84    (antisymmetry_r2_hidden)
% 8.35/1.85     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ in(v1, v0) |  ~ in(v0,
% 8.35/1.85        v1))
% 8.35/1.85  
% 8.35/1.85    (t10_ordinal1)
% 8.35/1.87     ! [v0: $i] :  ! [v1: $i] : ( ~ (succ(v0) = v1) |  ~ $i(v0) | in(v0, v1))
% 8.35/1.87  
% 8.35/1.87    (t14_ordinal1)
% 8.35/1.87     ? [v0: $i] : (succ(v0) = v0 & $i(v0))
% 8.35/1.87  
% 8.35/1.87  Further assumptions not needed in the proof:
% 8.35/1.87  --------------------------------------------
% 8.35/1.87  cc1_funct_1, cc1_relat_1, cc2_funct_1, commutativity_k2_xboole_0, d1_ordinal1,
% 8.35/1.87  existence_m1_subset_1, fc12_relat_1, fc1_ordinal1, fc1_xboole_0, fc2_relat_1,
% 8.35/1.87  fc2_xboole_0, fc3_xboole_0, fc4_relat_1, idempotence_k2_xboole_0, rc1_funct_1,
% 8.35/1.87  rc1_relat_1, rc1_xboole_0, rc2_funct_1, rc2_relat_1, rc2_xboole_0, rc3_funct_1,
% 8.35/1.87  rc3_relat_1, rc4_funct_1, rc5_funct_1, t1_boole, t1_subset, t2_subset, t6_boole,
% 8.35/1.87  t7_boole, t8_boole
% 8.35/1.87  
% 8.35/1.87  Those formulas are unsatisfiable:
% 8.35/1.87  ---------------------------------
% 8.35/1.87  
% 8.35/1.87  Begin of proof
% 8.35/1.87  | 
% 8.35/1.87  | DELTA: instantiating (t14_ordinal1) with fresh symbol all_22_0 gives:
% 8.35/1.87  |   (1)  succ(all_22_0) = all_22_0 & $i(all_22_0)
% 8.35/1.87  | 
% 8.35/1.87  | ALPHA: (1) implies:
% 8.35/1.87  |   (2)  $i(all_22_0)
% 8.35/1.87  |   (3)  succ(all_22_0) = all_22_0
% 8.35/1.87  | 
% 8.35/1.88  | GROUND_INST: instantiating (t10_ordinal1) with all_22_0, all_22_0, simplifying
% 8.35/1.88  |              with (2), (3) gives:
% 8.35/1.88  |   (4)  in(all_22_0, all_22_0)
% 8.35/1.88  | 
% 8.35/1.88  | GROUND_INST: instantiating (antisymmetry_r2_hidden) with all_22_0, all_22_0,
% 8.35/1.88  |              simplifying with (2), (4) gives:
% 8.35/1.88  |   (5)  $false
% 8.35/1.88  | 
% 8.35/1.88  | CLOSE: (5) is inconsistent.
% 8.35/1.88  | 
% 8.35/1.88  End of proof
% 8.35/1.88  % SZS output end Proof for theBenchmark
% 8.35/1.88  
% 8.35/1.88  1298ms
%------------------------------------------------------------------------------