TSTP Solution File: LCL684+1.001 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : LCL684+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:29 EDT 2022
% Result : Theorem 4.36s 1.75s
% Output : Proof 4.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL684+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 03:28:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.50/0.59 ____ _
% 0.50/0.59 ___ / __ \_____(_)___ ________ __________
% 0.50/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.50/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.50/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.50/0.59
% 0.50/0.59 A Theorem Prover for First-Order Logic
% 0.50/0.59 (ePrincess v.1.0)
% 0.50/0.59
% 0.50/0.59 (c) Philipp Rümmer, 2009-2015
% 0.50/0.59 (c) Peter Backeman, 2014-2015
% 0.50/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.50/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.50/0.59 Bug reports to peter@backeman.se
% 0.50/0.59
% 0.50/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.50/0.59
% 0.50/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.72/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.32/0.87 Prover 0: Preprocessing ...
% 1.32/0.92 Prover 0: Warning: ignoring some quantifiers
% 1.50/0.94 Prover 0: Constructing countermodel ...
% 1.57/1.03 Prover 0: gave up
% 1.57/1.03 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.80/1.05 Prover 1: Preprocessing ...
% 1.97/1.12 Prover 1: Constructing countermodel ...
% 2.15/1.14 Prover 1: gave up
% 2.15/1.14 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.15/1.15 Prover 2: Preprocessing ...
% 2.25/1.22 Prover 2: Warning: ignoring some quantifiers
% 2.25/1.22 Prover 2: Constructing countermodel ...
% 2.40/1.25 Prover 2: gave up
% 2.40/1.25 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.51/1.26 Prover 3: Preprocessing ...
% 2.51/1.27 Prover 3: Warning: ignoring some quantifiers
% 2.51/1.27 Prover 3: Constructing countermodel ...
% 2.51/1.28 Prover 3: gave up
% 2.51/1.28 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.51/1.29 Prover 4: Preprocessing ...
% 2.75/1.34 Prover 4: Warning: ignoring some quantifiers
% 2.75/1.35 Prover 4: Constructing countermodel ...
% 3.25/1.52 Prover 4: gave up
% 3.25/1.52 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 3.46/1.53 Prover 5: Preprocessing ...
% 3.46/1.56 Prover 5: Constructing countermodel ...
% 3.57/1.57 Prover 5: gave up
% 3.57/1.57 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 3.57/1.57 Prover 6: Preprocessing ...
% 3.57/1.60 Prover 6: Warning: ignoring some quantifiers
% 3.57/1.60 Prover 6: Constructing countermodel ...
% 3.57/1.62 Prover 6: gave up
% 3.57/1.62 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.57/1.63 Prover 7: Preprocessing ...
% 3.57/1.63 Prover 7: Proving ...
% 4.36/1.75 Prover 7: proved (129ms)
% 4.36/1.75
% 4.36/1.75 % SZS status Theorem for theBenchmark
% 4.36/1.75
% 4.36/1.75 Generating proof ... found it (size 13)
% 4.69/1.91
% 4.69/1.91 % SZS output start Proof for theBenchmark
% 4.69/1.91 Assumed formulas after preprocessing and simplification:
% 4.69/1.91 | (0) ! [v0] : ! [v1] : ! [v2] : ( ~ r1(v1, v2) | ~ r1(v0, v1) | r1(v0, v2)) & ! [v0] : r1(v0, v0) & ? [v0] : (p101(v0) & p201(v0) & ! [v1] : ( ~ r1(v0, v1) | ! [v2] : ( ~ p101(v2) | ~ p201(v2) | ~ r1(v1, v2))))
% 4.69/1.91 | Applying alpha-rule on (0) yields:
% 4.69/1.91 | (1) ! [v0] : ! [v1] : ! [v2] : ( ~ r1(v1, v2) | ~ r1(v0, v1) | r1(v0, v2))
% 4.69/1.91 | (2) ! [v0] : r1(v0, v0)
% 4.69/1.91 | (3) ? [v0] : (p101(v0) & p201(v0) & ! [v1] : ( ~ r1(v0, v1) | ! [v2] : ( ~ p101(v2) | ~ p201(v2) | ~ r1(v1, v2))))
% 4.69/1.91 |
% 4.69/1.91 | Instantiating (3) with all_1_0_0 yields:
% 4.69/1.91 | (4) p101(all_1_0_0) & p201(all_1_0_0) & ! [v0] : ( ~ r1(all_1_0_0, v0) | ! [v1] : ( ~ p101(v1) | ~ p201(v1) | ~ r1(v0, v1)))
% 4.69/1.91 |
% 4.69/1.91 | Applying alpha-rule on (4) yields:
% 4.69/1.91 | (5) p101(all_1_0_0)
% 4.69/1.91 | (6) p201(all_1_0_0)
% 4.69/1.91 | (7) ! [v0] : ( ~ r1(all_1_0_0, v0) | ! [v1] : ( ~ p101(v1) | ~ p201(v1) | ~ r1(v0, v1)))
% 4.69/1.91 |
% 4.69/1.91 | Introducing new symbol ex_10_0_1 defined by:
% 4.69/1.91 | (8) ex_10_0_1 = all_1_0_0
% 4.69/1.92 |
% 4.69/1.92 | Instantiating formula (2) with ex_10_0_1 yields:
% 4.69/1.92 | (9) r1(ex_10_0_1, ex_10_0_1)
% 4.69/1.92 |
% 4.69/1.92 | Instantiating formula (7) with all_1_0_0 yields:
% 4.69/1.92 | (10) ~ r1(all_1_0_0, all_1_0_0) | ! [v0] : ( ~ p101(v0) | ~ p201(v0) | ~ r1(all_1_0_0, v0))
% 4.69/1.92 |
% 4.69/1.92 +-Applying beta-rule and splitting (10), into two cases.
% 4.69/1.92 |-Branch one:
% 4.69/1.92 | (11) ~ r1(all_1_0_0, all_1_0_0)
% 4.69/1.92 |
% 4.69/1.92 | From (8)(8) and (9) follows:
% 4.69/1.92 | (12) r1(all_1_0_0, all_1_0_0)
% 4.69/1.92 |
% 4.69/1.92 | Using (12) and (11) yields:
% 4.69/1.92 | (13) $false
% 4.69/1.92 |
% 4.69/1.92 |-The branch is then unsatisfiable
% 4.69/1.92 |-Branch two:
% 4.69/1.92 | (12) r1(all_1_0_0, all_1_0_0)
% 4.69/1.92 | (15) ! [v0] : ( ~ p101(v0) | ~ p201(v0) | ~ r1(all_1_0_0, v0))
% 4.69/1.92 |
% 4.69/1.92 | Instantiating formula (15) with all_1_0_0 and discharging atoms p101(all_1_0_0), p201(all_1_0_0), yields:
% 4.69/1.92 | (11) ~ r1(all_1_0_0, all_1_0_0)
% 4.69/1.92 |
% 4.69/1.92 | Using (12) and (11) yields:
% 4.69/1.92 | (13) $false
% 4.69/1.92 |
% 4.69/1.92 |-The branch is then unsatisfiable
% 4.69/1.92 % SZS output end Proof for theBenchmark
% 4.69/1.92
% 4.69/1.92 1317ms
%------------------------------------------------------------------------------