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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : KRS086+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%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  : 600s
% DateTime : Sun Jul 17 02:56:31 EDT 2022

% Result   : Unsatisfiable 78.52s 51.01s
% Output   : Proof 83.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS086+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n027.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 : Tue Jun  7 19:05:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.57/0.59          ____       _                          
% 0.57/0.59    ___  / __ \_____(_)___  ________  __________
% 0.57/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.57/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.57/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.57/0.59  
% 0.57/0.59  A Theorem Prover for First-Order Logic
% 0.62/0.59  (ePrincess v.1.0)
% 0.62/0.59  
% 0.62/0.59  (c) Philipp Rümmer, 2009-2015
% 0.62/0.59  (c) Peter Backeman, 2014-2015
% 0.62/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.62/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.62/0.59  Bug reports to peter@backeman.se
% 0.62/0.59  
% 0.62/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.62/0.59  
% 0.62/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.68/0.67  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.54/0.97  Prover 0: Preprocessing ...
% 1.94/1.10  Prover 0: Warning: ignoring some quantifiers
% 1.94/1.12  Prover 0: Constructing countermodel ...
% 16.81/5.96  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 17.02/6.00  Prover 1: Preprocessing ...
% 17.59/6.16  Prover 1: Constructing countermodel ...
% 18.04/6.23  Prover 1: gave up
% 18.04/6.23  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 18.04/6.25  Prover 2: Preprocessing ...
% 18.52/6.33  Prover 2: Warning: ignoring some quantifiers
% 18.52/6.34  Prover 2: Constructing countermodel ...
% 18.52/6.40  Prover 2: gave up
% 18.52/6.40  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 18.99/6.42  Prover 3: Preprocessing ...
% 18.99/6.43  Prover 3: Warning: ignoring some quantifiers
% 18.99/6.43  Prover 3: Constructing countermodel ...
% 73.16/49.82  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 73.16/49.85  Prover 4: Preprocessing ...
% 73.63/49.97  Prover 4: Warning: ignoring some quantifiers
% 73.63/49.97  Prover 4: Constructing countermodel ...
% 74.94/50.30  Prover 4: gave up
% 74.94/50.30  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 75.32/50.31  Prover 5: Preprocessing ...
% 75.32/50.35  Prover 5: Constructing countermodel ...
% 75.32/50.37  Prover 5: gave up
% 75.32/50.37  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 75.32/50.38  Prover 6: Preprocessing ...
% 75.74/50.41  Prover 6: Warning: ignoring some quantifiers
% 75.74/50.41  Prover 6: Constructing countermodel ...
% 75.74/50.45  Prover 6: gave up
% 75.74/50.45  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 75.74/50.46  Prover 7: Preprocessing ...
% 75.74/50.47  Prover 7: Proving ...
% 78.52/51.01  Prover 7: proved (562ms)
% 78.52/51.01  Prover 3: stopped
% 78.52/51.01  Prover 0: stopped
% 78.52/51.01  
% 78.52/51.01  % SZS status Unsatisfiable for theBenchmark
% 78.52/51.01  
% 78.52/51.01  Generating proof ... found it (size 25)
% 83.60/52.32  
% 83.60/52.32  % SZS output start Proof for theBenchmark
% 83.60/52.32  Assumed formulas after preprocessing and simplification: 
% 83.60/52.32  | (0)  ? [v0] : (cUnsatisfiable(v0) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ rr(v2, v3) |  ~ rr(v1, v2) | rr(v1, v3)) &  ! [v1] :  ! [v2] : ( ~ rr(v2, v1) | rinvR(v1, v2)) &  ! [v1] :  ! [v2] : ( ~ rinvR(v1, v2) | rr(v2, v1)) &  ! [v1] :  ! [v2] : ( ~ rinvF(v1, v2) | rf(v2, v1)) &  ! [v1] :  ! [v2] : ( ~ rf(v2, v1) | rinvF(v1, v2)) &  ! [v1] : ( ~ xsd_string(v1) |  ~ xsd_integer(v1)) &  ! [v1] : ( ~ cowlThing(v1) |  ! [v2] :  ! [v3] : (v3 = v2 |  ~ rf(v1, v3) |  ~ rf(v1, v2))) &  ! [v1] :  ~ cowlNothing(v1) &  ! [v1] : ( ~ cUnsatisfiable(v1) |  ? [v2] : (rf(v1, v2) & cp1(v2) &  ? [v3] : (rinvF(v2, v3) &  ? [v4] : (rf(v3, v4) &  ~ cp1(v4))))) &  ! [v1] : (xsd_string(v1) | xsd_integer(v1)) &  ! [v1] : cowlThing(v1) &  ! [v1] : (cUnsatisfiable(v1) |  ! [v2] : ( ~ rf(v1, v2) |  ~ cp1(v2) |  ! [v3] : ( ~ rinvF(v2, v3) |  ! [v4] : ( ~ rf(v3, v4) | cp1(v4))))))
% 83.66/52.32  | Instantiating (0) with all_0_0_0 yields:
% 83.66/52.32  | (1) cUnsatisfiable(all_0_0_0) &  ! [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] : ( ~ cowlThing(v0) |  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf(v0, v2) |  ~ rf(v0, v1))) &  ! [v0] :  ~ cowlNothing(v0) &  ! [v0] : ( ~ cUnsatisfiable(v0) |  ? [v1] : (rf(v0, v1) & cp1(v1) &  ? [v2] : (rinvF(v1, v2) &  ? [v3] : (rf(v2, v3) &  ~ cp1(v3))))) &  ! [v0] : (xsd_string(v0) | xsd_integer(v0)) &  ! [v0] : cowlThing(v0) &  ! [v0] : (cUnsatisfiable(v0) |  ! [v1] : ( ~ rf(v0, v1) |  ~ cp1(v1) |  ! [v2] : ( ~ rinvF(v1, v2) |  ! [v3] : ( ~ rf(v2, v3) | cp1(v3)))))
% 83.66/52.32  |
% 83.66/52.32  | Applying alpha-rule on (1) yields:
% 83.66/52.32  | (2) cUnsatisfiable(all_0_0_0)
% 83.66/52.32  | (3)  ! [v0] : (xsd_string(v0) | xsd_integer(v0))
% 83.66/52.32  | (4)  ! [v0] : ( ~ cowlThing(v0) |  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf(v0, v2) |  ~ rf(v0, v1)))
% 83.66/52.32  | (5)  ! [v0] :  ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1))
% 83.66/52.32  | (6)  ! [v0] :  ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0))
% 83.66/52.32  | (7)  ! [v0] : ( ~ xsd_string(v0) |  ~ xsd_integer(v0))
% 83.66/52.32  | (8)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ rr(v1, v2) |  ~ rr(v0, v1) | rr(v0, v2))
% 83.66/52.32  | (9)  ! [v0] :  ~ cowlNothing(v0)
% 83.66/52.32  | (10)  ! [v0] : ( ~ cUnsatisfiable(v0) |  ? [v1] : (rf(v0, v1) & cp1(v1) &  ? [v2] : (rinvF(v1, v2) &  ? [v3] : (rf(v2, v3) &  ~ cp1(v3)))))
% 83.66/52.32  | (11)  ! [v0] : cowlThing(v0)
% 83.66/52.32  | (12)  ! [v0] :  ! [v1] : ( ~ rinvR(v0, v1) | rr(v1, v0))
% 83.66/52.32  | (13)  ! [v0] :  ! [v1] : ( ~ rr(v1, v0) | rinvR(v0, v1))
% 83.66/52.32  | (14)  ! [v0] : (cUnsatisfiable(v0) |  ! [v1] : ( ~ rf(v0, v1) |  ~ cp1(v1) |  ! [v2] : ( ~ rinvF(v1, v2) |  ! [v3] : ( ~ rf(v2, v3) | cp1(v3)))))
% 83.66/52.33  |
% 83.66/52.33  | Instantiating formula (10) with all_0_0_0 and discharging atoms cUnsatisfiable(all_0_0_0), yields:
% 83.66/52.33  | (15)  ? [v0] : (rf(all_0_0_0, v0) & cp1(v0) &  ? [v1] : (rinvF(v0, v1) &  ? [v2] : (rf(v1, v2) &  ~ cp1(v2))))
% 83.66/52.33  |
% 83.66/52.33  | Instantiating (15) with all_8_0_1 yields:
% 83.66/52.33  | (16) rf(all_0_0_0, all_8_0_1) & cp1(all_8_0_1) &  ? [v0] : (rinvF(all_8_0_1, v0) &  ? [v1] : (rf(v0, v1) &  ~ cp1(v1)))
% 83.66/52.33  |
% 83.66/52.33  | Applying alpha-rule on (16) yields:
% 83.66/52.33  | (17) rf(all_0_0_0, all_8_0_1)
% 83.66/52.33  | (18) cp1(all_8_0_1)
% 83.66/52.33  | (19)  ? [v0] : (rinvF(all_8_0_1, v0) &  ? [v1] : (rf(v0, v1) &  ~ cp1(v1)))
% 83.66/52.33  |
% 83.66/52.33  | Instantiating (19) with all_10_0_2 yields:
% 83.66/52.33  | (20) rinvF(all_8_0_1, all_10_0_2) &  ? [v0] : (rf(all_10_0_2, v0) &  ~ cp1(v0))
% 83.66/52.33  |
% 83.66/52.33  | Applying alpha-rule on (20) yields:
% 83.66/52.33  | (21) rinvF(all_8_0_1, all_10_0_2)
% 83.66/52.33  | (22)  ? [v0] : (rf(all_10_0_2, v0) &  ~ cp1(v0))
% 83.66/52.33  |
% 83.66/52.33  | Instantiating (22) with all_12_0_3 yields:
% 83.66/52.33  | (23) rf(all_10_0_2, all_12_0_3) &  ~ cp1(all_12_0_3)
% 83.66/52.33  |
% 83.66/52.33  | Applying alpha-rule on (23) yields:
% 83.66/52.33  | (24) rf(all_10_0_2, all_12_0_3)
% 83.66/52.33  | (25)  ~ cp1(all_12_0_3)
% 83.66/52.33  |
% 83.66/52.33  | Instantiating formula (6) with all_10_0_2, all_8_0_1 and discharging atoms rinvF(all_8_0_1, all_10_0_2), yields:
% 83.66/52.33  | (26) rf(all_10_0_2, all_8_0_1)
% 83.66/52.33  |
% 83.66/52.33  | Introducing new symbol ex_52_0_8 defined by:
% 83.66/52.33  | (27) ex_52_0_8 = all_10_0_2
% 83.66/52.33  |
% 83.66/52.33  | Instantiating formula (11) with ex_52_0_8 yields:
% 83.66/52.33  | (28) cowlThing(ex_52_0_8)
% 83.66/52.33  |
% 83.66/52.33  | Instantiating formula (4) with ex_52_0_8 and discharging atoms cowlThing(ex_52_0_8), yields:
% 83.66/52.33  | (29)  ! [v0] :  ! [v1] : (v1 = v0 |  ~ rf(ex_52_0_8, v1) |  ~ rf(ex_52_0_8, v0))
% 83.66/52.33  |
% 83.66/52.33  | Instantiating formula (29) with all_8_0_1, all_12_0_3 yields:
% 83.66/52.33  | (30) all_12_0_3 = all_8_0_1 |  ~ rf(ex_52_0_8, all_12_0_3) |  ~ rf(ex_52_0_8, all_8_0_1)
% 83.66/52.33  |
% 83.66/52.33  +-Applying beta-rule and splitting (30), into two cases.
% 83.66/52.33  |-Branch one:
% 83.66/52.33  | (31)  ~ rf(ex_52_0_8, all_12_0_3)
% 83.66/52.33  |
% 83.66/52.33  	| From (27) and (31) follows:
% 83.66/52.33  	| (32)  ~ rf(all_10_0_2, all_12_0_3)
% 83.66/52.33  	|
% 83.66/52.33  	| Using (24) and (32) yields:
% 83.66/52.33  	| (33) $false
% 83.66/52.33  	|
% 83.66/52.33  	|-The branch is then unsatisfiable
% 83.66/52.33  |-Branch two:
% 83.66/52.33  | (34) all_12_0_3 = all_8_0_1 |  ~ rf(ex_52_0_8, all_8_0_1)
% 83.66/52.33  |
% 83.66/52.33  	+-Applying beta-rule and splitting (34), into two cases.
% 83.66/52.33  	|-Branch one:
% 83.66/52.33  	| (35)  ~ rf(ex_52_0_8, all_8_0_1)
% 83.66/52.33  	|
% 83.66/52.33  		| From (27) and (35) follows:
% 83.66/52.33  		| (36)  ~ rf(all_10_0_2, all_8_0_1)
% 83.66/52.33  		|
% 83.66/52.33  		| Using (26) and (36) yields:
% 83.66/52.33  		| (33) $false
% 83.66/52.33  		|
% 83.66/52.33  		|-The branch is then unsatisfiable
% 83.66/52.33  	|-Branch two:
% 83.66/52.33  	| (38) all_12_0_3 = all_8_0_1
% 83.66/52.33  	|
% 83.66/52.33  		| From (38) and (25) follows:
% 83.66/52.33  		| (39)  ~ cp1(all_8_0_1)
% 83.66/52.33  		|
% 83.66/52.33  		| Using (18) and (39) yields:
% 83.66/52.33  		| (33) $false
% 83.66/52.33  		|
% 83.66/52.33  		|-The branch is then unsatisfiable
% 83.66/52.33  % SZS output end Proof for theBenchmark
% 83.66/52.33  
% 83.66/52.33  51725ms
%------------------------------------------------------------------------------