TSTP Solution File: LCL638+1.001 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : LCL638+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n017.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 08:11:50 EDT 2023

% Result   : Theorem 5.94s 1.54s
% Output   : Proof 7.29s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : LCL638+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35  % Computer : n017.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 : Thu Aug 24 20:53:39 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.63  ________       _____
% 0.20/0.63  ___  __ \_________(_)________________________________
% 0.20/0.63  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.63  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.63  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.63  
% 0.20/0.63  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.63  (2023-06-19)
% 0.20/0.63  
% 0.20/0.63  (c) Philipp Rümmer, 2009-2023
% 0.20/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.63                Amanda Stjerna.
% 0.20/0.63  Free software under BSD-3-Clause.
% 0.20/0.63  
% 0.20/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.63  
% 0.20/0.63  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.64  Running up to 7 provers in parallel.
% 0.20/0.65  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.50/1.06  Prover 1: Preprocessing ...
% 2.50/1.06  Prover 4: Preprocessing ...
% 2.80/1.11  Prover 3: Preprocessing ...
% 2.80/1.11  Prover 0: Preprocessing ...
% 2.80/1.11  Prover 5: Preprocessing ...
% 2.80/1.11  Prover 6: Preprocessing ...
% 2.80/1.11  Prover 2: Preprocessing ...
% 2.99/1.26  Prover 2: Constructing countermodel ...
% 2.99/1.28  Prover 5: Constructing countermodel ...
% 3.81/1.34  Prover 1: Constructing countermodel ...
% 3.81/1.34  Prover 6: Proving ...
% 3.81/1.35  Prover 3: Constructing countermodel ...
% 4.63/1.38  Prover 4: Constructing countermodel ...
% 4.63/1.38  Prover 0: Proving ...
% 5.94/1.54  Prover 2: proved (888ms)
% 5.94/1.54  
% 5.94/1.54  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.94/1.54  
% 5.94/1.54  Prover 3: stopped
% 5.94/1.54  Prover 5: stopped
% 5.94/1.55  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.94/1.55  Prover 0: stopped
% 5.94/1.56  Prover 6: stopped
% 5.94/1.56  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.94/1.56  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.94/1.56  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.94/1.56  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.15/1.58  Prover 8: Preprocessing ...
% 6.15/1.59  Prover 7: Preprocessing ...
% 6.15/1.59  Prover 11: Preprocessing ...
% 6.15/1.60  Prover 10: Preprocessing ...
% 6.15/1.61  Prover 13: Preprocessing ...
% 6.15/1.62  Prover 7: Constructing countermodel ...
% 6.15/1.62  Prover 10: Constructing countermodel ...
% 6.64/1.65  Prover 13: Constructing countermodel ...
% 6.89/1.67  Prover 10: Found proof (size 13)
% 6.89/1.67  Prover 10: proved (118ms)
% 6.89/1.67  Prover 13: stopped
% 6.89/1.67  Prover 4: stopped
% 6.89/1.68  Prover 7: stopped
% 6.89/1.68  Prover 1: stopped
% 6.89/1.69  Prover 8: Warning: ignoring some quantifiers
% 6.89/1.69  Prover 8: Constructing countermodel ...
% 6.89/1.70  Prover 8: stopped
% 6.89/1.71  Prover 11: Constructing countermodel ...
% 6.89/1.71  Prover 11: stopped
% 6.89/1.71  
% 6.89/1.71  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.89/1.71  
% 6.89/1.71  % SZS output start Proof for theBenchmark
% 6.89/1.71  Assumptions after simplification:
% 6.89/1.71  ---------------------------------
% 6.89/1.71  
% 6.89/1.71    (main)
% 6.89/1.73     ? [v0: $i] :  ? [v1: $i] : ($i(v1) & $i(v0) & r1(v0, v1) &  ~ p1(v1) &  !
% 6.89/1.73      [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : ( ~ $i(v4) |  ~ $i(v3) |  ~ $i(v2) | 
% 6.89/1.73        ~ r1(v3, v4) |  ~ r1(v2, v3) |  ~ r1(v0, v2) | p1(v4) |  ? [v5: $i] :
% 6.89/1.73        ($i(v5) & r1(v2, v5) &  ~ p1(v5))) &  ! [v2: $i] :  ! [v3: $i] :  ! [v4:
% 6.89/1.73        $i] : ( ~ $i(v4) |  ~ $i(v3) |  ~ $i(v2) |  ~ r1(v3, v4) |  ~ r1(v2, v3) |
% 6.89/1.73         ~ r1(v0, v2) |  ? [v5: $i] : ($i(v5) & ((p1(v5) & r1(v4, v5)) | (r1(v2,
% 6.89/1.73                v5) &  ! [v6: $i] : ( ~ $i(v6) |  ~ p1(v6) |  ~ r1(v5, v6)))))) & 
% 6.89/1.73      ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3) |  ~ $i(v2) |  ~ p1(v2) |  ~ r1(v2,
% 6.89/1.73          v3) |  ~ r1(v0, v2) |  ? [v4: $i] : ($i(v4) & p1(v4) & r1(v3, v4))) &  !
% 6.89/1.73      [v2: $i] :  ! [v3: $i] : ( ~ $i(v3) |  ~ $i(v2) |  ~ r1(v2, v3) |  ~ r1(v0,
% 6.89/1.73          v2) | p1(v2) |  ? [v4: $i] : ($i(v4) & r1(v3, v4) &  ~ p1(v4))) &  !
% 6.89/1.73      [v2: $i] : ( ~ $i(v2) |  ~ r1(v1, v2) | p1(v2)) &  ! [v2: $i] : ( ~ $i(v2) |
% 6.89/1.73         ~ r1(v0, v2) |  ? [v3: $i] : ($i(v3) & r1(v2, v3))))
% 6.89/1.73  
% 6.89/1.73  Those formulas are unsatisfiable:
% 6.89/1.73  ---------------------------------
% 6.89/1.73  
% 6.89/1.73  Begin of proof
% 6.89/1.73  | 
% 7.29/1.73  | DELTA: instantiating (main) with fresh symbols all_2_0, all_2_1 gives:
% 7.29/1.74  |   (1)  $i(all_2_0) & $i(all_2_1) & r1(all_2_1, all_2_0) &  ~ p1(all_2_0) &  !
% 7.29/1.74  |        [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~
% 7.29/1.74  |          $i(v0) |  ~ r1(v1, v2) |  ~ r1(v0, v1) |  ~ r1(all_2_1, v0) | p1(v2)
% 7.29/1.74  |          |  ? [v3: $i] : ($i(v3) & r1(v0, v3) &  ~ p1(v3))) &  ! [v0: $i] :  !
% 7.29/1.74  |        [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ r1(v1,
% 7.29/1.74  |            v2) |  ~ r1(v0, v1) |  ~ r1(all_2_1, v0) |  ? [v3: $i] : ($i(v3) &
% 7.29/1.74  |            ((p1(v3) & r1(v2, v3)) | (r1(v0, v3) &  ! [v4: $i] : ( ~ $i(v4) | 
% 7.29/1.74  |                  ~ p1(v4) |  ~ r1(v3, v4)))))) &  ! [v0: $i] :  ! [v1: $i] : (
% 7.29/1.74  |          ~ $i(v1) |  ~ $i(v0) |  ~ p1(v0) |  ~ r1(v0, v1) |  ~ r1(all_2_1, v0)
% 7.29/1.74  |          |  ? [v2: $i] : ($i(v2) & p1(v2) & r1(v1, v2))) &  ! [v0: $i] :  !
% 7.29/1.74  |        [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ r1(v0, v1) |  ~ r1(all_2_1, v0)
% 7.29/1.74  |          | p1(v0) |  ? [v2: $i] : ($i(v2) & r1(v1, v2) &  ~ p1(v2))) &  ! [v0:
% 7.29/1.74  |          $i] : ( ~ $i(v0) |  ~ r1(all_2_0, v0) | p1(v0)) &  ! [v0: $i] : ( ~
% 7.29/1.74  |          $i(v0) |  ~ r1(all_2_1, v0) |  ? [v1: $i] : ($i(v1) & r1(v0, v1)))
% 7.29/1.74  | 
% 7.29/1.74  | ALPHA: (1) implies:
% 7.29/1.74  |   (2)   ~ p1(all_2_0)
% 7.29/1.74  |   (3)  r1(all_2_1, all_2_0)
% 7.29/1.74  |   (4)  $i(all_2_0)
% 7.29/1.74  |   (5)   ! [v0: $i] : ( ~ $i(v0) |  ~ r1(all_2_1, v0) |  ? [v1: $i] : ($i(v1) &
% 7.29/1.74  |            r1(v0, v1)))
% 7.29/1.74  |   (6)   ! [v0: $i] : ( ~ $i(v0) |  ~ r1(all_2_0, v0) | p1(v0))
% 7.29/1.74  |   (7)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ r1(v0, v1) |  ~
% 7.29/1.74  |          r1(all_2_1, v0) | p1(v0) |  ? [v2: $i] : ($i(v2) & r1(v1, v2) &  ~
% 7.29/1.74  |            p1(v2)))
% 7.29/1.75  |   (8)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~
% 7.29/1.75  |          $i(v0) |  ~ r1(v1, v2) |  ~ r1(v0, v1) |  ~ r1(all_2_1, v0) | p1(v2)
% 7.29/1.75  |          |  ? [v3: $i] : ($i(v3) & r1(v0, v3) &  ~ p1(v3)))
% 7.29/1.75  | 
% 7.29/1.75  | GROUND_INST: instantiating (5) with all_2_0, simplifying with (3), (4) gives:
% 7.29/1.75  |   (9)   ? [v0: $i] : ($i(v0) & r1(all_2_0, v0))
% 7.29/1.75  | 
% 7.29/1.75  | DELTA: instantiating (9) with fresh symbol all_10_0 gives:
% 7.29/1.75  |   (10)  $i(all_10_0) & r1(all_2_0, all_10_0)
% 7.29/1.75  | 
% 7.29/1.75  | ALPHA: (10) implies:
% 7.29/1.75  |   (11)  r1(all_2_0, all_10_0)
% 7.29/1.75  |   (12)  $i(all_10_0)
% 7.29/1.75  | 
% 7.29/1.75  | GROUND_INST: instantiating (7) with all_2_0, all_10_0, simplifying with (2),
% 7.29/1.75  |              (3), (4), (11), (12) gives:
% 7.29/1.75  |   (13)   ? [v0: $i] : ($i(v0) & r1(all_10_0, v0) &  ~ p1(v0))
% 7.29/1.75  | 
% 7.29/1.75  | DELTA: instantiating (13) with fresh symbol all_18_0 gives:
% 7.29/1.75  |   (14)  $i(all_18_0) & r1(all_10_0, all_18_0) &  ~ p1(all_18_0)
% 7.29/1.75  | 
% 7.29/1.75  | ALPHA: (14) implies:
% 7.29/1.75  |   (15)   ~ p1(all_18_0)
% 7.29/1.75  |   (16)  r1(all_10_0, all_18_0)
% 7.29/1.75  |   (17)  $i(all_18_0)
% 7.29/1.75  | 
% 7.29/1.75  | GROUND_INST: instantiating (8) with all_2_0, all_10_0, all_18_0, simplifying
% 7.29/1.75  |              with (3), (4), (11), (12), (15), (16), (17) gives:
% 7.29/1.75  |   (18)   ? [v0: $i] : ($i(v0) & r1(all_2_0, v0) &  ~ p1(v0))
% 7.29/1.75  | 
% 7.29/1.75  | DELTA: instantiating (18) with fresh symbol all_25_0 gives:
% 7.29/1.75  |   (19)  $i(all_25_0) & r1(all_2_0, all_25_0) &  ~ p1(all_25_0)
% 7.29/1.75  | 
% 7.29/1.75  | ALPHA: (19) implies:
% 7.29/1.75  |   (20)   ~ p1(all_25_0)
% 7.29/1.75  |   (21)  r1(all_2_0, all_25_0)
% 7.29/1.75  |   (22)  $i(all_25_0)
% 7.29/1.75  | 
% 7.29/1.75  | GROUND_INST: instantiating (6) with all_25_0, simplifying with (20), (21),
% 7.29/1.75  |              (22) gives:
% 7.29/1.75  |   (23)  $false
% 7.29/1.75  | 
% 7.29/1.75  | CLOSE: (23) is inconsistent.
% 7.29/1.75  | 
% 7.29/1.75  End of proof
% 7.29/1.75  % SZS output end Proof for theBenchmark
% 7.29/1.75  
% 7.29/1.75  1127ms
%------------------------------------------------------------------------------