%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS074+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:29 EDT 2022 % Result : Unsatisfiable 2.21s 1.15s % Output : Proof 2.80s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : KRS074+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.11 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.32 % Computer : n024.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Tue Jun 7 18:21:19 EDT 2022 % 0.12/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/sandbox2/benchmark/theBenchmark.p ... % 0.65/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.56/0.92 Prover 0: Preprocessing ... % 1.98/1.06 Prover 0: Warning: ignoring some quantifiers % 1.98/1.08 Prover 0: Constructing countermodel ... % 2.21/1.15 Prover 0: proved (528ms) % 2.21/1.15 % 2.21/1.15 No countermodel exists, formula is valid % 2.21/1.15 % SZS status Unsatisfiable for theBenchmark % 2.21/1.15 % 2.21/1.15 Generating proof ... Warning: ignoring some quantifiers % 2.80/1.32 found it (size 6) % 2.80/1.32 % 2.80/1.32 % SZS output start Proof for theBenchmark % 2.80/1.32 Assumed formulas after preprocessing and simplification: % 2.80/1.32 | (0) cUnsatisfiable(i2003_11_14_17_18_59896) & ! [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] : ! [v2] : ( ~ rs(v0, v1) | ~ rinvS(v1, v2) | ~ cp(v2) | ~ cp(v1) | cUnsatisfiable(v0) | ? [v3] : (rs(v0, v3) & cp(v3))) & ! [v0] : ! [v1] : ( ~ rs(v1, v0) | rinvS(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | ~ cp(v1) | ~ cUnsatisfiable(v0)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf1(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf(v0, v1)) & ! [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] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : (rs(v0, v1) & rinvS(v1, v2) & cp(v2) & cp(v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0) % 2.80/1.33 | Applying alpha-rule on (0) yields: % 2.80/1.33 | (1) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 2.80/1.34 | (2) ? [v0] : (xsd_string(v0) | xsd_integer(v0)) % 2.80/1.34 | (3) ! [v0] : ! [v1] : ( ~ rf1(v1, v0) | rinvF1(v0, v1)) % 2.80/1.34 | (4) ! [v0] : ! [v1] : ( ~ rinvF1(v0, v1) | rf1(v1, v0)) % 2.80/1.34 | (5) ! [v0] : ! [v1] : ( ~ rinvS(v0, v1) | rs(v1, v0)) % 2.80/1.34 | (6) ! [v0] : ! [v1] : ( ~ rs(v1, v0) | rinvS(v0, v1)) % 2.80/1.34 | (7) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rs(v0, v2) | ~ rs(v0, v1)) % 2.80/1.34 | (8) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf(v0, v1)) % 2.80/1.34 | (9) ! [v0] : ! [v1] : ! [v2] : ( ~ rs(v0, v1) | ~ rinvS(v1, v2) | ~ cp(v2) | ~ cp(v1) | cUnsatisfiable(v0) | ? [v3] : (rs(v0, v3) & cp(v3))) % 2.80/1.34 | (10) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : (rs(v0, v1) & rinvS(v1, v2) & cp(v2) & cp(v1))) % 2.80/1.34 | (11) ! [v0] : ~ cowlNothing(v0) % 2.80/1.34 | (12) cUnsatisfiable(i2003_11_14_17_18_59896) % 2.80/1.34 | (13) ? [v0] : cowlThing(v0) % 2.80/1.34 | (14) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | ~ cp(v1) | ~ cUnsatisfiable(v0)) % 2.80/1.34 | (15) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1)) % 2.80/1.34 | (16) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf1(v0, v1)) % 2.80/1.34 | (17) ! [v0] : ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1)) % 2.80/1.34 | (18) ! [v0] : ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0)) % 2.80/1.34 | (19) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf(v0, v2) | ~ rf(v0, v1)) % 2.80/1.34 | % 2.80/1.34 | Instantiating formula (10) with i2003_11_14_17_18_59896 and discharging atoms cUnsatisfiable(i2003_11_14_17_18_59896), yields: % 2.80/1.34 | (20) ? [v0] : ? [v1] : (rs(i2003_11_14_17_18_59896, v0) & rinvS(v0, v1) & cp(v1) & cp(v0)) % 2.80/1.34 | % 2.80/1.34 | Instantiating (20) with all_10_0_2, all_10_1_3 yields: % 2.80/1.34 | (21) rs(i2003_11_14_17_18_59896, all_10_1_3) & rinvS(all_10_1_3, all_10_0_2) & cp(all_10_0_2) & cp(all_10_1_3) % 2.80/1.34 | % 2.80/1.34 | Applying alpha-rule on (21) yields: % 2.80/1.34 | (22) rs(i2003_11_14_17_18_59896, all_10_1_3) % 2.80/1.34 | (23) rinvS(all_10_1_3, all_10_0_2) % 2.80/1.34 | (24) cp(all_10_0_2) % 2.80/1.35 | (25) cp(all_10_1_3) % 2.80/1.35 | % 2.80/1.35 | Instantiating formula (14) with all_10_1_3, i2003_11_14_17_18_59896 and discharging atoms rs(i2003_11_14_17_18_59896, all_10_1_3), cp(all_10_1_3), cUnsatisfiable(i2003_11_14_17_18_59896), yields: % 2.80/1.35 | (26) $false % 2.80/1.35 | % 2.80/1.35 |-The branch is then unsatisfiable % 2.80/1.35 % SZS output end Proof for theBenchmark % 2.80/1.35 % 2.80/1.35 765ms %------------------------------------------------------------------------------