TSTP Solution File: SYN961+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SYN961+1 : TPTP v8.1.0. Released v3.1.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 05:06:07 EDT 2022
% Result : Theorem 1.70s 1.05s
% Output : Proof 2.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN961+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n009.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 06:49:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.58/0.58 ____ _
% 0.58/0.58 ___ / __ \_____(_)___ ________ __________
% 0.58/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.58/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.58/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.58/0.58
% 0.58/0.58 A Theorem Prover for First-Order Logic
% 0.58/0.58 (ePrincess v.1.0)
% 0.58/0.58
% 0.58/0.58 (c) Philipp Rümmer, 2009-2015
% 0.58/0.58 (c) Peter Backeman, 2014-2015
% 0.58/0.58 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.58/0.58 Free software under GNU Lesser General Public License (LGPL).
% 0.58/0.58 Bug reports to peter@backeman.se
% 0.58/0.58
% 0.58/0.58 For more information, visit http://user.uu.se/~petba168/breu/
% 0.58/0.58
% 0.58/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.58/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.19/0.86 Prover 0: Preprocessing ...
% 1.27/0.89 Prover 0: Warning: ignoring some quantifiers
% 1.27/0.90 Prover 0: Constructing countermodel ...
% 1.47/0.98 Prover 0: gave up
% 1.47/0.98 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.47/0.99 Prover 1: Preprocessing ...
% 1.47/1.02 Prover 1: Constructing countermodel ...
% 1.70/1.05 Prover 1: proved (75ms)
% 1.70/1.05
% 1.70/1.05 No countermodel exists, formula is valid
% 1.70/1.05 % SZS status Theorem for theBenchmark
% 1.70/1.05
% 1.70/1.05 Generating proof ... found it (size 9)
% 2.05/1.16
% 2.05/1.16 % SZS output start Proof for theBenchmark
% 2.05/1.16 Assumed formulas after preprocessing and simplification:
% 2.05/1.16 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : (p(v1) = v3 & p(v0) = v2 & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (p(v6) = v5) | ~ (p(v6) = v4)) & ! [v4] : ! [v5] : (v5 = 0 | ~ (p(v4) = v5)) & ( ~ (v3 = 0) | ~ (v2 = 0)))
% 2.12/1.21 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields:
% 2.12/1.21 | (1) p(all_0_2_2) = all_0_0_0 & p(all_0_3_3) = all_0_1_1 & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)) & ( ~ (all_0_0_0 = 0) | ~ (all_0_1_1 = 0))
% 2.12/1.21 |
% 2.12/1.21 | Applying alpha-rule on (1) yields:
% 2.12/1.21 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0))
% 2.12/1.21 | (3) ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1))
% 2.12/1.21 | (4) p(all_0_3_3) = all_0_1_1
% 2.12/1.21 | (5) p(all_0_2_2) = all_0_0_0
% 2.12/1.21 | (6) ~ (all_0_0_0 = 0) | ~ (all_0_1_1 = 0)
% 2.12/1.21 |
% 2.12/1.21 | Instantiating formula (3) with all_0_0_0, all_0_2_2 and discharging atoms p(all_0_2_2) = all_0_0_0, yields:
% 2.12/1.21 | (7) all_0_0_0 = 0
% 2.12/1.21 |
% 2.12/1.21 | Instantiating formula (3) with all_0_1_1, all_0_3_3 and discharging atoms p(all_0_3_3) = all_0_1_1, yields:
% 2.12/1.21 | (8) all_0_1_1 = 0
% 2.12/1.21 |
% 2.12/1.21 +-Applying beta-rule and splitting (6), into two cases.
% 2.12/1.21 |-Branch one:
% 2.12/1.21 | (9) ~ (all_0_0_0 = 0)
% 2.12/1.22 |
% 2.12/1.22 | Equations (7) can reduce 9 to:
% 2.12/1.22 | (10) $false
% 2.12/1.22 |
% 2.12/1.22 |-The branch is then unsatisfiable
% 2.12/1.22 |-Branch two:
% 2.12/1.22 | (7) all_0_0_0 = 0
% 2.12/1.22 | (12) ~ (all_0_1_1 = 0)
% 2.12/1.22 |
% 2.12/1.22 | Equations (8) can reduce 12 to:
% 2.12/1.22 | (10) $false
% 2.12/1.22 |
% 2.12/1.22 |-The branch is then unsatisfiable
% 2.12/1.22 % SZS output end Proof for theBenchmark
% 2.12/1.22
% 2.12/1.22 629ms
%------------------------------------------------------------------------------