%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS168+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n021.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:46 EDT 2022 % Result : Theorem 2.26s 1.18s % Output : Proof 2.81s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS168+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n021.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 19:44:21 EDT 2022 % 0.12/0.33 % CPUTime : % 0.55/0.58 ____ _ % 0.55/0.58 ___ / __ \_____(_)___ ________ __________ % 0.55/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.55/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.55/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.55/0.58 % 0.55/0.58 A Theorem Prover for First-Order Logic % 0.55/0.59 (ePrincess v.1.0) % 0.55/0.59 % 0.55/0.59 (c) Philipp Rümmer, 2009-2015 % 0.55/0.59 (c) Peter Backeman, 2014-2015 % 0.55/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.55/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.55/0.59 Bug reports to peter@backeman.se % 0.55/0.59 % 0.55/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.55/0.59 % 0.55/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.75/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.34/0.88 Prover 0: Preprocessing ... % 1.50/0.94 Prover 0: Warning: ignoring some quantifiers % 1.50/0.96 Prover 0: Constructing countermodel ... % 1.68/1.04 Prover 0: gave up % 1.68/1.05 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.68/1.06 Prover 1: Preprocessing ... % 1.90/1.13 Prover 1: Constructing countermodel ... % 2.26/1.18 Prover 1: proved (130ms) % 2.26/1.18 % 2.26/1.18 No countermodel exists, formula is valid % 2.26/1.18 % SZS status Theorem for theBenchmark % 2.26/1.18 % 2.26/1.18 Generating proof ... found it (size 40) % 2.65/1.36 % 2.65/1.36 % SZS output start Proof for theBenchmark % 2.65/1.36 Assumed formulas after preprocessing and simplification: % 2.65/1.36 | (0) ? [v0] : ? [v1] : ? [v2] : ( ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (cB(v5) = v4) | ~ (cB(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (cA(v5) = v4) | ~ (cA(v5) = v3)) & ! [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.81/1.39 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.81/1.39 | (1) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cB(v2) = v1) | ~ (cB(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cA(v2) = v1) | ~ (cA(v2) = v0)) & ! [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.81/1.39 | % 2.81/1.39 | Applying alpha-rule on (1) yields: % 2.81/1.39 | (2) ! [v0] : ! [v1] : (v1 = 0 | ~ (xsd_string(v0) = v1) | xsd_integer(v0) = 0) % 2.81/1.39 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 2.81/1.39 | (4) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cB(v2) = v1) | ~ (cB(v2) = v0)) % 2.81/1.39 | (5) ! [v0] : ( ~ (xsd_string(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) % 2.81/1.40 | (6) ! [v0] : ! [v1] : (v1 = 0 | ~ (cowlThing(v0) = v1)) % 2.81/1.40 | (7) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) % 2.81/1.40 | (8) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cA(v2) = v1) | ~ (cA(v2) = v0)) % 2.81/1.40 | (9) ! [v0] : ~ (cowlNothing(v0) = 0) % 2.81/1.40 | (10) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 2.81/1.40 | (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)))) | (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.81/1.40 | (12) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) % 2.81/1.40 | % 2.81/1.40 +-Applying beta-rule and splitting (11), into two cases. % 2.81/1.40 |-Branch one: % 2.81/1.40 | (13) 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.81/1.40 | % 2.81/1.40 | Applying alpha-rule on (13) yields: % 2.81/1.40 | (14) xsd_string(all_0_2_2) = all_0_1_1 % 2.81/1.40 | (15) xsd_integer(all_0_2_2) = all_0_0_0 % 2.81/1.40 | (16) (all_0_0_0 = 0 & all_0_1_1 = 0) | ( ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0)) % 2.81/1.40 | % 2.81/1.40 | Instantiating formula (5) with all_0_2_2 yields: % 2.81/1.40 | (17) ~ (xsd_string(all_0_2_2) = 0) | ? [v0] : ( ~ (v0 = 0) & xsd_integer(all_0_2_2) = v0) % 2.81/1.40 | % 2.81/1.40 | Instantiating formula (2) with all_0_1_1, all_0_2_2 and discharging atoms xsd_string(all_0_2_2) = all_0_1_1, yields: % 2.81/1.40 | (18) all_0_1_1 = 0 | xsd_integer(all_0_2_2) = 0 % 2.81/1.40 | % 2.81/1.40 +-Applying beta-rule and splitting (18), into two cases. % 2.81/1.40 |-Branch one: % 2.81/1.40 | (19) xsd_integer(all_0_2_2) = 0 % 2.81/1.40 | % 2.81/1.40 | Instantiating formula (3) 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.81/1.40 | (20) all_0_0_0 = 0 % 2.81/1.40 | % 2.81/1.40 | From (20) and (15) follows: % 2.81/1.40 | (19) xsd_integer(all_0_2_2) = 0 % 2.81/1.40 | % 2.81/1.40 +-Applying beta-rule and splitting (17), into two cases. % 2.81/1.40 |-Branch one: % 2.81/1.40 | (22) ~ (xsd_string(all_0_2_2) = 0) % 2.81/1.40 | % 2.81/1.40 +-Applying beta-rule and splitting (16), into two cases. % 2.81/1.40 |-Branch one: % 2.81/1.40 | (23) all_0_0_0 = 0 & all_0_1_1 = 0 % 2.81/1.40 | % 2.81/1.40 | Applying alpha-rule on (23) yields: % 2.81/1.40 | (20) all_0_0_0 = 0 % 2.81/1.40 | (25) all_0_1_1 = 0 % 2.81/1.41 | % 2.81/1.41 | From (25) and (14) follows: % 2.81/1.41 | (26) xsd_string(all_0_2_2) = 0 % 2.81/1.41 | % 2.81/1.41 | Using (26) and (22) yields: % 2.81/1.41 | (27) $false % 2.81/1.41 | % 2.81/1.41 |-The branch is then unsatisfiable % 2.81/1.41 |-Branch two: % 2.81/1.41 | (28) ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0) % 2.81/1.41 | % 2.81/1.41 | Applying alpha-rule on (28) yields: % 2.81/1.41 | (29) ~ (all_0_0_0 = 0) % 2.81/1.41 | (30) ~ (all_0_1_1 = 0) % 2.81/1.41 | % 2.81/1.41 | Equations (20) can reduce 29 to: % 2.81/1.41 | (31) $false % 2.81/1.41 | % 2.81/1.41 |-The branch is then unsatisfiable % 2.81/1.41 |-Branch two: % 2.81/1.41 | (26) xsd_string(all_0_2_2) = 0 % 2.81/1.41 | (33) ? [v0] : ( ~ (v0 = 0) & xsd_integer(all_0_2_2) = v0) % 2.81/1.41 | % 2.81/1.41 | Instantiating (33) with all_21_0_3 yields: % 2.81/1.41 | (34) ~ (all_21_0_3 = 0) & xsd_integer(all_0_2_2) = all_21_0_3 % 2.81/1.41 | % 2.81/1.41 | Applying alpha-rule on (34) yields: % 2.81/1.41 | (35) ~ (all_21_0_3 = 0) % 2.81/1.41 | (36) xsd_integer(all_0_2_2) = all_21_0_3 % 2.81/1.41 | % 2.81/1.41 | Instantiating formula (3) 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.81/1.41 | (37) all_21_0_3 = 0 % 2.81/1.41 | % 2.81/1.41 | Equations (37) can reduce 35 to: % 2.81/1.41 | (31) $false % 2.81/1.41 | % 2.81/1.41 |-The branch is then unsatisfiable % 2.81/1.41 |-Branch two: % 2.81/1.41 | (39) ~ (xsd_integer(all_0_2_2) = 0) % 2.81/1.41 | (25) all_0_1_1 = 0 % 2.81/1.41 | % 2.81/1.41 +-Applying beta-rule and splitting (16), into two cases. % 2.81/1.41 |-Branch one: % 2.81/1.41 | (23) all_0_0_0 = 0 & all_0_1_1 = 0 % 2.81/1.41 | % 2.81/1.41 | Applying alpha-rule on (23) yields: % 2.81/1.41 | (20) all_0_0_0 = 0 % 2.81/1.41 | (25) all_0_1_1 = 0 % 2.81/1.41 | % 2.81/1.41 | From (20) and (15) follows: % 2.81/1.41 | (19) xsd_integer(all_0_2_2) = 0 % 2.81/1.41 | % 2.81/1.41 | Using (19) and (39) yields: % 2.81/1.41 | (27) $false % 2.81/1.41 | % 2.81/1.41 |-The branch is then unsatisfiable % 2.81/1.41 |-Branch two: % 2.81/1.41 | (28) ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0) % 2.81/1.41 | % 2.81/1.41 | Applying alpha-rule on (28) yields: % 2.81/1.41 | (29) ~ (all_0_0_0 = 0) % 2.81/1.41 | (30) ~ (all_0_1_1 = 0) % 2.81/1.41 | % 2.81/1.41 | Equations (25) can reduce 30 to: % 2.81/1.41 | (31) $false % 2.81/1.41 | % 2.81/1.41 |-The branch is then unsatisfiable % 2.81/1.41 |-Branch two: % 2.81/1.41 | (50) 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.81/1.41 | % 2.81/1.41 | Applying alpha-rule on (50) yields: % 2.81/1.41 | (51) cowlNothing(all_0_2_2) = all_0_0_0 % 2.81/1.41 | (52) cowlThing(all_0_2_2) = all_0_1_1 % 2.81/1.41 | (53) ~ (all_0_1_1 = 0) | all_0_0_0 = 0 % 2.81/1.41 | % 2.81/1.41 | Instantiating formula (9) with all_0_2_2 yields: % 2.81/1.41 | (54) ~ (cowlNothing(all_0_2_2) = 0) % 2.81/1.41 | % 2.81/1.41 | Instantiating formula (6) with all_0_1_1, all_0_2_2 and discharging atoms cowlThing(all_0_2_2) = all_0_1_1, yields: % 2.81/1.41 | (25) all_0_1_1 = 0 % 2.81/1.41 | % 2.81/1.41 +-Applying beta-rule and splitting (53), into two cases. % 2.81/1.41 |-Branch one: % 2.81/1.41 | (30) ~ (all_0_1_1 = 0) % 2.81/1.41 | % 2.81/1.41 | Equations (25) can reduce 30 to: % 2.81/1.41 | (31) $false % 2.81/1.41 | % 2.81/1.41 |-The branch is then unsatisfiable % 2.81/1.41 |-Branch two: % 2.81/1.41 | (25) all_0_1_1 = 0 % 2.81/1.41 | (20) all_0_0_0 = 0 % 2.81/1.41 | % 2.81/1.41 | From (20) and (51) follows: % 2.81/1.41 | (60) cowlNothing(all_0_2_2) = 0 % 2.81/1.41 | % 2.81/1.41 | Using (60) and (54) yields: % 2.81/1.41 | (27) $false % 2.81/1.41 | % 2.81/1.41 |-The branch is then unsatisfiable % 2.81/1.41 % SZS output end Proof for theBenchmark % 2.81/1.41 % 2.81/1.41 819ms %------------------------------------------------------------------------------