%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS078+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n022.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:30 EDT 2022 % Result : Unsatisfiable 2.09s 1.14s % Output : Proof 2.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : KRS078+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.11/0.33 % Computer : n022.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Tue Jun 7 13:46:50 EDT 2022 % 0.11/0.33 % CPUTime : % 0.18/0.58 ____ _ % 0.18/0.58 ___ / __ \_____(_)___ ________ __________ % 0.18/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic % 0.18/0.58 (ePrincess v.1.0) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2015 % 0.18/0.58 (c) Peter Backeman, 2014-2015 % 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.58 Bug reports to peter@backeman.se % 0.18/0.58 % 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.66/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.58/0.91 Prover 0: Preprocessing ... % 1.93/1.03 Prover 0: Warning: ignoring some quantifiers % 1.93/1.04 Prover 0: Constructing countermodel ... % 2.09/1.14 Prover 0: proved (508ms) % 2.09/1.14 % 2.09/1.14 No countermodel exists, formula is valid % 2.09/1.14 % SZS status Unsatisfiable for theBenchmark % 2.09/1.14 % 2.09/1.14 Generating proof ... Warning: ignoring some quantifiers % 2.83/1.33 found it (size 13) % 2.83/1.33 % 2.83/1.33 % SZS output start Proof for theBenchmark % 2.83/1.33 Assumed formulas after preprocessing and simplification: % 2.83/1.33 | (0) cUnsatisfiable(i2003_11_14_17_19_13721) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ rs(v0, v1) | ~ rr(v0, v2) | ~ rinvR(v2, v3) | cq(v1) | cp(v1) | cUnsatisfiable(v0) | ? [v4] : ? [v5] : (( ~ (v5 = v4) & rinvR(v2, v5) & rinvR(v2, v4)) | (rs(v3, v4) & ~ cp(v4)))) & ! [v0] : ! [v1] : ( ~ rr(v1, v0) | rinvR(v0, v1)) & ! [v0] : ! [v1] : ( ~ rinvR(v0, v1) | rr(v1, v0)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : (rr(v0, v1) & rinvR(v1, v2) & ! [v3] : ! [v4] : (v4 = v3 | ~ rinvR(v1, v4) | ~ rinvR(v1, v3)) & ! [v3] : ( ~ rs(v2, v3) | cp(v3)))) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rs(v0, v1) & ~ cq(v1) & ~ cp(v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0) % 2.83/1.34 | Applying alpha-rule on (0) yields: % 2.83/1.34 | (1) cUnsatisfiable(i2003_11_14_17_19_13721) % 2.83/1.34 | (2) ? [v0] : cowlThing(v0) % 2.83/1.34 | (3) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : (rr(v0, v1) & rinvR(v1, v2) & ! [v3] : ! [v4] : (v4 = v3 | ~ rinvR(v1, v4) | ~ rinvR(v1, v3)) & ! [v3] : ( ~ rs(v2, v3) | cp(v3)))) % 2.83/1.34 | (4) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rs(v0, v1) & ~ cq(v1) & ~ cp(v1))) % 2.83/1.35 | (5) ! [v0] : ~ cowlNothing(v0) % 2.83/1.35 | (6) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 2.83/1.35 | (7) ! [v0] : ! [v1] : ( ~ rinvR(v0, v1) | rr(v1, v0)) % 2.83/1.35 | (8) ! [v0] : ! [v1] : ( ~ rr(v1, v0) | rinvR(v0, v1)) % 2.83/1.35 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ rs(v0, v1) | ~ rr(v0, v2) | ~ rinvR(v2, v3) | cq(v1) | cp(v1) | cUnsatisfiable(v0) | ? [v4] : ? [v5] : (( ~ (v5 = v4) & rinvR(v2, v5) & rinvR(v2, v4)) | (rs(v3, v4) & ~ cp(v4)))) % 2.83/1.35 | (10) ? [v0] : (xsd_string(v0) | xsd_integer(v0)) % 2.83/1.35 | % 2.83/1.35 | Instantiating formula (3) with i2003_11_14_17_19_13721 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_13721), yields: % 2.83/1.35 | (11) ? [v0] : ? [v1] : (rr(i2003_11_14_17_19_13721, v0) & rinvR(v0, v1) & ! [v2] : ! [v3] : (v3 = v2 | ~ rinvR(v0, v3) | ~ rinvR(v0, v2)) & ! [v2] : ( ~ rs(v1, v2) | cp(v2))) % 2.83/1.35 | % 2.83/1.35 | Instantiating formula (4) with i2003_11_14_17_19_13721 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_13721), yields: % 2.83/1.35 | (12) ? [v0] : (rs(i2003_11_14_17_19_13721, v0) & ~ cq(v0) & ~ cp(v0)) % 2.83/1.35 | % 2.83/1.35 | Instantiating (12) with all_10_0_2 yields: % 2.83/1.35 | (13) rs(i2003_11_14_17_19_13721, all_10_0_2) & ~ cq(all_10_0_2) & ~ cp(all_10_0_2) % 2.83/1.35 | % 2.83/1.35 | Applying alpha-rule on (13) yields: % 2.83/1.35 | (14) rs(i2003_11_14_17_19_13721, all_10_0_2) % 2.83/1.35 | (15) ~ cq(all_10_0_2) % 2.83/1.35 | (16) ~ cp(all_10_0_2) % 2.83/1.35 | % 2.83/1.35 | Instantiating (11) with all_12_0_3, all_12_1_4 yields: % 2.83/1.35 | (17) rr(i2003_11_14_17_19_13721, all_12_1_4) & rinvR(all_12_1_4, all_12_0_3) & ! [v0] : ! [v1] : (v1 = v0 | ~ rinvR(all_12_1_4, v1) | ~ rinvR(all_12_1_4, v0)) & ! [v0] : ( ~ rs(all_12_0_3, v0) | cp(v0)) % 2.83/1.35 | % 2.83/1.35 | Applying alpha-rule on (17) yields: % 2.83/1.35 | (18) rr(i2003_11_14_17_19_13721, all_12_1_4) % 2.83/1.35 | (19) rinvR(all_12_1_4, all_12_0_3) % 2.83/1.35 | (20) ! [v0] : ! [v1] : (v1 = v0 | ~ rinvR(all_12_1_4, v1) | ~ rinvR(all_12_1_4, v0)) % 2.83/1.35 | (21) ! [v0] : ( ~ rs(all_12_0_3, v0) | cp(v0)) % 2.83/1.35 | % 2.83/1.35 | Instantiating formula (8) with i2003_11_14_17_19_13721, all_12_1_4 and discharging atoms rr(i2003_11_14_17_19_13721, all_12_1_4), yields: % 2.83/1.35 | (22) rinvR(all_12_1_4, i2003_11_14_17_19_13721) % 2.83/1.35 | % 2.83/1.35 | Instantiating formula (20) with i2003_11_14_17_19_13721, all_12_0_3 and discharging atoms rinvR(all_12_1_4, all_12_0_3), rinvR(all_12_1_4, i2003_11_14_17_19_13721), yields: % 2.83/1.36 | (23) all_12_0_3 = i2003_11_14_17_19_13721 % 2.83/1.36 | % 2.83/1.36 | Instantiating formula (21) with all_10_0_2 and discharging atoms ~ cp(all_10_0_2), yields: % 2.83/1.36 | (24) ~ rs(all_12_0_3, all_10_0_2) % 2.83/1.36 | % 2.83/1.36 | From (23) and (24) follows: % 2.83/1.36 | (25) ~ rs(i2003_11_14_17_19_13721, all_10_0_2) % 2.83/1.36 | % 2.83/1.36 | Using (14) and (25) yields: % 2.83/1.36 | (26) $false % 2.83/1.36 | % 2.83/1.36 |-The branch is then unsatisfiable % 2.83/1.36 % SZS output end Proof for theBenchmark % 2.83/1.36 % 2.83/1.36 772ms %------------------------------------------------------------------------------