TSTP Solution File: KRS110+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n025.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 2.48s 1.29s
% Output : Proof 3.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n025.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 07:02:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.54/0.58 ____ _
% 0.54/0.58 ___ / __ \_____(_)___ ________ __________
% 0.54/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.54/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.54/0.58
% 0.54/0.58 A Theorem Prover for First-Order Logic
% 0.54/0.58 (ePrincess v.1.0)
% 0.54/0.58
% 0.54/0.58 (c) Philipp Rümmer, 2009-2015
% 0.54/0.58 (c) Peter Backeman, 2014-2015
% 0.54/0.58 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.58 Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.58 Bug reports to peter@backeman.se
% 0.54/0.58
% 0.54/0.58 For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.58
% 0.54/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.74/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.71/0.97 Prover 0: Preprocessing ...
% 2.18/1.16 Prover 0: Warning: ignoring some quantifiers
% 2.28/1.18 Prover 0: Constructing countermodel ...
% 2.48/1.29 Prover 0: proved (657ms)
% 2.48/1.29
% 2.48/1.29 No countermodel exists, formula is valid
% 2.48/1.29 % SZS status Unsatisfiable for theBenchmark
% 2.48/1.29
% 2.48/1.29 Generating proof ... Warning: ignoring some quantifiers
% 3.51/1.50 found it (size 10)
% 3.51/1.50
% 3.51/1.50 % SZS output start Proof for theBenchmark
% 3.51/1.50 Assumed formulas after preprocessing and simplification:
% 3.51/1.50 | (0) cUnsatisfiable(i2003_11_14_17_21_12565) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rs(v0, v2) | ~ rs(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf(v0, v2) | ~ rf(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v1, v0) | rinvS(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | ~ ca_Ax2(v1) | cUnsatisfiable(v0) | ? [v2] : (rs(v0, v2) & ~ cpxcomp(v2))) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | ~ cUnsatisfiable(v0) | cpxcomp(v1)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf1(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf(v0, v1)) & ! [v0] : ! [v1] : ( ~ rinvS(v0, v1) | ~ cp(v1) | ~ cp(v0) | ca_Ax2(v0)) & ! [v0] : ! [v1] : ( ~ rinvS(v0, v1) | rs(v1, v0)) & ! [v0] : ! [v1] : ( ~ rinvF1(v0, v1) | rf1(v1, v0)) & ! [v0] : ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0)) & ! [v0] : ! [v1] : ( ~ rf1(v1, v0) | rinvF1(v0, v1)) & ! [v0] : ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1)) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ cp(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cpxcomp(v0)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ( ~ cpxcomp(v0) | ? [v1] : ra_Px1(v0, v1)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ ca_Ax2(v0) | cp(v0)) & ! [v0] : ( ~ ca_Ax2(v0) | ? [v1] : (rinvS(v0, v1) & cp(v1))) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rs(v0, v1) & ca_Ax2(v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : (cp(v0) | ? [v1] : ra_Px1(v0, v1)) & ? [v0] : cowlThing(v0)
% 3.51/1.52 | Applying alpha-rule on (0) yields:
% 3.51/1.52 | (1) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rs(v0, v1) & ca_Ax2(v1)))
% 3.51/1.52 | (2) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | ~ cUnsatisfiable(v0) | cpxcomp(v1))
% 3.51/1.52 | (3) ! [v0] : ! [v1] : ( ~ rinvS(v0, v1) | rs(v1, v0))
% 3.51/1.52 | (4) ! [v0] : ! [v1] : ( ~ rs(v1, v0) | rinvS(v0, v1))
% 3.51/1.52 | (5) ? [v0] : (cp(v0) | ? [v1] : ra_Px1(v0, v1))
% 3.51/1.52 | (6) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf(v0, v1))
% 3.51/1.52 | (7) ! [v0] : ( ~ ca_Ax2(v0) | cp(v0))
% 3.51/1.52 | (8) ! [v0] : ( ~ cpxcomp(v0) | ? [v1] : ra_Px1(v0, v1))
% 3.51/1.52 | (9) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | ~ ca_Ax2(v1) | cUnsatisfiable(v0) | ? [v2] : (rs(v0, v2) & ~ cpxcomp(v2)))
% 3.51/1.52 | (10) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ cp(v0))
% 3.51/1.52 | (11) ! [v0] : ! [v1] : ( ~ rf1(v1, v0) | rinvF1(v0, v1))
% 3.51/1.52 | (12) ! [v0] : ! [v1] : ( ~ rinvF1(v0, v1) | rf1(v1, v0))
% 3.51/1.52 | (13) ? [v0] : (xsd_string(v0) | xsd_integer(v0))
% 3.51/1.52 | (14) ? [v0] : cowlThing(v0)
% 3.51/1.52 | (15) ! [v0] : ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1))
% 3.51/1.52 | (16) ! [v0] : ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0))
% 3.51/1.52 | (17) ! [v0] : ~ cowlNothing(v0)
% 3.51/1.52 | (18) ! [v0] : ! [v1] : ( ~ rinvS(v0, v1) | ~ cp(v1) | ~ cp(v0) | ca_Ax2(v0))
% 3.51/1.53 | (19) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cpxcomp(v0))
% 3.51/1.53 | (20) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1))
% 3.51/1.53 | (21) ! [v0] : ( ~ ca_Ax2(v0) | ? [v1] : (rinvS(v0, v1) & cp(v1)))
% 3.51/1.53 | (22) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf1(v0, v1))
% 3.78/1.53 | (23) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf(v0, v2) | ~ rf(v0, v1))
% 3.78/1.53 | (24) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0))
% 3.78/1.53 | (25) cUnsatisfiable(i2003_11_14_17_21_12565)
% 3.78/1.53 | (26) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rs(v0, v2) | ~ rs(v0, v1))
% 3.78/1.53 |
% 3.78/1.53 | Instantiating formula (1) with i2003_11_14_17_21_12565 and discharging atoms cUnsatisfiable(i2003_11_14_17_21_12565), yields:
% 3.78/1.53 | (27) ? [v0] : (rs(i2003_11_14_17_21_12565, v0) & ca_Ax2(v0))
% 3.78/1.53 |
% 3.78/1.53 | Instantiating (27) with all_11_0_3 yields:
% 3.78/1.53 | (28) rs(i2003_11_14_17_21_12565, all_11_0_3) & ca_Ax2(all_11_0_3)
% 3.78/1.53 |
% 3.78/1.53 | Applying alpha-rule on (28) yields:
% 3.78/1.53 | (29) rs(i2003_11_14_17_21_12565, all_11_0_3)
% 3.78/1.53 | (30) ca_Ax2(all_11_0_3)
% 3.78/1.53 |
% 3.78/1.53 | Instantiating formula (2) with all_11_0_3, i2003_11_14_17_21_12565 and discharging atoms rs(i2003_11_14_17_21_12565, all_11_0_3), cUnsatisfiable(i2003_11_14_17_21_12565), yields:
% 3.78/1.53 | (31) cpxcomp(all_11_0_3)
% 3.78/1.53 |
% 3.78/1.53 | Instantiating formula (7) with all_11_0_3 and discharging atoms ca_Ax2(all_11_0_3), yields:
% 3.78/1.53 | (32) cp(all_11_0_3)
% 3.78/1.53 |
% 3.78/1.53 | Instantiating formula (8) with all_11_0_3 and discharging atoms cpxcomp(all_11_0_3), yields:
% 3.78/1.53 | (33) ? [v0] : ra_Px1(all_11_0_3, v0)
% 3.78/1.53 |
% 3.78/1.53 | Instantiating (33) with all_27_0_5 yields:
% 3.78/1.53 | (34) ra_Px1(all_11_0_3, all_27_0_5)
% 3.78/1.53 |
% 3.78/1.53 | Instantiating formula (10) with all_27_0_5, all_11_0_3 and discharging atoms ra_Px1(all_11_0_3, all_27_0_5), cp(all_11_0_3), yields:
% 3.78/1.53 | (35) $false
% 3.78/1.53 |
% 3.78/1.53 |-The branch is then unsatisfiable
% 3.78/1.53 % SZS output end Proof for theBenchmark
% 3.78/1.53
% 3.78/1.53 939ms
%------------------------------------------------------------------------------