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

View Problem - Process Solution

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

% Computer : n011.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:34 EDT 2022

% Result   : Theorem 3.11s 1.51s
% Output   : Proof 3.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN341+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.34  % Computer : n011.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 00:33:57 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.56/0.60          ____       _                          
% 0.56/0.60    ___  / __ \_____(_)___  ________  __________
% 0.56/0.60   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.56/0.60  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.56/0.60  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.56/0.60  
% 0.56/0.60  A Theorem Prover for First-Order Logic
% 0.64/0.60  (ePrincess v.1.0)
% 0.64/0.60  
% 0.64/0.60  (c) Philipp Rümmer, 2009-2015
% 0.64/0.60  (c) Peter Backeman, 2014-2015
% 0.64/0.60  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.64/0.60  Free software under GNU Lesser General Public License (LGPL).
% 0.64/0.60  Bug reports to peter@backeman.se
% 0.64/0.60  
% 0.64/0.60  For more information, visit http://user.uu.se/~petba168/breu/
% 0.64/0.60  
% 0.64/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.71/0.65  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.15/0.86  Prover 0: Preprocessing ...
% 1.31/0.89  Prover 0: Warning: ignoring some quantifiers
% 1.37/0.91  Prover 0: Constructing countermodel ...
% 1.43/0.99  Prover 0: gave up
% 1.43/1.00  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.43/1.01  Prover 1: Preprocessing ...
% 1.74/1.04  Prover 1: Warning: ignoring some quantifiers
% 1.74/1.04  Prover 1: Constructing countermodel ...
% 1.74/1.05  Prover 1: gave up
% 1.74/1.05  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.74/1.06  Prover 2: Preprocessing ...
% 1.74/1.07  Prover 2: Warning: ignoring some quantifiers
% 1.74/1.08  Prover 2: Constructing countermodel ...
% 2.01/1.10  Prover 2: gave up
% 2.01/1.10  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.01/1.10  Prover 3: Preprocessing ...
% 2.01/1.11  Prover 3: Warning: ignoring some quantifiers
% 2.01/1.11  Prover 3: Constructing countermodel ...
% 2.01/1.12  Prover 3: gave up
% 2.01/1.12  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.01/1.13  Prover 4: Preprocessing ...
% 2.01/1.15  Prover 4: Warning: ignoring some quantifiers
% 2.01/1.15  Prover 4: Constructing countermodel ...
% 2.27/1.20  Prover 4: gave up
% 2.27/1.20  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.27/1.20  Prover 5: Preprocessing ...
% 2.36/1.21  Prover 5: Warning: ignoring some quantifiers
% 2.36/1.22  Prover 5: Constructing countermodel ...
% 2.36/1.22  Prover 5: gave up
% 2.36/1.22  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.36/1.22  Prover 6: Preprocessing ...
% 2.41/1.23  Prover 6: Warning: ignoring some quantifiers
% 2.41/1.23  Prover 6: Constructing countermodel ...
% 2.41/1.24  Prover 6: gave up
% 2.41/1.24  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.41/1.25  Prover 7: Preprocessing ...
% 2.41/1.25  Prover 7: Proving ...
% 3.11/1.51  Prover 7: proved (266ms)
% 3.11/1.51  
% 3.11/1.51  % SZS status Theorem for theBenchmark
% 3.11/1.51  
% 3.11/1.51  Generating proof ... found it (size 17)
% 3.50/1.64  
% 3.50/1.64  % SZS output start Proof for theBenchmark
% 3.50/1.64  Assumed formulas after preprocessing and simplification: 
% 3.50/1.64  | (0)  ! [v0] :  ? [v1] :  ! [v2] :  ? [v3] : (big_f(v0, v1, v2) &  ~ big_f(v1, v2, v3))
% 3.50/1.64  | Instantiating formula (0) with ex_0_0_0 yields:
% 3.50/1.64  | (1)  ? [v0] :  ! [v1] :  ? [v2] : (big_f(ex_0_0_0, v0, v1) &  ~ big_f(v0, v1, v2))
% 3.50/1.64  |
% 3.50/1.64  | Instantiating (1) with all_1_0_1 yields:
% 3.50/1.64  | (2)  ! [v0] :  ? [v1] : (big_f(ex_0_0_0, all_1_0_1, v0) &  ~ big_f(all_1_0_1, v0, v1))
% 3.50/1.64  |
% 3.50/1.64  | Introducing new symbol ex_3_0_2 defined by:
% 3.50/1.64  | (3) ex_3_0_2 = all_1_0_1
% 3.50/1.64  |
% 3.50/1.64  | Instantiating formula (0) with ex_3_0_2 yields:
% 3.50/1.64  | (4)  ? [v0] :  ! [v1] :  ? [v2] : (big_f(ex_3_0_2, v0, v1) &  ~ big_f(v0, v1, v2))
% 3.50/1.64  |
% 3.50/1.64  | Instantiating (4) with all_4_0_3 yields:
% 3.50/1.64  | (5)  ! [v0] :  ? [v1] : (big_f(ex_3_0_2, all_4_0_3, v0) &  ~ big_f(all_4_0_3, v0, v1))
% 3.50/1.64  |
% 3.50/1.64  | Introducing new symbol ex_6_0_4 defined by:
% 3.50/1.64  | (6) ex_6_0_4 = all_4_0_3
% 3.50/1.64  |
% 3.50/1.64  | Instantiating formula (2) with ex_6_0_4 yields:
% 3.50/1.64  | (7)  ? [v0] : (big_f(ex_0_0_0, all_1_0_1, ex_6_0_4) &  ~ big_f(all_1_0_1, ex_6_0_4, v0))
% 3.50/1.64  |
% 3.50/1.64  | Instantiating (7) with all_7_0_5 yields:
% 3.50/1.64  | (8) big_f(ex_0_0_0, all_1_0_1, ex_6_0_4) &  ~ big_f(all_1_0_1, ex_6_0_4, all_7_0_5)
% 3.50/1.64  |
% 3.50/1.64  | Applying alpha-rule on (8) yields:
% 3.50/1.64  | (9) big_f(ex_0_0_0, all_1_0_1, ex_6_0_4)
% 3.50/1.64  | (10)  ~ big_f(all_1_0_1, ex_6_0_4, all_7_0_5)
% 3.50/1.64  |
% 3.50/1.64  | Introducing new symbol ex_18_0_8 defined by:
% 3.50/1.64  | (11) ex_18_0_8 = all_7_0_5
% 3.50/1.64  |
% 3.50/1.64  | Instantiating formula (5) with ex_18_0_8 yields:
% 3.50/1.64  | (12)  ? [v0] : (big_f(ex_3_0_2, all_4_0_3, ex_18_0_8) &  ~ big_f(all_4_0_3, ex_18_0_8, v0))
% 3.50/1.64  |
% 3.50/1.64  | Instantiating (12) with all_19_0_9 yields:
% 3.50/1.64  | (13) big_f(ex_3_0_2, all_4_0_3, ex_18_0_8) &  ~ big_f(all_4_0_3, ex_18_0_8, all_19_0_9)
% 3.50/1.64  |
% 3.50/1.64  | Applying alpha-rule on (13) yields:
% 3.50/1.64  | (14) big_f(ex_3_0_2, all_4_0_3, ex_18_0_8)
% 3.50/1.64  | (15)  ~ big_f(all_4_0_3, ex_18_0_8, all_19_0_9)
% 3.50/1.64  |
% 3.50/1.65  | From (3)(11) and (14) follows:
% 3.50/1.65  | (16) big_f(all_1_0_1, all_4_0_3, all_7_0_5)
% 3.50/1.65  |
% 3.50/1.65  | From (6) and (10) follows:
% 3.50/1.65  | (17)  ~ big_f(all_1_0_1, all_4_0_3, all_7_0_5)
% 3.50/1.65  |
% 3.50/1.65  | Using (16) and (17) yields:
% 3.50/1.65  | (18) $false
% 3.50/1.65  |
% 3.50/1.65  |-The branch is then unsatisfiable
% 3.50/1.65  % SZS output end Proof for theBenchmark
% 3.50/1.65  
% 3.50/1.65  1036ms
%------------------------------------------------------------------------------