%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET590+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n004.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 00:20:31 EDT 2022 % Result : Theorem 2.33s 1.28s % Output : Proof 3.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET590+3 : TPTP v8.1.0. Released v2.2.0. % 0.11/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n004.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 : Sat Jul 9 23:06:37 EDT 2022 % 0.13/0.34 % CPUTime : % 0.61/0.61 ____ _ % 0.61/0.61 ___ / __ \_____(_)___ ________ __________ % 0.61/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.61/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.61/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.61/0.61 % 0.61/0.61 A Theorem Prover for First-Order Logic % 0.61/0.61 (ePrincess v.1.0) % 0.61/0.61 % 0.61/0.61 (c) Philipp Rümmer, 2009-2015 % 0.61/0.61 (c) Peter Backeman, 2014-2015 % 0.61/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.61/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.61/0.61 Bug reports to peter@backeman.se % 0.61/0.61 % 0.61/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.61/0.61 % 0.61/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.69/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.36/0.93 Prover 0: Preprocessing ... % 1.43/1.02 Prover 0: Warning: ignoring some quantifiers % 1.64/1.04 Prover 0: Constructing countermodel ... % 1.78/1.15 Prover 0: gave up % 1.78/1.16 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.13/1.18 Prover 1: Preprocessing ... % 2.33/1.24 Prover 1: Constructing countermodel ... % 2.33/1.28 Prover 1: proved (125ms) % 2.33/1.28 % 2.33/1.28 No countermodel exists, formula is valid % 2.33/1.28 % SZS status Theorem for theBenchmark % 2.33/1.28 % 2.33/1.28 Generating proof ... found it (size 17) % 2.82/1.44 % 2.82/1.44 % SZS output start Proof for theBenchmark % 2.82/1.44 Assumed formulas after preprocessing and simplification: % 2.82/1.44 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = 0) & subset(v2, v0) = v3 & difference(v0, v1) = v2 & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ! [v8] : (v8 = 0 | ~ (difference(v4, v5) = v7) | ~ (member(v6, v7) = v8) | ? [v9] : ? [v10] : (member(v6, v5) = v10 & member(v6, v4) = v9 & ( ~ (v9 = 0) | v10 = 0))) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (subset(v7, v6) = v5) | ~ (subset(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (difference(v7, v6) = v5) | ~ (difference(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (member(v7, v6) = v5) | ~ (member(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (difference(v4, v5) = v7) | ~ (member(v6, v7) = 0) | ? [v8] : ( ~ (v8 = 0) & member(v6, v5) = v8 & member(v6, v4) = 0)) & ! [v4] : ! [v5] : ! [v6] : (v6 = 0 | ~ (subset(v4, v5) = v6) | ? [v7] : ? [v8] : ( ~ (v8 = 0) & member(v7, v5) = v8 & member(v7, v4) = 0)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (subset(v4, v5) = 0) | ~ (member(v6, v4) = 0) | member(v6, v5) = 0) & ! [v4] : ! [v5] : (v5 = 0 | ~ (subset(v4, v4) = v5))) % 3.01/1.47 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 3.01/1.47 | (1) ~ (all_0_0_0 = 0) & subset(all_0_1_1, all_0_3_3) = all_0_0_0 & difference(all_0_3_3, all_0_2_2) = all_0_1_1 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v4 = 0 | ~ (difference(v0, v1) = v3) | ~ (member(v2, v3) = v4) | ? [v5] : ? [v6] : (member(v2, v1) = v6 & member(v2, v0) = v5 & ( ~ (v5 = 0) | v6 = 0))) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ (member(v2, v3) = 0) | ? [v4] : ( ~ (v4 = 0) & member(v2, v1) = v4 & member(v2, v0) = 0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (subset(v0, v1) = 0) | ~ (member(v2, v0) = 0) | member(v2, v1) = 0) & ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) % 3.07/1.48 | % 3.07/1.48 | Applying alpha-rule on (1) yields: % 3.07/1.48 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) % 3.07/1.48 | (3) difference(all_0_3_3, all_0_2_2) = all_0_1_1 % 3.07/1.48 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v4 = 0 | ~ (difference(v0, v1) = v3) | ~ (member(v2, v3) = v4) | ? [v5] : ? [v6] : (member(v2, v1) = v6 & member(v2, v0) = v5 & ( ~ (v5 = 0) | v6 = 0))) % 3.07/1.48 | (5) subset(all_0_1_1, all_0_3_3) = all_0_0_0 % 3.07/1.48 | (6) ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) % 3.07/1.48 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ (member(v2, v3) = 0) | ? [v4] : ( ~ (v4 = 0) & member(v2, v1) = v4 & member(v2, v0) = 0)) % 3.07/1.48 | (8) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0)) % 3.07/1.49 | (9) ~ (all_0_0_0 = 0) % 3.07/1.49 | (10) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) % 3.07/1.49 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ (subset(v0, v1) = 0) | ~ (member(v2, v0) = 0) | member(v2, v1) = 0) % 3.07/1.49 | (12) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) % 3.07/1.49 | % 3.07/1.49 | Instantiating formula (8) with all_0_0_0, all_0_3_3, all_0_1_1 and discharging atoms subset(all_0_1_1, all_0_3_3) = all_0_0_0, yields: % 3.07/1.49 | (13) all_0_0_0 = 0 | ? [v0] : ? [v1] : ( ~ (v1 = 0) & member(v0, all_0_1_1) = 0 & member(v0, all_0_3_3) = v1) % 3.07/1.49 | % 3.07/1.49 +-Applying beta-rule and splitting (13), into two cases. % 3.07/1.49 |-Branch one: % 3.07/1.49 | (14) all_0_0_0 = 0 % 3.07/1.49 | % 3.07/1.49 | Equations (14) can reduce 9 to: % 3.07/1.49 | (15) $false % 3.07/1.49 | % 3.07/1.49 |-The branch is then unsatisfiable % 3.07/1.49 |-Branch two: % 3.07/1.49 | (9) ~ (all_0_0_0 = 0) % 3.07/1.49 | (17) ? [v0] : ? [v1] : ( ~ (v1 = 0) & member(v0, all_0_1_1) = 0 & member(v0, all_0_3_3) = v1) % 3.07/1.49 | % 3.07/1.49 | Instantiating (17) with all_14_0_4, all_14_1_5 yields: % 3.07/1.49 | (18) ~ (all_14_0_4 = 0) & member(all_14_1_5, all_0_1_1) = 0 & member(all_14_1_5, all_0_3_3) = all_14_0_4 % 3.07/1.49 | % 3.07/1.49 | Applying alpha-rule on (18) yields: % 3.07/1.49 | (19) ~ (all_14_0_4 = 0) % 3.07/1.49 | (20) member(all_14_1_5, all_0_1_1) = 0 % 3.07/1.49 | (21) member(all_14_1_5, all_0_3_3) = all_14_0_4 % 3.07/1.49 | % 3.07/1.49 | Instantiating formula (12) with all_14_1_5, all_0_3_3, all_14_0_4, 0 and discharging atoms member(all_14_1_5, all_0_3_3) = all_14_0_4, yields: % 3.07/1.49 | (22) all_14_0_4 = 0 | ~ (member(all_14_1_5, all_0_3_3) = 0) % 3.07/1.49 | % 3.07/1.49 | Instantiating formula (7) with all_0_1_1, all_14_1_5, all_0_2_2, all_0_3_3 and discharging atoms difference(all_0_3_3, all_0_2_2) = all_0_1_1, member(all_14_1_5, all_0_1_1) = 0, yields: % 3.07/1.49 | (23) ? [v0] : ( ~ (v0 = 0) & member(all_14_1_5, all_0_2_2) = v0 & member(all_14_1_5, all_0_3_3) = 0) % 3.07/1.49 | % 3.07/1.49 | Instantiating (23) with all_25_0_6 yields: % 3.07/1.49 | (24) ~ (all_25_0_6 = 0) & member(all_14_1_5, all_0_2_2) = all_25_0_6 & member(all_14_1_5, all_0_3_3) = 0 % 3.07/1.49 | % 3.07/1.49 | Applying alpha-rule on (24) yields: % 3.07/1.49 | (25) ~ (all_25_0_6 = 0) % 3.07/1.49 | (26) member(all_14_1_5, all_0_2_2) = all_25_0_6 % 3.07/1.49 | (27) member(all_14_1_5, all_0_3_3) = 0 % 3.07/1.49 | % 3.07/1.49 +-Applying beta-rule and splitting (22), into two cases. % 3.07/1.49 |-Branch one: % 3.07/1.49 | (28) ~ (member(all_14_1_5, all_0_3_3) = 0) % 3.07/1.49 | % 3.07/1.49 | Using (27) and (28) yields: % 3.07/1.49 | (29) $false % 3.07/1.49 | % 3.07/1.49 |-The branch is then unsatisfiable % 3.07/1.49 |-Branch two: % 3.07/1.49 | (27) member(all_14_1_5, all_0_3_3) = 0 % 3.07/1.49 | (31) all_14_0_4 = 0 % 3.07/1.49 | % 3.07/1.49 | Equations (31) can reduce 19 to: % 3.07/1.49 | (15) $false % 3.07/1.49 | % 3.07/1.49 |-The branch is then unsatisfiable % 3.07/1.49 % SZS output end Proof for theBenchmark % 3.07/1.50 % 3.07/1.50 876ms %------------------------------------------------------------------------------