%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n016.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:28 EDT 2022 % Result : Theorem 1.76s 1.10s % Output : Proof 2.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n016.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 22:25:28 EDT 2022 % 0.13/0.34 % CPUTime : % 0.63/0.62 ____ _ % 0.63/0.62 ___ / __ \_____(_)___ ________ __________ % 0.63/0.62 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.63/0.62 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.63/0.62 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.63/0.62 % 0.63/0.62 A Theorem Prover for First-Order Logic % 0.63/0.62 (ePrincess v.1.0) % 0.63/0.62 % 0.63/0.62 (c) Philipp Rümmer, 2009-2015 % 0.63/0.62 (c) Peter Backeman, 2014-2015 % 0.63/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.63/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.63/0.62 Bug reports to peter@backeman.se % 0.63/0.62 % 0.63/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.63/0.62 % 0.63/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.36/0.92 Prover 0: Preprocessing ... % 1.40/1.00 Prover 0: Constructing countermodel ... % 1.76/1.10 Prover 0: proved (399ms) % 1.76/1.10 % 1.76/1.10 No countermodel exists, formula is valid % 1.76/1.10 % SZS status Theorem for theBenchmark % 1.76/1.10 % 1.76/1.10 Generating proof ... found it (size 21) % 2.33/1.25 % 2.33/1.25 % SZS output start Proof for theBenchmark % 2.33/1.25 Assumed formulas after preprocessing and simplification: % 2.33/1.25 | (0) ? [v0] : ? [v1] : ? [v2] : ( ! [v3] : ! [v4] : ( ~ big_s(v4) | ~ big_q(v4) | ~ big_p(v3) | big_r(v3)) & ! [v3] : ! [v4] : ( ~ big_r(v3) | ~ big_q(v4) | ~ big_p(v3) | big_s(v4)) & ((big_q(v1) & big_p(v2)) | ( ! [v3] : ~ big_q(v3) & ! [v3] : ~ big_p(v3))) & ((big_q(v0) & ~ big_s(v0) & ! [v3] : ( ~ big_p(v3) | big_r(v3))) | (big_p(v0) & ~ big_r(v0) & ! [v3] : ( ~ big_q(v3) | big_s(v3))))) % 2.33/1.26 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.33/1.26 | (1) ! [v0] : ! [v1] : ( ~ big_s(v1) | ~ big_q(v1) | ~ big_p(v0) | big_r(v0)) & ! [v0] : ! [v1] : ( ~ big_r(v0) | ~ big_q(v1) | ~ big_p(v0) | big_s(v1)) & ((big_q(all_0_1_1) & big_p(all_0_0_0)) | ( ! [v0] : ~ big_q(v0) & ! [v0] : ~ big_p(v0))) & ((big_q(all_0_2_2) & ~ big_s(all_0_2_2) & ! [v0] : ( ~ big_p(v0) | big_r(v0))) | (big_p(all_0_2_2) & ~ big_r(all_0_2_2) & ! [v0] : ( ~ big_q(v0) | big_s(v0)))) % 2.33/1.26 | % 2.33/1.26 | Applying alpha-rule on (1) yields: % 2.33/1.26 | (2) ! [v0] : ! [v1] : ( ~ big_s(v1) | ~ big_q(v1) | ~ big_p(v0) | big_r(v0)) % 2.33/1.26 | (3) ! [v0] : ! [v1] : ( ~ big_r(v0) | ~ big_q(v1) | ~ big_p(v0) | big_s(v1)) % 2.33/1.26 | (4) (big_q(all_0_1_1) & big_p(all_0_0_0)) | ( ! [v0] : ~ big_q(v0) & ! [v0] : ~ big_p(v0)) % 2.33/1.26 | (5) (big_q(all_0_2_2) & ~ big_s(all_0_2_2) & ! [v0] : ( ~ big_p(v0) | big_r(v0))) | (big_p(all_0_2_2) & ~ big_r(all_0_2_2) & ! [v0] : ( ~ big_q(v0) | big_s(v0))) % 2.33/1.26 | % 2.33/1.26 +-Applying beta-rule and splitting (5), into two cases. % 2.33/1.26 |-Branch one: % 2.33/1.26 | (6) big_q(all_0_2_2) & ~ big_s(all_0_2_2) & ! [v0] : ( ~ big_p(v0) | big_r(v0)) % 2.33/1.26 | % 2.33/1.26 | Applying alpha-rule on (6) yields: % 2.33/1.26 | (7) big_q(all_0_2_2) % 2.33/1.26 | (8) ~ big_s(all_0_2_2) % 2.33/1.26 | (9) ! [v0] : ( ~ big_p(v0) | big_r(v0)) % 2.33/1.26 | % 2.33/1.26 +-Applying beta-rule and splitting (4), into two cases. % 2.33/1.26 |-Branch one: % 2.33/1.26 | (10) big_q(all_0_1_1) & big_p(all_0_0_0) % 2.33/1.26 | % 2.33/1.26 | Applying alpha-rule on (10) yields: % 2.33/1.26 | (11) big_q(all_0_1_1) % 2.33/1.26 | (12) big_p(all_0_0_0) % 2.33/1.26 | % 2.33/1.27 | Instantiating formula (9) with all_0_0_0 and discharging atoms big_p(all_0_0_0), yields: % 2.33/1.27 | (13) big_r(all_0_0_0) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (3) with all_0_2_2, all_0_0_0 and discharging atoms big_r(all_0_0_0), big_q(all_0_2_2), big_p(all_0_0_0), ~ big_s(all_0_2_2), yields: % 2.33/1.27 | (14) $false % 2.33/1.27 | % 2.33/1.27 |-The branch is then unsatisfiable % 2.33/1.27 |-Branch two: % 2.33/1.27 | (15) ! [v0] : ~ big_q(v0) & ! [v0] : ~ big_p(v0) % 2.33/1.27 | % 2.33/1.27 | Applying alpha-rule on (15) yields: % 2.33/1.27 | (16) ! [v0] : ~ big_q(v0) % 2.33/1.27 | (17) ! [v0] : ~ big_p(v0) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (16) with all_0_2_2 and discharging atoms big_q(all_0_2_2), yields: % 2.33/1.27 | (14) $false % 2.33/1.27 | % 2.33/1.27 |-The branch is then unsatisfiable % 2.33/1.27 |-Branch two: % 2.33/1.27 | (19) big_p(all_0_2_2) & ~ big_r(all_0_2_2) & ! [v0] : ( ~ big_q(v0) | big_s(v0)) % 2.33/1.27 | % 2.33/1.27 | Applying alpha-rule on (19) yields: % 2.33/1.27 | (20) big_p(all_0_2_2) % 2.33/1.27 | (21) ~ big_r(all_0_2_2) % 2.33/1.27 | (22) ! [v0] : ( ~ big_q(v0) | big_s(v0)) % 2.33/1.27 | % 2.33/1.27 +-Applying beta-rule and splitting (4), into two cases. % 2.33/1.27 |-Branch one: % 2.33/1.27 | (10) big_q(all_0_1_1) & big_p(all_0_0_0) % 2.33/1.27 | % 2.33/1.27 | Applying alpha-rule on (10) yields: % 2.33/1.27 | (11) big_q(all_0_1_1) % 2.33/1.27 | (12) big_p(all_0_0_0) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (22) with all_0_1_1 and discharging atoms big_q(all_0_1_1), yields: % 2.33/1.27 | (26) big_s(all_0_1_1) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (2) with all_0_1_1, all_0_2_2 and discharging atoms big_s(all_0_1_1), big_q(all_0_1_1), big_p(all_0_2_2), ~ big_r(all_0_2_2), yields: % 2.33/1.27 | (14) $false % 2.33/1.27 | % 2.33/1.27 |-The branch is then unsatisfiable % 2.33/1.27 |-Branch two: % 2.33/1.27 | (15) ! [v0] : ~ big_q(v0) & ! [v0] : ~ big_p(v0) % 2.33/1.27 | % 2.33/1.27 | Applying alpha-rule on (15) yields: % 2.33/1.27 | (16) ! [v0] : ~ big_q(v0) % 2.33/1.27 | (17) ! [v0] : ~ big_p(v0) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (17) with all_0_2_2 and discharging atoms big_p(all_0_2_2), yields: % 2.33/1.27 | (14) $false % 2.33/1.27 | % 2.33/1.27 |-The branch is then unsatisfiable % 2.33/1.27 % SZS output end Proof for theBenchmark % 2.33/1.27 % 2.33/1.27 633ms %------------------------------------------------------------------------------