%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS136+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n017.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 : Sun Jul 17 02:56:40 EDT 2022 % Result : Theorem 2.10s 1.15s % Output : Proof 2.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : KRS136+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n017.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 Jun 7 16:11:47 EDT 2022 % 0.12/0.33 % CPUTime : % 0.61/0.59 ____ _ % 0.61/0.59 ___ / __ \_____(_)___ ________ __________ % 0.61/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.61/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.61/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.61/0.59 % 0.61/0.59 A Theorem Prover for First-Order Logic % 0.61/0.59 (ePrincess v.1.0) % 0.61/0.59 % 0.61/0.59 (c) Philipp Rümmer, 2009-2015 % 0.61/0.59 (c) Peter Backeman, 2014-2015 % 0.61/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.61/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.61/0.59 Bug reports to peter@backeman.se % 0.61/0.59 % 0.61/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.61/0.59 % 0.61/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.18/0.86 Prover 0: Preprocessing ... % 1.35/0.92 Prover 0: Warning: ignoring some quantifiers % 1.35/0.93 Prover 0: Constructing countermodel ... % 1.63/1.02 Prover 0: gave up % 1.73/1.02 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.73/1.04 Prover 1: Preprocessing ... % 1.73/1.10 Prover 1: Constructing countermodel ... % 2.10/1.15 Prover 1: proved (122ms) % 2.10/1.15 % 2.10/1.15 No countermodel exists, formula is valid % 2.10/1.15 % SZS status Theorem for theBenchmark % 2.10/1.15 % 2.10/1.15 Generating proof ... found it (size 40) % 2.53/1.33 % 2.53/1.33 % SZS output start Proof for theBenchmark % 2.53/1.33 Assumed formulas after preprocessing and simplification: % 2.53/1.33 | (0) ? [v0] : ? [v1] : ? [v2] : ( ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (xsd_string(v5) = v4) | ~ (xsd_string(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (xsd_integer(v5) = v4) | ~ (xsd_integer(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (cowlNothing(v5) = v4) | ~ (cowlNothing(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (cowlThing(v5) = v4) | ~ (cowlThing(v5) = v3)) & ! [v3] : ! [v4] : (v4 = 0 | ~ (xsd_string(v3) = v4) | xsd_integer(v3) = 0) & ! [v3] : ! [v4] : (v4 = 0 | ~ (cowlThing(v3) = v4)) & ! [v3] : ( ~ (xsd_string(v3) = 0) | ? [v4] : ( ~ (v4 = 0) & xsd_integer(v3) = v4)) & ! [v3] : ~ (cowlNothing(v3) = 0) & ((xsd_string(v0) = v1 & xsd_integer(v0) = v2 & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) | (cowlNothing(v0) = v2 & cowlThing(v0) = v1 & ( ~ (v1 = 0) | v2 = 0)))) % 2.53/1.36 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.53/1.36 | (1) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (xsd_string(v0) = v1) | xsd_integer(v0) = 0) & ! [v0] : ! [v1] : (v1 = 0 | ~ (cowlThing(v0) = v1)) & ! [v0] : ( ~ (xsd_string(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) & ! [v0] : ~ (cowlNothing(v0) = 0) & ((xsd_string(all_0_2_2) = all_0_1_1 & xsd_integer(all_0_2_2) = all_0_0_0 & ((all_0_0_0 = 0 & all_0_1_1 = 0) | ( ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0)))) | (cowlNothing(all_0_2_2) = all_0_0_0 & cowlThing(all_0_2_2) = all_0_1_1 & ( ~ (all_0_1_1 = 0) | all_0_0_0 = 0))) % 2.53/1.36 | % 2.53/1.36 | Applying alpha-rule on (1) yields: % 2.53/1.36 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) % 2.53/1.36 | (3) (xsd_string(all_0_2_2) = all_0_1_1 & xsd_integer(all_0_2_2) = all_0_0_0 & ((all_0_0_0 = 0 & all_0_1_1 = 0) | ( ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0)))) | (cowlNothing(all_0_2_2) = all_0_0_0 & cowlThing(all_0_2_2) = all_0_1_1 & ( ~ (all_0_1_1 = 0) | all_0_0_0 = 0)) % 2.53/1.37 | (4) ! [v0] : ! [v1] : (v1 = 0 | ~ (xsd_string(v0) = v1) | xsd_integer(v0) = 0) % 2.53/1.37 | (5) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) % 2.53/1.37 | (6) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 2.53/1.37 | (7) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 2.53/1.37 | (8) ! [v0] : ~ (cowlNothing(v0) = 0) % 2.53/1.37 | (9) ! [v0] : ! [v1] : (v1 = 0 | ~ (cowlThing(v0) = v1)) % 2.53/1.37 | (10) ! [v0] : ( ~ (xsd_string(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) % 2.53/1.37 | % 2.53/1.37 +-Applying beta-rule and splitting (3), into two cases. % 2.53/1.37 |-Branch one: % 2.53/1.37 | (11) xsd_string(all_0_2_2) = all_0_1_1 & xsd_integer(all_0_2_2) = all_0_0_0 & ((all_0_0_0 = 0 & all_0_1_1 = 0) | ( ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0))) % 2.53/1.37 | % 2.53/1.37 | Applying alpha-rule on (11) yields: % 2.53/1.37 | (12) xsd_string(all_0_2_2) = all_0_1_1 % 2.53/1.37 | (13) xsd_integer(all_0_2_2) = all_0_0_0 % 2.53/1.37 | (14) (all_0_0_0 = 0 & all_0_1_1 = 0) | ( ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0)) % 2.53/1.37 | % 2.53/1.37 | Instantiating formula (10) with all_0_2_2 yields: % 2.53/1.37 | (15) ~ (xsd_string(all_0_2_2) = 0) | ? [v0] : ( ~ (v0 = 0) & xsd_integer(all_0_2_2) = v0) % 2.53/1.37 | % 2.53/1.37 | Instantiating formula (4) with all_0_1_1, all_0_2_2 and discharging atoms xsd_string(all_0_2_2) = all_0_1_1, yields: % 2.53/1.37 | (16) all_0_1_1 = 0 | xsd_integer(all_0_2_2) = 0 % 2.53/1.37 | % 2.53/1.37 +-Applying beta-rule and splitting (16), into two cases. % 2.53/1.37 |-Branch one: % 2.53/1.37 | (17) xsd_integer(all_0_2_2) = 0 % 2.53/1.37 | % 2.53/1.37 | Instantiating formula (6) with all_0_2_2, 0, all_0_0_0 and discharging atoms xsd_integer(all_0_2_2) = all_0_0_0, xsd_integer(all_0_2_2) = 0, yields: % 2.53/1.37 | (18) all_0_0_0 = 0 % 2.53/1.37 | % 2.53/1.37 | From (18) and (13) follows: % 2.53/1.37 | (17) xsd_integer(all_0_2_2) = 0 % 2.53/1.37 | % 2.53/1.37 +-Applying beta-rule and splitting (15), into two cases. % 2.53/1.37 |-Branch one: % 2.53/1.37 | (20) ~ (xsd_string(all_0_2_2) = 0) % 2.53/1.37 | % 2.53/1.37 +-Applying beta-rule and splitting (14), into two cases. % 2.53/1.37 |-Branch one: % 2.53/1.37 | (21) all_0_0_0 = 0 & all_0_1_1 = 0 % 2.53/1.37 | % 2.53/1.38 | Applying alpha-rule on (21) yields: % 2.53/1.38 | (18) all_0_0_0 = 0 % 2.53/1.38 | (23) all_0_1_1 = 0 % 2.53/1.38 | % 2.53/1.38 | From (23) and (12) follows: % 2.53/1.38 | (24) xsd_string(all_0_2_2) = 0 % 2.53/1.38 | % 2.53/1.38 | Using (24) and (20) yields: % 2.53/1.38 | (25) $false % 2.53/1.38 | % 2.53/1.38 |-The branch is then unsatisfiable % 2.53/1.38 |-Branch two: % 2.53/1.38 | (26) ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0) % 2.53/1.38 | % 2.53/1.38 | Applying alpha-rule on (26) yields: % 2.53/1.38 | (27) ~ (all_0_0_0 = 0) % 2.53/1.38 | (28) ~ (all_0_1_1 = 0) % 2.53/1.38 | % 2.53/1.38 | Equations (18) can reduce 27 to: % 2.53/1.38 | (29) $false % 2.53/1.38 | % 2.53/1.38 |-The branch is then unsatisfiable % 2.53/1.38 |-Branch two: % 2.53/1.38 | (24) xsd_string(all_0_2_2) = 0 % 2.53/1.38 | (31) ? [v0] : ( ~ (v0 = 0) & xsd_integer(all_0_2_2) = v0) % 2.53/1.38 | % 2.53/1.38 | Instantiating (31) with all_21_0_3 yields: % 2.53/1.38 | (32) ~ (all_21_0_3 = 0) & xsd_integer(all_0_2_2) = all_21_0_3 % 2.53/1.38 | % 2.53/1.38 | Applying alpha-rule on (32) yields: % 2.53/1.38 | (33) ~ (all_21_0_3 = 0) % 2.53/1.38 | (34) xsd_integer(all_0_2_2) = all_21_0_3 % 2.53/1.38 | % 2.53/1.38 | Instantiating formula (6) with all_0_2_2, all_21_0_3, 0 and discharging atoms xsd_integer(all_0_2_2) = all_21_0_3, xsd_integer(all_0_2_2) = 0, yields: % 2.53/1.38 | (35) all_21_0_3 = 0 % 2.53/1.38 | % 2.53/1.38 | Equations (35) can reduce 33 to: % 2.53/1.38 | (29) $false % 2.53/1.38 | % 2.53/1.38 |-The branch is then unsatisfiable % 2.53/1.38 |-Branch two: % 2.53/1.38 | (37) ~ (xsd_integer(all_0_2_2) = 0) % 2.53/1.38 | (23) all_0_1_1 = 0 % 2.53/1.38 | % 2.53/1.38 +-Applying beta-rule and splitting (14), into two cases. % 2.53/1.38 |-Branch one: % 2.53/1.38 | (21) all_0_0_0 = 0 & all_0_1_1 = 0 % 2.53/1.38 | % 2.53/1.38 | Applying alpha-rule on (21) yields: % 2.53/1.38 | (18) all_0_0_0 = 0 % 2.53/1.38 | (23) all_0_1_1 = 0 % 2.53/1.38 | % 2.53/1.38 | From (18) and (13) follows: % 2.53/1.38 | (17) xsd_integer(all_0_2_2) = 0 % 2.53/1.38 | % 2.53/1.38 | Using (17) and (37) yields: % 2.53/1.38 | (25) $false % 2.53/1.38 | % 2.53/1.38 |-The branch is then unsatisfiable % 2.53/1.38 |-Branch two: % 2.53/1.38 | (26) ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0) % 2.53/1.38 | % 2.53/1.38 | Applying alpha-rule on (26) yields: % 2.53/1.38 | (27) ~ (all_0_0_0 = 0) % 2.53/1.38 | (28) ~ (all_0_1_1 = 0) % 2.53/1.38 | % 2.53/1.38 | Equations (23) can reduce 28 to: % 2.53/1.38 | (29) $false % 2.53/1.38 | % 2.53/1.38 |-The branch is then unsatisfiable % 2.53/1.38 |-Branch two: % 2.53/1.38 | (48) cowlNothing(all_0_2_2) = all_0_0_0 & cowlThing(all_0_2_2) = all_0_1_1 & ( ~ (all_0_1_1 = 0) | all_0_0_0 = 0) % 2.53/1.38 | % 2.53/1.38 | Applying alpha-rule on (48) yields: % 2.53/1.38 | (49) cowlNothing(all_0_2_2) = all_0_0_0 % 2.53/1.38 | (50) cowlThing(all_0_2_2) = all_0_1_1 % 2.53/1.38 | (51) ~ (all_0_1_1 = 0) | all_0_0_0 = 0 % 2.53/1.38 | % 2.53/1.38 | Instantiating formula (8) with all_0_2_2 yields: % 2.53/1.38 | (52) ~ (cowlNothing(all_0_2_2) = 0) % 2.53/1.38 | % 2.53/1.38 | Instantiating formula (9) with all_0_1_1, all_0_2_2 and discharging atoms cowlThing(all_0_2_2) = all_0_1_1, yields: % 2.53/1.38 | (23) all_0_1_1 = 0 % 2.53/1.38 | % 2.53/1.38 +-Applying beta-rule and splitting (51), into two cases. % 2.53/1.38 |-Branch one: % 2.53/1.38 | (28) ~ (all_0_1_1 = 0) % 2.53/1.38 | % 2.53/1.38 | Equations (23) can reduce 28 to: % 2.53/1.38 | (29) $false % 2.53/1.38 | % 2.53/1.38 |-The branch is then unsatisfiable % 2.53/1.38 |-Branch two: % 2.53/1.38 | (23) all_0_1_1 = 0 % 2.53/1.38 | (18) all_0_0_0 = 0 % 2.53/1.38 | % 2.53/1.38 | From (18) and (49) follows: % 2.53/1.38 | (58) cowlNothing(all_0_2_2) = 0 % 2.53/1.38 | % 2.53/1.38 | Using (58) and (52) yields: % 2.53/1.38 | (25) $false % 2.53/1.38 | % 2.53/1.38 |-The branch is then unsatisfiable % 2.53/1.38 % SZS output end Proof for theBenchmark % 2.53/1.38 % 2.53/1.38 784ms %------------------------------------------------------------------------------