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

View Problem - Process Solution

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

% Computer : n024.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:36 EDT 2022

% Result   : Unsatisfiable 13.29s 3.66s
% Output   : Proof 17.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS115+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n024.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 15:44:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.54/0.57          ____       _                          
% 0.54/0.57    ___  / __ \_____(_)___  ________  __________
% 0.54/0.57   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.57  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.54/0.57  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.54/0.57  
% 0.54/0.57  A Theorem Prover for First-Order Logic
% 0.54/0.57  (ePrincess v.1.0)
% 0.54/0.57  
% 0.54/0.57  (c) Philipp Rümmer, 2009-2015
% 0.54/0.57  (c) Peter Backeman, 2014-2015
% 0.54/0.57  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.57  Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.57  Bug reports to peter@backeman.se
% 0.54/0.57  
% 0.54/0.57  For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.57  
% 0.54/0.57  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.54/0.62  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.44/0.92  Prover 0: Preprocessing ...
% 1.87/1.06  Prover 0: Warning: ignoring some quantifiers
% 1.99/1.08  Prover 0: Constructing countermodel ...
% 2.59/1.26  Prover 0: gave up
% 2.59/1.26  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.59/1.29  Prover 1: Preprocessing ...
% 3.43/1.44  Prover 1: Constructing countermodel ...
% 3.58/1.53  Prover 1: gave up
% 3.58/1.53  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 3.85/1.55  Prover 2: Preprocessing ...
% 4.39/1.66  Prover 2: Warning: ignoring some quantifiers
% 4.39/1.66  Prover 2: Constructing countermodel ...
% 4.97/1.78  Prover 2: gave up
% 4.97/1.78  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 4.97/1.80  Prover 3: Preprocessing ...
% 5.16/1.81  Prover 3: Warning: ignoring some quantifiers
% 5.16/1.81  Prover 3: Constructing countermodel ...
% 5.28/1.85  Prover 3: gave up
% 5.28/1.85  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 5.28/1.86  Prover 4: Preprocessing ...
% 5.69/1.96  Prover 4: Warning: ignoring some quantifiers
% 5.69/1.96  Prover 4: Constructing countermodel ...
% 8.36/2.56  Prover 4: gave up
% 8.36/2.56  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 8.36/2.58  Prover 5: Preprocessing ...
% 8.66/2.62  Prover 5: Constructing countermodel ...
% 8.93/2.68  Prover 5: gave up
% 8.93/2.68  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 8.93/2.69  Prover 6: Preprocessing ...
% 8.93/2.74  Prover 6: Warning: ignoring some quantifiers
% 8.93/2.74  Prover 6: Constructing countermodel ...
% 9.36/2.80  Prover 6: gave up
% 9.36/2.80  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 9.58/2.82  Prover 7: Preprocessing ...
% 9.58/2.83  Prover 7: Proving ...
% 13.29/3.66  Prover 7: proved (859ms)
% 13.29/3.66  
% 13.29/3.66  % SZS status Unsatisfiable for theBenchmark
% 13.29/3.66  
% 13.29/3.66  Generating proof ... found it (size 44)
% 17.43/4.57  
% 17.43/4.57  % SZS output start Proof for theBenchmark
% 17.43/4.57  Assumed formulas after preprocessing and simplification: 
% 17.43/4.57  | (0)  ? [v0] : (cUnsatisfiable(v0) &  ! [v1] :  ! [v2] : ( ~ rr(v1, v2) | rf2(v1, v2)) &  ! [v1] :  ! [v2] : ( ~ rr(v1, v2) | rf1(v1, v2)) &  ! [v1] : ( ~ xsd_string(v1) |  ~ xsd_integer(v1)) &  ! [v1] : ( ~ cp2xcomp(v1) |  ? [v2] : ra_Px1(v1, v2)) &  ! [v1] : ( ~ cp2(v1) |  ! [v2] :  ~ ra_Px1(v1, v2)) &  ! [v1] : ( ~ cp1(v1) | cp2xcomp(v1)) &  ! [v1] : ( ~ cowlThing(v1) |  ! [v2] :  ! [v3] : (v3 = v2 |  ~ rf2(v1, v3) |  ~ rf2(v1, v2))) &  ! [v1] : ( ~ cowlThing(v1) |  ! [v2] :  ! [v3] : (v3 = v2 |  ~ rf1(v1, v3) |  ~ rf1(v1, v2))) &  ! [v1] :  ~ cowlNothing(v1) &  ! [v1] : ( ~ cUnsatisfiable(v1) | ( ? [v2] : (rr(v1, v2) & cowlThing(v2)) &  ? [v2] : (rf2(v1, v2) & cp2(v2)) &  ? [v2] : (rf1(v1, v2) & cp1(v2)))) &  ! [v1] : (xsd_string(v1) | xsd_integer(v1)) &  ! [v1] : (cp2xcomp(v1) |  ! [v2] :  ~ ra_Px1(v1, v2)) &  ! [v1] : (cp2(v1) |  ? [v2] : ra_Px1(v1, v2)) &  ! [v1] : cowlThing(v1) &  ! [v1] : (cUnsatisfiable(v1) |  ! [v2] : ( ~ rr(v1, v2) |  ~ cowlThing(v2)) |  ! [v2] : ( ~ rf2(v1, v2) |  ~ cp2(v2)) |  ! [v2] : ( ~ rf1(v1, v2) |  ~ cp1(v2))))
% 17.43/4.57  | Instantiating (0) with all_0_0_0 yields:
% 17.43/4.57  | (1) cUnsatisfiable(all_0_0_0) &  ! [v0] :  ! [v1] : ( ~ rr(v0, v1) | rf2(v0, v1)) &  ! [v0] :  ! [v1] : ( ~ rr(v0, v1) | rf1(v0, v1)) &  ! [v0] : ( ~ xsd_string(v0) |  ~ xsd_integer(v0)) &  ! [v0] : ( ~ cp2xcomp(v0) |  ? [v1] : ra_Px1(v0, v1)) &  ! [v0] : ( ~ cp2(v0) |  ! [v1] :  ~ ra_Px1(v0, v1)) &  ! [v0] : ( ~ cp1(v0) | cp2xcomp(v0)) &  ! [v0] : ( ~ cowlThing(v0) |  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf2(v0, v2) |  ~ rf2(v0, v1))) &  ! [v0] : ( ~ cowlThing(v0) |  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf1(v0, v2) |  ~ rf1(v0, v1))) &  ! [v0] :  ~ cowlNothing(v0) &  ! [v0] : ( ~ cUnsatisfiable(v0) | ( ? [v1] : (rr(v0, v1) & cowlThing(v1)) &  ? [v1] : (rf2(v0, v1) & cp2(v1)) &  ? [v1] : (rf1(v0, v1) & cp1(v1)))) &  ! [v0] : (xsd_string(v0) | xsd_integer(v0)) &  ! [v0] : (cp2xcomp(v0) |  ! [v1] :  ~ ra_Px1(v0, v1)) &  ! [v0] : (cp2(v0) |  ? [v1] : ra_Px1(v0, v1)) &  ! [v0] : cowlThing(v0) &  ! [v0] : (cUnsatisfiable(v0) |  ! [v1] : ( ~ rr(v0, v1) |  ~ cowlThing(v1)) |  ! [v1] : ( ~ rf2(v0, v1) |  ~ cp2(v1)) |  ! [v1] : ( ~ rf1(v0, v1) |  ~ cp1(v1)))
% 17.43/4.57  |
% 17.43/4.57  | Applying alpha-rule on (1) yields:
% 17.43/4.57  | (2)  ! [v0] : (cUnsatisfiable(v0) |  ! [v1] : ( ~ rr(v0, v1) |  ~ cowlThing(v1)) |  ! [v1] : ( ~ rf2(v0, v1) |  ~ cp2(v1)) |  ! [v1] : ( ~ rf1(v0, v1) |  ~ cp1(v1)))
% 17.43/4.58  | (3)  ! [v0] : (cp2(v0) |  ? [v1] : ra_Px1(v0, v1))
% 17.43/4.58  | (4)  ! [v0] : cowlThing(v0)
% 17.43/4.58  | (5)  ! [v0] :  ! [v1] : ( ~ rr(v0, v1) | rf1(v0, v1))
% 17.43/4.58  | (6)  ! [v0] :  ~ cowlNothing(v0)
% 17.43/4.58  | (7)  ! [v0] : ( ~ cp2xcomp(v0) |  ? [v1] : ra_Px1(v0, v1))
% 17.43/4.58  | (8)  ! [v0] : (xsd_string(v0) | xsd_integer(v0))
% 17.43/4.58  | (9)  ! [v0] : ( ~ cowlThing(v0) |  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf2(v0, v2) |  ~ rf2(v0, v1)))
% 17.43/4.58  | (10)  ! [v0] : ( ~ cp1(v0) | cp2xcomp(v0))
% 17.43/4.58  | (11)  ! [v0] : ( ~ xsd_string(v0) |  ~ xsd_integer(v0))
% 17.43/4.58  | (12)  ! [v0] : (cp2xcomp(v0) |  ! [v1] :  ~ ra_Px1(v0, v1))
% 17.43/4.58  | (13)  ! [v0] : ( ~ cowlThing(v0) |  ! [v1] :  ! [v2] : (v2 = v1 |  ~ rf1(v0, v2) |  ~ rf1(v0, v1)))
% 17.43/4.58  | (14)  ! [v0] : ( ~ cp2(v0) |  ! [v1] :  ~ ra_Px1(v0, v1))
% 17.43/4.58  | (15)  ! [v0] :  ! [v1] : ( ~ rr(v0, v1) | rf2(v0, v1))
% 17.43/4.58  | (16)  ! [v0] : ( ~ cUnsatisfiable(v0) | ( ? [v1] : (rr(v0, v1) & cowlThing(v1)) &  ? [v1] : (rf2(v0, v1) & cp2(v1)) &  ? [v1] : (rf1(v0, v1) & cp1(v1))))
% 17.43/4.58  | (17) cUnsatisfiable(all_0_0_0)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (16) with all_0_0_0 and discharging atoms cUnsatisfiable(all_0_0_0), yields:
% 17.43/4.58  | (18)  ? [v0] : (rr(all_0_0_0, v0) & cowlThing(v0)) &  ? [v0] : (rf2(all_0_0_0, v0) & cp2(v0)) &  ? [v0] : (rf1(all_0_0_0, v0) & cp1(v0))
% 17.43/4.58  |
% 17.43/4.58  | Applying alpha-rule on (18) yields:
% 17.43/4.58  | (19)  ? [v0] : (rr(all_0_0_0, v0) & cowlThing(v0))
% 17.43/4.58  | (20)  ? [v0] : (rf2(all_0_0_0, v0) & cp2(v0))
% 17.43/4.58  | (21)  ? [v0] : (rf1(all_0_0_0, v0) & cp1(v0))
% 17.43/4.58  |
% 17.43/4.58  | Instantiating (21) with all_8_0_1 yields:
% 17.43/4.58  | (22) rf1(all_0_0_0, all_8_0_1) & cp1(all_8_0_1)
% 17.43/4.58  |
% 17.43/4.58  | Applying alpha-rule on (22) yields:
% 17.43/4.58  | (23) rf1(all_0_0_0, all_8_0_1)
% 17.43/4.58  | (24) cp1(all_8_0_1)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating (20) with all_10_0_2 yields:
% 17.43/4.58  | (25) rf2(all_0_0_0, all_10_0_2) & cp2(all_10_0_2)
% 17.43/4.58  |
% 17.43/4.58  | Applying alpha-rule on (25) yields:
% 17.43/4.58  | (26) rf2(all_0_0_0, all_10_0_2)
% 17.43/4.58  | (27) cp2(all_10_0_2)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating (19) with all_12_0_3 yields:
% 17.43/4.58  | (28) rr(all_0_0_0, all_12_0_3) & cowlThing(all_12_0_3)
% 17.43/4.58  |
% 17.43/4.58  | Applying alpha-rule on (28) yields:
% 17.43/4.58  | (29) rr(all_0_0_0, all_12_0_3)
% 17.43/4.58  | (30) cowlThing(all_12_0_3)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (15) with all_12_0_3, all_0_0_0 and discharging atoms rr(all_0_0_0, all_12_0_3), yields:
% 17.43/4.58  | (31) rf2(all_0_0_0, all_12_0_3)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (5) with all_12_0_3, all_0_0_0 and discharging atoms rr(all_0_0_0, all_12_0_3), yields:
% 17.43/4.58  | (32) rf1(all_0_0_0, all_12_0_3)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (14) with all_10_0_2 and discharging atoms cp2(all_10_0_2), yields:
% 17.43/4.58  | (33)  ! [v0] :  ~ ra_Px1(all_10_0_2, v0)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (10) with all_8_0_1 and discharging atoms cp1(all_8_0_1), yields:
% 17.43/4.58  | (34) cp2xcomp(all_8_0_1)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (7) with all_8_0_1 and discharging atoms cp2xcomp(all_8_0_1), yields:
% 17.43/4.58  | (35)  ? [v0] : ra_Px1(all_8_0_1, v0)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating (35) with all_28_0_4 yields:
% 17.43/4.58  | (36) ra_Px1(all_8_0_1, all_28_0_4)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (33) with all_28_0_4 yields:
% 17.43/4.58  | (37)  ~ ra_Px1(all_10_0_2, all_28_0_4)
% 17.43/4.58  |
% 17.43/4.58  | Introducing new symbol ex_64_0_10 defined by:
% 17.43/4.58  | (38) ex_64_0_10 = all_0_0_0
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (4) with ex_64_0_10 yields:
% 17.43/4.58  | (39) cowlThing(ex_64_0_10)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (9) with ex_64_0_10 and discharging atoms cowlThing(ex_64_0_10), yields:
% 17.43/4.58  | (40)  ! [v0] :  ! [v1] : (v1 = v0 |  ~ rf2(ex_64_0_10, v1) |  ~ rf2(ex_64_0_10, v0))
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (13) with ex_64_0_10 and discharging atoms cowlThing(ex_64_0_10), yields:
% 17.43/4.58  | (41)  ! [v0] :  ! [v1] : (v1 = v0 |  ~ rf1(ex_64_0_10, v1) |  ~ rf1(ex_64_0_10, v0))
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (41) with all_8_0_1, all_12_0_3 yields:
% 17.43/4.58  | (42) all_12_0_3 = all_8_0_1 |  ~ rf1(ex_64_0_10, all_12_0_3) |  ~ rf1(ex_64_0_10, all_8_0_1)
% 17.43/4.58  |
% 17.43/4.58  | Instantiating formula (40) with all_10_0_2, all_12_0_3 yields:
% 17.43/4.58  | (43) all_12_0_3 = all_10_0_2 |  ~ rf2(ex_64_0_10, all_12_0_3) |  ~ rf2(ex_64_0_10, all_10_0_2)
% 17.43/4.58  |
% 17.43/4.58  +-Applying beta-rule and splitting (42), into two cases.
% 17.43/4.58  |-Branch one:
% 17.43/4.58  | (44)  ~ rf1(ex_64_0_10, all_12_0_3)
% 17.43/4.58  |
% 17.43/4.58  	| From (38) and (44) follows:
% 17.43/4.59  	| (45)  ~ rf1(all_0_0_0, all_12_0_3)
% 17.43/4.59  	|
% 17.43/4.59  	| Using (32) and (45) yields:
% 17.43/4.59  	| (46) $false
% 17.43/4.59  	|
% 17.43/4.59  	|-The branch is then unsatisfiable
% 17.43/4.59  |-Branch two:
% 17.43/4.59  | (47) all_12_0_3 = all_8_0_1 |  ~ rf1(ex_64_0_10, all_8_0_1)
% 17.43/4.59  |
% 17.43/4.59  	+-Applying beta-rule and splitting (43), into two cases.
% 17.43/4.59  	|-Branch one:
% 17.43/4.59  	| (48)  ~ rf2(ex_64_0_10, all_12_0_3)
% 17.43/4.59  	|
% 17.43/4.59  		| From (38) and (48) follows:
% 17.43/4.59  		| (49)  ~ rf2(all_0_0_0, all_12_0_3)
% 17.43/4.59  		|
% 17.43/4.59  		| Using (31) and (49) yields:
% 17.43/4.59  		| (46) $false
% 17.43/4.59  		|
% 17.43/4.59  		|-The branch is then unsatisfiable
% 17.43/4.59  	|-Branch two:
% 17.43/4.59  	| (51) all_12_0_3 = all_10_0_2 |  ~ rf2(ex_64_0_10, all_10_0_2)
% 17.43/4.59  	|
% 17.43/4.59  		+-Applying beta-rule and splitting (47), into two cases.
% 17.43/4.59  		|-Branch one:
% 17.43/4.59  		| (52)  ~ rf1(ex_64_0_10, all_8_0_1)
% 17.43/4.59  		|
% 17.43/4.59  			| From (38) and (52) follows:
% 17.43/4.59  			| (53)  ~ rf1(all_0_0_0, all_8_0_1)
% 17.43/4.59  			|
% 17.43/4.59  			| Using (23) and (53) yields:
% 17.43/4.59  			| (46) $false
% 17.43/4.59  			|
% 17.43/4.59  			|-The branch is then unsatisfiable
% 17.43/4.59  		|-Branch two:
% 17.43/4.59  		| (55) all_12_0_3 = all_8_0_1
% 17.43/4.59  		|
% 17.43/4.59  			+-Applying beta-rule and splitting (51), into two cases.
% 17.43/4.59  			|-Branch one:
% 17.43/4.59  			| (56)  ~ rf2(ex_64_0_10, all_10_0_2)
% 17.43/4.59  			|
% 17.43/4.59  				| From (38) and (56) follows:
% 17.43/4.59  				| (57)  ~ rf2(all_0_0_0, all_10_0_2)
% 17.43/4.59  				|
% 17.43/4.59  				| Using (26) and (57) yields:
% 17.43/4.59  				| (46) $false
% 17.43/4.59  				|
% 17.43/4.59  				|-The branch is then unsatisfiable
% 17.43/4.59  			|-Branch two:
% 17.43/4.59  			| (59) all_12_0_3 = all_10_0_2
% 17.43/4.59  			|
% 17.43/4.59  				| Combining equations (59,55) yields a new equation:
% 17.43/4.59  				| (60) all_10_0_2 = all_8_0_1
% 17.43/4.59  				|
% 17.43/4.59  				| Simplifying 60 yields:
% 17.43/4.59  				| (61) all_10_0_2 = all_8_0_1
% 17.43/4.59  				|
% 17.43/4.59  				| From (61) and (37) follows:
% 17.43/4.59  				| (62)  ~ ra_Px1(all_8_0_1, all_28_0_4)
% 17.43/4.59  				|
% 17.43/4.59  				| Using (36) and (62) yields:
% 17.43/4.59  				| (46) $false
% 17.43/4.59  				|
% 17.43/4.59  				|-The branch is then unsatisfiable
% 17.43/4.59  % SZS output end Proof for theBenchmark
% 17.43/4.59  
% 17.43/4.59  4010ms
%------------------------------------------------------------------------------