%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS099+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:33 EDT 2022 % Result : Unsatisfiable 2.09s 1.16s % Output : Proof 2.74s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS099+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n024.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 09:07:05 EDT 2022 % 0.13/0.34 % CPUTime : % 0.51/0.58 ____ _ % 0.51/0.58 ___ / __ \_____(_)___ ________ __________ % 0.51/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.51/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.51/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.51/0.58 % 0.51/0.58 A Theorem Prover for First-Order Logic % 0.51/0.59 (ePrincess v.1.0) % 0.51/0.59 % 0.51/0.59 (c) Philipp Rümmer, 2009-2015 % 0.51/0.59 (c) Peter Backeman, 2014-2015 % 0.51/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.51/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.51/0.59 Bug reports to peter@backeman.se % 0.51/0.59 % 0.51/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.51/0.59 % 0.51/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.75/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.53/0.94 Prover 0: Preprocessing ... % 1.85/1.06 Prover 0: Warning: ignoring some quantifiers % 1.94/1.08 Prover 0: Constructing countermodel ... % 2.09/1.16 Prover 0: proved (523ms) % 2.09/1.16 % 2.09/1.16 No countermodel exists, formula is valid % 2.09/1.16 % SZS status Unsatisfiable for theBenchmark % 2.09/1.16 % 2.09/1.16 Generating proof ... Warning: ignoring some quantifiers % 2.59/1.32 found it (size 10) % 2.59/1.32 % 2.59/1.32 % SZS output start Proof for theBenchmark % 2.59/1.32 Assumed formulas after preprocessing and simplification: % 2.59/1.32 | (0) cUnsatisfiable(i2003_11_14_17_20_29215) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | v3 = v1 | v2 = v1 | ~ rtt(v0, v3) | ~ rtt(v0, v2) | ~ rtt(v0, v1) | cUnsatisfiable(v0) | ? [v4] : ? [v5] : (( ~ (v5 = v4) & rtt(v0, v5) & rtt(v0, v4)) | (rtt(v0, v4) & ~ ca(v4)))) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rtt(v0, v2) | ~ rtt(v0, v1) | ~ cUnsatisfiable(v0)) & ! [v0] : ! [v1] : ( ~ rtt(v0, v1) | ~ cUnsatisfiable(v0) | ca(v1)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cd(v0) | ~ cc(v0)) & ! [v0] : ( ~ ca(v0) | cd(v0) | cc(v0)) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v2) & ~ (v3 = v1) & ~ (v2 = v1) & rtt(v0, v3) & rtt(v0, v2) & rtt(v0, v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0) % 2.74/1.33 | Applying alpha-rule on (0) yields: % 2.74/1.33 | (1) ! [v0] : ! [v1] : ( ~ rtt(v0, v1) | ~ cUnsatisfiable(v0) | ca(v1)) % 2.74/1.34 | (2) ? [v0] : (xsd_string(v0) | xsd_integer(v0)) % 2.74/1.34 | (3) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v2) & ~ (v3 = v1) & ~ (v2 = v1) & rtt(v0, v3) & rtt(v0, v2) & rtt(v0, v1))) % 2.74/1.34 | (4) ! [v0] : ( ~ cd(v0) | ~ cc(v0)) % 2.74/1.34 | (5) ? [v0] : cowlThing(v0) % 2.74/1.34 | (6) ! [v0] : ( ~ ca(v0) | cd(v0) | cc(v0)) % 2.74/1.34 | (7) ! [v0] : ~ cowlNothing(v0) % 2.74/1.34 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | v3 = v1 | v2 = v1 | ~ rtt(v0, v3) | ~ rtt(v0, v2) | ~ rtt(v0, v1) | cUnsatisfiable(v0) | ? [v4] : ? [v5] : (( ~ (v5 = v4) & rtt(v0, v5) & rtt(v0, v4)) | (rtt(v0, v4) & ~ ca(v4)))) % 2.74/1.34 | (9) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 2.74/1.34 | (10) cUnsatisfiable(i2003_11_14_17_20_29215) % 2.74/1.34 | (11) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rtt(v0, v2) | ~ rtt(v0, v1) | ~ cUnsatisfiable(v0)) % 2.74/1.34 | % 2.74/1.34 | Instantiating formula (3) with i2003_11_14_17_20_29215 and discharging atoms cUnsatisfiable(i2003_11_14_17_20_29215), yields: % 2.74/1.34 | (12) ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = v1) & ~ (v2 = v0) & ~ (v1 = v0) & rtt(i2003_11_14_17_20_29215, v2) & rtt(i2003_11_14_17_20_29215, v1) & rtt(i2003_11_14_17_20_29215, v0)) % 2.74/1.34 | % 2.74/1.34 | Instantiating (12) with all_10_0_2, all_10_1_3, all_10_2_4 yields: % 2.74/1.34 | (13) ~ (all_10_0_2 = all_10_1_3) & ~ (all_10_0_2 = all_10_2_4) & ~ (all_10_1_3 = all_10_2_4) & rtt(i2003_11_14_17_20_29215, all_10_0_2) & rtt(i2003_11_14_17_20_29215, all_10_1_3) & rtt(i2003_11_14_17_20_29215, all_10_2_4) % 2.74/1.34 | % 2.74/1.34 | Applying alpha-rule on (13) yields: % 2.74/1.34 | (14) rtt(i2003_11_14_17_20_29215, all_10_0_2) % 2.74/1.34 | (15) rtt(i2003_11_14_17_20_29215, all_10_1_3) % 2.74/1.34 | (16) ~ (all_10_0_2 = all_10_2_4) % 2.74/1.34 | (17) ~ (all_10_0_2 = all_10_1_3) % 2.74/1.34 | (18) ~ (all_10_1_3 = all_10_2_4) % 2.74/1.34 | (19) rtt(i2003_11_14_17_20_29215, all_10_2_4) % 2.74/1.35 | % 2.74/1.35 | Instantiating formula (11) with all_10_1_3, all_10_0_2, i2003_11_14_17_20_29215 and discharging atoms rtt(i2003_11_14_17_20_29215, all_10_0_2), rtt(i2003_11_14_17_20_29215, all_10_1_3), cUnsatisfiable(i2003_11_14_17_20_29215), yields: % 2.74/1.35 | (20) all_10_0_2 = all_10_1_3 % 2.74/1.35 | % 2.74/1.35 | Instantiating formula (11) with all_10_2_4, all_10_0_2, i2003_11_14_17_20_29215 and discharging atoms rtt(i2003_11_14_17_20_29215, all_10_0_2), rtt(i2003_11_14_17_20_29215, all_10_2_4), cUnsatisfiable(i2003_11_14_17_20_29215), yields: % 2.74/1.35 | (21) all_10_0_2 = all_10_2_4 % 2.74/1.35 | % 2.74/1.35 | Combining equations (20,21) yields a new equation: % 2.74/1.35 | (22) all_10_1_3 = all_10_2_4 % 2.74/1.35 | % 2.74/1.35 | Simplifying 22 yields: % 2.74/1.35 | (23) all_10_1_3 = all_10_2_4 % 2.74/1.35 | % 2.74/1.35 | Equations (23) can reduce 18 to: % 2.74/1.35 | (24) $false % 2.74/1.35 | % 2.74/1.35 |-The branch is then unsatisfiable % 2.74/1.35 % SZS output end Proof for theBenchmark % 2.74/1.35 % 2.74/1.35 753ms %------------------------------------------------------------------------------