TSTP Solution File: LCL682+1.001 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n021.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:27 EDT 2022
% Result : Theorem 1.86s 1.11s
% Output : Proof 2.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.33 % Computer : n021.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 : Sun Jul 3 00:52:45 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.60/0.59 ____ _
% 0.60/0.59 ___ / __ \_____(_)___ ________ __________
% 0.60/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.60/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.60/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.60/0.59
% 0.60/0.59 A Theorem Prover for First-Order Logic
% 0.60/0.59 (ePrincess v.1.0)
% 0.60/0.59
% 0.60/0.59 (c) Philipp Rümmer, 2009-2015
% 0.60/0.59 (c) Peter Backeman, 2014-2015
% 0.60/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.60/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.60/0.59 Bug reports to peter@backeman.se
% 0.60/0.59
% 0.60/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.60/0.59
% 0.60/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.74/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.47/0.92 Prover 0: Preprocessing ...
% 1.58/1.00 Prover 0: Warning: ignoring some quantifiers
% 1.72/1.02 Prover 0: Constructing countermodel ...
% 1.86/1.11 Prover 0: proved (471ms)
% 1.86/1.11
% 1.86/1.11 No countermodel exists, formula is valid
% 1.86/1.11 % SZS status Theorem for theBenchmark
% 1.86/1.11
% 1.86/1.11 Generating proof ... Warning: ignoring some quantifiers
% 2.47/1.28 found it (size 4)
% 2.47/1.28
% 2.47/1.28 % SZS output start Proof for theBenchmark
% 2.47/1.28 Assumed formulas after preprocessing and simplification:
% 2.47/1.28 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : ? [v8] : (r1(v7, v8) & r1(v5, v6) & r1(v3, v4) & r1(v1, v2) & r1(v0, v7) & r1(v0, v5) & r1(v0, v3) & r1(v0, v1) & ~ p11(v2) & ~ p13(v6) & ~ p15(v8) & ~ p12(v4) & ! [v9] : ! [v10] : ! [v11] : ( ~ r1(v10, v11) | ~ r1(v9, v10) | r1(v9, v11)) & ! [v9] : ! [v10] : ( ~ r1(v9, v10) | ~ r1(v0, v9) | p14(v10)) & ! [v9] : ! [v10] : ( ~ r1(v9, v10) | ~ r1(v0, v9) | p12(v10)) & ! [v9] : ! [v10] : ( ~ r1(v9, v10) | ~ r1(v0, v9) | p16(v10)) & ? [v9] : r1(v9, v9))
% 2.47/1.29 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6, all_0_7_7, all_0_8_8 yields:
% 2.47/1.29 | (1) r1(all_0_1_1, all_0_0_0) & r1(all_0_3_3, all_0_2_2) & r1(all_0_5_5, all_0_4_4) & r1(all_0_7_7, all_0_6_6) & r1(all_0_8_8, all_0_1_1) & r1(all_0_8_8, all_0_3_3) & r1(all_0_8_8, all_0_5_5) & r1(all_0_8_8, all_0_7_7) & ~ p11(all_0_6_6) & ~ p13(all_0_2_2) & ~ p15(all_0_0_0) & ~ p12(all_0_4_4) & ! [v0] : ! [v1] : ! [v2] : ( ~ r1(v1, v2) | ~ r1(v0, v1) | r1(v0, v2)) & ! [v0] : ! [v1] : ( ~ r1(v0, v1) | ~ r1(all_0_8_8, v0) | p14(v1)) & ! [v0] : ! [v1] : ( ~ r1(v0, v1) | ~ r1(all_0_8_8, v0) | p12(v1)) & ! [v0] : ! [v1] : ( ~ r1(v0, v1) | ~ r1(all_0_8_8, v0) | p16(v1)) & ? [v0] : r1(v0, v0)
% 2.47/1.29 |
% 2.47/1.29 | Applying alpha-rule on (1) yields:
% 2.47/1.29 | (2) ~ p15(all_0_0_0)
% 2.47/1.29 | (3) r1(all_0_8_8, all_0_7_7)
% 2.47/1.29 | (4) ! [v0] : ! [v1] : ( ~ r1(v0, v1) | ~ r1(all_0_8_8, v0) | p14(v1))
% 2.47/1.29 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ r1(v1, v2) | ~ r1(v0, v1) | r1(v0, v2))
% 2.47/1.29 | (6) ! [v0] : ! [v1] : ( ~ r1(v0, v1) | ~ r1(all_0_8_8, v0) | p16(v1))
% 2.47/1.29 | (7) r1(all_0_8_8, all_0_3_3)
% 2.47/1.29 | (8) r1(all_0_8_8, all_0_5_5)
% 2.47/1.30 | (9) r1(all_0_5_5, all_0_4_4)
% 2.47/1.30 | (10) r1(all_0_7_7, all_0_6_6)
% 2.47/1.30 | (11) ~ p12(all_0_4_4)
% 2.47/1.30 | (12) ~ p11(all_0_6_6)
% 2.47/1.30 | (13) ! [v0] : ! [v1] : ( ~ r1(v0, v1) | ~ r1(all_0_8_8, v0) | p12(v1))
% 2.47/1.30 | (14) ~ p13(all_0_2_2)
% 2.47/1.30 | (15) r1(all_0_3_3, all_0_2_2)
% 2.47/1.30 | (16) r1(all_0_1_1, all_0_0_0)
% 2.47/1.30 | (17) r1(all_0_8_8, all_0_1_1)
% 2.47/1.30 | (18) ? [v0] : r1(v0, v0)
% 2.47/1.30 |
% 2.47/1.30 | Instantiating formula (13) with all_0_4_4, all_0_5_5 and discharging atoms r1(all_0_5_5, all_0_4_4), r1(all_0_8_8, all_0_5_5), ~ p12(all_0_4_4), yields:
% 2.47/1.30 | (19) $false
% 2.47/1.30 |
% 2.47/1.30 |-The branch is then unsatisfiable
% 2.47/1.30 % SZS output end Proof for theBenchmark
% 2.47/1.30
% 2.47/1.30 697ms
%------------------------------------------------------------------------------