%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN955+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n003.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:06:05 EDT 2022 % Result : Theorem 1.53s 1.00s % Output : Proof 1.80s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN955+1 : TPTP v8.1.0. Released v3.1.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n003.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 : Tue Jul 12 03:11:30 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.58 ____ _ % 0.19/0.58 ___ / __ \_____(_)___ ________ __________ % 0.19/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic % 0.19/0.58 (ePrincess v.1.0) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2015 % 0.19/0.58 (c) Peter Backeman, 2014-2015 % 0.19/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.58 Bug reports to peter@backeman.se % 0.19/0.58 % 0.19/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.23/0.88 Prover 0: Preprocessing ... % 1.40/0.94 Prover 0: Constructing countermodel ... % 1.53/1.00 Prover 0: proved (371ms) % 1.53/1.00 % 1.53/1.00 No countermodel exists, formula is valid % 1.53/1.00 % SZS status Theorem for theBenchmark % 1.53/1.00 % 1.53/1.00 Generating proof ... found it (size 5) % 1.80/1.10 % 1.80/1.10 % SZS output start Proof for theBenchmark % 1.80/1.10 Assumed formulas after preprocessing and simplification: % 1.80/1.10 | (0) ? [v0] : (a(v0) & ! [v1] : ~ b(v1) & ! [v1] : ( ~ a(v1) | b(v1))) % 1.80/1.10 | Instantiating (0) with all_0_0_0 yields: % 1.80/1.10 | (1) a(all_0_0_0) & ! [v0] : ~ b(v0) & ! [v0] : ( ~ a(v0) | b(v0)) % 1.80/1.11 | % 1.80/1.11 | Applying alpha-rule on (1) yields: % 1.80/1.11 | (2) a(all_0_0_0) % 1.80/1.11 | (3) ! [v0] : ~ b(v0) % 1.80/1.11 | (4) ! [v0] : ( ~ a(v0) | b(v0)) % 1.80/1.11 | % 1.80/1.11 | Instantiating formula (4) with all_0_0_0 and discharging atoms a(all_0_0_0), yields: % 1.80/1.11 | (5) b(all_0_0_0) % 1.80/1.11 | % 1.80/1.11 | Instantiating formula (3) with all_0_0_0 and discharging atoms b(all_0_0_0), yields: % 1.80/1.11 | (6) $false % 1.80/1.11 | % 1.80/1.11 |-The branch is then unsatisfiable % 1.80/1.11 % SZS output end Proof for theBenchmark % 1.80/1.11 % 1.80/1.11 525ms %------------------------------------------------------------------------------