%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN057+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 04:59:29 EDT 2022 % Result : Theorem 1.50s 0.99s % Output : Proof 2.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN057+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n009.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue Jul 12 01:34:07 EDT 2022 % 0.13/0.33 % CPUTime : % 0.18/0.58 ____ _ % 0.18/0.58 ___ / __ \_____(_)___ ________ __________ % 0.18/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic % 0.18/0.58 (ePrincess v.1.0) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2015 % 0.18/0.58 (c) Peter Backeman, 2014-2015 % 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.58 Bug reports to peter@backeman.se % 0.18/0.58 % 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.64/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.24/0.85 Prover 0: Preprocessing ... % 1.46/0.92 Prover 0: Constructing countermodel ... % 1.50/0.99 Prover 0: proved (364ms) % 1.50/0.99 % 1.50/0.99 No countermodel exists, formula is valid % 1.50/0.99 % SZS status Theorem for theBenchmark % 1.50/0.99 % 1.50/0.99 Generating proof ... found it (size 10) % 2.10/1.12 % 2.10/1.12 % SZS output start Proof for theBenchmark % 2.10/1.12 Assumed formulas after preprocessing and simplification: % 2.10/1.12 | (0) ? [v0] : ? [v1] : (big_i(v0) & big_j(v0) & big_f(v1) & ~ big_g(v1) & ! [v2] : ( ~ big_i(v2) | ~ big_j(v2) | big_f(v2)) & ! [v2] : ( ~ big_f(v2) | big_h(v2)) & ( ! [v2] : ( ~ big_i(v2) | ~ big_h(v2)) | ! [v2] : ( ~ big_h(v2) | big_g(v2)))) % 2.10/1.13 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 2.10/1.13 | (1) big_i(all_0_1_1) & big_j(all_0_1_1) & big_f(all_0_0_0) & ~ big_g(all_0_0_0) & ! [v0] : ( ~ big_i(v0) | ~ big_j(v0) | big_f(v0)) & ! [v0] : ( ~ big_f(v0) | big_h(v0)) & ( ! [v0] : ( ~ big_i(v0) | ~ big_h(v0)) | ! [v0] : ( ~ big_h(v0) | big_g(v0))) % 2.10/1.13 | % 2.10/1.13 | Applying alpha-rule on (1) yields: % 2.10/1.13 | (2) big_j(all_0_1_1) % 2.10/1.13 | (3) ! [v0] : ( ~ big_i(v0) | ~ big_h(v0)) | ! [v0] : ( ~ big_h(v0) | big_g(v0)) % 2.10/1.13 | (4) big_i(all_0_1_1) % 2.10/1.13 | (5) ! [v0] : ( ~ big_i(v0) | ~ big_j(v0) | big_f(v0)) % 2.10/1.13 | (6) big_f(all_0_0_0) % 2.10/1.13 | (7) ~ big_g(all_0_0_0) % 2.10/1.13 | (8) ! [v0] : ( ~ big_f(v0) | big_h(v0)) % 2.10/1.14 | % 2.10/1.14 | Instantiating formula (5) with all_0_1_1 and discharging atoms big_i(all_0_1_1), big_j(all_0_1_1), yields: % 2.10/1.14 | (9) big_f(all_0_1_1) % 2.10/1.14 | % 2.10/1.14 | Instantiating formula (8) with all_0_0_0 and discharging atoms big_f(all_0_0_0), yields: % 2.10/1.14 | (10) big_h(all_0_0_0) % 2.10/1.14 | % 2.10/1.14 | Instantiating formula (8) with all_0_1_1 and discharging atoms big_f(all_0_1_1), yields: % 2.10/1.14 | (11) big_h(all_0_1_1) % 2.10/1.14 | % 2.10/1.14 +-Applying beta-rule and splitting (3), into two cases. % 2.10/1.14 |-Branch one: % 2.10/1.14 | (12) ! [v0] : ( ~ big_i(v0) | ~ big_h(v0)) % 2.10/1.14 | % 2.10/1.14 | Instantiating formula (12) with all_0_1_1 and discharging atoms big_i(all_0_1_1), big_h(all_0_1_1), yields: % 2.10/1.14 | (13) $false % 2.10/1.14 | % 2.10/1.14 |-The branch is then unsatisfiable % 2.10/1.14 |-Branch two: % 2.10/1.14 | (14) ! [v0] : ( ~ big_h(v0) | big_g(v0)) % 2.10/1.14 | % 2.10/1.14 | Instantiating formula (14) with all_0_0_0 and discharging atoms big_h(all_0_0_0), ~ big_g(all_0_0_0), yields: % 2.10/1.14 | (13) $false % 2.10/1.14 | % 2.10/1.14 |-The branch is then unsatisfiable % 2.10/1.14 % SZS output end Proof for theBenchmark % 2.10/1.14 % 2.10/1.14 554ms %------------------------------------------------------------------------------