TSTP Solution File: LCL664+1.001 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : LCL664+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n013.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 : Sun Jul 17 09:38:02 EDT 2022
% Result : Theorem 1.69s 1.04s
% Output : Proof 2.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL664+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.33 % Computer : n013.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 4 08:25:59 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.49/0.57 ____ _
% 0.49/0.57 ___ / __ \_____(_)___ ________ __________
% 0.49/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.49/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.49/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.49/0.57
% 0.49/0.57 A Theorem Prover for First-Order Logic
% 0.49/0.57 (ePrincess v.1.0)
% 0.49/0.57
% 0.49/0.57 (c) Philipp Rümmer, 2009-2015
% 0.49/0.57 (c) Peter Backeman, 2014-2015
% 0.49/0.57 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.49/0.57 Free software under GNU Lesser General Public License (LGPL).
% 0.49/0.57 Bug reports to peter@backeman.se
% 0.49/0.57
% 0.49/0.57 For more information, visit http://user.uu.se/~petba168/breu/
% 0.49/0.57
% 0.49/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.49/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.35/0.88 Prover 0: Preprocessing ...
% 1.57/0.94 Prover 0: Warning: ignoring some quantifiers
% 1.57/0.96 Prover 0: Constructing countermodel ...
% 1.69/1.04 Prover 0: proved (417ms)
% 1.69/1.04
% 1.69/1.04 No countermodel exists, formula is valid
% 1.69/1.04 % SZS status Theorem for theBenchmark
% 1.69/1.04
% 1.69/1.04 Generating proof ... Warning: ignoring some quantifiers
% 2.25/1.17 found it (size 4)
% 2.25/1.17
% 2.25/1.17 % SZS output start Proof for theBenchmark
% 2.25/1.17 Assumed formulas after preprocessing and simplification:
% 2.25/1.17 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : (r1(v0, v4) & r1(v0, v3) & r1(v0, v2) & r1(v0, v1) & ~ p11(v1) & ~ p13(v3) & ~ p15(v4) & ~ p12(v2) & ! [v5] : ( ~ r1(v0, v5) | p14(v5)) & ! [v5] : ( ~ r1(v0, v5) | p12(v5)) & ! [v5] : ( ~ r1(v0, v5) | p16(v5)) & ? [v5] : r1(v5, v5))
% 2.25/1.18 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 yields:
% 2.25/1.18 | (1) r1(all_0_4_4, all_0_0_0) & r1(all_0_4_4, all_0_1_1) & r1(all_0_4_4, all_0_2_2) & r1(all_0_4_4, all_0_3_3) & ~ p11(all_0_3_3) & ~ p13(all_0_1_1) & ~ p15(all_0_0_0) & ~ p12(all_0_2_2) & ! [v0] : ( ~ r1(all_0_4_4, v0) | p14(v0)) & ! [v0] : ( ~ r1(all_0_4_4, v0) | p12(v0)) & ! [v0] : ( ~ r1(all_0_4_4, v0) | p16(v0)) & ? [v0] : r1(v0, v0)
% 2.25/1.19 |
% 2.25/1.19 | Applying alpha-rule on (1) yields:
% 2.25/1.19 | (2) ~ p15(all_0_0_0)
% 2.25/1.19 | (3) ~ p12(all_0_2_2)
% 2.25/1.19 | (4) r1(all_0_4_4, all_0_0_0)
% 2.25/1.19 | (5) ! [v0] : ( ~ r1(all_0_4_4, v0) | p14(v0))
% 2.25/1.19 | (6) ? [v0] : r1(v0, v0)
% 2.25/1.19 | (7) ~ p11(all_0_3_3)
% 2.25/1.19 | (8) r1(all_0_4_4, all_0_2_2)
% 2.25/1.19 | (9) ! [v0] : ( ~ r1(all_0_4_4, v0) | p12(v0))
% 2.25/1.19 | (10) r1(all_0_4_4, all_0_3_3)
% 2.25/1.19 | (11) ! [v0] : ( ~ r1(all_0_4_4, v0) | p16(v0))
% 2.25/1.19 | (12) ~ p13(all_0_1_1)
% 2.25/1.19 | (13) r1(all_0_4_4, all_0_1_1)
% 2.25/1.19 |
% 2.25/1.19 | Instantiating formula (9) with all_0_2_2 and discharging atoms r1(all_0_4_4, all_0_2_2), ~ p12(all_0_2_2), yields:
% 2.25/1.19 | (14) $false
% 2.25/1.19 |
% 2.25/1.19 |-The branch is then unsatisfiable
% 2.25/1.19 % SZS output end Proof for theBenchmark
% 2.25/1.19
% 2.25/1.19 616ms
%------------------------------------------------------------------------------