↑ Up

ePrincess---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n026.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 : Tue Jul 19 08:47:04 EDT 2022

% Result   : Theorem 2.80s 1.35s
% Output   : Proof 3.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.34  % Computer : n026.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 : Mon Jun 20 12:09:56 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.51/0.59          ____       _                          
% 0.51/0.59    ___  / __ \_____(_)___  ________  __________
% 0.51/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.51/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.51/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.51/0.59  
% 0.51/0.59  A Theorem Prover for First-Order Logic
% 0.51/0.59  (ePrincess v.1.0)
% 0.51/0.59  
% 0.51/0.59  (c) Philipp Rümmer, 2009-2015
% 0.51/0.59  (c) Peter Backeman, 2014-2015
% 0.51/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.51/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.51/0.59  Bug reports to peter@backeman.se
% 0.51/0.59  
% 0.51/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.51/0.59  
% 0.51/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.73/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.32/0.88  Prover 0: Preprocessing ...
% 1.61/1.01  Prover 0: Warning: ignoring some quantifiers
% 1.61/1.03  Prover 0: Constructing countermodel ...
% 2.23/1.21  Prover 0: gave up
% 2.23/1.21  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.23/1.23  Prover 1: Preprocessing ...
% 2.58/1.29  Prover 1: Warning: ignoring some quantifiers
% 2.58/1.29  Prover 1: Constructing countermodel ...
% 2.80/1.34  Prover 1: proved (133ms)
% 2.80/1.35  
% 2.80/1.35  No countermodel exists, formula is valid
% 2.80/1.35  % SZS status Theorem for theBenchmark
% 2.80/1.35  
% 2.80/1.35  Generating proof ... Warning: ignoring some quantifiers
% 3.40/1.55  found it (size 17)
% 3.40/1.55  
% 3.40/1.55  % SZS output start Proof for theBenchmark
% 3.40/1.55  Assumed formulas after preprocessing and simplification: 
% 3.40/1.55  | (0)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] : ( ~ (v3 = 0) & union(v1) = v2 & subset(v0, v2) = v3 & in(v0, v1) = 0 &  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] :  ! [v8] : (v7 = 0 |  ~ (union(v4) = v5) |  ~ (in(v6, v8) = 0) |  ~ (in(v6, v5) = v7) |  ? [v9] : ( ~ (v9 = 0) & in(v8, v4) = v9)) &  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : (v5 = v4 |  ~ (subset(v7, v6) = v5) |  ~ (subset(v7, v6) = v4)) &  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : (v5 = v4 |  ~ (in(v7, v6) = v5) |  ~ (in(v7, v6) = v4)) &  ! [v4] :  ! [v5] :  ! [v6] : (v6 = 0 |  ~ (subset(v4, v5) = v6) |  ? [v7] :  ? [v8] : ( ~ (v8 = 0) & in(v7, v5) = v8 & in(v7, v4) = 0)) &  ! [v4] :  ! [v5] :  ! [v6] : (v5 = v4 |  ~ (union(v6) = v5) |  ~ (union(v6) = v4)) &  ! [v4] :  ! [v5] :  ! [v6] : ( ~ (union(v4) = v5) |  ~ (in(v6, v5) = 0) |  ? [v7] : (in(v7, v4) = 0 & in(v6, v7) = 0)) &  ! [v4] :  ! [v5] :  ! [v6] : ( ~ (subset(v4, v5) = 0) |  ~ (in(v6, v4) = 0) | in(v6, v5) = 0) &  ? [v4] :  ! [v5] :  ! [v6] : (v6 = v4 |  ~ (union(v5) = v6) |  ? [v7] :  ? [v8] :  ? [v9] :  ? [v10] :  ? [v11] : (in(v7, v4) = v8 & ( ~ (v8 = 0) |  ! [v12] : ( ~ (in(v7, v12) = 0) |  ? [v13] : ( ~ (v13 = 0) & in(v12, v5) = v13))) & (v8 = 0 | (v11 = 0 & v10 = 0 & in(v9, v5) = 0 & in(v7, v9) = 0)))) &  ! [v4] :  ! [v5] : (v5 = 0 |  ~ (subset(v4, v4) = v5)) &  ! [v4] :  ! [v5] : ( ~ (in(v4, v5) = 0) |  ? [v6] : ( ~ (v6 = 0) & in(v5, v4) = v6)))
% 3.49/1.58  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields:
% 3.49/1.58  | (1)  ~ (all_0_0_0 = 0) & union(all_0_2_2) = all_0_1_1 & subset(all_0_3_3, all_0_1_1) = all_0_0_0 & in(all_0_3_3, all_0_2_2) = 0 &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] : (v3 = 0 |  ~ (union(v0) = v1) |  ~ (in(v2, v4) = 0) |  ~ (in(v2, v1) = v3) |  ? [v5] : ( ~ (v5 = 0) & in(v4, v0) = v5)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (subset(v3, v2) = v1) |  ~ (subset(v3, v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (in(v3, v2) = v1) |  ~ (in(v3, v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : (v2 = 0 |  ~ (subset(v0, v1) = v2) |  ? [v3] :  ? [v4] : ( ~ (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (union(v2) = v1) |  ~ (union(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (union(v0) = v1) |  ~ (in(v2, v1) = 0) |  ? [v3] : (in(v3, v0) = 0 & in(v2, v3) = 0)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (subset(v0, v1) = 0) |  ~ (in(v2, v0) = 0) | in(v2, v1) = 0) &  ? [v0] :  ! [v1] :  ! [v2] : (v2 = v0 |  ~ (union(v1) = v2) |  ? [v3] :  ? [v4] :  ? [v5] :  ? [v6] :  ? [v7] : (in(v3, v0) = v4 & ( ~ (v4 = 0) |  ! [v8] : ( ~ (in(v3, v8) = 0) |  ? [v9] : ( ~ (v9 = 0) & in(v8, v1) = v9))) & (v4 = 0 | (v7 = 0 & v6 = 0 & in(v5, v1) = 0 & in(v3, v5) = 0)))) &  ! [v0] :  ! [v1] : (v1 = 0 |  ~ (subset(v0, v0) = v1)) &  ! [v0] :  ! [v1] : ( ~ (in(v0, v1) = 0) |  ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2))
% 3.49/1.59  |
% 3.49/1.59  | Applying alpha-rule on (1) yields:
% 3.49/1.59  | (2)  ~ (all_0_0_0 = 0)
% 3.49/1.59  | (3)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] : (v3 = 0 |  ~ (union(v0) = v1) |  ~ (in(v2, v4) = 0) |  ~ (in(v2, v1) = v3) |  ? [v5] : ( ~ (v5 = 0) & in(v4, v0) = v5))
% 3.49/1.59  | (4)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (in(v3, v2) = v1) |  ~ (in(v3, v2) = v0))
% 3.49/1.59  | (5)  ! [v0] :  ! [v1] : ( ~ (in(v0, v1) = 0) |  ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2))
% 3.49/1.59  | (6)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (union(v2) = v1) |  ~ (union(v2) = v0))
% 3.49/1.59  | (7) subset(all_0_3_3, all_0_1_1) = all_0_0_0
% 3.49/1.59  | (8)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (union(v0) = v1) |  ~ (in(v2, v1) = 0) |  ? [v3] : (in(v3, v0) = 0 & in(v2, v3) = 0))
% 3.49/1.59  | (9) union(all_0_2_2) = all_0_1_1
% 3.49/1.59  | (10)  ? [v0] :  ! [v1] :  ! [v2] : (v2 = v0 |  ~ (union(v1) = v2) |  ? [v3] :  ? [v4] :  ? [v5] :  ? [v6] :  ? [v7] : (in(v3, v0) = v4 & ( ~ (v4 = 0) |  ! [v8] : ( ~ (in(v3, v8) = 0) |  ? [v9] : ( ~ (v9 = 0) & in(v8, v1) = v9))) & (v4 = 0 | (v7 = 0 & v6 = 0 & in(v5, v1) = 0 & in(v3, v5) = 0))))
% 3.49/1.60  | (11)  ! [v0] :  ! [v1] :  ! [v2] : (v2 = 0 |  ~ (subset(v0, v1) = v2) |  ? [v3] :  ? [v4] : ( ~ (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0))
% 3.49/1.60  | (12) in(all_0_3_3, all_0_2_2) = 0
% 3.49/1.60  | (13)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (subset(v0, v1) = 0) |  ~ (in(v2, v0) = 0) | in(v2, v1) = 0)
% 3.49/1.60  | (14)  ! [v0] :  ! [v1] : (v1 = 0 |  ~ (subset(v0, v0) = v1))
% 3.49/1.60  | (15)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (subset(v3, v2) = v1) |  ~ (subset(v3, v2) = v0))
% 3.49/1.60  |
% 3.49/1.60  | Instantiating formula (11) with all_0_0_0, all_0_1_1, all_0_3_3 and discharging atoms subset(all_0_3_3, all_0_1_1) = all_0_0_0, yields:
% 3.49/1.60  | (16) all_0_0_0 = 0 |  ? [v0] :  ? [v1] : ( ~ (v1 = 0) & in(v0, all_0_1_1) = v1 & in(v0, all_0_3_3) = 0)
% 3.49/1.60  |
% 3.49/1.60  +-Applying beta-rule and splitting (16), into two cases.
% 3.49/1.60  |-Branch one:
% 3.49/1.60  | (17) all_0_0_0 = 0
% 3.49/1.60  |
% 3.49/1.60  	| Equations (17) can reduce 2 to:
% 3.49/1.60  	| (18) $false
% 3.49/1.60  	|
% 3.49/1.60  	|-The branch is then unsatisfiable
% 3.49/1.60  |-Branch two:
% 3.49/1.60  | (2)  ~ (all_0_0_0 = 0)
% 3.49/1.60  | (20)  ? [v0] :  ? [v1] : ( ~ (v1 = 0) & in(v0, all_0_1_1) = v1 & in(v0, all_0_3_3) = 0)
% 3.49/1.60  |
% 3.49/1.60  	| Instantiating (20) with all_19_0_6, all_19_1_7 yields:
% 3.49/1.60  	| (21)  ~ (all_19_0_6 = 0) & in(all_19_1_7, all_0_1_1) = all_19_0_6 & in(all_19_1_7, all_0_3_3) = 0
% 3.49/1.60  	|
% 3.49/1.60  	| Applying alpha-rule on (21) yields:
% 3.49/1.60  	| (22)  ~ (all_19_0_6 = 0)
% 3.49/1.60  	| (23) in(all_19_1_7, all_0_1_1) = all_19_0_6
% 3.49/1.60  	| (24) in(all_19_1_7, all_0_3_3) = 0
% 3.49/1.60  	|
% 3.49/1.60  	| Instantiating formula (3) with all_0_3_3, all_19_0_6, all_19_1_7, all_0_1_1, all_0_2_2 and discharging atoms union(all_0_2_2) = all_0_1_1, in(all_19_1_7, all_0_1_1) = all_19_0_6, in(all_19_1_7, all_0_3_3) = 0, yields:
% 3.49/1.60  	| (25) all_19_0_6 = 0 |  ? [v0] : ( ~ (v0 = 0) & in(all_0_3_3, all_0_2_2) = v0)
% 3.49/1.60  	|
% 3.49/1.60  	+-Applying beta-rule and splitting (25), into two cases.
% 3.49/1.60  	|-Branch one:
% 3.49/1.60  	| (26) all_19_0_6 = 0
% 3.49/1.60  	|
% 3.49/1.60  		| Equations (26) can reduce 22 to:
% 3.49/1.60  		| (18) $false
% 3.49/1.60  		|
% 3.49/1.60  		|-The branch is then unsatisfiable
% 3.49/1.60  	|-Branch two:
% 3.49/1.60  	| (22)  ~ (all_19_0_6 = 0)
% 3.49/1.60  	| (29)  ? [v0] : ( ~ (v0 = 0) & in(all_0_3_3, all_0_2_2) = v0)
% 3.49/1.60  	|
% 3.49/1.60  		| Instantiating (29) with all_36_0_9 yields:
% 3.49/1.60  		| (30)  ~ (all_36_0_9 = 0) & in(all_0_3_3, all_0_2_2) = all_36_0_9
% 3.49/1.60  		|
% 3.49/1.60  		| Applying alpha-rule on (30) yields:
% 3.49/1.60  		| (31)  ~ (all_36_0_9 = 0)
% 3.49/1.60  		| (32) in(all_0_3_3, all_0_2_2) = all_36_0_9
% 3.49/1.60  		|
% 3.49/1.60  		| Instantiating formula (4) with all_0_3_3, all_0_2_2, all_36_0_9, 0 and discharging atoms in(all_0_3_3, all_0_2_2) = all_36_0_9, in(all_0_3_3, all_0_2_2) = 0, yields:
% 3.49/1.60  		| (33) all_36_0_9 = 0
% 3.49/1.60  		|
% 3.49/1.60  		| Equations (33) can reduce 31 to:
% 3.49/1.60  		| (18) $false
% 3.49/1.60  		|
% 3.49/1.60  		|-The branch is then unsatisfiable
% 3.49/1.60  % SZS output end Proof for theBenchmark
% 3.49/1.60  
% 3.49/1.60  1004ms
%------------------------------------------------------------------------------