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

View Problem - Process Solution

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

% Computer : n022.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 : Sun Jul 17 02:56:31 EDT 2022

% Result   : Unsatisfiable 2.13s 1.26s
% Output   : Proof 3.00s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS087+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun  7 05:27:20 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.64/0.64          ____       _                          
% 0.64/0.64    ___  / __ \_____(_)___  ________  __________
% 0.64/0.64   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.64/0.64  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.64/0.64  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.64/0.64  
% 0.64/0.64  A Theorem Prover for First-Order Logic
% 0.64/0.64  (ePrincess v.1.0)
% 0.64/0.64  
% 0.64/0.64  (c) Philipp Rümmer, 2009-2015
% 0.64/0.64  (c) Peter Backeman, 2014-2015
% 0.64/0.64  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.64/0.64  Free software under GNU Lesser General Public License (LGPL).
% 0.64/0.64  Bug reports to peter@backeman.se
% 0.64/0.64  
% 0.64/0.64  For more information, visit http://user.uu.se/~petba168/breu/
% 0.64/0.64  
% 0.64/0.64  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.64/0.69  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.48/1.01  Prover 0: Preprocessing ...
% 1.92/1.15  Prover 0: Warning: ignoring some quantifiers
% 1.92/1.17  Prover 0: Constructing countermodel ...
% 2.13/1.26  Prover 0: proved (568ms)
% 2.13/1.26  
% 2.13/1.26  No countermodel exists, formula is valid
% 2.13/1.26  % SZS status Unsatisfiable for theBenchmark
% 2.13/1.26  
% 2.13/1.26  Generating proof ... Warning: ignoring some quantifiers
% 3.00/1.46  found it (size 9)
% 3.00/1.46  
% 3.00/1.46  % SZS output start Proof for theBenchmark
% 3.00/1.46  Assumed formulas after preprocessing and simplification: 
% 3.00/1.46  | (0) cUnsatisfiable(i2003_11_14_17_19_46763) &  ! [v0] :  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf(v0, v2) |  ~ rf(v0, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ rr(v1, v2) |  ~ rr(v0, v1) |  ~ cp1(v2) |  ~ cp1(v0) | cUnsatisfiable(v0) |  ? [v3] : (rinvR(v2, v3) & cp1(v3))) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ rr(v1, v2) |  ~ rr(v0, v1) | rr(v0, v2)) &  ! [v0] :  ! [v1] : ( ~ rr(v1, v0) | rinvR(v0, v1)) &  ! [v0] :  ! [v1] : ( ~ rinvR(v0, v1) | rr(v1, v0)) &  ! [v0] :  ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0)) &  ! [v0] :  ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1)) &  ! [v0] : ( ~ xsd_string(v0) |  ~ xsd_integer(v0)) &  ! [v0] :  ~ cowlNothing(v0) &  ! [v0] : ( ~ cUnsatisfiable(v0) | cp1(v0)) &  ! [v0] : ( ~ cUnsatisfiable(v0) |  ? [v1] :  ? [v2] : (rr(v1, v2) & rr(v0, v1) & cp1(v2) &  ! [v3] : ( ~ rinvR(v2, v3) |  ~ cp1(v3)))) &  ? [v0] : (xsd_string(v0) | xsd_integer(v0)) &  ? [v0] : cowlThing(v0)
% 3.00/1.47  | Applying alpha-rule on (0) yields:
% 3.00/1.47  | (1)  ! [v0] :  ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1))
% 3.00/1.47  | (2)  ! [v0] :  ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0))
% 3.00/1.47  | (3)  ! [v0] : ( ~ xsd_string(v0) |  ~ xsd_integer(v0))
% 3.00/1.47  | (4)  ! [v0] :  ~ cowlNothing(v0)
% 3.00/1.47  | (5)  ? [v0] : cowlThing(v0)
% 3.00/1.47  | (6)  ! [v0] : ( ~ cUnsatisfiable(v0) | cp1(v0))
% 3.00/1.47  | (7)  ! [v0] : ( ~ cUnsatisfiable(v0) |  ? [v1] :  ? [v2] : (rr(v1, v2) & rr(v0, v1) & cp1(v2) &  ! [v3] : ( ~ rinvR(v2, v3) |  ~ cp1(v3))))
% 3.00/1.47  | (8)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ rr(v1, v2) |  ~ rr(v0, v1) |  ~ cp1(v2) |  ~ cp1(v0) | cUnsatisfiable(v0) |  ? [v3] : (rinvR(v2, v3) & cp1(v3)))
% 3.00/1.47  | (9)  ! [v0] :  ! [v1] : ( ~ rinvR(v0, v1) | rr(v1, v0))
% 3.00/1.47  | (10)  ! [v0] :  ! [v1] : ( ~ rr(v1, v0) | rinvR(v0, v1))
% 3.00/1.47  | (11)  ? [v0] : (xsd_string(v0) | xsd_integer(v0))
% 3.00/1.47  | (12)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ rr(v1, v2) |  ~ rr(v0, v1) | rr(v0, v2))
% 3.00/1.47  | (13) cUnsatisfiable(i2003_11_14_17_19_46763)
% 3.00/1.47  | (14)  ! [v0] :  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf(v0, v2) |  ~ rf(v0, v1))
% 3.00/1.47  |
% 3.00/1.47  | Instantiating formula (6) with i2003_11_14_17_19_46763 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_46763), yields:
% 3.00/1.47  | (15) cp1(i2003_11_14_17_19_46763)
% 3.00/1.47  |
% 3.00/1.48  | Instantiating formula (7) with i2003_11_14_17_19_46763 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_46763), yields:
% 3.00/1.48  | (16)  ? [v0] :  ? [v1] : (rr(v0, v1) & rr(i2003_11_14_17_19_46763, v0) & cp1(v1) &  ! [v2] : ( ~ rinvR(v1, v2) |  ~ cp1(v2)))
% 3.00/1.48  |
% 3.00/1.48  | Instantiating (16) with all_11_0_2, all_11_1_3 yields:
% 3.00/1.48  | (17) rr(all_11_1_3, all_11_0_2) & rr(i2003_11_14_17_19_46763, all_11_1_3) & cp1(all_11_0_2) &  ! [v0] : ( ~ rinvR(all_11_0_2, v0) |  ~ cp1(v0))
% 3.00/1.48  |
% 3.00/1.48  | Applying alpha-rule on (17) yields:
% 3.00/1.48  | (18) rr(all_11_1_3, all_11_0_2)
% 3.00/1.48  | (19) rr(i2003_11_14_17_19_46763, all_11_1_3)
% 3.00/1.48  | (20) cp1(all_11_0_2)
% 3.00/1.48  | (21)  ! [v0] : ( ~ rinvR(all_11_0_2, v0) |  ~ cp1(v0))
% 3.00/1.48  |
% 3.00/1.48  | Instantiating formula (12) with all_11_0_2, all_11_1_3, i2003_11_14_17_19_46763 and discharging atoms rr(all_11_1_3, all_11_0_2), rr(i2003_11_14_17_19_46763, all_11_1_3), yields:
% 3.00/1.48  | (22) rr(i2003_11_14_17_19_46763, all_11_0_2)
% 3.00/1.48  |
% 3.00/1.48  | Instantiating formula (10) with i2003_11_14_17_19_46763, all_11_0_2 and discharging atoms rr(i2003_11_14_17_19_46763, all_11_0_2), yields:
% 3.00/1.48  | (23) rinvR(all_11_0_2, i2003_11_14_17_19_46763)
% 3.00/1.48  |
% 3.00/1.48  | Instantiating formula (21) with i2003_11_14_17_19_46763 and discharging atoms rinvR(all_11_0_2, i2003_11_14_17_19_46763), cp1(i2003_11_14_17_19_46763), yields:
% 3.00/1.48  | (24) $false
% 3.00/1.48  |
% 3.00/1.48  |-The branch is then unsatisfiable
% 3.00/1.48  % SZS output end Proof for theBenchmark
% 3.00/1.48  
% 3.00/1.48  831ms
%------------------------------------------------------------------------------