%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN385+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n006.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:59 EDT 2022 % Result : Theorem 2.26s 1.15s % Output : Proof 2.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN385+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n006.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jul 12 00:10:50 EDT 2022 % 0.12/0.33 % CPUTime : % 0.52/0.58 ____ _ % 0.52/0.58 ___ / __ \_____(_)___ ________ __________ % 0.52/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.52/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.52/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.52/0.58 % 0.52/0.58 A Theorem Prover for First-Order Logic % 0.52/0.58 (ePrincess v.1.0) % 0.52/0.58 % 0.52/0.58 (c) Philipp Rümmer, 2009-2015 % 0.52/0.58 (c) Peter Backeman, 2014-2015 % 0.52/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.52/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.52/0.58 Bug reports to peter@backeman.se % 0.52/0.58 % 0.52/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.52/0.58 % 0.52/0.58 Loading /export/starexec/sandbox2/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.22/0.83 Prover 0: Preprocessing ... % 1.30/0.86 Prover 0: Warning: ignoring some quantifiers % 1.30/0.88 Prover 0: Constructing countermodel ... % 1.47/0.95 Prover 0: gave up % 1.47/0.95 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.47/0.97 Prover 1: Preprocessing ... % 1.66/1.00 Prover 1: Constructing countermodel ... % 1.66/1.01 Prover 1: gave up % 1.66/1.01 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.66/1.02 Prover 2: Preprocessing ... % 1.91/1.04 Prover 2: Warning: ignoring some quantifiers % 1.91/1.04 Prover 2: Constructing countermodel ... % 1.91/1.07 Prover 2: gave up % 1.91/1.07 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.03/1.08 Prover 3: Preprocessing ... % 2.03/1.08 Prover 3: Warning: ignoring some quantifiers % 2.03/1.08 Prover 3: Constructing countermodel ... % 2.03/1.09 Prover 3: gave up % 2.03/1.09 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 2.03/1.10 Prover 4: Preprocessing ... % 2.03/1.12 Prover 4: Warning: ignoring some quantifiers % 2.03/1.12 Prover 4: Constructing countermodel ... % 2.26/1.15 Prover 4: proved (55ms) % 2.26/1.15 % 2.26/1.15 No countermodel exists, formula is valid % 2.26/1.15 % SZS status Theorem for theBenchmark % 2.26/1.15 % 2.26/1.15 Generating proof ... Warning: ignoring some quantifiers % 2.58/1.27 found it (size 8) % 2.58/1.27 % 2.58/1.27 % SZS output start Proof for theBenchmark % 2.58/1.27 Assumed formulas after preprocessing and simplification: % 2.58/1.27 | (0) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (big_q(v2) = v1) | ~ (big_q(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (big_p(v2) = v1) | ~ (big_p(v2) = v0)) & ! [v0] : ! [v1] : ( ~ (big_q(v0) = v1) | ? [v2] : ? [v3] : ( ~ (v3 = 0) & ~ (v1 = 0) & big_p(v2) = v3 & big_p(v0) = 0)) & ! [v0] : ! [v1] : ( ~ (big_p(v0) = v1) | ? [v2] : ? [v3] : ? [v4] : (v1 = 0 & ~ (v4 = 0) & ~ (v2 = 0) & big_q(v0) = v2 & big_p(v3) = v4)) & ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = 0) & ~ (v1 = 0) & big_q(v0) = v1 & big_p(v2) = v3 & big_p(v0) = 0) % 2.58/1.31 | Applying alpha-rule on (0) yields: % 2.58/1.31 | (1) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = 0) & ~ (v1 = 0) & big_q(v0) = v1 & big_p(v2) = v3 & big_p(v0) = 0) % 2.58/1.31 | (2) ! [v0] : ! [v1] : ( ~ (big_q(v0) = v1) | ? [v2] : ? [v3] : ( ~ (v3 = 0) & ~ (v1 = 0) & big_p(v2) = v3 & big_p(v0) = 0)) % 2.58/1.31 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (big_p(v2) = v1) | ~ (big_p(v2) = v0)) % 2.58/1.31 | (4) ! [v0] : ! [v1] : ( ~ (big_p(v0) = v1) | ? [v2] : ? [v3] : ? [v4] : (v1 = 0 & ~ (v4 = 0) & ~ (v2 = 0) & big_q(v0) = v2 & big_p(v3) = v4)) % 2.58/1.31 | (5) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (big_q(v2) = v1) | ~ (big_q(v2) = v0)) % 2.58/1.31 | % 2.58/1.31 | Instantiating (1) with all_1_0_0, all_1_1_1, all_1_2_2, all_1_3_3 yields: % 2.58/1.31 | (6) ~ (all_1_0_0 = 0) & ~ (all_1_2_2 = 0) & big_q(all_1_3_3) = all_1_2_2 & big_p(all_1_1_1) = all_1_0_0 & big_p(all_1_3_3) = 0 % 2.58/1.31 | % 2.58/1.31 | Applying alpha-rule on (6) yields: % 2.58/1.31 | (7) big_p(all_1_3_3) = 0 % 2.58/1.31 | (8) big_p(all_1_1_1) = all_1_0_0 % 2.58/1.31 | (9) ~ (all_1_0_0 = 0) % 2.58/1.31 | (10) big_q(all_1_3_3) = all_1_2_2 % 2.58/1.31 | (11) ~ (all_1_2_2 = 0) % 2.58/1.31 | % 2.58/1.31 | Instantiating formula (4) with all_1_0_0, all_1_1_1 and discharging atoms big_p(all_1_1_1) = all_1_0_0, yields: % 2.58/1.31 | (12) ? [v0] : ? [v1] : ? [v2] : (all_1_0_0 = 0 & ~ (v2 = 0) & ~ (v0 = 0) & big_q(all_1_1_1) = v0 & big_p(v1) = v2) % 2.58/1.31 | % 2.58/1.31 | Instantiating (12) with all_10_0_7, all_10_1_8, all_10_2_9 yields: % 2.58/1.31 | (13) all_1_0_0 = 0 & ~ (all_10_0_7 = 0) & ~ (all_10_2_9 = 0) & big_q(all_1_1_1) = all_10_2_9 & big_p(all_10_1_8) = all_10_0_7 % 2.58/1.32 | % 2.58/1.32 | Applying alpha-rule on (13) yields: % 2.58/1.32 | (14) ~ (all_10_2_9 = 0) % 2.58/1.32 | (15) big_q(all_1_1_1) = all_10_2_9 % 2.58/1.32 | (16) all_1_0_0 = 0 % 2.58/1.32 | (17) big_p(all_10_1_8) = all_10_0_7 % 2.58/1.32 | (18) ~ (all_10_0_7 = 0) % 2.58/1.32 | % 2.58/1.32 | Equations (16) can reduce 9 to: % 2.58/1.32 | (19) $false % 2.58/1.32 | % 2.58/1.32 |-The branch is then unsatisfiable % 2.58/1.32 % SZS output end Proof for theBenchmark % 2.58/1.32 % 2.58/1.32 728ms %------------------------------------------------------------------------------