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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : NLP145+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:04:12 EDT 2023

% Result   : Theorem 9.91s 2.07s
% Output   : Proof 14.27s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NLP145+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.13/0.34  % Computer : n027.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 : Thu Aug 24 11:15:47 EDT 2023
% 0.13/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.58  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.58  
% 0.20/0.58  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.59  Running up to 7 provers in parallel.
% 0.20/0.61  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.61  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.61  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.61  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.61  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.61  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.61  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.97/1.14  Prover 1: Preprocessing ...
% 2.97/1.14  Prover 4: Preprocessing ...
% 2.97/1.17  Prover 3: Preprocessing ...
% 2.97/1.17  Prover 6: Preprocessing ...
% 2.97/1.17  Prover 0: Preprocessing ...
% 2.97/1.17  Prover 2: Preprocessing ...
% 2.97/1.17  Prover 5: Preprocessing ...
% 5.03/1.60  Prover 2: Constructing countermodel ...
% 6.42/1.62  Prover 5: Proving ...
% 8.30/1.84  Prover 6: Proving ...
% 8.94/1.94  Prover 3: Constructing countermodel ...
% 8.94/1.94  Prover 1: Constructing countermodel ...
% 9.08/1.99  Prover 4: Constructing countermodel ...
% 9.91/2.07  Prover 5: proved (1462ms)
% 9.91/2.07  
% 9.91/2.07  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.91/2.07  
% 9.91/2.08  Prover 2: stopped
% 9.91/2.08  Prover 3: stopped
% 9.91/2.09  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.91/2.09  Prover 0: Proving ...
% 9.91/2.09  Prover 6: stopped
% 9.91/2.10  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.91/2.10  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 9.91/2.10  Prover 0: stopped
% 9.91/2.10  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.91/2.10  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 9.91/2.19  Prover 11: Preprocessing ...
% 9.91/2.22  Prover 1: gave up
% 9.91/2.23  Prover 7: Preprocessing ...
% 9.91/2.23  Prover 10: Preprocessing ...
% 9.91/2.25  Prover 8: Preprocessing ...
% 9.91/2.26  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 11.16/2.27  Prover 13: Preprocessing ...
% 11.60/2.31  Prover 16: Preprocessing ...
% 11.60/2.35  Prover 10: Constructing countermodel ...
% 12.05/2.36  Prover 7: Constructing countermodel ...
% 12.05/2.38  Prover 16: Constructing countermodel ...
% 12.05/2.41  Prover 13: Constructing countermodel ...
% 13.46/2.59  Prover 11: Constructing countermodel ...
% 13.46/2.60  Prover 8: Warning: ignoring some quantifiers
% 13.93/2.62  Prover 13: Found proof (size 24)
% 13.93/2.62  Prover 13: proved (517ms)
% 13.93/2.62  Prover 11: stopped
% 13.93/2.62  Prover 10: stopped
% 13.93/2.62  Prover 4: stopped
% 13.93/2.62  Prover 7: stopped
% 13.93/2.62  Prover 16: stopped
% 13.93/2.62  Prover 8: Constructing countermodel ...
% 13.93/2.63  Prover 8: stopped
% 13.93/2.63  
% 13.93/2.63  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.93/2.63  
% 13.93/2.63  % SZS output start Proof for theBenchmark
% 13.93/2.64  Assumptions after simplification:
% 13.93/2.64  ---------------------------------
% 13.93/2.64  
% 13.93/2.64    (ax1)
% 13.93/2.64     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ furniture(v0, v1) |
% 13.93/2.64      instrumentality(v0, v1))
% 13.93/2.64  
% 13.93/2.64    (ax18)
% 13.93/2.64     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ object(v0, v1) |
% 13.93/2.64      nonliving(v0, v1))
% 13.93/2.64  
% 13.93/2.64    (ax2)
% 13.93/2.64     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ seat(v0, v1) |
% 13.93/2.64      furniture(v0, v1))
% 13.93/2.64  
% 13.93/2.64    (ax20)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ artifact(v0, v1) |
% 13.93/2.65      object(v0, v1))
% 13.93/2.65  
% 13.93/2.65    (ax21)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ instrumentality(v0,
% 13.93/2.65        v1) | artifact(v0, v1))
% 13.93/2.65  
% 13.93/2.65    (ax3)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ frontseat(v0, v1) |
% 13.93/2.65      seat(v0, v1))
% 13.93/2.65  
% 13.93/2.65    (ax38)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ human_person(v0, v1) |
% 13.93/2.65      animate(v0, v1))
% 13.93/2.65  
% 13.93/2.65    (ax48)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ man(v0, v1) |
% 13.93/2.65      human_person(v0, v1))
% 13.93/2.65  
% 13.93/2.65    (ax49)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ fellow(v0, v1) |
% 13.93/2.65      man(v0, v1))
% 13.93/2.65  
% 13.93/2.65    (ax50)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ animate(v0, v1) |  ~
% 13.93/2.65      nonliving(v0, v1))
% 13.93/2.65  
% 13.93/2.65    (ax59)
% 13.93/2.65     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v3 = v2 |  ~ $i(v3) |
% 13.93/2.65       ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ be(v0, v1, v2, v3))
% 13.93/2.65  
% 13.93/2.65    (ax60)
% 13.93/2.66     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v3 = v2 |  ~ $i(v3) |
% 13.93/2.66       ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ member(v0, v3, v1) |  ~ member(v0,
% 13.93/2.66        v2, v1) | two(v0, v1) |  ? [v4: $i] : ( ~ (v4 = v3) &  ~ (v4 = v2) &
% 13.93/2.66        $i(v4) & member(v0, v4, v1))) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) | 
% 13.93/2.66      ~ $i(v0) |  ~ two(v0, v1) |  ? [v2: $i] :  ? [v3: $i] : ( ~ (v3 = v2) &
% 13.93/2.66        $i(v3) & $i(v2) & member(v0, v3, v1) & member(v0, v2, v1) &  ! [v4: $i] :
% 13.93/2.66        (v4 = v3 | v4 = v2 |  ~ $i(v4) |  ~ member(v0, v4, v1))))
% 13.93/2.66  
% 13.93/2.66    (co1)
% 14.27/2.66     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 14.27/2.66      $i] :  ? [v6: $i] : ($i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 14.27/2.66      $i(v0) & in(v0, v5, v1) & down(v0, v5, v4) & present(v0, v5) & agent(v0, v5,
% 14.27/2.66        v3) & lonely(v0, v4) & dirty(v0, v3) & white(v0, v3) & actual_world(v0) &
% 14.27/2.66      of(v0, v2, v1) & old(v0, v3) & group(v0, v6) & two(v0, v6) & event(v0, v5) &
% 14.27/2.66      barrel(v0, v5) & chevy(v0, v3) & street(v0, v4) & placename(v0, v2) &
% 14.27/2.66      hollywood_placename(v0, v2) & city(v0, v1) &  ! [v7: $i] : ( ~ $i(v7) |  ~
% 14.27/2.66        member(v0, v7, v6) | young(v0, v7)) &  ! [v7: $i] : ( ~ $i(v7) |  ~
% 14.27/2.66        member(v0, v7, v6) | fellow(v0, v7)) &  ! [v7: $i] : ( ~ $i(v7) |  ~
% 14.27/2.66        member(v0, v7, v6) |  ? [v8: $i] :  ? [v9: $i] : ($i(v9) & $i(v8) & in(v0,
% 14.27/2.66            v9, v9) & be(v0, v8, v7, v9) & state(v0, v8) & frontseat(v0, v9))))
% 14.27/2.66  
% 14.27/2.66  Further assumptions not needed in the proof:
% 14.27/2.66  --------------------------------------------
% 14.27/2.66  ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax19, ax22, ax23, ax24, ax25,
% 14.27/2.66  ax26, ax27, ax28, ax29, ax30, ax31, ax32, ax33, ax34, ax35, ax36, ax37, ax39,
% 14.27/2.66  ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, ax5, ax51, ax52, ax53,
% 14.27/2.66  ax54, ax55, ax56, ax57, ax58, ax6, ax61, ax7, ax8, ax9
% 14.27/2.66  
% 14.27/2.66  Those formulas are unsatisfiable:
% 14.27/2.66  ---------------------------------
% 14.27/2.66  
% 14.27/2.66  Begin of proof
% 14.27/2.66  | 
% 14.27/2.66  | ALPHA: (ax60) implies:
% 14.27/2.66  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ two(v0, v1) | 
% 14.27/2.66  |          ? [v2: $i] :  ? [v3: $i] : ( ~ (v3 = v2) & $i(v3) & $i(v2) &
% 14.27/2.66  |            member(v0, v3, v1) & member(v0, v2, v1) &  ! [v4: $i] : (v4 = v3 |
% 14.27/2.66  |              v4 = v2 |  ~ $i(v4) |  ~ member(v0, v4, v1))))
% 14.27/2.66  | 
% 14.27/2.66  | DELTA: instantiating (co1) with fresh symbols all_63_0, all_63_1, all_63_2,
% 14.27/2.66  |        all_63_3, all_63_4, all_63_5, all_63_6 gives:
% 14.27/2.67  |   (2)  $i(all_63_0) & $i(all_63_1) & $i(all_63_2) & $i(all_63_3) &
% 14.27/2.67  |        $i(all_63_4) & $i(all_63_5) & $i(all_63_6) & in(all_63_6, all_63_1,
% 14.27/2.67  |          all_63_5) & down(all_63_6, all_63_1, all_63_2) & present(all_63_6,
% 14.27/2.67  |          all_63_1) & agent(all_63_6, all_63_1, all_63_3) & lonely(all_63_6,
% 14.27/2.67  |          all_63_2) & dirty(all_63_6, all_63_3) & white(all_63_6, all_63_3) &
% 14.27/2.67  |        actual_world(all_63_6) & of(all_63_6, all_63_4, all_63_5) &
% 14.27/2.67  |        old(all_63_6, all_63_3) & group(all_63_6, all_63_0) & two(all_63_6,
% 14.27/2.67  |          all_63_0) & event(all_63_6, all_63_1) & barrel(all_63_6, all_63_1) &
% 14.27/2.67  |        chevy(all_63_6, all_63_3) & street(all_63_6, all_63_2) &
% 14.27/2.67  |        placename(all_63_6, all_63_4) & hollywood_placename(all_63_6, all_63_4)
% 14.27/2.67  |        & city(all_63_6, all_63_5) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 14.27/2.67  |          member(all_63_6, v0, all_63_0) | young(all_63_6, v0)) &  ! [v0: $i] :
% 14.27/2.67  |        ( ~ $i(v0) |  ~ member(all_63_6, v0, all_63_0) | fellow(all_63_6, v0))
% 14.27/2.67  |        &  ! [v0: $i] : ( ~ $i(v0) |  ~ member(all_63_6, v0, all_63_0) |  ?
% 14.27/2.67  |          [v1: $i] :  ? [v2: $i] : ($i(v2) & $i(v1) & in(all_63_6, v2, v2) &
% 14.27/2.67  |            be(all_63_6, v1, v0, v2) & state(all_63_6, v1) &
% 14.27/2.67  |            frontseat(all_63_6, v2)))
% 14.27/2.67  | 
% 14.27/2.67  | ALPHA: (2) implies:
% 14.27/2.67  |   (3)  two(all_63_6, all_63_0)
% 14.27/2.67  |   (4)  $i(all_63_6)
% 14.27/2.67  |   (5)  $i(all_63_0)
% 14.27/2.67  |   (6)   ! [v0: $i] : ( ~ $i(v0) |  ~ member(all_63_6, v0, all_63_0) |  ? [v1:
% 14.27/2.67  |            $i] :  ? [v2: $i] : ($i(v2) & $i(v1) & in(all_63_6, v2, v2) &
% 14.27/2.67  |            be(all_63_6, v1, v0, v2) & state(all_63_6, v1) &
% 14.27/2.67  |            frontseat(all_63_6, v2)))
% 14.27/2.67  |   (7)   ! [v0: $i] : ( ~ $i(v0) |  ~ member(all_63_6, v0, all_63_0) |
% 14.27/2.67  |          fellow(all_63_6, v0))
% 14.27/2.67  | 
% 14.27/2.67  | GROUND_INST: instantiating (1) with all_63_6, all_63_0, simplifying with (3),
% 14.27/2.67  |              (4), (5) gives:
% 14.27/2.67  |   (8)   ? [v0: $i] :  ? [v1: $i] : ( ~ (v1 = v0) & $i(v1) & $i(v0) &
% 14.27/2.67  |          member(all_63_6, v1, all_63_0) & member(all_63_6, v0, all_63_0) &  !
% 14.27/2.67  |          [v2: $i] : (v2 = v1 | v2 = v0 |  ~ $i(v2) |  ~ member(all_63_6, v2,
% 14.27/2.67  |              all_63_0)))
% 14.27/2.67  | 
% 14.27/2.67  | DELTA: instantiating (8) with fresh symbols all_72_0, all_72_1 gives:
% 14.27/2.67  |   (9)   ~ (all_72_0 = all_72_1) & $i(all_72_0) & $i(all_72_1) &
% 14.27/2.67  |        member(all_63_6, all_72_0, all_63_0) & member(all_63_6, all_72_1,
% 14.27/2.67  |          all_63_0) &  ! [v0: any] : (v0 = all_72_0 | v0 = all_72_1 |  ~ $i(v0)
% 14.27/2.67  |          |  ~ member(all_63_6, v0, all_63_0))
% 14.27/2.67  | 
% 14.27/2.67  | ALPHA: (9) implies:
% 14.27/2.67  |   (10)  member(all_63_6, all_72_0, all_63_0)
% 14.27/2.67  |   (11)  $i(all_72_0)
% 14.27/2.67  | 
% 14.27/2.67  | GROUND_INST: instantiating (7) with all_72_0, simplifying with (10), (11)
% 14.27/2.67  |              gives:
% 14.27/2.67  |   (12)  fellow(all_63_6, all_72_0)
% 14.27/2.67  | 
% 14.27/2.67  | GROUND_INST: instantiating (6) with all_72_0, simplifying with (10), (11)
% 14.27/2.67  |              gives:
% 14.27/2.67  |   (13)   ? [v0: $i] :  ? [v1: $i] : ($i(v1) & $i(v0) & in(all_63_6, v1, v1) &
% 14.27/2.67  |           be(all_63_6, v0, all_72_0, v1) & state(all_63_6, v0) &
% 14.27/2.67  |           frontseat(all_63_6, v1))
% 14.27/2.67  | 
% 14.27/2.67  | DELTA: instantiating (13) with fresh symbols all_81_0, all_81_1 gives:
% 14.27/2.67  |   (14)  $i(all_81_0) & $i(all_81_1) & in(all_63_6, all_81_0, all_81_0) &
% 14.27/2.67  |         be(all_63_6, all_81_1, all_72_0, all_81_0) & state(all_63_6, all_81_1)
% 14.27/2.68  |         & frontseat(all_63_6, all_81_0)
% 14.27/2.68  | 
% 14.27/2.68  | ALPHA: (14) implies:
% 14.27/2.68  |   (15)  frontseat(all_63_6, all_81_0)
% 14.27/2.68  |   (16)  be(all_63_6, all_81_1, all_72_0, all_81_0)
% 14.27/2.68  |   (17)  $i(all_81_1)
% 14.27/2.68  |   (18)  $i(all_81_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax3) with all_63_6, all_81_0, simplifying with
% 14.27/2.68  |              (4), (15), (18) gives:
% 14.27/2.68  |   (19)  seat(all_63_6, all_81_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax49) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (12) gives:
% 14.27/2.68  |   (20)  man(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax59) with all_63_6, all_81_1, all_72_0, all_81_0,
% 14.27/2.68  |              simplifying with (4), (11), (16), (17), (18) gives:
% 14.27/2.68  |   (21)  all_81_0 = all_72_0
% 14.27/2.68  | 
% 14.27/2.68  | REDUCE: (19), (21) imply:
% 14.27/2.68  |   (22)  seat(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax2) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (22) gives:
% 14.27/2.68  |   (23)  furniture(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax48) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (20) gives:
% 14.27/2.68  |   (24)  human_person(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax1) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (23) gives:
% 14.27/2.68  |   (25)  instrumentality(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax38) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (24) gives:
% 14.27/2.68  |   (26)  animate(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax21) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (25) gives:
% 14.27/2.68  |   (27)  artifact(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax20) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (27) gives:
% 14.27/2.68  |   (28)  object(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax18) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (28) gives:
% 14.27/2.68  |   (29)  nonliving(all_63_6, all_72_0)
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (ax50) with all_63_6, all_72_0, simplifying with
% 14.27/2.68  |              (4), (11), (26), (29) gives:
% 14.27/2.68  |   (30)  $false
% 14.27/2.68  | 
% 14.27/2.68  | CLOSE: (30) is inconsistent.
% 14.27/2.68  | 
% 14.27/2.68  End of proof
% 14.27/2.68  % SZS output end Proof for theBenchmark
% 14.27/2.68  
% 14.27/2.68  2100ms
%------------------------------------------------------------------------------