%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN071+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n028.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:41 EDT 2022 % Result : Theorem 1.38s 0.97s % Output : Proof 1.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN071+1 : TPTP v8.1.0. Released v2.0.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n028.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 : Mon Jul 11 16:08:13 EDT 2022 % 0.13/0.33 % CPUTime : % 0.20/0.58 ____ _ % 0.20/0.58 ___ / __ \_____(_)___ ________ __________ % 0.20/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.20/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.20/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.20/0.58 % 0.20/0.58 A Theorem Prover for First-Order Logic % 0.20/0.58 (ePrincess v.1.0) % 0.20/0.58 % 0.20/0.58 (c) Philipp Rümmer, 2009-2015 % 0.20/0.58 (c) Peter Backeman, 2014-2015 % 0.20/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.20/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.20/0.58 Bug reports to peter@backeman.se % 0.20/0.58 % 0.20/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.20/0.58 % 0.20/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.71/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.28/0.90 Prover 0: Preprocessing ... % 1.34/0.92 Prover 0: Constructing countermodel ... % 1.38/0.97 Prover 0: proved (308ms) % 1.38/0.97 % 1.38/0.97 No countermodel exists, formula is valid % 1.38/0.97 % SZS status Theorem for theBenchmark % 1.38/0.97 % 1.38/0.97 Generating proof ... found it (size 16) % 1.62/1.07 % 1.62/1.07 % SZS output start Proof for theBenchmark % 1.62/1.08 Assumed formulas after preprocessing and simplification: % 1.62/1.08 | (0) ~ (c = b) & ~ (d = a) & (c = d | a = b) & (c = a | d = b) % 1.75/1.08 | Applying alpha-rule on (0) yields: % 1.75/1.08 | (1) ~ (c = b) % 1.75/1.08 | (2) ~ (d = a) % 1.75/1.08 | (3) c = d | a = b % 1.75/1.08 | (4) c = a | d = b % 1.75/1.08 | % 1.75/1.09 +-Applying beta-rule and splitting (3), into two cases. % 1.75/1.09 |-Branch one: % 1.75/1.09 | (5) c = d % 1.75/1.09 | % 1.75/1.09 | Equations (5) can reduce 1 to: % 1.75/1.09 | (6) ~ (d = b) % 1.75/1.09 | % 1.75/1.09 +-Applying beta-rule and splitting (4), into two cases. % 1.75/1.09 |-Branch one: % 1.75/1.09 | (7) c = a % 1.75/1.09 | % 1.75/1.09 | Combining equations (7,5) yields a new equation: % 1.75/1.09 | (8) d = a % 1.75/1.09 | % 1.75/1.09 | Equations (8) can reduce 2 to: % 1.75/1.09 | (9) $false % 1.75/1.09 | % 1.75/1.09 |-The branch is then unsatisfiable % 1.75/1.09 |-Branch two: % 1.75/1.09 | (10) ~ (c = a) % 1.75/1.09 | (11) d = b % 1.75/1.09 | % 1.75/1.09 | Equations (11) can reduce 6 to: % 1.75/1.09 | (9) $false % 1.75/1.09 | % 1.75/1.09 |-The branch is then unsatisfiable % 1.75/1.09 |-Branch two: % 1.75/1.09 | (13) ~ (c = d) % 1.75/1.09 | (14) a = b % 1.75/1.09 | % 1.75/1.09 | Equations (14) can reduce 2 to: % 1.75/1.09 | (6) ~ (d = b) % 1.75/1.09 | % 1.75/1.09 +-Applying beta-rule and splitting (4), into two cases. % 1.75/1.09 |-Branch one: % 1.75/1.09 | (7) c = a % 1.75/1.09 | % 1.75/1.09 | Combining equations (14,7) yields a new equation: % 1.75/1.09 | (17) c = b % 1.75/1.09 | % 1.75/1.09 | Equations (17) can reduce 1 to: % 1.75/1.09 | (9) $false % 1.75/1.09 | % 1.75/1.09 |-The branch is then unsatisfiable % 1.75/1.09 |-Branch two: % 1.75/1.09 | (10) ~ (c = a) % 1.75/1.09 | (11) d = b % 1.75/1.09 | % 1.75/1.09 | Equations (11) can reduce 6 to: % 1.75/1.09 | (9) $false % 1.75/1.09 | % 1.75/1.09 |-The branch is then unsatisfiable % 1.75/1.09 % SZS output end Proof for theBenchmark % 1.75/1.09 % 1.75/1.09 494ms %------------------------------------------------------------------------------