TSTP Solution File: KRS101+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n019.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:34 EDT 2022
% Result : Unsatisfiable 2.04s 1.12s
% Output : Proof 2.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 20:46:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.61/0.59 ____ _
% 0.61/0.59 ___ / __ \_____(_)___ ________ __________
% 0.61/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.61/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.61/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.61/0.59
% 0.61/0.59 A Theorem Prover for First-Order Logic
% 0.61/0.59 (ePrincess v.1.0)
% 0.61/0.59
% 0.61/0.59 (c) Philipp Rümmer, 2009-2015
% 0.61/0.59 (c) Peter Backeman, 2014-2015
% 0.61/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.61/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.61/0.59 Bug reports to peter@backeman.se
% 0.61/0.59
% 0.61/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.61/0.59
% 0.61/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.72/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.54/0.91 Prover 0: Preprocessing ...
% 1.86/1.02 Prover 0: Warning: ignoring some quantifiers
% 1.86/1.04 Prover 0: Constructing countermodel ...
% 2.04/1.12 Prover 0: proved (480ms)
% 2.04/1.12
% 2.04/1.12 No countermodel exists, formula is valid
% 2.04/1.12 % SZS status Unsatisfiable for theBenchmark
% 2.04/1.12
% 2.04/1.12 Generating proof ... Warning: ignoring some quantifiers
% 2.78/1.31 found it (size 11)
% 2.78/1.31
% 2.78/1.31 % SZS output start Proof for theBenchmark
% 2.78/1.31 Assumed formulas after preprocessing and simplification:
% 2.78/1.31 | (0) cUnsatisfiable(i2003_11_14_17_20_36582) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | ~ rs(v1, v3) | ~ rs(v1, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | cc(v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | ~ rs(v1, v3) | ~ rs(v1, v2) | ~ rr(v0, v1) | cUnsatisfiable(v0) | ? [v4] : ? [v5] : ? [v6] : (( ~ (v6 = v5) & rs(v4, v6) & rs(v4, v5) & rr(v0, v4) & ~ cc(v4)) | (rr(v0, v4) & ~ cd(v4)))) & ! [v0] : ! [v1] : ( ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | cd(v1)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cd(v0) | ~ cc(v0)) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v2) & rs(v1, v3) & rs(v1, v2) & rr(v0, v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0)
% 2.78/1.32 | Applying alpha-rule on (0) yields:
% 2.78/1.32 | (1) ? [v0] : (xsd_string(v0) | xsd_integer(v0))
% 2.78/1.32 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | ~ rs(v1, v3) | ~ rs(v1, v2) | ~ rr(v0, v1) | cUnsatisfiable(v0) | ? [v4] : ? [v5] : ? [v6] : (( ~ (v6 = v5) & rs(v4, v6) & rs(v4, v5) & rr(v0, v4) & ~ cc(v4)) | (rr(v0, v4) & ~ cd(v4))))
% 2.78/1.32 | (3) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v2) & rs(v1, v3) & rs(v1, v2) & rr(v0, v1)))
% 2.78/1.33 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | ~ rs(v1, v3) | ~ rs(v1, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | cc(v1))
% 2.78/1.33 | (5) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0))
% 2.78/1.33 | (6) ! [v0] : ~ cowlNothing(v0)
% 2.78/1.33 | (7) ! [v0] : ! [v1] : ( ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | cd(v1))
% 2.78/1.33 | (8) ? [v0] : cowlThing(v0)
% 2.78/1.33 | (9) ! [v0] : ( ~ cd(v0) | ~ cc(v0))
% 2.78/1.33 | (10) cUnsatisfiable(i2003_11_14_17_20_36582)
% 2.78/1.33 |
% 2.78/1.33 | Instantiating formula (3) with i2003_11_14_17_20_36582 and discharging atoms cUnsatisfiable(i2003_11_14_17_20_36582), yields:
% 2.78/1.33 | (11) ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = v1) & rs(v0, v2) & rs(v0, v1) & rr(i2003_11_14_17_20_36582, v0))
% 2.78/1.33 |
% 2.78/1.33 | Instantiating (11) with all_10_0_2, all_10_1_3, all_10_2_4 yields:
% 2.78/1.33 | (12) ~ (all_10_0_2 = all_10_1_3) & rs(all_10_2_4, all_10_0_2) & rs(all_10_2_4, all_10_1_3) & rr(i2003_11_14_17_20_36582, all_10_2_4)
% 2.78/1.33 |
% 2.78/1.33 | Applying alpha-rule on (12) yields:
% 2.78/1.33 | (13) ~ (all_10_0_2 = all_10_1_3)
% 2.78/1.33 | (14) rs(all_10_2_4, all_10_0_2)
% 2.78/1.33 | (15) rs(all_10_2_4, all_10_1_3)
% 2.78/1.33 | (16) rr(i2003_11_14_17_20_36582, all_10_2_4)
% 2.78/1.33 |
% 2.78/1.33 | Instantiating formula (4) with all_10_0_2, all_10_1_3, all_10_2_4, i2003_11_14_17_20_36582 and discharging atoms rs(all_10_2_4, all_10_0_2), rs(all_10_2_4, all_10_1_3), rr(i2003_11_14_17_20_36582, all_10_2_4), cUnsatisfiable(i2003_11_14_17_20_36582), yields:
% 2.78/1.33 | (17) all_10_0_2 = all_10_1_3 | cc(all_10_2_4)
% 2.78/1.33 |
% 2.78/1.33 | Instantiating formula (7) with all_10_2_4, i2003_11_14_17_20_36582 and discharging atoms rr(i2003_11_14_17_20_36582, all_10_2_4), cUnsatisfiable(i2003_11_14_17_20_36582), yields:
% 2.78/1.33 | (18) cd(all_10_2_4)
% 2.78/1.33 |
% 2.78/1.33 +-Applying beta-rule and splitting (17), into two cases.
% 2.78/1.33 |-Branch one:
% 2.78/1.33 | (19) cc(all_10_2_4)
% 2.78/1.33 |
% 2.78/1.33 | Instantiating formula (9) with all_10_2_4 and discharging atoms cd(all_10_2_4), cc(all_10_2_4), yields:
% 2.78/1.33 | (20) $false
% 2.78/1.33 |
% 2.78/1.33 |-The branch is then unsatisfiable
% 2.78/1.33 |-Branch two:
% 2.78/1.33 | (21) ~ cc(all_10_2_4)
% 2.78/1.33 | (22) all_10_0_2 = all_10_1_3
% 2.78/1.33 |
% 2.78/1.33 | Equations (22) can reduce 13 to:
% 2.78/1.33 | (23) $false
% 2.78/1.33 |
% 2.78/1.33 |-The branch is then unsatisfiable
% 2.78/1.33 % SZS output end Proof for theBenchmark
% 2.78/1.33
% 2.78/1.33 732ms
%------------------------------------------------------------------------------