TSTP Solution File: NLP001+1 by ePrincess---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : NLP001+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n013.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  : 600s
% DateTime : Mon Jul 18 01:54:53 EDT 2022

% Result   : Theorem 1.81s 1.13s
% Output   : Proof 2.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NLP001+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun 30 23:56:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.59          ____       _                          
% 0.19/0.59    ___  / __ \_____(_)___  ________  __________
% 0.19/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.19/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.19/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.19/0.59  
% 0.19/0.59  A Theorem Prover for First-Order Logic
% 0.19/0.59  (ePrincess v.1.0)
% 0.19/0.59  
% 0.19/0.59  (c) Philipp Rümmer, 2009-2015
% 0.19/0.59  (c) Peter Backeman, 2014-2015
% 0.19/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.19/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.19/0.59  Bug reports to peter@backeman.se
% 0.19/0.59  
% 0.19/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.19/0.59  
% 0.19/0.59  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.71/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.50/0.93  Prover 0: Preprocessing ...
% 1.70/1.03  Prover 0: Constructing countermodel ...
% 1.81/1.12  Prover 0: proved (484ms)
% 1.81/1.13  
% 1.81/1.13  No countermodel exists, formula is valid
% 1.81/1.13  % SZS status Theorem for theBenchmark
% 1.81/1.13  
% 1.81/1.13  Generating proof ... found it (size 8)
% 2.38/1.29  
% 2.38/1.29  % SZS output start Proof for theBenchmark
% 2.38/1.29  Assumed formulas after preprocessing and simplification: 
% 2.38/1.29  | (0)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] : ((in(v1, v0) & down(v1, v3) & barrel(v1, v2) & old(v2) & dirty(v2) & white(v2) & car(v2) & chevy(v2) & lonely(v3) & way(v3) & street(v3) & event(v1) & city(v0) & hollywood(v0) &  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : ( ~ in(v5, v4) |  ~ down(v5, v6) |  ~ barrel(v5, v7) |  ~ old(v7) |  ~ dirty(v7) |  ~ white(v7) |  ~ car(v7) |  ~ chevy(v7) |  ~ lonely(v6) |  ~ way(v6) |  ~ street(v6) |  ~ event(v5) |  ~ city(v4) |  ~ hollywood(v4))) | (in(v1, v0) & down(v1, v2) & barrel(v1, v3) & old(v3) & dirty(v3) & white(v3) & car(v3) & chevy(v3) & lonely(v2) & way(v2) & street(v2) & event(v1) & city(v0) & hollywood(v0) &  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : ( ~ in(v5, v4) |  ~ down(v5, v7) |  ~ barrel(v5, v6) |  ~ old(v6) |  ~ dirty(v6) |  ~ white(v6) |  ~ car(v6) |  ~ chevy(v6) |  ~ lonely(v7) |  ~ way(v7) |  ~ street(v7) |  ~ event(v5) |  ~ city(v4) |  ~ hollywood(v4))))
% 2.60/1.30  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields:
% 2.60/1.30  | (1) (in(all_0_2_2, all_0_3_3) & down(all_0_2_2, all_0_0_0) & barrel(all_0_2_2, all_0_1_1) & old(all_0_1_1) & dirty(all_0_1_1) & white(all_0_1_1) & car(all_0_1_1) & chevy(all_0_1_1) & lonely(all_0_0_0) & way(all_0_0_0) & street(all_0_0_0) & event(all_0_2_2) & city(all_0_3_3) & hollywood(all_0_3_3) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : ( ~ in(v1, v0) |  ~ down(v1, v2) |  ~ barrel(v1, v3) |  ~ old(v3) |  ~ dirty(v3) |  ~ white(v3) |  ~ car(v3) |  ~ chevy(v3) |  ~ lonely(v2) |  ~ way(v2) |  ~ street(v2) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))) | (in(all_0_2_2, all_0_3_3) & down(all_0_2_2, all_0_1_1) & barrel(all_0_2_2, all_0_0_0) & old(all_0_0_0) & dirty(all_0_0_0) & white(all_0_0_0) & car(all_0_0_0) & chevy(all_0_0_0) & lonely(all_0_1_1) & way(all_0_1_1) & street(all_0_1_1) & event(all_0_2_2) & city(all_0_3_3) & hollywood(all_0_3_3) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : ( ~ in(v1, v0) |  ~ down(v1, v3) |  ~ barrel(v1, v2) |  ~ old(v2) |  ~ dirty(v2) |  ~ white(v2) |  ~ car(v2) |  ~ chevy(v2) |  ~ lonely(v3) |  ~ way(v3) |  ~ street(v3) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0)))
% 2.60/1.31  |
% 2.60/1.31  +-Applying beta-rule and splitting (1), into two cases.
% 2.60/1.31  |-Branch one:
% 2.60/1.31  | (2) in(all_0_2_2, all_0_3_3) & down(all_0_2_2, all_0_0_0) & barrel(all_0_2_2, all_0_1_1) & old(all_0_1_1) & dirty(all_0_1_1) & white(all_0_1_1) & car(all_0_1_1) & chevy(all_0_1_1) & lonely(all_0_0_0) & way(all_0_0_0) & street(all_0_0_0) & event(all_0_2_2) & city(all_0_3_3) & hollywood(all_0_3_3) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : ( ~ in(v1, v0) |  ~ down(v1, v2) |  ~ barrel(v1, v3) |  ~ old(v3) |  ~ dirty(v3) |  ~ white(v3) |  ~ car(v3) |  ~ chevy(v3) |  ~ lonely(v2) |  ~ way(v2) |  ~ street(v2) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))
% 2.60/1.31  |
% 2.60/1.31  	| Applying alpha-rule on (2) yields:
% 2.60/1.31  	| (3) down(all_0_2_2, all_0_0_0)
% 2.60/1.31  	| (4) in(all_0_2_2, all_0_3_3)
% 2.60/1.31  	| (5) white(all_0_1_1)
% 2.60/1.31  	| (6) lonely(all_0_0_0)
% 2.60/1.31  	| (7) way(all_0_0_0)
% 2.60/1.31  	| (8)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : ( ~ in(v1, v0) |  ~ down(v1, v2) |  ~ barrel(v1, v3) |  ~ old(v3) |  ~ dirty(v3) |  ~ white(v3) |  ~ car(v3) |  ~ chevy(v3) |  ~ lonely(v2) |  ~ way(v2) |  ~ street(v2) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))
% 2.60/1.31  	| (9) hollywood(all_0_3_3)
% 2.60/1.31  	| (10) dirty(all_0_1_1)
% 2.60/1.31  	| (11) chevy(all_0_1_1)
% 2.60/1.31  	| (12) event(all_0_2_2)
% 2.60/1.31  	| (13) old(all_0_1_1)
% 2.60/1.31  	| (14) car(all_0_1_1)
% 2.60/1.31  	| (15) barrel(all_0_2_2, all_0_1_1)
% 2.60/1.31  	| (16) city(all_0_3_3)
% 2.60/1.31  	| (17) street(all_0_0_0)
% 2.60/1.31  	|
% 2.60/1.31  	| Instantiating formula (8) with all_0_1_1, all_0_0_0, all_0_2_2, all_0_3_3 and discharging atoms in(all_0_2_2, all_0_3_3), down(all_0_2_2, all_0_0_0), barrel(all_0_2_2, all_0_1_1), old(all_0_1_1), dirty(all_0_1_1), white(all_0_1_1), car(all_0_1_1), chevy(all_0_1_1), lonely(all_0_0_0), way(all_0_0_0), street(all_0_0_0), event(all_0_2_2), city(all_0_3_3), hollywood(all_0_3_3), yields:
% 2.60/1.32  	| (18) $false
% 2.60/1.32  	|
% 2.60/1.32  	|-The branch is then unsatisfiable
% 2.60/1.32  |-Branch two:
% 2.60/1.32  | (19) in(all_0_2_2, all_0_3_3) & down(all_0_2_2, all_0_1_1) & barrel(all_0_2_2, all_0_0_0) & old(all_0_0_0) & dirty(all_0_0_0) & white(all_0_0_0) & car(all_0_0_0) & chevy(all_0_0_0) & lonely(all_0_1_1) & way(all_0_1_1) & street(all_0_1_1) & event(all_0_2_2) & city(all_0_3_3) & hollywood(all_0_3_3) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : ( ~ in(v1, v0) |  ~ down(v1, v3) |  ~ barrel(v1, v2) |  ~ old(v2) |  ~ dirty(v2) |  ~ white(v2) |  ~ car(v2) |  ~ chevy(v2) |  ~ lonely(v3) |  ~ way(v3) |  ~ street(v3) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))
% 2.60/1.32  |
% 2.60/1.32  	| Applying alpha-rule on (19) yields:
% 2.60/1.32  	| (20) old(all_0_0_0)
% 2.60/1.32  	| (4) in(all_0_2_2, all_0_3_3)
% 2.60/1.32  	| (22) car(all_0_0_0)
% 2.60/1.32  	| (23) down(all_0_2_2, all_0_1_1)
% 2.60/1.32  	| (24) white(all_0_0_0)
% 2.60/1.32  	| (25) street(all_0_1_1)
% 2.60/1.32  	| (26) chevy(all_0_0_0)
% 2.60/1.32  	| (27)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : ( ~ in(v1, v0) |  ~ down(v1, v3) |  ~ barrel(v1, v2) |  ~ old(v2) |  ~ dirty(v2) |  ~ white(v2) |  ~ car(v2) |  ~ chevy(v2) |  ~ lonely(v3) |  ~ way(v3) |  ~ street(v3) |  ~ event(v1) |  ~ city(v0) |  ~ hollywood(v0))
% 2.60/1.32  	| (28) way(all_0_1_1)
% 2.60/1.32  	| (9) hollywood(all_0_3_3)
% 2.60/1.32  	| (12) event(all_0_2_2)
% 2.60/1.32  	| (31) dirty(all_0_0_0)
% 2.60/1.32  	| (32) barrel(all_0_2_2, all_0_0_0)
% 2.60/1.32  	| (33) lonely(all_0_1_1)
% 2.60/1.32  	| (16) city(all_0_3_3)
% 2.60/1.32  	|
% 2.60/1.32  	| Instantiating formula (27) with all_0_1_1, all_0_0_0, all_0_2_2, all_0_3_3 and discharging atoms in(all_0_2_2, all_0_3_3), down(all_0_2_2, all_0_1_1), barrel(all_0_2_2, all_0_0_0), old(all_0_0_0), dirty(all_0_0_0), white(all_0_0_0), car(all_0_0_0), chevy(all_0_0_0), lonely(all_0_1_1), way(all_0_1_1), street(all_0_1_1), event(all_0_2_2), city(all_0_3_3), hollywood(all_0_3_3), yields:
% 2.60/1.33  	| (18) $false
% 2.60/1.33  	|
% 2.60/1.33  	|-The branch is then unsatisfiable
% 2.60/1.33  % SZS output end Proof for theBenchmark
% 2.60/1.33  
% 2.60/1.33  723ms
%------------------------------------------------------------------------------