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

View Problem - Process Solution

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

% Computer : n006.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:51 EDT 2022

% Result   : Theorem 3.71s 1.70s
% Output   : Proof 4.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN366+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n006.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 : Tue Jul 12 08:35:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.53/0.58          ____       _                          
% 0.53/0.58    ___  / __ \_____(_)___  ________  __________
% 0.53/0.58   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.53/0.58  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.53/0.58  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.53/0.58  
% 0.53/0.58  A Theorem Prover for First-Order Logic
% 0.53/0.58  (ePrincess v.1.0)
% 0.53/0.58  
% 0.53/0.58  (c) Philipp Rümmer, 2009-2015
% 0.53/0.58  (c) Peter Backeman, 2014-2015
% 0.53/0.58  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.53/0.58  Free software under GNU Lesser General Public License (LGPL).
% 0.53/0.58  Bug reports to peter@backeman.se
% 0.53/0.58  
% 0.53/0.58  For more information, visit http://user.uu.se/~petba168/breu/
% 0.53/0.58  
% 0.53/0.58  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.61/0.63  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.19/0.87  Prover 0: Preprocessing ...
% 1.28/0.93  Prover 0: Warning: ignoring some quantifiers
% 1.39/0.94  Prover 0: Constructing countermodel ...
% 1.80/1.08  Prover 0: gave up
% 1.80/1.08  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.80/1.09  Prover 1: Preprocessing ...
% 1.80/1.14  Prover 1: Constructing countermodel ...
% 2.08/1.18  Prover 1: gave up
% 2.08/1.18  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.08/1.19  Prover 2: Preprocessing ...
% 2.21/1.22  Prover 2: Warning: ignoring some quantifiers
% 2.21/1.22  Prover 2: Constructing countermodel ...
% 2.33/1.25  Prover 2: gave up
% 2.33/1.25  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.33/1.26  Prover 3: Preprocessing ...
% 2.33/1.27  Prover 3: Warning: ignoring some quantifiers
% 2.33/1.27  Prover 3: Constructing countermodel ...
% 2.33/1.31  Prover 3: gave up
% 2.33/1.31  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.33/1.31  Prover 4: Preprocessing ...
% 2.71/1.35  Prover 4: Warning: ignoring some quantifiers
% 2.71/1.35  Prover 4: Constructing countermodel ...
% 2.95/1.41  Prover 4: gave up
% 2.95/1.41  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.95/1.41  Prover 5: Preprocessing ...
% 2.95/1.43  Prover 5: Constructing countermodel ...
% 2.95/1.45  Prover 5: gave up
% 2.95/1.45  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 3.21/1.46  Prover 6: Preprocessing ...
% 3.22/1.48  Prover 6: Warning: ignoring some quantifiers
% 3.22/1.48  Prover 6: Constructing countermodel ...
% 3.22/1.50  Prover 6: gave up
% 3.22/1.50  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.34/1.50  Prover 7: Preprocessing ...
% 3.34/1.52  Prover 7: Proving ...
% 3.71/1.69  Prover 7: proved (197ms)
% 3.71/1.70  
% 3.71/1.70  % SZS status Theorem for theBenchmark
% 3.71/1.70  
% 3.71/1.70  Generating proof ... found it (size 10)
% 4.13/1.85  
% 4.13/1.85  % SZS output start Proof for theBenchmark
% 4.13/1.85  Assumed formulas after preprocessing and simplification: 
% 4.13/1.85  | (0)  ! [v0] :  ! [v1] : ( ~ big_r(v1, v0) | big_r(v0, v0)) &  ! [v0] :  ! [v1] : ( ~ big_r(v0, v1) | big_r(v0, v0)) &  ! [v0] : ( ~ big_r(v0, v0) |  ! [v1] : big_r(v1, v0)) &  ! [v0] : ( ~ big_r(v0, v0) |  ! [v1] : big_r(v0, v1)) &  ? [v0] :  ~ big_r(v0, v0) &  ? [v0] : big_r(v0, v0)
% 4.13/1.86  | Applying alpha-rule on (0) yields:
% 4.13/1.86  | (1)  ? [v0] :  ~ big_r(v0, v0)
% 4.13/1.86  | (2)  ? [v0] : big_r(v0, v0)
% 4.13/1.86  | (3)  ! [v0] : ( ~ big_r(v0, v0) |  ! [v1] : big_r(v0, v1))
% 4.13/1.86  | (4)  ! [v0] :  ! [v1] : ( ~ big_r(v0, v1) | big_r(v0, v0))
% 4.13/1.86  | (5)  ! [v0] :  ! [v1] : ( ~ big_r(v1, v0) | big_r(v0, v0))
% 4.13/1.86  | (6)  ! [v0] : ( ~ big_r(v0, v0) |  ! [v1] : big_r(v1, v0))
% 4.13/1.86  |
% 4.13/1.86  | Instantiating (2) with all_1_0_0 yields:
% 4.13/1.86  | (7) big_r(all_1_0_0, all_1_0_0)
% 4.13/1.86  |
% 4.13/1.86  | Instantiating (1) with all_3_0_1 yields:
% 4.13/1.86  | (8)  ~ big_r(all_3_0_1, all_3_0_1)
% 4.13/1.86  |
% 4.13/1.86  | Instantiating formula (3) with all_1_0_0 and discharging atoms big_r(all_1_0_0, all_1_0_0), yields:
% 4.13/1.86  | (9)  ! [v0] : big_r(all_1_0_0, v0)
% 4.13/1.86  |
% 4.13/1.86  | Introducing new symbol ex_11_0_2 defined by:
% 4.13/1.86  | (10) ex_11_0_2 = all_3_0_1
% 4.13/1.86  |
% 4.13/1.86  | Instantiating formula (9) with ex_11_0_2 yields:
% 4.13/1.86  | (11) big_r(all_1_0_0, ex_11_0_2)
% 4.13/1.86  |
% 4.13/1.86  | Instantiating formula (5) with all_1_0_0, ex_11_0_2 and discharging atoms big_r(all_1_0_0, ex_11_0_2), yields:
% 4.13/1.86  | (12) big_r(ex_11_0_2, ex_11_0_2)
% 4.13/1.86  |
% 4.13/1.86  | From (10)(10) and (12) follows:
% 4.13/1.86  | (13) big_r(all_3_0_1, all_3_0_1)
% 4.13/1.86  |
% 4.13/1.86  | Using (13) and (8) yields:
% 4.13/1.86  | (14) $false
% 4.13/1.86  |
% 4.13/1.86  |-The branch is then unsatisfiable
% 4.13/1.86  % SZS output end Proof for theBenchmark
% 4.13/1.86  
% 4.13/1.86  1274ms
%------------------------------------------------------------------------------