%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n018.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:49 EDT 2022 % Result : Theorem 1.72s 1.05s % Output : Proof 2.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n018.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 Jul 12 08:51:29 EDT 2022 % 0.13/0.34 % CPUTime : % 0.52/0.59 ____ _ % 0.52/0.59 ___ / __ \_____(_)___ ________ __________ % 0.52/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.52/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.52/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.52/0.59 % 0.52/0.59 A Theorem Prover for First-Order Logic % 0.52/0.59 (ePrincess v.1.0) % 0.52/0.59 % 0.52/0.59 (c) Philipp Rümmer, 2009-2015 % 0.52/0.59 (c) Peter Backeman, 2014-2015 % 0.52/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.52/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.52/0.59 Bug reports to peter@backeman.se % 0.52/0.59 % 0.52/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.52/0.59 % 0.52/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.52/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.18/0.84 Prover 0: Preprocessing ... % 1.43/0.95 Prover 0: Constructing countermodel ... % 1.72/1.05 Prover 0: proved (416ms) % 1.72/1.05 % 1.72/1.05 No countermodel exists, formula is valid % 1.72/1.05 % SZS status Theorem for theBenchmark % 1.72/1.05 % 1.72/1.05 Generating proof ... found it (size 15) % 2.36/1.24 % 2.36/1.24 % SZS output start Proof for theBenchmark % 2.36/1.24 Assumed formulas after preprocessing and simplification: % 2.36/1.24 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : ? [v8] : ? [v9] : ( ~ (v9 = v6) & f(v8, v3) = v9 & f(v7, v2) = v8 & f(v2, v3) = v4 & f(v1, v4) = v5 & f(v0, v5) = v6 & f(v0, v1) = v7 & ! [v10] : ! [v11] : ! [v12] : ! [v13] : ! [v14] : ( ~ (f(v13, v12) = v14) | ~ (f(v10, v11) = v13) | ? [v15] : (f(v11, v12) = v15 & f(v10, v15) = v14)) & ! [v10] : ! [v11] : ! [v12] : ! [v13] : ! [v14] : ( ~ (f(v11, v12) = v13) | ~ (f(v10, v13) = v14) | ? [v15] : (f(v15, v12) = v14 & f(v10, v11) = v15)) & ! [v10] : ! [v11] : ! [v12] : ! [v13] : (v11 = v10 | ~ (f(v13, v12) = v11) | ~ (f(v13, v12) = v10))) % 2.39/1.28 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6, all_0_7_7, all_0_8_8, all_0_9_9 yields: % 2.39/1.28 | (1) ~ (all_0_0_0 = all_0_3_3) & f(all_0_1_1, all_0_6_6) = all_0_0_0 & f(all_0_2_2, all_0_7_7) = all_0_1_1 & f(all_0_7_7, all_0_6_6) = all_0_5_5 & f(all_0_8_8, all_0_5_5) = all_0_4_4 & f(all_0_9_9, all_0_4_4) = all_0_3_3 & f(all_0_9_9, all_0_8_8) = all_0_2_2 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v3, v2) = v4) | ~ (f(v0, v1) = v3) | ? [v5] : (f(v1, v2) = v5 & f(v0, v5) = v4)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v1, v2) = v3) | ~ (f(v0, v3) = v4) | ? [v5] : (f(v5, v2) = v4 & f(v0, v1) = v5)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (f(v3, v2) = v1) | ~ (f(v3, v2) = v0)) % 2.39/1.28 | % 2.39/1.28 | Applying alpha-rule on (1) yields: % 2.39/1.28 | (2) f(all_0_1_1, all_0_6_6) = all_0_0_0 % 2.39/1.28 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v3, v2) = v4) | ~ (f(v0, v1) = v3) | ? [v5] : (f(v1, v2) = v5 & f(v0, v5) = v4)) % 2.39/1.28 | (4) f(all_0_9_9, all_0_4_4) = all_0_3_3 % 2.39/1.28 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v1, v2) = v3) | ~ (f(v0, v3) = v4) | ? [v5] : (f(v5, v2) = v4 & f(v0, v1) = v5)) % 2.39/1.28 | (6) f(all_0_2_2, all_0_7_7) = all_0_1_1 % 2.39/1.28 | (7) f(all_0_9_9, all_0_8_8) = all_0_2_2 % 2.39/1.28 | (8) ~ (all_0_0_0 = all_0_3_3) % 2.39/1.29 | (9) f(all_0_8_8, all_0_5_5) = all_0_4_4 % 2.39/1.29 | (10) f(all_0_7_7, all_0_6_6) = all_0_5_5 % 2.39/1.29 | (11) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (f(v3, v2) = v1) | ~ (f(v3, v2) = v0)) % 2.39/1.29 | % 2.39/1.29 | Instantiating formula (3) with all_0_0_0, all_0_1_1, all_0_6_6, all_0_7_7, all_0_2_2 and discharging atoms f(all_0_1_1, all_0_6_6) = all_0_0_0, f(all_0_2_2, all_0_7_7) = all_0_1_1, yields: % 2.39/1.29 | (12) ? [v0] : (f(all_0_2_2, v0) = all_0_0_0 & f(all_0_7_7, all_0_6_6) = v0) % 2.39/1.29 | % 2.39/1.29 | Instantiating formula (5) with all_0_3_3, all_0_4_4, all_0_5_5, all_0_8_8, all_0_9_9 and discharging atoms f(all_0_8_8, all_0_5_5) = all_0_4_4, f(all_0_9_9, all_0_4_4) = all_0_3_3, yields: % 2.39/1.29 | (13) ? [v0] : (f(v0, all_0_5_5) = all_0_3_3 & f(all_0_9_9, all_0_8_8) = v0) % 2.39/1.29 | % 2.39/1.29 | Instantiating (12) with all_12_0_12 yields: % 2.39/1.29 | (14) f(all_0_2_2, all_12_0_12) = all_0_0_0 & f(all_0_7_7, all_0_6_6) = all_12_0_12 % 2.39/1.29 | % 2.39/1.29 | Applying alpha-rule on (14) yields: % 2.39/1.29 | (15) f(all_0_2_2, all_12_0_12) = all_0_0_0 % 2.39/1.29 | (16) f(all_0_7_7, all_0_6_6) = all_12_0_12 % 2.39/1.29 | % 2.39/1.29 | Instantiating (13) with all_14_0_13 yields: % 2.39/1.29 | (17) f(all_14_0_13, all_0_5_5) = all_0_3_3 & f(all_0_9_9, all_0_8_8) = all_14_0_13 % 2.39/1.29 | % 2.39/1.29 | Applying alpha-rule on (17) yields: % 2.39/1.29 | (18) f(all_14_0_13, all_0_5_5) = all_0_3_3 % 2.39/1.29 | (19) f(all_0_9_9, all_0_8_8) = all_14_0_13 % 2.39/1.29 | % 2.39/1.29 | Instantiating formula (11) with all_0_7_7, all_0_6_6, all_12_0_12, all_0_5_5 and discharging atoms f(all_0_7_7, all_0_6_6) = all_12_0_12, f(all_0_7_7, all_0_6_6) = all_0_5_5, yields: % 2.39/1.29 | (20) all_12_0_12 = all_0_5_5 % 2.39/1.29 | % 2.39/1.29 | Instantiating formula (11) with all_0_9_9, all_0_8_8, all_14_0_13, all_0_2_2 and discharging atoms f(all_0_9_9, all_0_8_8) = all_14_0_13, f(all_0_9_9, all_0_8_8) = all_0_2_2, yields: % 2.39/1.29 | (21) all_14_0_13 = all_0_2_2 % 2.39/1.29 | % 2.39/1.29 | From (21) and (18) follows: % 2.39/1.29 | (22) f(all_0_2_2, all_0_5_5) = all_0_3_3 % 2.39/1.29 | % 2.39/1.29 | From (20) and (15) follows: % 2.39/1.29 | (23) f(all_0_2_2, all_0_5_5) = all_0_0_0 % 2.39/1.29 | % 2.39/1.29 | Instantiating formula (11) with all_0_2_2, all_0_5_5, all_0_3_3, all_0_0_0 and discharging atoms f(all_0_2_2, all_0_5_5) = all_0_0_0, f(all_0_2_2, all_0_5_5) = all_0_3_3, yields: % 2.39/1.29 | (24) all_0_0_0 = all_0_3_3 % 2.39/1.29 | % 2.39/1.29 | Equations (24) can reduce 8 to: % 2.39/1.29 | (25) $false % 2.39/1.29 | % 2.39/1.30 |-The branch is then unsatisfiable % 2.39/1.30 % SZS output end Proof for theBenchmark % 2.39/1.30 % 2.39/1.30 699ms %------------------------------------------------------------------------------