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

View Problem - Process Solution

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

% Computer : n010.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:04:44 EDT 2022

% Result   : Theorem 3.23s 1.58s
% Output   : Proof 3.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN727+1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.34  % Computer : n010.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:09:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.60/0.60          ____       _                          
% 0.60/0.60    ___  / __ \_____(_)___  ________  __________
% 0.60/0.60   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.60/0.60  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.60/0.60  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.60/0.60  
% 0.60/0.60  A Theorem Prover for First-Order Logic
% 0.60/0.60  (ePrincess v.1.0)
% 0.60/0.60  
% 0.60/0.60  (c) Philipp Rümmer, 2009-2015
% 0.60/0.60  (c) Peter Backeman, 2014-2015
% 0.60/0.60  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.60/0.60  Free software under GNU Lesser General Public License (LGPL).
% 0.60/0.60  Bug reports to peter@backeman.se
% 0.60/0.60  
% 0.60/0.60  For more information, visit http://user.uu.se/~petba168/breu/
% 0.60/0.60  
% 0.60/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.75/0.65  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.22/0.89  Prover 0: Preprocessing ...
% 1.31/0.93  Prover 0: Warning: ignoring some quantifiers
% 1.38/0.95  Prover 0: Constructing countermodel ...
% 1.56/1.06  Prover 0: gave up
% 1.56/1.06  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.56/1.08  Prover 1: Preprocessing ...
% 1.80/1.11  Prover 1: Warning: ignoring some quantifiers
% 1.80/1.12  Prover 1: Constructing countermodel ...
% 1.80/1.16  Prover 1: gave up
% 1.80/1.16  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.80/1.16  Prover 2: Preprocessing ...
% 2.16/1.18  Prover 2: Warning: ignoring some quantifiers
% 2.16/1.18  Prover 2: Constructing countermodel ...
% 2.23/1.21  Prover 2: gave up
% 2.23/1.21  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.23/1.22  Prover 3: Preprocessing ...
% 2.23/1.22  Prover 3: Warning: ignoring some quantifiers
% 2.23/1.23  Prover 3: Constructing countermodel ...
% 2.41/1.25  Prover 3: gave up
% 2.41/1.25  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.41/1.26  Prover 4: Preprocessing ...
% 2.41/1.28  Prover 4: Warning: ignoring some quantifiers
% 2.41/1.28  Prover 4: Constructing countermodel ...
% 2.61/1.32  Prover 4: gave up
% 2.61/1.33  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.61/1.33  Prover 5: Preprocessing ...
% 2.61/1.34  Prover 5: Warning: ignoring some quantifiers
% 2.61/1.34  Prover 5: Constructing countermodel ...
% 2.77/1.36  Prover 5: gave up
% 2.77/1.36  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.77/1.37  Prover 6: Preprocessing ...
% 2.77/1.38  Prover 6: Warning: ignoring some quantifiers
% 2.77/1.38  Prover 6: Constructing countermodel ...
% 2.77/1.40  Prover 6: gave up
% 2.77/1.40  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.77/1.40  Prover 7: Preprocessing ...
% 2.77/1.41  Prover 7: Proving ...
% 3.23/1.58  Prover 7: proved (186ms)
% 3.23/1.58  
% 3.23/1.58  % SZS status Theorem for theBenchmark
% 3.23/1.58  
% 3.23/1.58  Generating proof ... found it (size 19)
% 3.59/1.70  
% 3.59/1.70  % SZS output start Proof for theBenchmark
% 3.59/1.70  Assumed formulas after preprocessing and simplification: 
% 3.59/1.70  | (0)  ? [v0] :  ? [v1] : ( ! [v2] : likes(v2, v1) &  ! [v2] : (likes(v0, v2) |  ! [v3] :  ~ likes(v2, v3)) &  ! [v2] :  ? [v3] :  ~ likes(v2, v3))
% 3.59/1.70  | Instantiating (0) with all_0_0_0, all_0_1_1 yields:
% 3.59/1.70  | (1)  ! [v0] : likes(v0, all_0_0_0) &  ! [v0] : (likes(all_0_1_1, v0) |  ! [v1] :  ~ likes(v0, v1)) &  ! [v0] :  ? [v1] :  ~ likes(v0, v1)
% 3.59/1.70  |
% 3.59/1.70  | Applying alpha-rule on (1) yields:
% 3.59/1.70  | (2)  ! [v0] : likes(v0, all_0_0_0)
% 3.59/1.70  | (3)  ! [v0] : (likes(all_0_1_1, v0) |  ! [v1] :  ~ likes(v0, v1))
% 3.59/1.70  | (4)  ! [v0] :  ? [v1] :  ~ likes(v0, v1)
% 3.59/1.70  |
% 3.59/1.70  | Introducing new symbol ex_2_0_2 defined by:
% 3.59/1.70  | (5) ex_2_0_2 = all_0_1_1
% 3.59/1.70  |
% 3.59/1.70  | Instantiating formula (4) with ex_2_0_2 yields:
% 3.59/1.70  | (6)  ? [v0] :  ~ likes(ex_2_0_2, v0)
% 3.59/1.70  |
% 3.59/1.70  | Instantiating (6) with all_3_0_3 yields:
% 3.59/1.70  | (7)  ~ likes(ex_2_0_2, all_3_0_3)
% 3.59/1.70  |
% 3.59/1.70  | Introducing new symbol ex_11_0_4 defined by:
% 3.59/1.70  | (8) ex_11_0_4 = all_3_0_3
% 3.59/1.70  |
% 3.59/1.70  | Instantiating formula (3) with ex_11_0_4 yields:
% 3.59/1.70  | (9) likes(all_0_1_1, ex_11_0_4) |  ! [v0] :  ~ likes(ex_11_0_4, v0)
% 3.59/1.70  |
% 3.59/1.70  +-Applying beta-rule and splitting (9), into two cases.
% 3.59/1.70  |-Branch one:
% 3.59/1.70  | (10) likes(all_0_1_1, ex_11_0_4)
% 3.59/1.70  |
% 3.59/1.70  	| From (8) and (10) follows:
% 3.59/1.71  	| (11) likes(all_0_1_1, all_3_0_3)
% 3.59/1.71  	|
% 3.59/1.71  	| From (5) and (7) follows:
% 3.59/1.71  	| (12)  ~ likes(all_0_1_1, all_3_0_3)
% 3.59/1.71  	|
% 3.59/1.71  	| Using (11) and (12) yields:
% 3.59/1.71  	| (13) $false
% 3.59/1.71  	|
% 3.59/1.71  	|-The branch is then unsatisfiable
% 3.59/1.71  |-Branch two:
% 3.59/1.71  | (14)  ! [v0] :  ~ likes(ex_11_0_4, v0)
% 3.59/1.71  |
% 3.59/1.71  	| Introducing new symbol ex_16_0_5 defined by:
% 3.59/1.71  	| (15) ex_16_0_5 = all_3_0_3
% 3.59/1.71  	|
% 3.59/1.71  	| Instantiating formula (2) with ex_16_0_5 yields:
% 3.59/1.71  	| (16) likes(ex_16_0_5, all_0_0_0)
% 3.59/1.71  	|
% 3.59/1.71  	| Instantiating formula (14) with all_0_0_0 yields:
% 3.59/1.71  	| (17)  ~ likes(ex_11_0_4, all_0_0_0)
% 3.59/1.71  	|
% 3.59/1.71  	| From (15) and (16) follows:
% 3.59/1.71  	| (18) likes(all_3_0_3, all_0_0_0)
% 3.59/1.71  	|
% 3.59/1.71  	| From (8) and (17) follows:
% 3.59/1.71  	| (19)  ~ likes(all_3_0_3, all_0_0_0)
% 3.59/1.71  	|
% 3.59/1.71  	| Using (18) and (19) yields:
% 3.59/1.71  	| (13) $false
% 3.59/1.71  	|
% 3.59/1.71  	|-The branch is then unsatisfiable
% 3.59/1.71  % SZS output end Proof for theBenchmark
% 3.59/1.71  
% 3.59/1.71  1097ms
%------------------------------------------------------------------------------