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

View Problem - Process Solution

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

% Computer : n022.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:31 EDT 2022

% Result   : Theorem 3.11s 1.46s
% Output   : Proof 3.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN336+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n022.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 23:02:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.49/0.57          ____       _                          
% 0.49/0.57    ___  / __ \_____(_)___  ________  __________
% 0.49/0.57   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.49/0.57  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.49/0.57  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.49/0.57  
% 0.49/0.57  A Theorem Prover for First-Order Logic
% 0.49/0.57  (ePrincess v.1.0)
% 0.49/0.57  
% 0.49/0.57  (c) Philipp Rümmer, 2009-2015
% 0.49/0.57  (c) Peter Backeman, 2014-2015
% 0.49/0.57  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.49/0.57  Free software under GNU Lesser General Public License (LGPL).
% 0.49/0.57  Bug reports to peter@backeman.se
% 0.49/0.57  
% 0.49/0.57  For more information, visit http://user.uu.se/~petba168/breu/
% 0.49/0.57  
% 0.49/0.57  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.49/0.62  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.22/0.83  Prover 0: Preprocessing ...
% 1.27/0.85  Prover 0: Warning: ignoring some quantifiers
% 1.27/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.46/0.98  Prover 1: Preprocessing ...
% 1.64/1.02  Prover 1: Warning: ignoring some quantifiers
% 1.64/1.03  Prover 1: Constructing countermodel ...
% 1.64/1.04  Prover 1: gave up
% 1.64/1.04  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.64/1.05  Prover 2: Preprocessing ...
% 1.90/1.07  Prover 2: Warning: ignoring some quantifiers
% 1.90/1.08  Prover 2: Constructing countermodel ...
% 1.99/1.10  Prover 2: gave up
% 1.99/1.10  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.99/1.11  Prover 3: Preprocessing ...
% 1.99/1.11  Prover 3: Warning: ignoring some quantifiers
% 1.99/1.11  Prover 3: Constructing countermodel ...
% 1.99/1.13  Prover 3: gave up
% 1.99/1.13  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.18/1.13  Prover 4: Preprocessing ...
% 2.30/1.16  Prover 4: Warning: ignoring some quantifiers
% 2.30/1.16  Prover 4: Constructing countermodel ...
% 2.47/1.24  Prover 4: gave up
% 2.47/1.24  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.47/1.25  Prover 5: Preprocessing ...
% 2.47/1.26  Prover 5: Warning: ignoring some quantifiers
% 2.47/1.26  Prover 5: Constructing countermodel ...
% 2.47/1.26  Prover 5: gave up
% 2.47/1.26  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.57/1.27  Prover 6: Preprocessing ...
% 2.57/1.28  Prover 6: Warning: ignoring some quantifiers
% 2.57/1.28  Prover 6: Constructing countermodel ...
% 2.57/1.28  Prover 6: gave up
% 2.57/1.29  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.57/1.29  Prover 7: Preprocessing ...
% 2.57/1.29  Prover 7: Proving ...
% 3.11/1.46  Prover 7: proved (172ms)
% 3.11/1.46  
% 3.11/1.46  % SZS status Theorem for theBenchmark
% 3.11/1.46  
% 3.11/1.46  Generating proof ... found it (size 13)
% 3.42/1.64  
% 3.42/1.64  % SZS output start Proof for theBenchmark
% 3.42/1.64  Assumed formulas after preprocessing and simplification: 
% 3.42/1.64  | (0)  ? [v0] :  ! [v1] :  ! [v2] :  ? [v3] : (big_f(v2, v3) & big_f(v1, v3) & big_f(v1, v0) & big_f(v0, v3) &  ~ big_f(v3, v2))
% 3.42/1.64  | Instantiating (0) with all_0_0_0 yields:
% 3.42/1.64  | (1)  ! [v0] :  ! [v1] :  ? [v2] : (big_f(v1, v2) & big_f(v0, v2) & big_f(v0, all_0_0_0) & big_f(all_0_0_0, v2) &  ~ big_f(v2, v1))
% 3.42/1.64  |
% 3.42/1.64  | Introducing new symbol ex_2_0_1 defined by:
% 3.42/1.64  | (2) ex_2_0_1 = all_0_0_0
% 3.42/1.64  |
% 3.42/1.64  | Instantiating formula (1) with ex_2_0_1, ex_2_1_2 yields:
% 3.42/1.64  | (3)  ? [v0] : (big_f(ex_2_0_1, v0) & big_f(ex_2_1_2, v0) & big_f(ex_2_1_2, all_0_0_0) & big_f(all_0_0_0, v0) &  ~ big_f(v0, ex_2_0_1))
% 3.42/1.64  |
% 3.42/1.64  | Instantiating (3) with all_3_0_3 yields:
% 3.42/1.64  | (4) big_f(ex_2_0_1, all_3_0_3) & big_f(ex_2_1_2, all_3_0_3) & big_f(ex_2_1_2, all_0_0_0) & big_f(all_0_0_0, all_3_0_3) &  ~ big_f(all_3_0_3, ex_2_0_1)
% 3.42/1.64  |
% 3.42/1.64  | Applying alpha-rule on (4) yields:
% 3.42/1.64  | (5) big_f(ex_2_0_1, all_3_0_3)
% 3.42/1.64  | (6) big_f(ex_2_1_2, all_0_0_0)
% 3.42/1.64  | (7)  ~ big_f(all_3_0_3, ex_2_0_1)
% 3.42/1.65  | (8) big_f(all_0_0_0, all_3_0_3)
% 3.42/1.65  | (9) big_f(ex_2_1_2, all_3_0_3)
% 3.42/1.65  |
% 3.42/1.65  | Introducing new symbol ex_11_1_5 defined by:
% 3.42/1.65  | (10) ex_11_1_5 = all_3_0_3
% 3.42/1.65  |
% 3.42/1.65  | Instantiating formula (1) with ex_11_0_4, ex_11_1_5 yields:
% 3.42/1.65  | (11)  ? [v0] : (big_f(ex_11_0_4, v0) & big_f(ex_11_1_5, v0) & big_f(ex_11_1_5, all_0_0_0) & big_f(all_0_0_0, v0) &  ~ big_f(v0, ex_11_0_4))
% 3.42/1.65  |
% 3.42/1.65  | Instantiating (11) with all_12_0_6 yields:
% 3.42/1.65  | (12) big_f(ex_11_0_4, all_12_0_6) & big_f(ex_11_1_5, all_12_0_6) & big_f(ex_11_1_5, all_0_0_0) & big_f(all_0_0_0, all_12_0_6) &  ~ big_f(all_12_0_6, ex_11_0_4)
% 3.42/1.65  |
% 3.42/1.65  | Applying alpha-rule on (12) yields:
% 3.42/1.65  | (13) big_f(ex_11_1_5, all_12_0_6)
% 3.42/1.65  | (14) big_f(all_0_0_0, all_12_0_6)
% 3.42/1.65  | (15)  ~ big_f(all_12_0_6, ex_11_0_4)
% 3.42/1.65  | (16) big_f(ex_11_1_5, all_0_0_0)
% 3.42/1.65  | (17) big_f(ex_11_0_4, all_12_0_6)
% 3.42/1.65  |
% 3.42/1.65  | From (10) and (16) follows:
% 3.42/1.65  | (18) big_f(all_3_0_3, all_0_0_0)
% 3.42/1.65  |
% 3.42/1.65  | From (2) and (7) follows:
% 3.42/1.65  | (19)  ~ big_f(all_3_0_3, all_0_0_0)
% 3.42/1.65  |
% 3.42/1.65  | Using (18) and (19) yields:
% 3.42/1.65  | (20) $false
% 3.42/1.65  |
% 3.42/1.65  |-The branch is then unsatisfiable
% 3.42/1.65  % SZS output end Proof for theBenchmark
% 3.42/1.65  
% 3.62/1.65  1069ms
%------------------------------------------------------------------------------