%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN372+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n009.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:53 EDT 2022 % Result : Theorem 1.83s 1.09s % Output : Proof 2.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN372+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n009.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 : Mon Jul 11 19:40:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.53/0.58 ____ _ % 0.53/0.58 ___ / __ \_____(_)___ ________ __________ % 0.53/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.53/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.53/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.53/0.58 % 0.53/0.58 A Theorem Prover for First-Order Logic % 0.53/0.58 (ePrincess v.1.0) % 0.53/0.58 % 0.53/0.58 (c) Philipp Rümmer, 2009-2015 % 0.53/0.58 (c) Peter Backeman, 2014-2015 % 0.53/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.53/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.53/0.58 Bug reports to peter@backeman.se % 0.53/0.58 % 0.53/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.53/0.58 % 0.53/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.53/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.21/0.87 Prover 0: Preprocessing ... % 1.21/0.90 Prover 0: Warning: ignoring some quantifiers % 1.21/0.92 Prover 0: Constructing countermodel ... % 1.43/1.00 Prover 0: gave up % 1.43/1.00 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.43/1.02 Prover 1: Preprocessing ... % 1.68/1.06 Prover 1: Constructing countermodel ... % 1.83/1.09 Prover 1: proved (86ms) % 1.83/1.09 % 1.83/1.09 No countermodel exists, formula is valid % 1.83/1.09 % SZS status Theorem for theBenchmark % 1.83/1.09 % 1.83/1.09 Generating proof ... found it (size 10) % 2.11/1.20 % 2.11/1.20 % SZS output start Proof for theBenchmark % 2.11/1.21 Assumed formulas after preprocessing and simplification: % 2.11/1.21 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : (big_q(v0) = v1 & big_p(v2) = v3 & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (big_q(v6) = v5) | ~ (big_q(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (big_p(v6) = v5) | ~ (big_p(v6) = v4)) & ! [v4] : ! [v5] : (v5 = 0 | ~ (big_p(v4) = v5)) & ! [v4] : ~ (big_q(v4) = 0) & ( ~ (v3 = 0) | v1 = 0)) % 2.23/1.24 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 2.23/1.24 | (1) big_q(all_0_3_3) = all_0_2_2 & big_p(all_0_1_1) = all_0_0_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] : (v1 = 0 | ~ (big_p(v0) = v1)) & ! [v0] : ~ (big_q(v0) = 0) & ( ~ (all_0_0_0 = 0) | all_0_2_2 = 0) % 2.23/1.25 | % 2.23/1.25 | Applying alpha-rule on (1) yields: % 2.23/1.25 | (2) ~ (all_0_0_0 = 0) | all_0_2_2 = 0 % 2.23/1.25 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (big_q(v2) = v1) | ~ (big_q(v2) = v0)) % 2.23/1.25 | (4) big_q(all_0_3_3) = all_0_2_2 % 2.23/1.25 | (5) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (big_p(v2) = v1) | ~ (big_p(v2) = v0)) % 2.23/1.25 | (6) ! [v0] : ! [v1] : (v1 = 0 | ~ (big_p(v0) = v1)) % 2.23/1.25 | (7) ! [v0] : ~ (big_q(v0) = 0) % 2.23/1.25 | (8) big_p(all_0_1_1) = all_0_0_0 % 2.23/1.25 | % 2.23/1.25 | Instantiating formula (7) with all_0_3_3 yields: % 2.23/1.25 | (9) ~ (big_q(all_0_3_3) = 0) % 2.23/1.25 | % 2.23/1.25 | Instantiating formula (6) with all_0_0_0, all_0_1_1 and discharging atoms big_p(all_0_1_1) = all_0_0_0, yields: % 2.23/1.25 | (10) all_0_0_0 = 0 % 2.23/1.25 | % 2.23/1.25 +-Applying beta-rule and splitting (2), into two cases. % 2.23/1.25 |-Branch one: % 2.23/1.25 | (11) ~ (all_0_0_0 = 0) % 2.23/1.25 | % 2.23/1.25 | Equations (10) can reduce 11 to: % 2.23/1.25 | (12) $false % 2.23/1.25 | % 2.28/1.25 |-The branch is then unsatisfiable % 2.28/1.25 |-Branch two: % 2.28/1.25 | (10) all_0_0_0 = 0 % 2.28/1.25 | (14) all_0_2_2 = 0 % 2.28/1.25 | % 2.28/1.25 | From (14) and (4) follows: % 2.28/1.25 | (15) big_q(all_0_3_3) = 0 % 2.28/1.25 | % 2.28/1.25 | Using (15) and (9) yields: % 2.28/1.25 | (16) $false % 2.28/1.25 | % 2.28/1.25 |-The branch is then unsatisfiable % 2.28/1.25 % SZS output end Proof for theBenchmark % 2.28/1.25 % 2.28/1.25 666ms %------------------------------------------------------------------------------