%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN079+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n010.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 : Thu Jul 21 04:59:47 EDT 2022 % Result : Theorem 1.47s 1.05s % Output : Proof 2.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN079+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n010.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 : Mon Jul 11 13:33:45 EDT 2022 % 0.13/0.34 % CPUTime : % 0.48/0.60 ____ _ % 0.48/0.60 ___ / __ \_____(_)___ ________ __________ % 0.48/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.48/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.48/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.48/0.60 % 0.48/0.60 A Theorem Prover for First-Order Logic % 0.48/0.60 (ePrincess v.1.0) % 0.48/0.60 % 0.48/0.60 (c) Philipp Rümmer, 2009-2015 % 0.48/0.60 (c) Peter Backeman, 2014-2015 % 0.48/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.48/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.48/0.60 Bug reports to peter@backeman.se % 0.48/0.60 % 0.48/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.48/0.60 % 0.48/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.19/0.89 Prover 0: Preprocessing ... % 1.40/0.97 Prover 0: Constructing countermodel ... % 1.47/1.04 Prover 0: proved (395ms) % 1.47/1.05 % 1.47/1.05 No countermodel exists, formula is valid % 1.47/1.05 % SZS status Theorem for theBenchmark % 1.47/1.05 % 1.47/1.05 Generating proof ... found it (size 4) % 2.03/1.15 % 2.03/1.15 % SZS output start Proof for theBenchmark % 2.03/1.15 Assumed formulas after preprocessing and simplification: % 2.03/1.15 | (0) ? [v0] : ? [v1] : ? [v2] : (f(b, c) = v1 & f(a, c) = v2 & f(a, b) = v0 & big_f(v1, v2) & big_f(v0, v1) & ~ big_f(v0, v2) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (f(v6, v5) = v4) | ~ (f(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : ( ~ big_f(v4, v5) | ~ big_f(v3, v4) | big_f(v3, v5))) % 2.13/1.20 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.13/1.20 | (1) f(b, c) = all_0_1_1 & f(a, c) = all_0_0_0 & f(a, b) = all_0_2_2 & big_f(all_0_1_1, all_0_0_0) & big_f(all_0_2_2, all_0_1_1) & ~ big_f(all_0_2_2, all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (f(v3, v2) = v1) | ~ (f(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ big_f(v1, v2) | ~ big_f(v0, v1) | big_f(v0, v2)) % 2.13/1.20 | % 2.13/1.20 | Applying alpha-rule on (1) yields: % 2.13/1.20 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (f(v3, v2) = v1) | ~ (f(v3, v2) = v0)) % 2.13/1.20 | (3) ! [v0] : ! [v1] : ! [v2] : ( ~ big_f(v1, v2) | ~ big_f(v0, v1) | big_f(v0, v2)) % 2.13/1.20 | (4) f(b, c) = all_0_1_1 % 2.13/1.20 | (5) big_f(all_0_2_2, all_0_1_1) % 2.13/1.20 | (6) f(a, c) = all_0_0_0 % 2.13/1.20 | (7) big_f(all_0_1_1, all_0_0_0) % 2.13/1.20 | (8) ~ big_f(all_0_2_2, all_0_0_0) % 2.13/1.20 | (9) f(a, b) = all_0_2_2 % 2.13/1.20 | % 2.13/1.20 | Instantiating formula (3) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms big_f(all_0_1_1, all_0_0_0), big_f(all_0_2_2, all_0_1_1), ~ big_f(all_0_2_2, all_0_0_0), yields: % 2.13/1.20 | (10) $false % 2.13/1.20 | % 2.13/1.21 |-The branch is then unsatisfiable % 2.13/1.21 % SZS output end Proof for theBenchmark % 2.13/1.21 % 2.13/1.21 596ms %------------------------------------------------------------------------------