%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n025.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 : Fri Jul 15 02:52:13 EDT 2022 % Result : Theorem 1.88s 1.11s % Output : Proof 2.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % 0.10/0.11 % Command : ePrincess-casc -timeout=%d %s % 0.11/0.32 % Computer : n025.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Fri Jun 10 07:06:36 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.74/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.44/0.91 Prover 0: Preprocessing ... % 1.69/1.03 Prover 0: Constructing countermodel ... % 1.88/1.11 Prover 0: proved (480ms) % 1.88/1.11 % 1.88/1.11 No countermodel exists, formula is valid % 1.88/1.11 % SZS status Theorem for theBenchmark % 1.88/1.11 % 1.88/1.11 Generating proof ... found it (size 4) % 2.42/1.27 % 2.42/1.27 % SZS output start Proof for theBenchmark % 2.42/1.27 Assumed formulas after preprocessing and simplification: % 2.42/1.27 | (0) ? [v0] : ? [v1] : (s__siblingFn(jim) = geoff & greater(n54, n48) & s__age(jim, n54) & s__age(geoff, n48) & s__LivingThing(v0) & s__Human(v1) & s__Human(jim) & s__Human(geoff) & ~ s__has_seen_more(geoff, jim) & ~ s__more_experienced(jim, geoff) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (s__siblingFn(v2) = v5) | ~ greater(v3, v4) | ~ s__age(v5, v4) | ~ s__age(v2, v3) | ~ s__Human(v2) | s__has_seen_more(v5, v2) | s__more_experienced(v2, v5)) & ! [v2] : ! [v3] : ! [v4] : (v4 = v3 | ~ (s__siblingFn(v3) = v2) | ~ (s__siblingFn(v2) = v4) | ~ s__Human(v3) | ~ s__Human(v2)) & ! [v2] : ! [v3] : ! [v4] : (v3 = v2 | ~ (s__siblingFn(v4) = v3) | ~ (s__siblingFn(v4) = v2)) & ! [v2] : ! [v3] : ( ~ (s__siblingFn(v2) = v3) | ~ s__Human(v2) | s__Human(v3)) & ! [v2] : ( ~ s__Human(v2) | s__LivingThing(v2))) % 2.42/1.30 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 2.42/1.30 | (1) s__siblingFn(jim) = geoff & greater(n54, n48) & s__age(jim, n54) & s__age(geoff, n48) & s__LivingThing(all_0_1_1) & s__Human(all_0_0_0) & s__Human(jim) & s__Human(geoff) & ~ s__has_seen_more(geoff, jim) & ~ s__more_experienced(jim, geoff) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (s__siblingFn(v0) = v3) | ~ greater(v1, v2) | ~ s__age(v3, v2) | ~ s__age(v0, v1) | ~ s__Human(v0) | s__has_seen_more(v3, v0) | s__more_experienced(v0, v3)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ (s__siblingFn(v1) = v0) | ~ (s__siblingFn(v0) = v2) | ~ s__Human(v1) | ~ s__Human(v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (s__siblingFn(v2) = v1) | ~ (s__siblingFn(v2) = v0)) & ! [v0] : ! [v1] : ( ~ (s__siblingFn(v0) = v1) | ~ s__Human(v0) | s__Human(v1)) & ! [v0] : ( ~ s__Human(v0) | s__LivingThing(v0)) % 2.42/1.31 | % 2.42/1.31 | Applying alpha-rule on (1) yields: % 2.42/1.31 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (s__siblingFn(v2) = v1) | ~ (s__siblingFn(v2) = v0)) % 2.42/1.31 | (3) ! [v0] : ! [v1] : ( ~ (s__siblingFn(v0) = v1) | ~ s__Human(v0) | s__Human(v1)) % 2.42/1.31 | (4) s__LivingThing(all_0_1_1) % 2.42/1.31 | (5) s__Human(geoff) % 2.42/1.31 | (6) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (s__siblingFn(v0) = v3) | ~ greater(v1, v2) | ~ s__age(v3, v2) | ~ s__age(v0, v1) | ~ s__Human(v0) | s__has_seen_more(v3, v0) | s__more_experienced(v0, v3)) % 2.42/1.31 | (7) ~ s__more_experienced(jim, geoff) % 2.42/1.31 | (8) s__age(geoff, n48) % 2.42/1.31 | (9) ~ s__has_seen_more(geoff, jim) % 2.42/1.31 | (10) s__Human(all_0_0_0) % 2.42/1.31 | (11) s__Human(jim) % 2.42/1.31 | (12) s__age(jim, n54) % 2.42/1.31 | (13) ! [v0] : ( ~ s__Human(v0) | s__LivingThing(v0)) % 2.42/1.31 | (14) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ (s__siblingFn(v1) = v0) | ~ (s__siblingFn(v0) = v2) | ~ s__Human(v1) | ~ s__Human(v0)) % 2.42/1.31 | (15) greater(n54, n48) % 2.42/1.31 | (16) s__siblingFn(jim) = geoff % 2.42/1.31 | % 2.42/1.31 | Instantiating formula (6) with geoff, n48, n54, jim and discharging atoms s__siblingFn(jim) = geoff, greater(n54, n48), s__age(jim, n54), s__age(geoff, n48), s__Human(jim), ~ s__has_seen_more(geoff, jim), ~ s__more_experienced(jim, geoff), yields: % 2.42/1.31 | (17) $false % 2.42/1.31 | % 2.42/1.32 |-The branch is then unsatisfiable % 2.42/1.32 % SZS output end Proof for theBenchmark % 2.42/1.32 % 2.42/1.32 727ms %------------------------------------------------------------------------------