%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN343+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n014.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 05:01:36 EDT 2022 % Result : Theorem 2.67s 1.37s % Output : Proof 3.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN343+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n014.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 20:42:04 EDT 2022 % 0.13/0.34 % CPUTime : % 0.65/0.64 ____ _ % 0.65/0.64 ___ / __ \_____(_)___ ________ __________ % 0.65/0.64 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.65/0.64 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.65/0.64 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.65/0.64 % 0.65/0.64 A Theorem Prover for First-Order Logic % 0.65/0.64 (ePrincess v.1.0) % 0.65/0.64 % 0.65/0.64 (c) Philipp Rümmer, 2009-2015 % 0.65/0.64 (c) Peter Backeman, 2014-2015 % 0.65/0.64 (contributions by Angelo Brillout, Peter Baumgartner) % 0.65/0.64 Free software under GNU Lesser General Public License (LGPL). % 0.65/0.64 Bug reports to peter@backeman.se % 0.65/0.64 % 0.65/0.64 For more information, visit http://user.uu.se/~petba168/breu/ % 0.65/0.64 % 0.65/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.38/0.95 Prover 0: Preprocessing ... % 1.38/1.00 Prover 0: Warning: ignoring some quantifiers % 1.38/1.02 Prover 0: Constructing countermodel ... % 1.68/1.13 Prover 0: gave up % 1.68/1.13 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.68/1.15 Prover 1: Preprocessing ... % 1.97/1.18 Prover 1: Constructing countermodel ... % 2.07/1.19 Prover 1: gave up % 2.07/1.19 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.07/1.20 Prover 2: Preprocessing ... % 2.07/1.22 Prover 2: Warning: ignoring some quantifiers % 2.24/1.22 Prover 2: Constructing countermodel ... % 2.24/1.24 Prover 2: gave up % 2.28/1.24 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.28/1.24 Prover 3: Preprocessing ... % 2.28/1.25 Prover 3: Warning: ignoring some quantifiers % 2.28/1.25 Prover 3: Constructing countermodel ... % 2.28/1.28 Prover 3: gave up % 2.28/1.28 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 2.28/1.28 Prover 4: Preprocessing ... % 2.52/1.31 Prover 4: Warning: ignoring some quantifiers % 2.52/1.31 Prover 4: Constructing countermodel ... % 2.67/1.37 Prover 4: proved (93ms) % 2.67/1.37 % 2.67/1.37 No countermodel exists, formula is valid % 2.67/1.37 % SZS status Theorem for theBenchmark % 2.67/1.37 % 2.67/1.37 Generating proof ... Warning: ignoring some quantifiers % 3.15/1.54 found it (size 22) % 3.15/1.54 % 3.15/1.54 % SZS output start Proof for theBenchmark % 3.15/1.54 Assumed formulas after preprocessing and simplification: % 3.15/1.54 | (0) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (big_f(v1, v2) = v4) | ~ (big_f(v0, v1) = v3) | ? [v5] : ? [v6] : ? [v7] : (big_f(v6, v0) = v7 & big_f(v0, v0) = v5 & ( ~ (v5 = 0) | ~ (v4 = 0)) & (v5 = 0 | (v3 = 0 & ~ (v7 = 0))))) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (big_f(v1, v2) = v4) | ~ (big_f(v0, v0) = v3) | ? [v5] : ? [v6] : ? [v7] : (big_f(v6, v0) = v7 & big_f(v0, v1) = v5 & ( ~ (v4 = 0) | ~ (v3 = 0)) & (v3 = 0 | (v5 = 0 & ~ (v7 = 0))))) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (big_f(v3, v2) = v1) | ~ (big_f(v3, v2) = v0)) & ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : (big_f(v6, v0) = v7 & big_f(v1, v2) = v5 & big_f(v0, v1) = v3 & big_f(v0, v0) = v4 & ( ~ (v5 = 0) | ~ (v4 = 0)) & (v4 = 0 | (v3 = 0 & ~ (v7 = 0)))) % 3.15/1.57 | Applying alpha-rule on (0) yields: % 3.15/1.57 | (1) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (big_f(v1, v2) = v4) | ~ (big_f(v0, v1) = v3) | ? [v5] : ? [v6] : ? [v7] : (big_f(v6, v0) = v7 & big_f(v0, v0) = v5 & ( ~ (v5 = 0) | ~ (v4 = 0)) & (v5 = 0 | (v3 = 0 & ~ (v7 = 0))))) % 3.15/1.58 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (big_f(v1, v2) = v4) | ~ (big_f(v0, v0) = v3) | ? [v5] : ? [v6] : ? [v7] : (big_f(v6, v0) = v7 & big_f(v0, v1) = v5 & ( ~ (v4 = 0) | ~ (v3 = 0)) & (v3 = 0 | (v5 = 0 & ~ (v7 = 0))))) % 3.15/1.58 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (big_f(v3, v2) = v1) | ~ (big_f(v3, v2) = v0)) % 3.15/1.58 | (4) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : (big_f(v6, v0) = v7 & big_f(v1, v2) = v5 & big_f(v0, v1) = v3 & big_f(v0, v0) = v4 & ( ~ (v5 = 0) | ~ (v4 = 0)) & (v4 = 0 | (v3 = 0 & ~ (v7 = 0)))) % 3.15/1.58 | % 3.15/1.58 | Instantiating (4) with all_1_0_0, all_1_1_1, all_1_2_2, all_1_3_3, all_1_4_4, all_1_5_5, all_1_6_6, all_1_7_7 yields: % 3.15/1.58 | (5) big_f(all_1_1_1, all_1_7_7) = all_1_0_0 & big_f(all_1_6_6, all_1_5_5) = all_1_2_2 & big_f(all_1_7_7, all_1_6_6) = all_1_4_4 & big_f(all_1_7_7, all_1_7_7) = all_1_3_3 & ( ~ (all_1_2_2 = 0) | ~ (all_1_3_3 = 0)) & (all_1_3_3 = 0 | (all_1_4_4 = 0 & ~ (all_1_0_0 = 0))) % 3.15/1.58 | % 3.15/1.58 | Applying alpha-rule on (5) yields: % 3.15/1.58 | (6) big_f(all_1_7_7, all_1_6_6) = all_1_4_4 % 3.15/1.58 | (7) all_1_3_3 = 0 | (all_1_4_4 = 0 & ~ (all_1_0_0 = 0)) % 3.15/1.58 | (8) big_f(all_1_6_6, all_1_5_5) = all_1_2_2 % 3.15/1.58 | (9) big_f(all_1_1_1, all_1_7_7) = all_1_0_0 % 3.15/1.58 | (10) ~ (all_1_2_2 = 0) | ~ (all_1_3_3 = 0) % 3.15/1.58 | (11) big_f(all_1_7_7, all_1_7_7) = all_1_3_3 % 3.15/1.58 | % 3.15/1.58 | Instantiating formula (1) with all_1_4_4, all_1_0_0, all_1_6_6, all_1_7_7, all_1_1_1 and discharging atoms big_f(all_1_1_1, all_1_7_7) = all_1_0_0, big_f(all_1_7_7, all_1_6_6) = all_1_4_4, yields: % 3.15/1.58 | (12) ? [v0] : ? [v1] : ? [v2] : (big_f(v1, all_1_1_1) = v2 & big_f(all_1_1_1, all_1_1_1) = v0 & ( ~ (v0 = 0) | ~ (all_1_4_4 = 0)) & (v0 = 0 | (all_1_0_0 = 0 & ~ (v2 = 0)))) % 3.15/1.58 | % 3.15/1.58 | Instantiating formula (2) with all_1_3_3, all_1_3_3, all_1_7_7, all_1_7_7, all_1_7_7 and discharging atoms big_f(all_1_7_7, all_1_7_7) = all_1_3_3, yields: % 3.15/1.58 | (13) ? [v0] : ? [v1] : ( ~ (v1 = 0) & ~ (all_1_3_3 = 0) & big_f(v0, all_1_7_7) = v1 & big_f(all_1_7_7, all_1_7_7) = 0) % 3.15/1.59 | % 3.15/1.59 | Instantiating (13) with all_10_0_11, all_10_1_12 yields: % 3.15/1.59 | (14) ~ (all_10_0_11 = 0) & ~ (all_1_3_3 = 0) & big_f(all_10_1_12, all_1_7_7) = all_10_0_11 & big_f(all_1_7_7, all_1_7_7) = 0 % 3.15/1.59 | % 3.15/1.59 | Applying alpha-rule on (14) yields: % 3.15/1.59 | (15) ~ (all_10_0_11 = 0) % 3.15/1.59 | (16) ~ (all_1_3_3 = 0) % 3.15/1.59 | (17) big_f(all_10_1_12, all_1_7_7) = all_10_0_11 % 3.15/1.59 | (18) big_f(all_1_7_7, all_1_7_7) = 0 % 3.15/1.59 | % 3.15/1.59 | Instantiating (12) with all_24_0_31, all_24_1_32, all_24_2_33 yields: % 3.15/1.59 | (19) big_f(all_24_1_32, all_1_1_1) = all_24_0_31 & big_f(all_1_1_1, all_1_1_1) = all_24_2_33 & ( ~ (all_24_2_33 = 0) | ~ (all_1_4_4 = 0)) & (all_24_2_33 = 0 | (all_1_0_0 = 0 & ~ (all_24_0_31 = 0))) % 3.15/1.59 | % 3.15/1.59 | Applying alpha-rule on (19) yields: % 3.15/1.59 | (20) big_f(all_24_1_32, all_1_1_1) = all_24_0_31 % 3.15/1.59 | (21) big_f(all_1_1_1, all_1_1_1) = all_24_2_33 % 3.15/1.59 | (22) ~ (all_24_2_33 = 0) | ~ (all_1_4_4 = 0) % 3.15/1.59 | (23) all_24_2_33 = 0 | (all_1_0_0 = 0 & ~ (all_24_0_31 = 0)) % 3.15/1.59 | % 3.15/1.59 +-Applying beta-rule and splitting (7), into two cases. % 3.15/1.59 |-Branch one: % 3.15/1.59 | (24) all_1_3_3 = 0 % 3.15/1.59 | % 3.15/1.59 | Equations (24) can reduce 16 to: % 3.15/1.59 | (25) $false % 3.15/1.59 | % 3.15/1.59 |-The branch is then unsatisfiable % 3.15/1.59 |-Branch two: % 3.15/1.59 | (16) ~ (all_1_3_3 = 0) % 3.15/1.59 | (27) all_1_4_4 = 0 & ~ (all_1_0_0 = 0) % 3.15/1.59 | % 3.15/1.59 | Applying alpha-rule on (27) yields: % 3.15/1.59 | (28) all_1_4_4 = 0 % 3.15/1.59 | (29) ~ (all_1_0_0 = 0) % 3.15/1.59 | % 3.15/1.59 +-Applying beta-rule and splitting (23), into two cases. % 3.15/1.59 |-Branch one: % 3.15/1.59 | (30) all_24_2_33 = 0 % 3.15/1.59 | % 3.15/1.59 +-Applying beta-rule and splitting (22), into two cases. % 3.15/1.59 |-Branch one: % 3.15/1.59 | (31) ~ (all_24_2_33 = 0) % 3.15/1.59 | % 3.15/1.59 | Equations (30) can reduce 31 to: % 3.15/1.59 | (25) $false % 3.15/1.59 | % 3.15/1.59 |-The branch is then unsatisfiable % 3.15/1.59 |-Branch two: % 3.15/1.59 | (30) all_24_2_33 = 0 % 3.15/1.59 | (34) ~ (all_1_4_4 = 0) % 3.15/1.59 | % 3.15/1.59 | Equations (28) can reduce 34 to: % 3.15/1.59 | (25) $false % 3.15/1.59 | % 3.15/1.59 |-The branch is then unsatisfiable % 3.15/1.59 |-Branch two: % 3.15/1.59 | (31) ~ (all_24_2_33 = 0) % 3.15/1.59 | (37) all_1_0_0 = 0 & ~ (all_24_0_31 = 0) % 3.15/1.59 | % 3.15/1.59 | Applying alpha-rule on (37) yields: % 3.15/1.59 | (38) all_1_0_0 = 0 % 3.15/1.59 | (39) ~ (all_24_0_31 = 0) % 3.15/1.59 | % 3.15/1.59 | Equations (38) can reduce 29 to: % 3.15/1.59 | (25) $false % 3.15/1.59 | % 3.15/1.59 |-The branch is then unsatisfiable % 3.15/1.59 % SZS output end Proof for theBenchmark % 3.15/1.59 % 3.15/1.59 936ms %------------------------------------------------------------------------------