TSTP Solution File: SYN340+1 by ePrincess---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : SYN340+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n007.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:33 EDT 2022

% Result   : Theorem 3.39s 1.57s
% Output   : Proof 3.63s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN340+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n007.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 : Mon Jul 11 11:30:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.54/0.57          ____       _                          
% 0.54/0.57    ___  / __ \_____(_)___  ________  __________
% 0.54/0.57   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.57  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.54/0.57  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.54/0.57  
% 0.54/0.57  A Theorem Prover for First-Order Logic
% 0.54/0.57  (ePrincess v.1.0)
% 0.54/0.57  
% 0.54/0.57  (c) Philipp Rümmer, 2009-2015
% 0.54/0.57  (c) Peter Backeman, 2014-2015
% 0.54/0.57  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.57  Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.57  Bug reports to peter@backeman.se
% 0.54/0.57  
% 0.54/0.57  For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.57  
% 0.54/0.57  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.54/0.62  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.10/0.82  Prover 0: Preprocessing ...
% 1.31/0.86  Prover 0: Warning: ignoring some quantifiers
% 1.31/0.87  Prover 0: Constructing countermodel ...
% 1.46/0.96  Prover 0: gave up
% 1.46/0.96  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.61/0.98  Prover 1: Preprocessing ...
% 1.61/1.01  Prover 1: Warning: ignoring some quantifiers
% 1.61/1.01  Prover 1: Constructing countermodel ...
% 1.61/1.02  Prover 1: gave up
% 1.61/1.02  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.61/1.03  Prover 2: Preprocessing ...
% 1.90/1.04  Prover 2: Warning: ignoring some quantifiers
% 1.90/1.05  Prover 2: Constructing countermodel ...
% 1.90/1.07  Prover 2: gave up
% 1.90/1.07  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.90/1.07  Prover 3: Preprocessing ...
% 2.02/1.08  Prover 3: Warning: ignoring some quantifiers
% 2.02/1.08  Prover 3: Constructing countermodel ...
% 2.02/1.09  Prover 3: gave up
% 2.02/1.10  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.02/1.11  Prover 4: Preprocessing ...
% 2.02/1.14  Prover 4: Warning: ignoring some quantifiers
% 2.02/1.14  Prover 4: Constructing countermodel ...
% 2.28/1.19  Prover 4: gave up
% 2.28/1.19  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.28/1.20  Prover 5: Preprocessing ...
% 2.28/1.21  Prover 5: Warning: ignoring some quantifiers
% 2.28/1.21  Prover 5: Constructing countermodel ...
% 2.28/1.22  Prover 5: gave up
% 2.28/1.22  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.28/1.22  Prover 6: Preprocessing ...
% 2.46/1.23  Prover 6: Warning: ignoring some quantifiers
% 2.46/1.24  Prover 6: Constructing countermodel ...
% 2.46/1.25  Prover 6: gave up
% 2.46/1.25  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.54/1.26  Prover 7: Preprocessing ...
% 2.54/1.26  Prover 7: Proving ...
% 3.39/1.57  Prover 7: proved (319ms)
% 3.39/1.57  
% 3.39/1.57  % SZS status Theorem for theBenchmark
% 3.39/1.57  
% 3.39/1.57  Generating proof ... found it (size 16)
% 3.63/1.71  
% 3.63/1.71  % SZS output start Proof for theBenchmark
% 3.63/1.71  Assumed formulas after preprocessing and simplification: 
% 3.63/1.71  | (0)  ! [v0] :  ? [v1] : ( ! [v2] :  ! [v3] :  ~ big_f(v2, v0, v1, v2, v3) &  ! [v2] :  ! [v3] : big_f(v0, v1, v2, v3, v2))
% 3.63/1.71  | Introducing new symbol ex_0_0_0 defined by:
% 3.63/1.71  | (1) ex_0_0_0 = arbitrary_constant
% 3.63/1.71  |
% 3.63/1.71  | Instantiating formula (0) with ex_0_0_0 yields:
% 3.63/1.71  | (2)  ? [v0] : ( ! [v1] :  ! [v2] :  ~ big_f(v1, ex_0_0_0, v0, v1, v2) &  ! [v1] :  ! [v2] : big_f(ex_0_0_0, v0, v1, v2, v1))
% 3.63/1.72  |
% 3.63/1.72  | Instantiating (2) with all_1_0_1 yields:
% 3.63/1.72  | (3)  ! [v0] :  ! [v1] :  ~ big_f(v0, ex_0_0_0, all_1_0_1, v0, v1) &  ! [v0] :  ! [v1] : big_f(ex_0_0_0, all_1_0_1, v0, v1, v0)
% 3.63/1.72  |
% 3.63/1.72  | Applying alpha-rule on (3) yields:
% 3.63/1.72  | (4)  ! [v0] :  ! [v1] :  ~ big_f(v0, ex_0_0_0, all_1_0_1, v0, v1)
% 3.63/1.72  | (5)  ! [v0] :  ! [v1] : big_f(ex_0_0_0, all_1_0_1, v0, v1, v0)
% 3.63/1.72  |
% 3.63/1.72  | Introducing new symbol ex_5_0_2 defined by:
% 3.63/1.72  | (6) ex_5_0_2 = all_1_0_1
% 3.63/1.72  |
% 3.63/1.72  | Instantiating formula (0) with ex_5_0_2 yields:
% 3.63/1.72  | (7)  ? [v0] : ( ! [v1] :  ! [v2] :  ~ big_f(v1, ex_5_0_2, v0, v1, v2) &  ! [v1] :  ! [v2] : big_f(ex_5_0_2, v0, v1, v2, v1))
% 3.63/1.72  |
% 3.63/1.72  | Instantiating (7) with all_6_0_3 yields:
% 3.63/1.72  | (8)  ! [v0] :  ! [v1] :  ~ big_f(v0, ex_5_0_2, all_6_0_3, v0, v1) &  ! [v0] :  ! [v1] : big_f(ex_5_0_2, all_6_0_3, v0, v1, v0)
% 3.63/1.72  |
% 3.63/1.72  | Applying alpha-rule on (8) yields:
% 3.63/1.72  | (9)  ! [v0] :  ! [v1] :  ~ big_f(v0, ex_5_0_2, all_6_0_3, v0, v1)
% 3.63/1.72  | (10)  ! [v0] :  ! [v1] : big_f(ex_5_0_2, all_6_0_3, v0, v1, v0)
% 3.63/1.72  |
% 3.63/1.72  | Introducing new symbol ex_10_1_5 defined by:
% 3.63/1.72  | (11) ex_10_1_5 = all_6_0_3
% 3.63/1.72  |
% 3.63/1.72  | Introducing new symbol ex_10_0_4 defined by:
% 3.63/1.72  | (12) ex_10_0_4 = arbitrary_constant
% 3.63/1.72  |
% 3.63/1.72  | Instantiating formula (5) with ex_10_0_4, ex_10_1_5 yields:
% 3.63/1.72  | (13) big_f(ex_0_0_0, all_1_0_1, ex_10_1_5, ex_10_0_4, ex_10_1_5)
% 3.63/1.72  |
% 3.63/1.72  | Instantiating formula (9) with all_6_0_3, ex_0_0_0 yields:
% 3.63/1.72  | (14)  ~ big_f(ex_0_0_0, ex_5_0_2, all_6_0_3, ex_0_0_0, all_6_0_3)
% 3.63/1.72  |
% 3.63/1.72  | From (1)(11)(12)(11) and (13) follows:
% 3.63/1.72  | (15) big_f(arbitrary_constant, all_1_0_1, all_6_0_3, arbitrary_constant, all_6_0_3)
% 3.63/1.72  |
% 3.63/1.72  | From (1)(6)(1) and (14) follows:
% 3.63/1.72  | (16)  ~ big_f(arbitrary_constant, all_1_0_1, all_6_0_3, arbitrary_constant, all_6_0_3)
% 3.63/1.72  |
% 3.63/1.72  | Using (15) and (16) yields:
% 3.63/1.72  | (17) $false
% 3.63/1.72  |
% 3.63/1.72  |-The branch is then unsatisfiable
% 3.63/1.72  % SZS output end Proof for theBenchmark
% 3.63/1.72  
% 3.63/1.72  1143ms
%------------------------------------------------------------------------------