TSTP Solution File: KRS095+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : KRS095+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:33 EDT 2022
% Result : Unsatisfiable 1.81s 1.14s
% Output : Proof 2.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS095+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.34 % Computer : n024.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 06:16:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.49/0.58 ____ _
% 0.49/0.58 ___ / __ \_____(_)___ ________ __________
% 0.49/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.49/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.49/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.49/0.58
% 0.49/0.58 A Theorem Prover for First-Order Logic
% 0.49/0.59 (ePrincess v.1.0)
% 0.49/0.59
% 0.49/0.59 (c) Philipp Rümmer, 2009-2015
% 0.49/0.59 (c) Peter Backeman, 2014-2015
% 0.49/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.49/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.49/0.59 Bug reports to peter@backeman.se
% 0.49/0.59
% 0.49/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.49/0.59
% 0.49/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.49/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.30/0.93 Prover 0: Preprocessing ...
% 1.68/1.05 Prover 0: Warning: ignoring some quantifiers
% 1.81/1.07 Prover 0: Constructing countermodel ...
% 1.81/1.14 Prover 0: proved (505ms)
% 1.81/1.14
% 1.81/1.14 No countermodel exists, formula is valid
% 1.81/1.14 % SZS status Unsatisfiable for theBenchmark
% 1.81/1.14
% 1.81/1.14 Generating proof ... Warning: ignoring some quantifiers
% 2.35/1.26 found it (size 7)
% 2.35/1.26
% 2.35/1.26 % SZS output start Proof for theBenchmark
% 2.35/1.26 Assumed formulas after preprocessing and simplification:
% 2.35/1.26 | (0) cUnsatisfiable(i2003_11_14_17_20_14253) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rr(v0, v2) | ~ rr(v0, v1) | cUnsatisfiable(v0) | ? [v3] : ? [v4] : ( ~ (v4 = v3) & rr(v0, v4) & rr(v0, v3))) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cd(v0) | ~ cc(v0)) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : ( ~ (v2 = v1) & rr(v0, v2) & rr(v0, v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0)
% 2.46/1.27 | Applying alpha-rule on (0) yields:
% 2.46/1.27 | (1) ? [v0] : (xsd_string(v0) | xsd_integer(v0))
% 2.46/1.27 | (2) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0))
% 2.46/1.27 | (3) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : ( ~ (v2 = v1) & rr(v0, v2) & rr(v0, v1)))
% 2.46/1.27 | (4) ! [v0] : ~ cowlNothing(v0)
% 2.46/1.27 | (5) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rr(v0, v2) | ~ rr(v0, v1) | cUnsatisfiable(v0) | ? [v3] : ? [v4] : ( ~ (v4 = v3) & rr(v0, v4) & rr(v0, v3)))
% 2.46/1.27 | (6) ? [v0] : cowlThing(v0)
% 2.46/1.27 | (7) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0))
% 2.46/1.27 | (8) cUnsatisfiable(i2003_11_14_17_20_14253)
% 2.46/1.27 | (9) ! [v0] : ( ~ cd(v0) | ~ cc(v0))
% 2.46/1.27 |
% 2.46/1.27 | Instantiating formula (3) with i2003_11_14_17_20_14253 and discharging atoms cUnsatisfiable(i2003_11_14_17_20_14253), yields:
% 2.46/1.27 | (10) ? [v0] : ? [v1] : ( ~ (v1 = v0) & rr(i2003_11_14_17_20_14253, v1) & rr(i2003_11_14_17_20_14253, v0))
% 2.46/1.28 |
% 2.46/1.28 | Instantiating (10) with all_10_0_2, all_10_1_3 yields:
% 2.46/1.28 | (11) ~ (all_10_0_2 = all_10_1_3) & rr(i2003_11_14_17_20_14253, all_10_0_2) & rr(i2003_11_14_17_20_14253, all_10_1_3)
% 2.46/1.28 |
% 2.46/1.28 | Applying alpha-rule on (11) yields:
% 2.46/1.28 | (12) ~ (all_10_0_2 = all_10_1_3)
% 2.46/1.28 | (13) rr(i2003_11_14_17_20_14253, all_10_0_2)
% 2.46/1.28 | (14) rr(i2003_11_14_17_20_14253, all_10_1_3)
% 2.46/1.28 |
% 2.46/1.28 | Instantiating formula (7) with all_10_1_3, all_10_0_2, i2003_11_14_17_20_14253 and discharging atoms rr(i2003_11_14_17_20_14253, all_10_0_2), rr(i2003_11_14_17_20_14253, all_10_1_3), cUnsatisfiable(i2003_11_14_17_20_14253), yields:
% 2.46/1.28 | (15) all_10_0_2 = all_10_1_3
% 2.46/1.28 |
% 2.46/1.28 | Equations (15) can reduce 12 to:
% 2.46/1.28 | (16) $false
% 2.46/1.28 |
% 2.46/1.28 |-The branch is then unsatisfiable
% 2.46/1.28 % SZS output end Proof for theBenchmark
% 2.46/1.28
% 2.46/1.28 682ms
%------------------------------------------------------------------------------