TSTP Solution File: SYN361+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SYN361+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n015.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:01:48 EDT 2022
% Result : Theorem 3.68s 1.73s
% Output : Proof 4.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN361+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.34 % Computer : n015.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 : Tue Jul 12 04:05:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.51/0.59 ____ _
% 0.51/0.59 ___ / __ \_____(_)___ ________ __________
% 0.51/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.51/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.51/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.51/0.59
% 0.51/0.59 A Theorem Prover for First-Order Logic
% 0.51/0.59 (ePrincess v.1.0)
% 0.51/0.59
% 0.51/0.59 (c) Philipp Rümmer, 2009-2015
% 0.51/0.59 (c) Peter Backeman, 2014-2015
% 0.51/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.51/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.51/0.59 Bug reports to peter@backeman.se
% 0.51/0.59
% 0.51/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.51/0.59
% 0.51/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.72/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.18/0.90 Prover 0: Preprocessing ...
% 1.33/0.95 Prover 0: Warning: ignoring some quantifiers
% 1.33/0.97 Prover 0: Constructing countermodel ...
% 1.58/1.07 Prover 0: gave up
% 1.58/1.07 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.73/1.09 Prover 1: Preprocessing ...
% 2.01/1.14 Prover 1: Constructing countermodel ...
% 2.01/1.15 Prover 1: gave up
% 2.01/1.15 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.01/1.16 Prover 2: Preprocessing ...
% 2.16/1.20 Prover 2: Warning: ignoring some quantifiers
% 2.16/1.20 Prover 2: Constructing countermodel ...
% 2.40/1.28 Prover 2: gave up
% 2.40/1.28 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.40/1.29 Prover 3: Preprocessing ...
% 2.40/1.30 Prover 3: Warning: ignoring some quantifiers
% 2.40/1.30 Prover 3: Constructing countermodel ...
% 2.40/1.32 Prover 3: gave up
% 2.40/1.32 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.40/1.32 Prover 4: Preprocessing ...
% 2.66/1.36 Prover 4: Warning: ignoring some quantifiers
% 2.76/1.36 Prover 4: Constructing countermodel ...
% 2.97/1.44 Prover 4: gave up
% 2.97/1.44 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.97/1.44 Prover 5: Preprocessing ...
% 2.97/1.46 Prover 5: Constructing countermodel ...
% 2.97/1.46 Prover 5: gave up
% 2.97/1.46 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.97/1.47 Prover 6: Preprocessing ...
% 3.07/1.49 Prover 6: Warning: ignoring some quantifiers
% 3.07/1.49 Prover 6: Constructing countermodel ...
% 3.07/1.53 Prover 6: gave up
% 3.07/1.53 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.27/1.53 Prover 7: Preprocessing ...
% 3.27/1.54 Prover 7: Proving ...
% 3.68/1.73 Prover 7: proved (201ms)
% 3.68/1.73
% 3.68/1.73 % SZS status Theorem for theBenchmark
% 3.68/1.73
% 3.68/1.73 Generating proof ... found it (size 16)
% 4.11/1.87
% 4.11/1.87 % SZS output start Proof for theBenchmark
% 4.11/1.87 Assumed formulas after preprocessing and simplification:
% 4.11/1.87 | (0) ! [v0] : ! [v1] : ( ~ big_q(v0, v1) | ~ big_p(v0, v1)) & ? [v0] : ! [v1] : big_p(v1, v0) & ! [v0] : ( ~ big_s(v0) | ? [v1] : big_q(v1, v0)) & ! [v0] : big_s(v0)
% 4.11/1.87 | Applying alpha-rule on (0) yields:
% 4.11/1.87 | (1) ! [v0] : ! [v1] : ( ~ big_q(v0, v1) | ~ big_p(v0, v1))
% 4.11/1.87 | (2) ? [v0] : ! [v1] : big_p(v1, v0)
% 4.11/1.87 | (3) ! [v0] : ( ~ big_s(v0) | ? [v1] : big_q(v1, v0))
% 4.11/1.87 | (4) ! [v0] : big_s(v0)
% 4.11/1.87 |
% 4.11/1.87 | Instantiating (2) with all_1_0_0 yields:
% 4.11/1.87 | (5) ! [v0] : big_p(v0, all_1_0_0)
% 4.11/1.87 |
% 4.11/1.87 | Introducing new symbol ex_3_0_1 defined by:
% 4.11/1.87 | (6) ex_3_0_1 = all_1_0_0
% 4.11/1.87 |
% 4.11/1.87 | Instantiating formula (4) with ex_3_0_1 yields:
% 4.11/1.87 | (7) big_s(ex_3_0_1)
% 4.11/1.88 |
% 4.11/1.88 | Instantiating formula (3) with ex_3_0_1 and discharging atoms big_s(ex_3_0_1), yields:
% 4.11/1.88 | (8) ? [v0] : big_q(v0, ex_3_0_1)
% 4.11/1.88 |
% 4.11/1.88 | Instantiating (8) with all_10_0_2 yields:
% 4.11/1.88 | (9) big_q(all_10_0_2, ex_3_0_1)
% 4.11/1.88 |
% 4.11/1.88 | Introducing new symbol ex_18_0_3 defined by:
% 4.11/1.88 | (10) ex_18_0_3 = all_10_0_2
% 4.11/1.88 |
% 4.11/1.88 | Instantiating formula (5) with ex_18_0_3 yields:
% 4.11/1.88 | (11) big_p(ex_18_0_3, all_1_0_0)
% 4.11/1.88 |
% 4.11/1.88 | Instantiating formula (1) with all_1_0_0, all_10_0_2 yields:
% 4.11/1.88 | (12) ~ big_q(all_10_0_2, all_1_0_0) | ~ big_p(all_10_0_2, all_1_0_0)
% 4.11/1.88 |
% 4.11/1.88 +-Applying beta-rule and splitting (12), into two cases.
% 4.11/1.88 |-Branch one:
% 4.11/1.88 | (13) ~ big_q(all_10_0_2, all_1_0_0)
% 4.11/1.88 |
% 4.11/1.88 | From (6) and (9) follows:
% 4.11/1.88 | (14) big_q(all_10_0_2, all_1_0_0)
% 4.11/1.88 |
% 4.11/1.88 | Using (14) and (13) yields:
% 4.11/1.88 | (15) $false
% 4.11/1.88 |
% 4.11/1.88 |-The branch is then unsatisfiable
% 4.11/1.88 |-Branch two:
% 4.11/1.88 | (16) ~ big_p(all_10_0_2, all_1_0_0)
% 4.11/1.88 |
% 4.11/1.88 | From (10) and (11) follows:
% 4.11/1.88 | (17) big_p(all_10_0_2, all_1_0_0)
% 4.11/1.88 |
% 4.11/1.88 | Using (17) and (16) yields:
% 4.11/1.88 | (15) $false
% 4.11/1.88 |
% 4.11/1.88 |-The branch is then unsatisfiable
% 4.11/1.88 % SZS output end Proof for theBenchmark
% 4.11/1.88
% 4.11/1.88 1277ms
%------------------------------------------------------------------------------