%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN054+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n008.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:26 EDT 2022 % Result : Theorem 1.50s 1.00s % Output : Proof 1.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN054+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n008.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 : Tue Jul 12 09:11:08 EDT 2022 % 0.13/0.34 % CPUTime : % 0.52/0.59 ____ _ % 0.52/0.59 ___ / __ \_____(_)___ ________ __________ % 0.52/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.52/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.52/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.52/0.59 % 0.52/0.59 A Theorem Prover for First-Order Logic % 0.52/0.59 (ePrincess v.1.0) % 0.52/0.59 % 0.52/0.59 (c) Philipp Rümmer, 2009-2015 % 0.52/0.59 (c) Peter Backeman, 2014-2015 % 0.52/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.52/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.52/0.59 Bug reports to peter@backeman.se % 0.52/0.60 % 0.52/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.52/0.60 % 0.52/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.73/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.28/0.88 Prover 0: Preprocessing ... % 1.44/0.94 Prover 0: Constructing countermodel ... % 1.50/1.00 Prover 0: proved (355ms) % 1.50/1.00 % 1.50/1.00 No countermodel exists, formula is valid % 1.50/1.00 % SZS status Theorem for theBenchmark % 1.50/1.00 % 1.50/1.00 Generating proof ... found it (size 9) % 1.93/1.12 % 1.93/1.12 % SZS output start Proof for theBenchmark % 1.93/1.12 Assumed formulas after preprocessing and simplification: % 1.93/1.12 | (0) ? [v0] : ( ! [v1] : ( ~ big_r(v1) | ~ big_p(v1)) & ! [v1] : ( ~ big_r(v1) | big_s(v1)) & ! [v1] : ( ~ big_p(v1) | big_r(v1) | big_q(v1)) & ! [v1] : ( ~ big_q(v1) | ~ big_s(v1)) & ! [v1] : ( ~ big_q(v1) | big_s(v1)) & (big_p(v0) | big_q(v0))) % 1.93/1.13 | Instantiating (0) with all_0_0_0 yields: % 1.93/1.13 | (1) ! [v0] : ( ~ big_r(v0) | ~ big_p(v0)) & ! [v0] : ( ~ big_r(v0) | big_s(v0)) & ! [v0] : ( ~ big_p(v0) | big_r(v0) | big_q(v0)) & ! [v0] : ( ~ big_q(v0) | ~ big_s(v0)) & ! [v0] : ( ~ big_q(v0) | big_s(v0)) & (big_p(all_0_0_0) | big_q(all_0_0_0)) % 1.93/1.13 | % 1.93/1.13 | Applying alpha-rule on (1) yields: % 1.93/1.13 | (2) ! [v0] : ( ~ big_q(v0) | ~ big_s(v0)) % 1.93/1.13 | (3) ! [v0] : ( ~ big_r(v0) | big_s(v0)) % 1.93/1.13 | (4) big_p(all_0_0_0) | big_q(all_0_0_0) % 1.93/1.13 | (5) ! [v0] : ( ~ big_q(v0) | big_s(v0)) % 1.93/1.13 | (6) ! [v0] : ( ~ big_r(v0) | ~ big_p(v0)) % 1.93/1.13 | (7) ! [v0] : ( ~ big_p(v0) | big_r(v0) | big_q(v0)) % 1.93/1.13 | % 1.93/1.13 +-Applying beta-rule and splitting (4), into two cases. % 1.93/1.13 |-Branch one: % 1.93/1.13 | (8) big_q(all_0_0_0) % 1.93/1.13 | % 1.93/1.13 | Instantiating formula (5) with all_0_0_0 and discharging atoms big_q(all_0_0_0), yields: % 1.93/1.13 | (9) big_s(all_0_0_0) % 1.93/1.13 | % 1.93/1.13 | Instantiating formula (2) with all_0_0_0 and discharging atoms big_q(all_0_0_0), big_s(all_0_0_0), yields: % 1.93/1.13 | (10) $false % 1.93/1.13 | % 1.93/1.14 |-The branch is then unsatisfiable % 1.93/1.14 |-Branch two: % 1.93/1.14 | (11) ~ big_q(all_0_0_0) % 1.93/1.14 | (12) big_p(all_0_0_0) % 1.93/1.14 | % 1.93/1.14 | Instantiating formula (7) with all_0_0_0 and discharging atoms big_p(all_0_0_0), ~ big_q(all_0_0_0), yields: % 1.93/1.14 | (13) big_r(all_0_0_0) % 1.93/1.14 | % 1.93/1.14 | Instantiating formula (6) with all_0_0_0 and discharging atoms big_r(all_0_0_0), big_p(all_0_0_0), yields: % 1.93/1.14 | (10) $false % 1.93/1.14 | % 1.93/1.14 |-The branch is then unsatisfiable % 1.93/1.14 % SZS output end Proof for theBenchmark % 1.93/1.14 % 1.93/1.14 533ms %------------------------------------------------------------------------------