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