%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n021.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 : Mon Jul 18 16:25:08 EDT 2022 % Result : Theorem 9.79s 2.95s % Output : Proof 11.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.35 % Computer : n021.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jun 2 04:48:31 EDT 2022 % 0.13/0.35 % CPUTime : % 0.47/0.59 ____ _ % 0.47/0.59 ___ / __ \_____(_)___ ________ __________ % 0.47/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.47/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.47/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.47/0.59 % 0.47/0.59 A Theorem Prover for First-Order Logic % 0.47/0.59 (ePrincess v.1.0) % 0.47/0.59 % 0.47/0.59 (c) Philipp Rümmer, 2009-2015 % 0.47/0.59 (c) Peter Backeman, 2014-2015 % 0.47/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.47/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.47/0.59 Bug reports to peter@backeman.se % 0.47/0.59 % 0.47/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.47/0.59 % 0.47/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.69/0.93 Prover 0: Preprocessing ... % 2.08/1.08 Prover 0: Warning: ignoring some quantifiers % 2.08/1.10 Prover 0: Constructing countermodel ... % 2.74/1.34 Prover 0: gave up % 2.74/1.34 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 3.11/1.37 Prover 1: Preprocessing ... % 3.33/1.44 Prover 1: Warning: ignoring some quantifiers % 3.33/1.45 Prover 1: Constructing countermodel ... % 3.85/1.62 Prover 1: gave up % 3.85/1.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 3.85/1.65 Prover 2: Preprocessing ... % 4.36/1.69 Prover 2: Warning: ignoring some quantifiers % 4.36/1.70 Prover 2: Constructing countermodel ... % 4.92/1.82 Prover 2: gave up % 4.92/1.83 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 4.92/1.84 Prover 3: Preprocessing ... % 5.13/1.86 Prover 3: Warning: ignoring some quantifiers % 5.13/1.86 Prover 3: Constructing countermodel ... % 5.13/1.92 Prover 3: gave up % 5.13/1.92 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 5.49/1.94 Prover 4: Preprocessing ... % 5.69/1.98 Prover 4: Warning: ignoring some quantifiers % 5.69/1.99 Prover 4: Constructing countermodel ... % 6.54/2.18 Prover 4: gave up % 6.54/2.18 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 6.54/2.19 Prover 5: Preprocessing ... % 6.54/2.21 Prover 5: Warning: ignoring some quantifiers % 6.54/2.22 Prover 5: Constructing countermodel ... % 6.93/2.28 Prover 5: gave up % 6.93/2.28 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 6.93/2.30 Prover 6: Preprocessing ... % 7.12/2.32 Prover 6: Warning: ignoring some quantifiers % 7.12/2.32 Prover 6: Constructing countermodel ... % 7.56/2.40 Prover 6: gave up % 7.56/2.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 7.56/2.42 Prover 7: Preprocessing ... % 7.56/2.43 Prover 7: Proving ... % 9.79/2.95 Prover 7: proved (550ms) % 9.79/2.95 % 9.79/2.95 % SZS status Theorem for theBenchmark % 9.79/2.95 % 9.79/2.95 Generating proof ... found it (size 14) % 11.65/3.31 % 11.65/3.31 % SZS output start Proof for theBenchmark % 11.65/3.31 Assumed formulas after preprocessing and simplification: % 11.65/3.31 | (0) ! [v0] : ! [v1] : (v1 = v0 | ! [v2] : ( ~ r2(v1, v2) | ~ r2(v0, v2))) & ! [v0] : ! [v1] : ( ~ r2(v1, v0) | ~ r1(v1)) & ! [v0] : ! [v1] : ( ~ r2(v0, v1) | ~ r1(v1)) & ! [v0] : ! [v1] : ? [v2] : ! [v3] : ((v3 = v2 & r4(v0, v1, v2)) | ( ~ (v3 = v2) & ~ r4(v0, v1, v3))) & ! [v0] : ! [v1] : ? [v2] : ! [v3] : ((v3 = v2 & r3(v0, v1, v2)) | ( ~ (v3 = v2) & ~ r3(v0, v1, v3))) & ! [v0] : ? [v1] : ! [v2] : ((v2 = v1 & r2(v0, v1)) | ( ~ (v2 = v1) & ~ r2(v0, v2))) & ? [v0] : ! [v1] : ((v1 = v0 & r1(v0)) | ( ~ (v1 = v0) & ~ r1(v1))) & ! [v0] : (r1(v0) | ? [v1] : r2(v1, v0)) & ! [v0] : ! [v1] : ? [v2] : ( ? [v3] : (r4(v0, v3, v2) & r2(v1, v3)) & ? [v3] : (r4(v0, v1, v3) & r3(v3, v0, v2))) & ! [v0] : ! [v1] : ? [v2] : ( ? [v3] : (r3(v0, v3, v2) & r2(v1, v3)) & ? [v3] : (r3(v0, v1, v3) & r2(v3, v2))) & ! [v0] : ? [v1] : (r3(v0, v1, v0) & r1(v1)) & ! [v0] : ? [v1] : (r1(v1) & ? [v2] : (r4(v0, v2, v1) & r1(v2))) % 11.65/3.31 | Applying alpha-rule on (0) yields: % 11.65/3.31 | (1) ? [v0] : ! [v1] : ((v1 = v0 & r1(v0)) | ( ~ (v1 = v0) & ~ r1(v1))) % 11.65/3.31 | (2) ! [v0] : ? [v1] : (r3(v0, v1, v0) & r1(v1)) % 11.65/3.31 | (3) ! [v0] : ! [v1] : ? [v2] : ! [v3] : ((v3 = v2 & r4(v0, v1, v2)) | ( ~ (v3 = v2) & ~ r4(v0, v1, v3))) % 11.65/3.32 | (4) ! [v0] : ? [v1] : ! [v2] : ((v2 = v1 & r2(v0, v1)) | ( ~ (v2 = v1) & ~ r2(v0, v2))) % 11.65/3.32 | (5) ! [v0] : ! [v1] : ( ~ r2(v1, v0) | ~ r1(v1)) % 11.65/3.32 | (6) ! [v0] : ! [v1] : ? [v2] : ! [v3] : ((v3 = v2 & r3(v0, v1, v2)) | ( ~ (v3 = v2) & ~ r3(v0, v1, v3))) % 11.65/3.32 | (7) ! [v0] : ! [v1] : ? [v2] : ( ? [v3] : (r3(v0, v3, v2) & r2(v1, v3)) & ? [v3] : (r3(v0, v1, v3) & r2(v3, v2))) % 11.65/3.32 | (8) ! [v0] : (r1(v0) | ? [v1] : r2(v1, v0)) % 11.65/3.32 | (9) ! [v0] : ! [v1] : ( ~ r2(v0, v1) | ~ r1(v1)) % 11.65/3.32 | (10) ! [v0] : ! [v1] : ? [v2] : ( ? [v3] : (r4(v0, v3, v2) & r2(v1, v3)) & ? [v3] : (r4(v0, v1, v3) & r3(v3, v0, v2))) % 11.65/3.32 | (11) ! [v0] : ! [v1] : (v1 = v0 | ! [v2] : ( ~ r2(v1, v2) | ~ r2(v0, v2))) % 11.71/3.32 | (12) ! [v0] : ? [v1] : (r1(v1) & ? [v2] : (r4(v0, v2, v1) & r1(v2))) % 11.71/3.32 | % 11.71/3.32 | Instantiating formula (2) with ex_54_0_21 yields: % 11.71/3.32 | (13) ? [v0] : (r3(ex_54_0_21, v0, ex_54_0_21) & r1(v0)) % 11.71/3.32 | % 11.71/3.32 | Instantiating (13) with all_55_0_22 yields: % 11.71/3.32 | (14) r3(ex_54_0_21, all_55_0_22, ex_54_0_21) & r1(all_55_0_22) % 11.71/3.32 | % 11.71/3.32 | Applying alpha-rule on (14) yields: % 11.71/3.32 | (15) r3(ex_54_0_21, all_55_0_22, ex_54_0_21) % 11.71/3.32 | (16) r1(all_55_0_22) % 11.71/3.32 | % 11.71/3.32 | Introducing new symbol ex_67_0_25 defined by: % 11.71/3.32 | (17) ex_67_0_25 = all_55_0_22 % 11.71/3.32 | % 11.71/3.32 | Instantiating formula (10) with ex_67_0_25, ex_67_1_26 yields: % 11.71/3.32 | (18) ? [v0] : ( ? [v1] : (r4(ex_67_1_26, v1, v0) & r2(ex_67_0_25, v1)) & ? [v1] : (r4(ex_67_1_26, ex_67_0_25, v1) & r3(v1, ex_67_1_26, v0))) % 11.71/3.32 | % 11.71/3.32 | Instantiating (18) with all_68_0_27 yields: % 11.71/3.32 | (19) ? [v0] : (r4(ex_67_1_26, v0, all_68_0_27) & r2(ex_67_0_25, v0)) & ? [v0] : (r4(ex_67_1_26, ex_67_0_25, v0) & r3(v0, ex_67_1_26, all_68_0_27)) % 11.71/3.32 | % 11.71/3.32 | Applying alpha-rule on (19) yields: % 11.71/3.32 | (20) ? [v0] : (r4(ex_67_1_26, v0, all_68_0_27) & r2(ex_67_0_25, v0)) % 11.71/3.32 | (21) ? [v0] : (r4(ex_67_1_26, ex_67_0_25, v0) & r3(v0, ex_67_1_26, all_68_0_27)) % 11.71/3.32 | % 11.71/3.32 | Instantiating (20) with all_71_0_29 yields: % 11.71/3.32 | (22) r4(ex_67_1_26, all_71_0_29, all_68_0_27) & r2(ex_67_0_25, all_71_0_29) % 11.71/3.32 | % 11.71/3.32 | Applying alpha-rule on (22) yields: % 11.71/3.32 | (23) r4(ex_67_1_26, all_71_0_29, all_68_0_27) % 11.71/3.32 | (24) r2(ex_67_0_25, all_71_0_29) % 11.71/3.32 | % 11.71/3.32 | Instantiating formula (5) with all_55_0_22, all_71_0_29 and discharging atoms r1(all_55_0_22), yields: % 11.71/3.32 | (25) ~ r2(all_55_0_22, all_71_0_29) % 11.71/3.32 | % 11.71/3.32 | From (17) and (24) follows: % 11.71/3.32 | (26) r2(all_55_0_22, all_71_0_29) % 11.71/3.32 | % 11.71/3.32 | Using (26) and (25) yields: % 11.71/3.32 | (27) $false % 11.71/3.32 | % 11.71/3.32 |-The branch is then unsatisfiable % 11.71/3.32 % SZS output end Proof for theBenchmark % 11.71/3.32 % 11.71/3.32 2722ms %------------------------------------------------------------------------------