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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : NLP143+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 : n021.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:11 EDT 2023

% Result   : Theorem 10.01s 2.12s
% Output   : Proof 15.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NLP143+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 : n021.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:07:55 EDT 2023
% 0.13/0.34  % 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/sandbox2/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 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 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 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 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
% 3.40/1.22  Prover 1: Preprocessing ...
% 3.40/1.22  Prover 4: Preprocessing ...
% 3.64/1.25  Prover 6: Preprocessing ...
% 3.64/1.25  Prover 2: Preprocessing ...
% 3.64/1.25  Prover 5: Preprocessing ...
% 3.64/1.25  Prover 0: Preprocessing ...
% 3.64/1.25  Prover 3: Preprocessing ...
% 6.34/1.66  Prover 5: Proving ...
% 6.34/1.66  Prover 2: Constructing countermodel ...
% 7.77/1.86  Prover 6: Proving ...
% 8.47/1.92  Prover 0: Proving ...
% 8.47/1.92  Prover 1: Constructing countermodel ...
% 8.47/1.95  Prover 3: Constructing countermodel ...
% 9.28/2.01  Prover 4: Constructing countermodel ...
% 10.01/2.12  Prover 2: proved (1478ms)
% 10.01/2.12  
% 10.01/2.12  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.01/2.12  
% 10.01/2.12  Prover 6: stopped
% 10.01/2.13  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.01/2.13  Prover 5: stopped
% 10.01/2.14  Prover 0: stopped
% 10.01/2.15  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.01/2.15  Prover 3: stopped
% 10.01/2.15  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 10.01/2.15  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 10.01/2.15  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 10.01/2.16  Prover 1: gave up
% 10.01/2.17  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 10.69/2.22  Prover 7: Preprocessing ...
% 10.69/2.27  Prover 8: Preprocessing ...
% 10.69/2.28  Prover 10: Preprocessing ...
% 11.46/2.31  Prover 11: Preprocessing ...
% 11.46/2.31  Prover 7: Constructing countermodel ...
% 11.46/2.32  Prover 13: Preprocessing ...
% 11.46/2.34  Prover 16: Preprocessing ...
% 11.46/2.39  Prover 10: Constructing countermodel ...
% 12.58/2.49  Prover 16: Constructing countermodel ...
% 12.92/2.52  Prover 13: Constructing countermodel ...
% 14.29/2.70  Prover 8: Warning: ignoring some quantifiers
% 14.29/2.72  Prover 8: Constructing countermodel ...
% 14.29/2.75  Prover 7: Found proof (size 23)
% 14.29/2.75  Prover 7: proved (632ms)
% 14.29/2.75  Prover 16: stopped
% 14.29/2.75  Prover 4: stopped
% 14.29/2.75  Prover 13: stopped
% 14.76/2.75  Prover 10: Found proof (size 24)
% 14.76/2.75  Prover 10: proved (617ms)
% 14.79/2.76  Prover 8: stopped
% 14.79/2.78  Prover 11: Constructing countermodel ...
% 14.79/2.79  Prover 11: stopped
% 14.79/2.79  
% 14.79/2.79  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.79/2.79  
% 14.79/2.79  % SZS output start Proof for theBenchmark
% 14.79/2.80  Assumptions after simplification:
% 14.79/2.80  ---------------------------------
% 14.79/2.80  
% 14.79/2.80    (ax1)
% 15.01/2.80     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ furniture(v0, v1) |
% 15.01/2.80      instrumentality(v0, v1))
% 15.01/2.80  
% 15.01/2.80    (ax16)
% 15.01/2.80     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ object(v0, v1) |
% 15.01/2.80      unisex(v0, v1))
% 15.01/2.80  
% 15.01/2.80    (ax2)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ seat(v0, v1) |
% 15.01/2.81      furniture(v0, v1))
% 15.01/2.81  
% 15.01/2.81    (ax20)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ artifact(v0, v1) |
% 15.01/2.81      object(v0, v1))
% 15.01/2.81  
% 15.01/2.81    (ax21)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ instrumentality(v0,
% 15.01/2.81        v1) | artifact(v0, v1))
% 15.01/2.81  
% 15.01/2.81    (ax3)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ frontseat(v0, v1) |
% 15.01/2.81      seat(v0, v1))
% 15.01/2.81  
% 15.01/2.81    (ax37)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ man(v0, v1) | male(v0,
% 15.01/2.81        v1))
% 15.01/2.81  
% 15.01/2.81    (ax49)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ fellow(v0, v1) |
% 15.01/2.81      man(v0, v1))
% 15.01/2.81  
% 15.01/2.81    (ax56)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ male(v0, v1) |  ~
% 15.01/2.81      unisex(v0, v1))
% 15.01/2.81  
% 15.01/2.81    (ax59)
% 15.01/2.81     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v3 = v2 |  ~ $i(v3) |
% 15.01/2.81       ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ be(v0, v1, v2, v3))
% 15.01/2.81  
% 15.01/2.81    (ax60)
% 15.01/2.82     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v3 = v2 |  ~ $i(v3) |
% 15.01/2.82       ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ member(v0, v3, v1) |  ~ member(v0,
% 15.01/2.82        v2, v1) | two(v0, v1) |  ? [v4: $i] : ( ~ (v4 = v3) &  ~ (v4 = v2) &
% 15.01/2.82        $i(v4) & member(v0, v4, v1))) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) | 
% 15.01/2.82      ~ $i(v0) |  ~ two(v0, v1) |  ? [v2: $i] :  ? [v3: $i] : ( ~ (v3 = v2) &
% 15.01/2.82        $i(v3) & $i(v2) & member(v0, v3, v1) & member(v0, v2, v1) &  ! [v4: $i] :
% 15.01/2.82        (v4 = v3 | v4 = v2 |  ~ $i(v4) |  ~ member(v0, v4, v1))))
% 15.01/2.82  
% 15.01/2.82    (co1)
% 15.01/2.82     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 15.01/2.82      $i] : ($i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & in(v0, v4, v2)
% 15.01/2.82      & down(v0, v4, v3) & present(v0, v4) & agent(v0, v4, v2) & lonely(v0, v3) &
% 15.01/2.82      dirty(v0, v2) & white(v0, v2) & actual_world(v0) & of(v0, v1, v2) & old(v0,
% 15.01/2.82        v2) & group(v0, v5) & two(v0, v5) & event(v0, v4) & barrel(v0, v4) &
% 15.01/2.82      chevy(v0, v2) & street(v0, v3) & placename(v0, v1) & hollywood_placename(v0,
% 15.01/2.82        v1) & city(v0, v2) &  ! [v6: $i] : ( ~ $i(v6) |  ~ member(v0, v6, v5) |
% 15.01/2.82        young(v0, v6)) &  ! [v6: $i] : ( ~ $i(v6) |  ~ member(v0, v6, v5) |
% 15.01/2.82        fellow(v0, v6)) &  ! [v6: $i] : ( ~ $i(v6) |  ~ member(v0, v6, v5) |  ?
% 15.01/2.82        [v7: $i] :  ? [v8: $i] : ($i(v8) & $i(v7) & in(v0, v8, v8) & be(v0, v7,
% 15.01/2.82            v6, v8) & state(v0, v7) & frontseat(v0, v8))))
% 15.01/2.82  
% 15.01/2.82  Further assumptions not needed in the proof:
% 15.01/2.82  --------------------------------------------
% 15.01/2.82  ax10, ax11, ax12, ax13, ax14, ax15, ax17, ax18, ax19, ax22, ax23, ax24, ax25,
% 15.01/2.82  ax26, ax27, ax28, ax29, ax30, ax31, ax32, ax33, ax34, ax35, ax36, ax38, ax39,
% 15.01/2.82  ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, ax48, ax5, ax50, ax51,
% 15.01/2.82  ax52, ax53, ax54, ax55, ax57, ax58, ax6, ax61, ax7, ax8, ax9
% 15.01/2.82  
% 15.01/2.82  Those formulas are unsatisfiable:
% 15.01/2.82  ---------------------------------
% 15.01/2.82  
% 15.01/2.82  Begin of proof
% 15.01/2.82  | 
% 15.01/2.82  | ALPHA: (ax60) implies:
% 15.01/2.83  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ two(v0, v1) | 
% 15.01/2.83  |          ? [v2: $i] :  ? [v3: $i] : ( ~ (v3 = v2) & $i(v3) & $i(v2) &
% 15.01/2.83  |            member(v0, v3, v1) & member(v0, v2, v1) &  ! [v4: $i] : (v4 = v3 |
% 15.01/2.83  |              v4 = v2 |  ~ $i(v4) |  ~ member(v0, v4, v1))))
% 15.01/2.83  | 
% 15.01/2.83  | DELTA: instantiating (co1) with fresh symbols all_63_0, all_63_1, all_63_2,
% 15.01/2.83  |        all_63_3, all_63_4, all_63_5 gives:
% 15.01/2.83  |   (2)  $i(all_63_0) & $i(all_63_1) & $i(all_63_2) & $i(all_63_3) &
% 15.01/2.83  |        $i(all_63_4) & $i(all_63_5) & in(all_63_5, all_63_1, all_63_3) &
% 15.01/2.83  |        down(all_63_5, all_63_1, all_63_2) & present(all_63_5, all_63_1) &
% 15.01/2.83  |        agent(all_63_5, all_63_1, all_63_3) & lonely(all_63_5, all_63_2) &
% 15.01/2.83  |        dirty(all_63_5, all_63_3) & white(all_63_5, all_63_3) &
% 15.01/2.83  |        actual_world(all_63_5) & of(all_63_5, all_63_4, all_63_3) &
% 15.01/2.83  |        old(all_63_5, all_63_3) & group(all_63_5, all_63_0) & two(all_63_5,
% 15.01/2.83  |          all_63_0) & event(all_63_5, all_63_1) & barrel(all_63_5, all_63_1) &
% 15.01/2.83  |        chevy(all_63_5, all_63_3) & street(all_63_5, all_63_2) &
% 15.01/2.83  |        placename(all_63_5, all_63_4) & hollywood_placename(all_63_5, all_63_4)
% 15.01/2.83  |        & city(all_63_5, all_63_3) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 15.01/2.83  |          member(all_63_5, v0, all_63_0) | young(all_63_5, v0)) &  ! [v0: $i] :
% 15.01/2.83  |        ( ~ $i(v0) |  ~ member(all_63_5, v0, all_63_0) | fellow(all_63_5, v0))
% 15.01/2.83  |        &  ! [v0: $i] : ( ~ $i(v0) |  ~ member(all_63_5, v0, all_63_0) |  ?
% 15.01/2.83  |          [v1: $i] :  ? [v2: $i] : ($i(v2) & $i(v1) & in(all_63_5, v2, v2) &
% 15.01/2.83  |            be(all_63_5, v1, v0, v2) & state(all_63_5, v1) &
% 15.01/2.83  |            frontseat(all_63_5, v2)))
% 15.01/2.83  | 
% 15.01/2.83  | ALPHA: (2) implies:
% 15.01/2.83  |   (3)  two(all_63_5, all_63_0)
% 15.01/2.83  |   (4)  $i(all_63_5)
% 15.01/2.83  |   (5)  $i(all_63_0)
% 15.01/2.83  |   (6)   ! [v0: $i] : ( ~ $i(v0) |  ~ member(all_63_5, v0, all_63_0) |  ? [v1:
% 15.01/2.83  |            $i] :  ? [v2: $i] : ($i(v2) & $i(v1) & in(all_63_5, v2, v2) &
% 15.01/2.83  |            be(all_63_5, v1, v0, v2) & state(all_63_5, v1) &
% 15.01/2.83  |            frontseat(all_63_5, v2)))
% 15.01/2.84  |   (7)   ! [v0: $i] : ( ~ $i(v0) |  ~ member(all_63_5, v0, all_63_0) |
% 15.01/2.84  |          fellow(all_63_5, v0))
% 15.01/2.84  | 
% 15.01/2.84  | GROUND_INST: instantiating (1) with all_63_5, all_63_0, simplifying with (3),
% 15.01/2.84  |              (4), (5) gives:
% 15.01/2.84  |   (8)   ? [v0: $i] :  ? [v1: $i] : ( ~ (v1 = v0) & $i(v1) & $i(v0) &
% 15.01/2.84  |          member(all_63_5, v1, all_63_0) & member(all_63_5, v0, all_63_0) &  !
% 15.01/2.84  |          [v2: $i] : (v2 = v1 | v2 = v0 |  ~ $i(v2) |  ~ member(all_63_5, v2,
% 15.01/2.84  |              all_63_0)))
% 15.01/2.84  | 
% 15.01/2.84  | DELTA: instantiating (8) with fresh symbols all_72_0, all_72_1 gives:
% 15.01/2.84  |   (9)   ~ (all_72_0 = all_72_1) & $i(all_72_0) & $i(all_72_1) &
% 15.01/2.84  |        member(all_63_5, all_72_0, all_63_0) & member(all_63_5, all_72_1,
% 15.01/2.84  |          all_63_0) &  ! [v0: any] : (v0 = all_72_0 | v0 = all_72_1 |  ~ $i(v0)
% 15.01/2.84  |          |  ~ member(all_63_5, v0, all_63_0))
% 15.01/2.84  | 
% 15.01/2.84  | ALPHA: (9) implies:
% 15.01/2.84  |   (10)  member(all_63_5, all_72_0, all_63_0)
% 15.01/2.84  |   (11)  $i(all_72_0)
% 15.01/2.84  | 
% 15.01/2.84  | GROUND_INST: instantiating (7) with all_72_0, simplifying with (10), (11)
% 15.01/2.84  |              gives:
% 15.01/2.84  |   (12)  fellow(all_63_5, all_72_0)
% 15.01/2.84  | 
% 15.01/2.84  | GROUND_INST: instantiating (6) with all_72_0, simplifying with (10), (11)
% 15.01/2.84  |              gives:
% 15.01/2.84  |   (13)   ? [v0: $i] :  ? [v1: $i] : ($i(v1) & $i(v0) & in(all_63_5, v1, v1) &
% 15.01/2.84  |           be(all_63_5, v0, all_72_0, v1) & state(all_63_5, v0) &
% 15.21/2.84  |           frontseat(all_63_5, v1))
% 15.21/2.84  | 
% 15.21/2.84  | DELTA: instantiating (13) with fresh symbols all_81_0, all_81_1 gives:
% 15.21/2.84  |   (14)  $i(all_81_0) & $i(all_81_1) & in(all_63_5, all_81_0, all_81_0) &
% 15.21/2.84  |         be(all_63_5, all_81_1, all_72_0, all_81_0) & state(all_63_5, all_81_1)
% 15.21/2.84  |         & frontseat(all_63_5, all_81_0)
% 15.21/2.84  | 
% 15.21/2.84  | ALPHA: (14) implies:
% 15.21/2.84  |   (15)  frontseat(all_63_5, all_81_0)
% 15.21/2.84  |   (16)  be(all_63_5, all_81_1, all_72_0, all_81_0)
% 15.21/2.84  |   (17)  $i(all_81_1)
% 15.21/2.84  |   (18)  $i(all_81_0)
% 15.21/2.84  | 
% 15.21/2.84  | GROUND_INST: instantiating (ax3) with all_63_5, all_81_0, simplifying with
% 15.21/2.84  |              (4), (15), (18) gives:
% 15.21/2.84  |   (19)  seat(all_63_5, all_81_0)
% 15.21/2.84  | 
% 15.21/2.84  | GROUND_INST: instantiating (ax49) with all_63_5, all_72_0, simplifying with
% 15.21/2.84  |              (4), (11), (12) gives:
% 15.21/2.84  |   (20)  man(all_63_5, all_72_0)
% 15.21/2.84  | 
% 15.21/2.84  | GROUND_INST: instantiating (ax59) with all_63_5, all_81_1, all_72_0, all_81_0,
% 15.21/2.84  |              simplifying with (4), (11), (16), (17), (18) gives:
% 15.21/2.84  |   (21)  all_81_0 = all_72_0
% 15.21/2.84  | 
% 15.21/2.84  | REDUCE: (19), (21) imply:
% 15.21/2.84  |   (22)  seat(all_63_5, all_72_0)
% 15.21/2.84  | 
% 15.21/2.84  | GROUND_INST: instantiating (ax2) with all_63_5, all_72_0, simplifying with
% 15.21/2.84  |              (4), (11), (22) gives:
% 15.21/2.84  |   (23)  furniture(all_63_5, all_72_0)
% 15.21/2.84  | 
% 15.21/2.84  | GROUND_INST: instantiating (ax37) with all_63_5, all_72_0, simplifying with
% 15.21/2.84  |              (4), (11), (20) gives:
% 15.21/2.84  |   (24)  male(all_63_5, all_72_0)
% 15.21/2.84  | 
% 15.21/2.85  | GROUND_INST: instantiating (ax1) with all_63_5, all_72_0, simplifying with
% 15.21/2.85  |              (4), (11), (23) gives:
% 15.21/2.85  |   (25)  instrumentality(all_63_5, all_72_0)
% 15.21/2.85  | 
% 15.21/2.85  | GROUND_INST: instantiating (ax56) with all_63_5, all_72_0, simplifying with
% 15.21/2.85  |              (4), (11), (24) gives:
% 15.21/2.85  |   (26)   ~ unisex(all_63_5, all_72_0)
% 15.21/2.85  | 
% 15.21/2.85  | GROUND_INST: instantiating (ax21) with all_63_5, all_72_0, simplifying with
% 15.21/2.85  |              (4), (11), (25) gives:
% 15.21/2.85  |   (27)  artifact(all_63_5, all_72_0)
% 15.21/2.85  | 
% 15.21/2.85  | GROUND_INST: instantiating (ax20) with all_63_5, all_72_0, simplifying with
% 15.21/2.85  |              (4), (11), (27) gives:
% 15.21/2.85  |   (28)  object(all_63_5, all_72_0)
% 15.21/2.85  | 
% 15.21/2.85  | GROUND_INST: instantiating (ax16) with all_63_5, all_72_0, simplifying with
% 15.21/2.85  |              (4), (11), (26), (28) gives:
% 15.21/2.85  |   (29)  $false
% 15.21/2.85  | 
% 15.21/2.85  | CLOSE: (29) is inconsistent.
% 15.21/2.85  | 
% 15.21/2.85  End of proof
% 15.21/2.85  % SZS output end Proof for theBenchmark
% 15.21/2.85  
% 15.21/2.85  2237ms
%------------------------------------------------------------------------------