↑ Up

Princess---230619.THM-Prf.s

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

% Result   : Theorem 5.01s 1.46s
% Output   : Proof 7.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU257+1 : 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.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Aug 23 20:44:00 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.61  ________       _____
% 0.20/0.61  ___  __ \_________(_)________________________________
% 0.20/0.61  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.61  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.61  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61  
% 0.20/0.61  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61  (2023-06-19)
% 0.20/0.61  
% 0.20/0.61  (c) Philipp Rümmer, 2009-2023
% 0.20/0.61  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61                Amanda Stjerna.
% 0.20/0.61  Free software under BSD-3-Clause.
% 0.20/0.61  
% 0.20/0.61  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61  
% 0.20/0.61  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62  Running up to 7 provers in parallel.
% 0.20/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.78/0.98  Prover 1: Preprocessing ...
% 1.78/0.98  Prover 4: Preprocessing ...
% 2.41/1.02  Prover 2: Preprocessing ...
% 2.41/1.02  Prover 0: Preprocessing ...
% 2.41/1.02  Prover 3: Preprocessing ...
% 2.41/1.02  Prover 6: Preprocessing ...
% 2.41/1.02  Prover 5: Preprocessing ...
% 3.89/1.28  Prover 1: Warning: ignoring some quantifiers
% 3.89/1.29  Prover 3: Warning: ignoring some quantifiers
% 3.89/1.31  Prover 3: Constructing countermodel ...
% 3.89/1.31  Prover 6: Proving ...
% 3.89/1.31  Prover 5: Proving ...
% 4.51/1.31  Prover 1: Constructing countermodel ...
% 4.51/1.31  Prover 2: Proving ...
% 4.51/1.32  Prover 4: Constructing countermodel ...
% 4.51/1.37  Prover 0: Proving ...
% 5.01/1.46  Prover 3: proved (823ms)
% 5.01/1.46  
% 5.01/1.46  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.01/1.46  
% 5.01/1.46  Prover 2: stopped
% 5.01/1.46  Prover 6: stopped
% 5.01/1.46  Prover 5: stopped
% 5.01/1.46  Prover 0: stopped
% 5.01/1.46  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.01/1.46  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.01/1.46  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.01/1.46  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.01/1.46  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.01/1.48  Prover 7: Preprocessing ...
% 5.01/1.49  Prover 8: Preprocessing ...
% 5.01/1.49  Prover 13: Preprocessing ...
% 5.01/1.50  Prover 11: Preprocessing ...
% 5.01/1.51  Prover 10: Preprocessing ...
% 5.01/1.55  Prover 7: Constructing countermodel ...
% 5.01/1.56  Prover 8: Warning: ignoring some quantifiers
% 5.01/1.57  Prover 10: Constructing countermodel ...
% 5.01/1.58  Prover 13: Warning: ignoring some quantifiers
% 5.01/1.59  Prover 8: Constructing countermodel ...
% 6.58/1.61  Prover 13: Constructing countermodel ...
% 6.73/1.65  Prover 10: Found proof (size 16)
% 6.73/1.65  Prover 10: proved (193ms)
% 6.73/1.65  Prover 1: stopped
% 6.73/1.65  Prover 8: stopped
% 6.73/1.66  Prover 7: stopped
% 6.73/1.66  Prover 11: Constructing countermodel ...
% 6.73/1.67  Prover 11: stopped
% 6.73/1.67  Prover 4: stopped
% 6.73/1.67  Prover 13: stopped
% 6.73/1.67  
% 6.73/1.67  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.73/1.67  
% 6.73/1.67  % SZS output start Proof for theBenchmark
% 6.73/1.68  Assumptions after simplification:
% 6.73/1.68  ---------------------------------
% 6.73/1.68  
% 6.73/1.68    (d4_wellord1)
% 6.73/1.69     ! [v0: $i] : ( ~ $i(v0) |  ~ well_founded_relation(v0) |  ~ connected(v0) | 
% 6.73/1.69      ~ antisymmetric(v0) |  ~ transitive(v0) |  ~ reflexive(v0) |  ~ relation(v0)
% 6.73/1.69      | well_ordering(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~
% 6.73/1.69      relation(v0) | well_founded_relation(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 6.73/1.69      well_ordering(v0) |  ~ relation(v0) | connected(v0)) &  ! [v0: $i] : ( ~
% 6.73/1.69      $i(v0) |  ~ well_ordering(v0) |  ~ relation(v0) | antisymmetric(v0)) &  !
% 6.73/1.69    [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~ relation(v0) |
% 6.73/1.69      transitive(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~
% 6.73/1.69      relation(v0) | reflexive(v0))
% 6.73/1.69  
% 6.73/1.69    (dt_k2_wellord1)
% 6.73/1.71     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_restriction(v0, v1) =
% 6.73/1.71        v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ relation(v0) | relation(v2))
% 6.73/1.71  
% 6.73/1.71    (t22_wellord1)
% 6.73/1.71     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_restriction(v1, v0) =
% 6.73/1.71        v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ reflexive(v1) |  ~ relation(v1) |
% 6.73/1.71      reflexive(v2))
% 6.73/1.71  
% 6.73/1.71    (t23_wellord1)
% 6.73/1.71     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_restriction(v1, v0) =
% 6.73/1.71        v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ connected(v1) |  ~ relation(v1) |
% 6.73/1.71      connected(v2))
% 6.73/1.71  
% 6.73/1.71    (t24_wellord1)
% 6.73/1.71     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_restriction(v1, v0) =
% 6.73/1.71        v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ transitive(v1) |  ~ relation(v1) |
% 6.73/1.71      transitive(v2))
% 6.73/1.71  
% 6.73/1.71    (t25_wellord1)
% 6.73/1.72     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_restriction(v1, v0) =
% 6.73/1.72        v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ antisymmetric(v1) |  ~ relation(v1) |
% 6.73/1.72      antisymmetric(v2))
% 6.73/1.72  
% 6.73/1.72    (t31_wellord1)
% 6.73/1.72     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_restriction(v1, v0) =
% 6.73/1.72        v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ well_founded_relation(v1) |  ~
% 6.73/1.72      relation(v1) | well_founded_relation(v2))
% 6.73/1.72  
% 6.73/1.72    (t32_wellord1)
% 6.73/1.72     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : (relation_restriction(v1, v0) = v2 &
% 6.73/1.72      $i(v2) & $i(v1) & $i(v0) & well_ordering(v1) & relation(v1) &  ~
% 6.73/1.72      well_ordering(v2))
% 6.73/1.72  
% 6.73/1.72  Further assumptions not needed in the proof:
% 6.73/1.72  --------------------------------------------
% 6.73/1.72  commutativity_k3_xboole_0, d6_wellord1, dt_k2_zfmisc_1, dt_k3_xboole_0,
% 6.73/1.72  idempotence_k3_xboole_0
% 6.73/1.72  
% 6.73/1.72  Those formulas are unsatisfiable:
% 6.73/1.72  ---------------------------------
% 6.73/1.72  
% 6.73/1.72  Begin of proof
% 7.22/1.72  | 
% 7.22/1.72  | ALPHA: (d4_wellord1) implies:
% 7.22/1.72  |   (1)   ! [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~ relation(v0) |
% 7.22/1.72  |          reflexive(v0))
% 7.22/1.72  |   (2)   ! [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~ relation(v0) |
% 7.22/1.72  |          transitive(v0))
% 7.22/1.72  |   (3)   ! [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~ relation(v0) |
% 7.22/1.72  |          antisymmetric(v0))
% 7.22/1.73  |   (4)   ! [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~ relation(v0) |
% 7.22/1.73  |          connected(v0))
% 7.22/1.73  |   (5)   ! [v0: $i] : ( ~ $i(v0) |  ~ well_ordering(v0) |  ~ relation(v0) |
% 7.22/1.73  |          well_founded_relation(v0))
% 7.22/1.73  |   (6)   ! [v0: $i] : ( ~ $i(v0) |  ~ well_founded_relation(v0) |  ~
% 7.22/1.73  |          connected(v0) |  ~ antisymmetric(v0) |  ~ transitive(v0) |  ~
% 7.22/1.73  |          reflexive(v0) |  ~ relation(v0) | well_ordering(v0))
% 7.22/1.73  | 
% 7.22/1.73  | DELTA: instantiating (t32_wellord1) with fresh symbols all_13_0, all_13_1,
% 7.22/1.73  |        all_13_2 gives:
% 7.22/1.73  |   (7)  relation_restriction(all_13_1, all_13_2) = all_13_0 & $i(all_13_0) &
% 7.22/1.73  |        $i(all_13_1) & $i(all_13_2) & well_ordering(all_13_1) &
% 7.22/1.73  |        relation(all_13_1) &  ~ well_ordering(all_13_0)
% 7.22/1.73  | 
% 7.22/1.73  | ALPHA: (7) implies:
% 7.22/1.73  |   (8)   ~ well_ordering(all_13_0)
% 7.22/1.73  |   (9)  relation(all_13_1)
% 7.22/1.73  |   (10)  well_ordering(all_13_1)
% 7.22/1.73  |   (11)  $i(all_13_2)
% 7.22/1.73  |   (12)  $i(all_13_1)
% 7.22/1.73  |   (13)  $i(all_13_0)
% 7.22/1.73  |   (14)  relation_restriction(all_13_1, all_13_2) = all_13_0
% 7.22/1.73  | 
% 7.22/1.73  | GROUND_INST: instantiating (5) with all_13_1, simplifying with (9), (10), (12)
% 7.22/1.73  |              gives:
% 7.22/1.73  |   (15)  well_founded_relation(all_13_1)
% 7.22/1.73  | 
% 7.22/1.73  | GROUND_INST: instantiating (4) with all_13_1, simplifying with (9), (10), (12)
% 7.22/1.73  |              gives:
% 7.22/1.73  |   (16)  connected(all_13_1)
% 7.22/1.73  | 
% 7.22/1.73  | GROUND_INST: instantiating (3) with all_13_1, simplifying with (9), (10), (12)
% 7.22/1.73  |              gives:
% 7.22/1.73  |   (17)  antisymmetric(all_13_1)
% 7.22/1.73  | 
% 7.22/1.73  | GROUND_INST: instantiating (2) with all_13_1, simplifying with (9), (10), (12)
% 7.22/1.73  |              gives:
% 7.22/1.73  |   (18)  transitive(all_13_1)
% 7.22/1.73  | 
% 7.22/1.73  | GROUND_INST: instantiating (1) with all_13_1, simplifying with (9), (10), (12)
% 7.22/1.73  |              gives:
% 7.22/1.73  |   (19)  reflexive(all_13_1)
% 7.22/1.73  | 
% 7.22/1.74  | GROUND_INST: instantiating (dt_k2_wellord1) with all_13_1, all_13_2, all_13_0,
% 7.22/1.74  |              simplifying with (9), (11), (12), (14) gives:
% 7.22/1.74  |   (20)  relation(all_13_0)
% 7.22/1.74  | 
% 7.22/1.74  | GROUND_INST: instantiating (t22_wellord1) with all_13_2, all_13_1, all_13_0,
% 7.22/1.74  |              simplifying with (9), (11), (12), (14), (19) gives:
% 7.22/1.74  |   (21)  reflexive(all_13_0)
% 7.22/1.74  | 
% 7.22/1.74  | GROUND_INST: instantiating (t24_wellord1) with all_13_2, all_13_1, all_13_0,
% 7.22/1.74  |              simplifying with (9), (11), (12), (14), (18) gives:
% 7.22/1.74  |   (22)  transitive(all_13_0)
% 7.22/1.74  | 
% 7.22/1.74  | GROUND_INST: instantiating (t25_wellord1) with all_13_2, all_13_1, all_13_0,
% 7.22/1.74  |              simplifying with (9), (11), (12), (14), (17) gives:
% 7.22/1.74  |   (23)  antisymmetric(all_13_0)
% 7.22/1.74  | 
% 7.22/1.74  | GROUND_INST: instantiating (t23_wellord1) with all_13_2, all_13_1, all_13_0,
% 7.22/1.74  |              simplifying with (9), (11), (12), (14), (16) gives:
% 7.22/1.74  |   (24)  connected(all_13_0)
% 7.22/1.74  | 
% 7.22/1.74  | GROUND_INST: instantiating (t31_wellord1) with all_13_2, all_13_1, all_13_0,
% 7.22/1.74  |              simplifying with (9), (11), (12), (14), (15) gives:
% 7.22/1.74  |   (25)  well_founded_relation(all_13_0)
% 7.22/1.74  | 
% 7.22/1.74  | GROUND_INST: instantiating (6) with all_13_0, simplifying with (8), (13),
% 7.22/1.74  |              (20), (21), (22), (23), (24), (25) gives:
% 7.22/1.74  |   (26)  $false
% 7.22/1.74  | 
% 7.22/1.74  | CLOSE: (26) is inconsistent.
% 7.22/1.74  | 
% 7.22/1.74  End of proof
% 7.22/1.74  % SZS output end Proof for theBenchmark
% 7.22/1.74  
% 7.22/1.74  1134ms
%------------------------------------------------------------------------------