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

View Problem - Process Solution

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

% Computer : n028.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:35 EDT 2022

% Result   : Unsatisfiable 6.91s 2.30s
% Output   : Proof 7.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : KRS105+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Tue Jun  7 17:36:30 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.18/0.57          ____       _                          
% 0.18/0.57    ___  / __ \_____(_)___  ________  __________
% 0.18/0.57   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.18/0.57  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.18/0.57  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.18/0.57  
% 0.18/0.57  A Theorem Prover for First-Order Logic
% 0.18/0.57  (ePrincess v.1.0)
% 0.18/0.57  
% 0.18/0.57  (c) Philipp Rümmer, 2009-2015
% 0.18/0.57  (c) Peter Backeman, 2014-2015
% 0.18/0.57  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.18/0.57  Free software under GNU Lesser General Public License (LGPL).
% 0.18/0.57  Bug reports to peter@backeman.se
% 0.18/0.57  
% 0.18/0.57  For more information, visit http://user.uu.se/~petba168/breu/
% 0.18/0.57  
% 0.18/0.57  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.65/0.61  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.17/0.85  Prover 0: Preprocessing ...
% 1.60/0.93  Prover 0: Warning: ignoring some quantifiers
% 1.60/0.95  Prover 0: Constructing countermodel ...
% 1.74/1.07  Prover 0: gave up
% 1.74/1.07  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.09/1.09  Prover 1: Preprocessing ...
% 2.40/1.20  Prover 1: Constructing countermodel ...
% 2.48/1.23  Prover 1: gave up
% 2.48/1.23  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.54/1.24  Prover 2: Preprocessing ...
% 2.92/1.32  Prover 2: Warning: ignoring some quantifiers
% 2.92/1.33  Prover 2: Constructing countermodel ...
% 3.16/1.39  Prover 2: gave up
% 3.16/1.39  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 3.16/1.40  Prover 3: Preprocessing ...
% 3.16/1.41  Prover 3: Warning: ignoring some quantifiers
% 3.16/1.41  Prover 3: Constructing countermodel ...
% 3.16/1.44  Prover 3: gave up
% 3.16/1.44  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 3.16/1.45  Prover 4: Preprocessing ...
% 3.72/1.52  Prover 4: Warning: ignoring some quantifiers
% 3.82/1.53  Prover 4: Constructing countermodel ...
% 5.56/1.94  Prover 4: gave up
% 5.56/1.94  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 5.56/1.95  Prover 5: Preprocessing ...
% 5.56/1.99  Prover 5: Constructing countermodel ...
% 5.95/2.01  Prover 5: gave up
% 5.95/2.01  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 5.95/2.01  Prover 6: Preprocessing ...
% 5.95/2.04  Prover 6: Warning: ignoring some quantifiers
% 5.95/2.05  Prover 6: Constructing countermodel ...
% 5.95/2.07  Prover 6: gave up
% 5.95/2.07  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 5.95/2.08  Prover 7: Preprocessing ...
% 6.40/2.09  Prover 7: Proving ...
% 6.91/2.30  Prover 7: proved (225ms)
% 6.91/2.30  
% 6.91/2.30  % SZS status Unsatisfiable for theBenchmark
% 6.91/2.30  
% 6.91/2.30  Generating proof ... found it (size 32)
% 7.99/2.55  
% 7.99/2.55  % SZS output start Proof for theBenchmark
% 7.99/2.55  Assumed formulas after preprocessing and simplification: 
% 7.99/2.55  | (0)  ? [v0] : (cUnsatisfiable(v0) &  ! [v1] : ( ~ ca_Ax2(v1) | cd(v1)) &  ! [v1] : ( ~ ca_Ax2(v1) |  ! [v2] : ( ~ rr(v1, v2) | cc(v2))) &  ! [v1] : ( ~ cd(v1) |  ! [v2] :  ~ ra_Px1(v1, v2)) &  ! [v1] : ( ~ cc(v1) |  ! [v2] : ( ~ rr(v1, v2) | cc(v2))) &  ! [v1] : ( ~ cdxcomp(v1) |  ? [v2] : ra_Px1(v1, v2)) &  ! [v1] : ( ~ cUnsatisfiable(v1) | cc(v1)) &  ! [v1] : ( ~ cUnsatisfiable(v1) | cdxcomp(v1)) &  ! [v1] : ( ~ xsd_integer(v1) |  ~ xsd_string(v1)) &  ! [v1] :  ~ cowlNothing(v1) &  ! [v1] : (ca_Ax2(v1) |  ? [v2] : (rr(v1, v2) &  ~ cc(v2))) &  ! [v1] : (cd(v1) |  ? [v2] : ra_Px1(v1, v2)) &  ! [v1] : (cdxcomp(v1) |  ! [v2] :  ~ ra_Px1(v1, v2)) &  ! [v1] : (xsd_integer(v1) | xsd_string(v1)) &  ! [v1] : cowlThing(v1))
% 7.99/2.55  | Instantiating (0) with all_0_0_0 yields:
% 7.99/2.55  | (1) cUnsatisfiable(all_0_0_0) &  ! [v0] : ( ~ ca_Ax2(v0) | cd(v0)) &  ! [v0] : ( ~ ca_Ax2(v0) |  ! [v1] : ( ~ rr(v0, v1) | cc(v1))) &  ! [v0] : ( ~ cd(v0) |  ! [v1] :  ~ ra_Px1(v0, v1)) &  ! [v0] : ( ~ cc(v0) |  ! [v1] : ( ~ rr(v0, v1) | cc(v1))) &  ! [v0] : ( ~ cdxcomp(v0) |  ? [v1] : ra_Px1(v0, v1)) &  ! [v0] : ( ~ cUnsatisfiable(v0) | cc(v0)) &  ! [v0] : ( ~ cUnsatisfiable(v0) | cdxcomp(v0)) &  ! [v0] : ( ~ xsd_integer(v0) |  ~ xsd_string(v0)) &  ! [v0] :  ~ cowlNothing(v0) &  ! [v0] : (ca_Ax2(v0) |  ? [v1] : (rr(v0, v1) &  ~ cc(v1))) &  ! [v0] : (cd(v0) |  ? [v1] : ra_Px1(v0, v1)) &  ! [v0] : (cdxcomp(v0) |  ! [v1] :  ~ ra_Px1(v0, v1)) &  ! [v0] : (xsd_integer(v0) | xsd_string(v0)) &  ! [v0] : cowlThing(v0)
% 7.99/2.56  |
% 7.99/2.56  | Applying alpha-rule on (1) yields:
% 7.99/2.56  | (2)  ! [v0] : ( ~ xsd_integer(v0) |  ~ xsd_string(v0))
% 7.99/2.56  | (3)  ! [v0] : ( ~ cUnsatisfiable(v0) | cdxcomp(v0))
% 7.99/2.56  | (4)  ! [v0] : ( ~ cd(v0) |  ! [v1] :  ~ ra_Px1(v0, v1))
% 7.99/2.56  | (5)  ! [v0] :  ~ cowlNothing(v0)
% 7.99/2.56  | (6)  ! [v0] : ( ~ ca_Ax2(v0) | cd(v0))
% 7.99/2.56  | (7)  ! [v0] : ( ~ cc(v0) |  ! [v1] : ( ~ rr(v0, v1) | cc(v1)))
% 7.99/2.56  | (8)  ! [v0] : (cd(v0) |  ? [v1] : ra_Px1(v0, v1))
% 7.99/2.56  | (9) cUnsatisfiable(all_0_0_0)
% 7.99/2.56  | (10)  ! [v0] : (cdxcomp(v0) |  ! [v1] :  ~ ra_Px1(v0, v1))
% 7.99/2.56  | (11)  ! [v0] : (xsd_integer(v0) | xsd_string(v0))
% 7.99/2.56  | (12)  ! [v0] : ( ~ cUnsatisfiable(v0) | cc(v0))
% 7.99/2.56  | (13)  ! [v0] : cowlThing(v0)
% 7.99/2.56  | (14)  ! [v0] : (ca_Ax2(v0) |  ? [v1] : (rr(v0, v1) &  ~ cc(v1)))
% 7.99/2.56  | (15)  ! [v0] : ( ~ cdxcomp(v0) |  ? [v1] : ra_Px1(v0, v1))
% 7.99/2.56  | (16)  ! [v0] : ( ~ ca_Ax2(v0) |  ! [v1] : ( ~ rr(v0, v1) | cc(v1)))
% 7.99/2.56  |
% 7.99/2.56  | Instantiating formula (12) with all_0_0_0 and discharging atoms cUnsatisfiable(all_0_0_0), yields:
% 7.99/2.56  | (17) cc(all_0_0_0)
% 7.99/2.56  |
% 7.99/2.56  | Instantiating formula (3) with all_0_0_0 and discharging atoms cUnsatisfiable(all_0_0_0), yields:
% 7.99/2.56  | (18) cdxcomp(all_0_0_0)
% 7.99/2.56  |
% 7.99/2.56  | Instantiating formula (7) with all_0_0_0 and discharging atoms cc(all_0_0_0), yields:
% 7.99/2.56  | (19)  ! [v0] : ( ~ rr(all_0_0_0, v0) | cc(v0))
% 7.99/2.56  |
% 7.99/2.56  | Instantiating formula (15) with all_0_0_0 and discharging atoms cdxcomp(all_0_0_0), yields:
% 7.99/2.56  | (20)  ? [v0] : ra_Px1(all_0_0_0, v0)
% 7.99/2.56  |
% 7.99/2.56  | Instantiating (20) with all_15_0_1 yields:
% 7.99/2.56  | (21) ra_Px1(all_0_0_0, all_15_0_1)
% 7.99/2.56  |
% 7.99/2.56  | Introducing new symbol ex_23_0_2 defined by:
% 7.99/2.56  | (22) ex_23_0_2 = all_0_0_0
% 7.99/2.56  |
% 7.99/2.56  | Instantiating formula (10) with ex_23_0_2 yields:
% 7.99/2.56  | (23) cdxcomp(ex_23_0_2) |  ! [v0] :  ~ ra_Px1(ex_23_0_2, v0)
% 7.99/2.56  |
% 7.99/2.56  +-Applying beta-rule and splitting (23), into two cases.
% 7.99/2.56  |-Branch one:
% 7.99/2.56  | (24) cdxcomp(ex_23_0_2)
% 7.99/2.56  |
% 7.99/2.56  	| Instantiating formula (15) with ex_23_0_2 and discharging atoms cdxcomp(ex_23_0_2), yields:
% 7.99/2.56  	| (25)  ? [v0] : ra_Px1(ex_23_0_2, v0)
% 7.99/2.56  	|
% 7.99/2.56  	| Instantiating (25) with all_31_0_3 yields:
% 7.99/2.56  	| (26) ra_Px1(ex_23_0_2, all_31_0_3)
% 7.99/2.56  	|
% 7.99/2.56  	| Introducing new symbol ex_39_0_4 defined by:
% 7.99/2.56  	| (27) ex_39_0_4 = all_0_0_0
% 7.99/2.56  	|
% 7.99/2.56  	| Instantiating formula (14) with ex_39_0_4 yields:
% 7.99/2.56  	| (28) ca_Ax2(ex_39_0_4) |  ? [v0] : (rr(ex_39_0_4, v0) &  ~ cc(v0))
% 7.99/2.56  	|
% 7.99/2.56  	+-Applying beta-rule and splitting (28), into two cases.
% 7.99/2.56  	|-Branch one:
% 7.99/2.56  	| (29) ca_Ax2(ex_39_0_4)
% 7.99/2.56  	|
% 7.99/2.56  		| Instantiating formula (6) with ex_39_0_4 and discharging atoms ca_Ax2(ex_39_0_4), yields:
% 7.99/2.56  		| (30) cd(ex_39_0_4)
% 7.99/2.56  		|
% 7.99/2.56  		| Instantiating formula (4) with ex_39_0_4 and discharging atoms cd(ex_39_0_4), yields:
% 7.99/2.56  		| (31)  ! [v0] :  ~ ra_Px1(ex_39_0_4, v0)
% 7.99/2.56  		|
% 7.99/2.56  		| Instantiating formula (31) with all_31_0_3 yields:
% 7.99/2.56  		| (32)  ~ ra_Px1(ex_39_0_4, all_31_0_3)
% 7.99/2.56  		|
% 7.99/2.56  		| From (22) and (26) follows:
% 7.99/2.57  		| (33) ra_Px1(all_0_0_0, all_31_0_3)
% 7.99/2.57  		|
% 7.99/2.57  		| From (27) and (32) follows:
% 7.99/2.57  		| (34)  ~ ra_Px1(all_0_0_0, all_31_0_3)
% 7.99/2.57  		|
% 7.99/2.57  		| Using (33) and (34) yields:
% 7.99/2.57  		| (35) $false
% 7.99/2.57  		|
% 7.99/2.57  		|-The branch is then unsatisfiable
% 7.99/2.57  	|-Branch two:
% 7.99/2.57  	| (36)  ? [v0] : (rr(ex_39_0_4, v0) &  ~ cc(v0))
% 7.99/2.57  	|
% 7.99/2.57  		| Instantiating (36) with all_41_0_5 yields:
% 7.99/2.57  		| (37) rr(ex_39_0_4, all_41_0_5) &  ~ cc(all_41_0_5)
% 7.99/2.57  		|
% 7.99/2.57  		| Applying alpha-rule on (37) yields:
% 7.99/2.57  		| (38) rr(ex_39_0_4, all_41_0_5)
% 7.99/2.57  		| (39)  ~ cc(all_41_0_5)
% 7.99/2.57  		|
% 7.99/2.57  		| Instantiating formula (19) with all_41_0_5 and discharging atoms  ~ cc(all_41_0_5), yields:
% 7.99/2.57  		| (40)  ~ rr(all_0_0_0, all_41_0_5)
% 7.99/2.57  		|
% 7.99/2.57  		| From (27) and (38) follows:
% 7.99/2.57  		| (41) rr(all_0_0_0, all_41_0_5)
% 7.99/2.57  		|
% 7.99/2.57  		| Using (41) and (40) yields:
% 7.99/2.57  		| (35) $false
% 7.99/2.57  		|
% 7.99/2.57  		|-The branch is then unsatisfiable
% 7.99/2.57  |-Branch two:
% 7.99/2.57  | (43)  ! [v0] :  ~ ra_Px1(ex_23_0_2, v0)
% 7.99/2.57  |
% 7.99/2.57  	| Instantiating formula (43) with all_15_0_1 yields:
% 7.99/2.57  	| (44)  ~ ra_Px1(ex_23_0_2, all_15_0_1)
% 7.99/2.57  	|
% 7.99/2.57  	| From (22) and (44) follows:
% 7.99/2.57  	| (45)  ~ ra_Px1(all_0_0_0, all_15_0_1)
% 7.99/2.57  	|
% 7.99/2.57  	| Using (21) and (45) yields:
% 7.99/2.57  	| (35) $false
% 7.99/2.57  	|
% 7.99/2.57  	|-The branch is then unsatisfiable
% 7.99/2.57  % SZS output end Proof for theBenchmark
% 7.99/2.57  
% 7.99/2.57  1990ms
%------------------------------------------------------------------------------