%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS069+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n029.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:28 EDT 2022 % Result : Unsatisfiable 2.13s 1.20s % Output : Proof 2.82s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : KRS069+1 : TPTP v8.1.0. Released v3.1.0. % 0.08/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n029.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 7 15:11:35 EDT 2022 % 0.13/0.34 % CPUTime : % 0.45/0.60 ____ _ % 0.45/0.60 ___ / __ \_____(_)___ ________ __________ % 0.45/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.45/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.45/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.45/0.60 % 0.45/0.60 A Theorem Prover for First-Order Logic % 0.45/0.61 (ePrincess v.1.0) % 0.45/0.61 % 0.45/0.61 (c) Philipp Rümmer, 2009-2015 % 0.45/0.61 (c) Peter Backeman, 2014-2015 % 0.45/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.45/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.45/0.61 Bug reports to peter@backeman.se % 0.45/0.61 % 0.45/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.45/0.61 % 0.45/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.52/0.96 Prover 0: Preprocessing ... % 1.79/1.09 Prover 0: Warning: ignoring some quantifiers % 1.99/1.10 Prover 0: Constructing countermodel ... % 2.13/1.19 Prover 0: proved (538ms) % 2.13/1.19 % 2.13/1.19 No countermodel exists, formula is valid % 2.13/1.20 % SZS status Unsatisfiable for theBenchmark % 2.13/1.20 % 2.13/1.20 Generating proof ... Warning: ignoring some quantifiers % 2.82/1.38 found it (size 18) % 2.82/1.38 % 2.82/1.38 % SZS output start Proof for theBenchmark % 2.82/1.38 Assumed formulas after preprocessing and simplification: % 2.82/1.38 | (0) cUnsatisfiable(i2003_11_14_17_18_2750) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ rf3(v0, v1) | ~ rf2(v0, v2) | ~ rf1(v0, v3) | ~ cp2(v1) | ~ cp1(v3) | cp1(v2) | cUnsatisfiable(v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf3(v0, v2) | ~ rf3(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf2(v0, v2) | ~ rf2(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1)) & ! [v0] : ! [v1] : ( ~ rf3(v0, v1) | rf2(v0, v1)) & ! [v0] : ! [v1] : ( ~ rf3(v0, v1) | rf1(v0, v1)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf3(v0, v1) & cp2(v1))) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf2(v0, v1) & ~ cp1(v1))) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf1(v0, v1) & cp1(v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0) % 2.82/1.39 | Applying alpha-rule on (0) yields: % 2.82/1.39 | (1) ? [v0] : cowlThing(v0) % 2.82/1.39 | (2) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1)) % 2.82/1.39 | (3) ! [v0] : ! [v1] : ( ~ rf3(v0, v1) | rf1(v0, v1)) % 2.82/1.39 | (4) ! [v0] : ! [v1] : ( ~ rf3(v0, v1) | rf2(v0, v1)) % 2.82/1.39 | (5) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf2(v0, v1) & ~ cp1(v1))) % 2.82/1.39 | (6) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf1(v0, v1) & cp1(v1))) % 2.82/1.39 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ rf3(v0, v1) | ~ rf2(v0, v2) | ~ rf1(v0, v3) | ~ cp2(v1) | ~ cp1(v3) | cp1(v2) | cUnsatisfiable(v0)) % 2.82/1.39 | (8) ! [v0] : ~ cowlNothing(v0) % 2.82/1.39 | (9) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 2.82/1.39 | (10) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf2(v0, v2) | ~ rf2(v0, v1)) % 2.82/1.39 | (11) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf3(v0, v1) & cp2(v1))) % 2.82/1.40 | (12) cUnsatisfiable(i2003_11_14_17_18_2750) % 2.82/1.40 | (13) ? [v0] : (xsd_string(v0) | xsd_integer(v0)) % 2.82/1.40 | (14) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf3(v0, v2) | ~ rf3(v0, v1)) % 2.82/1.40 | % 2.82/1.40 | Instantiating formula (11) with i2003_11_14_17_18_2750 and discharging atoms cUnsatisfiable(i2003_11_14_17_18_2750), yields: % 2.82/1.40 | (15) ? [v0] : (rf3(i2003_11_14_17_18_2750, v0) & cp2(v0)) % 2.82/1.40 | % 2.82/1.40 | Instantiating formula (5) with i2003_11_14_17_18_2750 and discharging atoms cUnsatisfiable(i2003_11_14_17_18_2750), yields: % 2.82/1.40 | (16) ? [v0] : (rf2(i2003_11_14_17_18_2750, v0) & ~ cp1(v0)) % 2.82/1.40 | % 2.82/1.40 | Instantiating formula (6) with i2003_11_14_17_18_2750 and discharging atoms cUnsatisfiable(i2003_11_14_17_18_2750), yields: % 2.82/1.40 | (17) ? [v0] : (rf1(i2003_11_14_17_18_2750, v0) & cp1(v0)) % 2.82/1.40 | % 2.82/1.40 | Instantiating (17) with all_10_0_2 yields: % 2.82/1.40 | (18) rf1(i2003_11_14_17_18_2750, all_10_0_2) & cp1(all_10_0_2) % 2.82/1.40 | % 2.82/1.40 | Applying alpha-rule on (18) yields: % 2.82/1.40 | (19) rf1(i2003_11_14_17_18_2750, all_10_0_2) % 2.82/1.40 | (20) cp1(all_10_0_2) % 2.82/1.40 | % 2.82/1.40 | Instantiating (15) with all_12_0_3 yields: % 2.82/1.40 | (21) rf3(i2003_11_14_17_18_2750, all_12_0_3) & cp2(all_12_0_3) % 2.82/1.40 | % 2.82/1.40 | Applying alpha-rule on (21) yields: % 2.82/1.40 | (22) rf3(i2003_11_14_17_18_2750, all_12_0_3) % 2.82/1.40 | (23) cp2(all_12_0_3) % 2.82/1.40 | % 2.82/1.40 | Instantiating (16) with all_14_0_4 yields: % 2.82/1.40 | (24) rf2(i2003_11_14_17_18_2750, all_14_0_4) & ~ cp1(all_14_0_4) % 2.82/1.40 | % 2.82/1.40 | Applying alpha-rule on (24) yields: % 2.82/1.40 | (25) rf2(i2003_11_14_17_18_2750, all_14_0_4) % 2.82/1.40 | (26) ~ cp1(all_14_0_4) % 2.82/1.40 | % 2.82/1.40 | Instantiating formula (4) with all_12_0_3, i2003_11_14_17_18_2750 and discharging atoms rf3(i2003_11_14_17_18_2750, all_12_0_3), yields: % 2.82/1.40 | (27) rf2(i2003_11_14_17_18_2750, all_12_0_3) % 2.82/1.40 | % 2.82/1.40 | Instantiating formula (3) with all_12_0_3, i2003_11_14_17_18_2750 and discharging atoms rf3(i2003_11_14_17_18_2750, all_12_0_3), yields: % 2.82/1.40 | (28) rf1(i2003_11_14_17_18_2750, all_12_0_3) % 2.82/1.40 | % 2.82/1.40 | Instantiating formula (10) with all_12_0_3, all_14_0_4, i2003_11_14_17_18_2750 and discharging atoms rf2(i2003_11_14_17_18_2750, all_14_0_4), rf2(i2003_11_14_17_18_2750, all_12_0_3), yields: % 2.82/1.40 | (29) all_14_0_4 = all_12_0_3 % 2.82/1.40 | % 2.82/1.40 | Instantiating formula (2) with all_12_0_3, all_10_0_2, i2003_11_14_17_18_2750 and discharging atoms rf1(i2003_11_14_17_18_2750, all_12_0_3), rf1(i2003_11_14_17_18_2750, all_10_0_2), yields: % 2.82/1.40 | (30) all_12_0_3 = all_10_0_2 % 2.82/1.40 | % 2.82/1.40 | Combining equations (30,29) yields a new equation: % 2.82/1.40 | (31) all_14_0_4 = all_10_0_2 % 2.82/1.40 | % 2.82/1.40 | From (31) and (26) follows: % 2.82/1.40 | (32) ~ cp1(all_10_0_2) % 2.82/1.40 | % 2.82/1.40 | Using (20) and (32) yields: % 2.82/1.40 | (33) $false % 2.82/1.40 | % 2.82/1.41 |-The branch is then unsatisfiable % 2.82/1.41 % SZS output end Proof for theBenchmark % 2.82/1.41 % 2.82/1.41 790ms %------------------------------------------------------------------------------