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

View Problem - Process Solution

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

% Computer : n009.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:32 EDT 2022

% Result   : Theorem 3.21s 1.62s
% Output   : Proof 3.90s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN338+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.14  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.35  % Computer : n009.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 19:31:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.57/0.60          ____       _                          
% 0.57/0.60    ___  / __ \_____(_)___  ________  __________
% 0.57/0.60   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.57/0.60  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.57/0.60  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.57/0.60  
% 0.57/0.60  A Theorem Prover for First-Order Logic
% 0.57/0.61  (ePrincess v.1.0)
% 0.57/0.61  
% 0.57/0.61  (c) Philipp Rümmer, 2009-2015
% 0.57/0.61  (c) Peter Backeman, 2014-2015
% 0.57/0.61  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.57/0.61  Free software under GNU Lesser General Public License (LGPL).
% 0.57/0.61  Bug reports to peter@backeman.se
% 0.57/0.61  
% 0.57/0.61  For more information, visit http://user.uu.se/~petba168/breu/
% 0.57/0.61  
% 0.57/0.61  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.71/0.66  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.24/0.90  Prover 0: Preprocessing ...
% 1.34/0.93  Prover 0: Warning: ignoring some quantifiers
% 1.35/0.95  Prover 0: Constructing countermodel ...
% 1.47/1.03  Prover 0: gave up
% 1.47/1.03  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.47/1.04  Prover 1: Preprocessing ...
% 1.73/1.09  Prover 1: Warning: ignoring some quantifiers
% 1.73/1.09  Prover 1: Constructing countermodel ...
% 1.73/1.14  Prover 1: gave up
% 1.73/1.14  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.73/1.15  Prover 2: Preprocessing ...
% 1.73/1.17  Prover 2: Warning: ignoring some quantifiers
% 1.73/1.17  Prover 2: Constructing countermodel ...
% 2.12/1.20  Prover 2: gave up
% 2.12/1.20  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.23/1.21  Prover 3: Preprocessing ...
% 2.23/1.21  Prover 3: Warning: ignoring some quantifiers
% 2.23/1.21  Prover 3: Constructing countermodel ...
% 2.23/1.22  Prover 3: gave up
% 2.23/1.22  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.23/1.23  Prover 4: Preprocessing ...
% 2.36/1.25  Prover 4: Warning: ignoring some quantifiers
% 2.36/1.26  Prover 4: Constructing countermodel ...
% 2.36/1.31  Prover 4: gave up
% 2.36/1.31  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.36/1.32  Prover 5: Preprocessing ...
% 2.62/1.33  Prover 5: Warning: ignoring some quantifiers
% 2.62/1.33  Prover 5: Constructing countermodel ...
% 2.62/1.35  Prover 5: gave up
% 2.62/1.35  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.62/1.35  Prover 6: Preprocessing ...
% 2.62/1.36  Prover 6: Warning: ignoring some quantifiers
% 2.62/1.36  Prover 6: Constructing countermodel ...
% 2.62/1.38  Prover 6: gave up
% 2.62/1.38  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.86/1.39  Prover 7: Preprocessing ...
% 2.86/1.39  Prover 7: Proving ...
% 3.21/1.62  Prover 7: proved (234ms)
% 3.21/1.62  
% 3.21/1.62  % SZS status Theorem for theBenchmark
% 3.21/1.62  
% 3.21/1.62  Generating proof ... found it (size 12)
% 3.70/1.77  
% 3.70/1.77  % SZS output start Proof for theBenchmark
% 3.70/1.77  Assumed formulas after preprocessing and simplification: 
% 3.70/1.77  | (0)  ! [v0] :  ? [v1] : (big_f(v0, v1) &  ~ big_f(v1, v1) &  ! [v2] : big_f(v2, v0))
% 3.70/1.78  | Instantiating formula (0) with ex_0_0_0 yields:
% 3.70/1.78  | (1)  ? [v0] : (big_f(ex_0_0_0, v0) &  ~ big_f(v0, v0) &  ! [v1] : big_f(v1, ex_0_0_0))
% 3.70/1.78  |
% 3.70/1.78  | Instantiating (1) with all_1_0_1 yields:
% 3.90/1.78  | (2) big_f(ex_0_0_0, all_1_0_1) &  ~ big_f(all_1_0_1, all_1_0_1) &  ! [v0] : big_f(v0, ex_0_0_0)
% 3.90/1.78  |
% 3.90/1.78  | Applying alpha-rule on (2) yields:
% 3.90/1.78  | (3) big_f(ex_0_0_0, all_1_0_1)
% 3.90/1.78  | (4)  ~ big_f(all_1_0_1, all_1_0_1)
% 3.90/1.78  | (5)  ! [v0] : big_f(v0, ex_0_0_0)
% 3.90/1.78  |
% 3.90/1.78  | Introducing new symbol ex_9_0_2 defined by:
% 3.90/1.78  | (6) ex_9_0_2 = all_1_0_1
% 3.90/1.78  |
% 3.90/1.78  | Instantiating formula (0) with ex_9_0_2 yields:
% 3.90/1.78  | (7)  ? [v0] : (big_f(ex_9_0_2, v0) &  ~ big_f(v0, v0) &  ! [v1] : big_f(v1, ex_9_0_2))
% 3.90/1.78  |
% 3.90/1.78  | Instantiating (7) with all_10_0_3 yields:
% 3.90/1.78  | (8) big_f(ex_9_0_2, all_10_0_3) &  ~ big_f(all_10_0_3, all_10_0_3) &  ! [v0] : big_f(v0, ex_9_0_2)
% 3.90/1.78  |
% 3.90/1.78  | Applying alpha-rule on (8) yields:
% 3.90/1.78  | (9) big_f(ex_9_0_2, all_10_0_3)
% 3.90/1.78  | (10)  ~ big_f(all_10_0_3, all_10_0_3)
% 3.90/1.78  | (11)  ! [v0] : big_f(v0, ex_9_0_2)
% 3.90/1.78  |
% 3.90/1.78  | Introducing new symbol ex_35_0_7 defined by:
% 3.90/1.78  | (12) ex_35_0_7 = all_1_0_1
% 3.90/1.78  |
% 3.90/1.78  | Instantiating formula (11) with ex_35_0_7 yields:
% 3.90/1.78  | (13) big_f(ex_35_0_7, ex_9_0_2)
% 3.90/1.78  |
% 3.90/1.78  | From (12)(6) and (13) follows:
% 3.90/1.78  | (14) big_f(all_1_0_1, all_1_0_1)
% 3.90/1.78  |
% 3.90/1.78  | Using (14) and (4) yields:
% 3.90/1.78  | (15) $false
% 3.90/1.78  |
% 3.90/1.78  |-The branch is then unsatisfiable
% 3.90/1.78  % SZS output end Proof for theBenchmark
% 3.90/1.78  
% 3.92/1.78  1167ms
%------------------------------------------------------------------------------