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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : NLP001+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n027.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 10:03:13 EDT 2023

% Result   : Theorem 4.32s 1.30s
% Output   : Proof 6.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NLP001+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug 24 11:49:17 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.20/0.58  ________       _____
% 0.20/0.58  ___  __ \_________(_)________________________________
% 0.20/0.58  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.58  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.58  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.58  
% 0.20/0.58  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.58  (2023-06-19)
% 0.20/0.58  
% 0.20/0.58  (c) Philipp Rümmer, 2009-2023
% 0.20/0.58  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.58                Amanda Stjerna.
% 0.20/0.58  Free software under BSD-3-Clause.
% 0.20/0.58  
% 0.20/0.59  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.59  
% 0.20/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.60  Running up to 7 provers in parallel.
% 0.20/0.62  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.62  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.13/0.98  Prover 1: Preprocessing ...
% 2.13/0.98  Prover 4: Preprocessing ...
% 2.60/1.01  Prover 0: Preprocessing ...
% 2.60/1.01  Prover 6: Preprocessing ...
% 2.60/1.02  Prover 2: Preprocessing ...
% 2.60/1.02  Prover 5: Preprocessing ...
% 2.60/1.02  Prover 3: Preprocessing ...
% 2.99/1.13  Prover 2: Constructing countermodel ...
% 2.99/1.13  Prover 5: Constructing countermodel ...
% 3.91/1.23  Prover 6: Proving ...
% 4.21/1.24  Prover 1: Constructing countermodel ...
% 4.32/1.25  Prover 3: Constructing countermodel ...
% 4.32/1.30  Prover 5: proved (676ms)
% 4.32/1.30  
% 4.32/1.30  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/1.30  
% 4.32/1.31  Prover 2: proved (686ms)
% 4.32/1.31  
% 4.32/1.31  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/1.31  
% 4.32/1.32  Prover 3: stopped
% 4.32/1.33  Prover 6: stopped
% 4.32/1.33  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.32/1.33  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.32/1.33  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.32/1.33  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.32/1.34  Prover 8: Preprocessing ...
% 4.32/1.36  Prover 10: Preprocessing ...
% 4.32/1.36  Prover 7: Preprocessing ...
% 4.32/1.37  Prover 11: Preprocessing ...
% 4.32/1.40  Prover 7: Constructing countermodel ...
% 4.32/1.41  Prover 10: Constructing countermodel ...
% 4.98/1.48  Prover 8: Warning: ignoring some quantifiers
% 5.99/1.49  Prover 8: Constructing countermodel ...
% 5.99/1.49  Prover 0: stopped
% 5.99/1.49  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.99/1.50  Prover 10: Found proof (size 9)
% 5.99/1.50  Prover 7: Found proof (size 9)
% 5.99/1.50  Prover 10: proved (171ms)
% 5.99/1.50  Prover 7: proved (184ms)
% 5.99/1.50  Prover 8: stopped
% 5.99/1.50  Prover 1: stopped
% 5.99/1.51  Prover 13: Preprocessing ...
% 5.99/1.51  Prover 4: stopped
% 5.99/1.53  Prover 13: Constructing countermodel ...
% 5.99/1.53  Prover 13: stopped
% 5.99/1.54  Prover 11: stopped
% 5.99/1.54  
% 5.99/1.54  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.99/1.54  
% 5.99/1.54  % SZS output start Proof for theBenchmark
% 5.99/1.54  Assumptions after simplification:
% 5.99/1.54  ---------------------------------
% 5.99/1.54  
% 5.99/1.54    (co1)
% 5.99/1.56     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] : ($i(v3) & $i(v2) &
% 5.99/1.56      $i(v1) & $i(v0) & ((in(v1, v0) & down(v1, v3) & barrel(v1, v2) & old(v2) &
% 5.99/1.56          dirty(v2) & white(v2) & car(v2) & chevy(v2) & lonely(v3) & way(v3) &
% 5.99/1.56          street(v3) & event(v1) & city(v0) & hollywood(v0) &  ! [v4: $i] :  !
% 5.99/1.56          [v5: $i] :  ! [v6: $i] :  ! [v7: $i] : ( ~ $i(v7) |  ~ $i(v6) |  ~
% 5.99/1.56            $i(v5) |  ~ $i(v4) |  ~ in(v5, v4) |  ~ down(v5, v6) |  ~ barrel(v5,
% 5.99/1.56              v7) |  ~ old(v7) |  ~ dirty(v7) |  ~ white(v7) |  ~ car(v7) |  ~
% 5.99/1.56            chevy(v7) |  ~ lonely(v6) |  ~ way(v6) |  ~ street(v6) |  ~ event(v5)
% 5.99/1.56            |  ~ city(v4) |  ~ hollywood(v4))) | (in(v1, v0) & down(v1, v2) &
% 5.99/1.56          barrel(v1, v3) & old(v3) & dirty(v3) & white(v3) & car(v3) & chevy(v3) &
% 5.99/1.56          lonely(v2) & way(v2) & street(v2) & event(v1) & city(v0) & hollywood(v0)
% 5.99/1.56          &  ! [v4: $i] :  ! [v5: $i] :  ! [v6: $i] :  ! [v7: $i] : ( ~ $i(v7) | 
% 5.99/1.56            ~ $i(v6) |  ~ $i(v5) |  ~ $i(v4) |  ~ in(v5, v4) |  ~ down(v5, v7) | 
% 5.99/1.56            ~ barrel(v5, v6) |  ~ old(v6) |  ~ dirty(v6) |  ~ white(v6) |  ~
% 5.99/1.56            car(v6) |  ~ chevy(v6) |  ~ lonely(v7) |  ~ way(v7) |  ~ street(v7) | 
% 5.99/1.56            ~ event(v5) |  ~ city(v4) |  ~ hollywood(v4)))))
% 5.99/1.56  
% 5.99/1.56  Those formulas are unsatisfiable:
% 5.99/1.56  ---------------------------------
% 5.99/1.56  
% 5.99/1.56  Begin of proof
% 5.99/1.56  | 
% 5.99/1.56  | DELTA: instantiating (co1) with fresh symbols all_2_0, all_2_1, all_2_2,
% 5.99/1.56  |        all_2_3 gives:
% 5.99/1.56  |   (1)  $i(all_2_0) & $i(all_2_1) & $i(all_2_2) & $i(all_2_3) & ((in(all_2_2,
% 5.99/1.56  |              all_2_3) & down(all_2_2, all_2_0) & barrel(all_2_2, all_2_1) &
% 5.99/1.56  |            old(all_2_1) & dirty(all_2_1) & white(all_2_1) & car(all_2_1) &
% 5.99/1.56  |            chevy(all_2_1) & lonely(all_2_0) & way(all_2_0) & street(all_2_0) &
% 5.99/1.56  |            event(all_2_2) & city(all_2_3) & hollywood(all_2_3) &  ! [v0: $i] :
% 5.99/1.56  |             ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3) |  ~ $i(v2) | 
% 5.99/1.56  |              ~ $i(v1) |  ~ $i(v0) |  ~ in(v1, v0) |  ~ down(v1, v2) |  ~
% 5.99/1.56  |              barrel(v1, v3) |  ~ old(v3) |  ~ dirty(v3) |  ~ white(v3) |  ~
% 5.99/1.56  |              car(v3) |  ~ chevy(v3) |  ~ lonely(v2) |  ~ way(v2) |  ~
% 5.99/1.56  |              street(v2) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))) |
% 5.99/1.56  |          (in(all_2_2, all_2_3) & down(all_2_2, all_2_1) & barrel(all_2_2,
% 5.99/1.56  |              all_2_0) & old(all_2_0) & dirty(all_2_0) & white(all_2_0) &
% 5.99/1.56  |            car(all_2_0) & chevy(all_2_0) & lonely(all_2_1) & way(all_2_1) &
% 5.99/1.56  |            street(all_2_1) & event(all_2_2) & city(all_2_3) &
% 5.99/1.56  |            hollywood(all_2_3) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  !
% 5.99/1.57  |            [v3: $i] : ( ~ $i(v3) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~
% 5.99/1.57  |              in(v1, v0) |  ~ down(v1, v3) |  ~ barrel(v1, v2) |  ~ old(v2) | 
% 5.99/1.57  |              ~ dirty(v2) |  ~ white(v2) |  ~ car(v2) |  ~ chevy(v2) |  ~
% 5.99/1.57  |              lonely(v3) |  ~ way(v3) |  ~ street(v3) |  ~ event(v1) |  ~
% 5.99/1.57  |              city(v0) |  ~ hollywood(v0))))
% 5.99/1.57  | 
% 5.99/1.57  | ALPHA: (1) implies:
% 5.99/1.57  |   (2)  $i(all_2_3)
% 5.99/1.57  |   (3)  $i(all_2_2)
% 5.99/1.57  |   (4)  $i(all_2_1)
% 5.99/1.57  |   (5)  $i(all_2_0)
% 5.99/1.57  |   (6)  (in(all_2_2, all_2_3) & down(all_2_2, all_2_0) & barrel(all_2_2,
% 5.99/1.57  |            all_2_1) & old(all_2_1) & dirty(all_2_1) & white(all_2_1) &
% 5.99/1.57  |          car(all_2_1) & chevy(all_2_1) & lonely(all_2_0) & way(all_2_0) &
% 5.99/1.57  |          street(all_2_0) & event(all_2_2) & city(all_2_3) & hollywood(all_2_3)
% 5.99/1.57  |          &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3)
% 5.99/1.57  |            |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ in(v1, v0) |  ~ down(v1,
% 5.99/1.57  |              v2) |  ~ barrel(v1, v3) |  ~ old(v3) |  ~ dirty(v3) |  ~
% 5.99/1.57  |            white(v3) |  ~ car(v3) |  ~ chevy(v3) |  ~ lonely(v2) |  ~ way(v2)
% 5.99/1.57  |            |  ~ street(v2) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))) |
% 5.99/1.57  |        (in(all_2_2, all_2_3) & down(all_2_2, all_2_1) & barrel(all_2_2,
% 5.99/1.57  |            all_2_0) & old(all_2_0) & dirty(all_2_0) & white(all_2_0) &
% 5.99/1.57  |          car(all_2_0) & chevy(all_2_0) & lonely(all_2_1) & way(all_2_1) &
% 5.99/1.57  |          street(all_2_1) & event(all_2_2) & city(all_2_3) & hollywood(all_2_3)
% 5.99/1.57  |          &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3)
% 5.99/1.57  |            |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ in(v1, v0) |  ~ down(v1,
% 5.99/1.57  |              v3) |  ~ barrel(v1, v2) |  ~ old(v2) |  ~ dirty(v2) |  ~
% 5.99/1.57  |            white(v2) |  ~ car(v2) |  ~ chevy(v2) |  ~ lonely(v3) |  ~ way(v3)
% 5.99/1.57  |            |  ~ street(v3) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0)))
% 5.99/1.57  | 
% 5.99/1.57  | BETA: splitting (6) gives:
% 5.99/1.57  | 
% 5.99/1.57  | Case 1:
% 5.99/1.57  | | 
% 5.99/1.57  | |   (7)  in(all_2_2, all_2_3) & down(all_2_2, all_2_0) & barrel(all_2_2,
% 5.99/1.57  | |          all_2_1) & old(all_2_1) & dirty(all_2_1) & white(all_2_1) &
% 5.99/1.57  | |        car(all_2_1) & chevy(all_2_1) & lonely(all_2_0) & way(all_2_0) &
% 5.99/1.57  | |        street(all_2_0) & event(all_2_2) & city(all_2_3) & hollywood(all_2_3)
% 5.99/1.57  | |        &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3)
% 5.99/1.57  | |          |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ in(v1, v0) |  ~ down(v1,
% 5.99/1.57  | |            v2) |  ~ barrel(v1, v3) |  ~ old(v3) |  ~ dirty(v3) |  ~
% 5.99/1.57  | |          white(v3) |  ~ car(v3) |  ~ chevy(v3) |  ~ lonely(v2) |  ~ way(v2)
% 5.99/1.57  | |          |  ~ street(v2) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))
% 5.99/1.57  | | 
% 5.99/1.57  | | ALPHA: (7) implies:
% 6.48/1.57  | |   (8)  hollywood(all_2_3)
% 6.48/1.57  | |   (9)  city(all_2_3)
% 6.48/1.57  | |   (10)  event(all_2_2)
% 6.48/1.57  | |   (11)  street(all_2_0)
% 6.48/1.57  | |   (12)  way(all_2_0)
% 6.48/1.58  | |   (13)  lonely(all_2_0)
% 6.48/1.58  | |   (14)  chevy(all_2_1)
% 6.48/1.58  | |   (15)  car(all_2_1)
% 6.48/1.58  | |   (16)  white(all_2_1)
% 6.48/1.58  | |   (17)  dirty(all_2_1)
% 6.48/1.58  | |   (18)  old(all_2_1)
% 6.48/1.58  | |   (19)  barrel(all_2_2, all_2_1)
% 6.48/1.58  | |   (20)  down(all_2_2, all_2_0)
% 6.48/1.58  | |   (21)  in(all_2_2, all_2_3)
% 6.48/1.58  | |   (22)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3) |
% 6.48/1.58  | |            ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ in(v1, v0) |  ~ down(v1,
% 6.48/1.58  | |             v2) |  ~ barrel(v1, v3) |  ~ old(v3) |  ~ dirty(v3) |  ~
% 6.48/1.58  | |           white(v3) |  ~ car(v3) |  ~ chevy(v3) |  ~ lonely(v2) |  ~ way(v2)
% 6.48/1.58  | |           |  ~ street(v2) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))
% 6.48/1.58  | | 
% 6.48/1.58  | | GROUND_INST: instantiating (22) with all_2_3, all_2_2, all_2_0, all_2_1,
% 6.48/1.58  | |              simplifying with (2), (3), (4), (5), (8), (9), (10), (11),
% 6.48/1.58  | |              (12), (13), (14), (15), (16), (17), (18), (19), (20), (21)
% 6.48/1.58  | |              gives:
% 6.48/1.58  | |   (23)  $false
% 6.48/1.58  | | 
% 6.48/1.58  | | CLOSE: (23) is inconsistent.
% 6.48/1.58  | | 
% 6.48/1.58  | Case 2:
% 6.48/1.58  | | 
% 6.52/1.58  | |   (24)  in(all_2_2, all_2_3) & down(all_2_2, all_2_1) & barrel(all_2_2,
% 6.52/1.58  | |           all_2_0) & old(all_2_0) & dirty(all_2_0) & white(all_2_0) &
% 6.52/1.58  | |         car(all_2_0) & chevy(all_2_0) & lonely(all_2_1) & way(all_2_1) &
% 6.52/1.58  | |         street(all_2_1) & event(all_2_2) & city(all_2_3) &
% 6.52/1.58  | |         hollywood(all_2_3) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  !
% 6.52/1.58  | |         [v3: $i] : ( ~ $i(v3) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~
% 6.52/1.58  | |           in(v1, v0) |  ~ down(v1, v3) |  ~ barrel(v1, v2) |  ~ old(v2) |  ~
% 6.52/1.58  | |           dirty(v2) |  ~ white(v2) |  ~ car(v2) |  ~ chevy(v2) |  ~
% 6.52/1.58  | |           lonely(v3) |  ~ way(v3) |  ~ street(v3) |  ~ event(v1) |  ~
% 6.52/1.58  | |           city(v0) |  ~ hollywood(v0))
% 6.52/1.58  | | 
% 6.52/1.58  | | ALPHA: (24) implies:
% 6.52/1.58  | |   (25)  hollywood(all_2_3)
% 6.52/1.58  | |   (26)  city(all_2_3)
% 6.52/1.58  | |   (27)  event(all_2_2)
% 6.52/1.58  | |   (28)  street(all_2_1)
% 6.52/1.59  | |   (29)  way(all_2_1)
% 6.52/1.59  | |   (30)  lonely(all_2_1)
% 6.52/1.59  | |   (31)  chevy(all_2_0)
% 6.52/1.59  | |   (32)  car(all_2_0)
% 6.52/1.59  | |   (33)  white(all_2_0)
% 6.52/1.59  | |   (34)  dirty(all_2_0)
% 6.52/1.59  | |   (35)  old(all_2_0)
% 6.52/1.59  | |   (36)  barrel(all_2_2, all_2_0)
% 6.52/1.59  | |   (37)  down(all_2_2, all_2_1)
% 6.52/1.59  | |   (38)  in(all_2_2, all_2_3)
% 6.52/1.59  | |   (39)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3) |
% 6.52/1.59  | |            ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ in(v1, v0) |  ~ down(v1,
% 6.52/1.59  | |             v3) |  ~ barrel(v1, v2) |  ~ old(v2) |  ~ dirty(v2) |  ~
% 6.52/1.59  | |           white(v2) |  ~ car(v2) |  ~ chevy(v2) |  ~ lonely(v3) |  ~ way(v3)
% 6.52/1.59  | |           |  ~ street(v3) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))
% 6.52/1.59  | | 
% 6.52/1.59  | | GROUND_INST: instantiating (39) with all_2_3, all_2_2, all_2_0, all_2_1,
% 6.52/1.59  | |              simplifying with (2), (3), (4), (5), (25), (26), (27), (28),
% 6.52/1.59  | |              (29), (30), (31), (32), (33), (34), (35), (36), (37), (38)
% 6.52/1.59  | |              gives:
% 6.52/1.59  | |   (40)  $false
% 6.52/1.59  | | 
% 6.52/1.59  | | CLOSE: (40) is inconsistent.
% 6.52/1.59  | | 
% 6.52/1.59  | End of split
% 6.52/1.59  | 
% 6.52/1.59  End of proof
% 6.52/1.59  % SZS output end Proof for theBenchmark
% 6.52/1.59  
% 6.52/1.59  1004ms
%------------------------------------------------------------------------------