%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS139+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n019.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.39s 1.36s % Output : Proof 3.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS139+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n019.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 7 13:47:40 EDT 2022 % 0.12/0.34 % CPUTime : % 0.59/0.60 ____ _ % 0.59/0.60 ___ / __ \_____(_)___ ________ __________ % 0.59/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.60 % 0.59/0.60 A Theorem Prover for First-Order Logic % 0.59/0.60 (ePrincess v.1.0) % 0.59/0.60 % 0.59/0.60 (c) Philipp Rümmer, 2009-2015 % 0.59/0.60 (c) Peter Backeman, 2014-2015 % 0.59/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.60 Bug reports to peter@backeman.se % 0.59/0.60 % 0.59/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.60 % 0.59/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.68/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.34/0.98 Prover 0: Preprocessing ... % 1.49/1.07 Prover 0: Warning: ignoring some quantifiers % 1.49/1.08 Prover 0: Constructing countermodel ... % 1.88/1.19 Prover 0: gave up % 1.88/1.19 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.95/1.21 Prover 1: Preprocessing ... % 2.13/1.29 Prover 1: Constructing countermodel ... % 2.39/1.36 Prover 1: proved (167ms) % 2.39/1.36 % 2.39/1.36 No countermodel exists, formula is valid % 2.39/1.36 % SZS status Theorem for theBenchmark % 2.39/1.36 % 2.39/1.36 Generating proof ... found it (size 45) % 3.09/1.55 % 3.09/1.55 % SZS output start Proof for theBenchmark % 3.09/1.55 Assumed formulas after preprocessing and simplification: % 3.09/1.55 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : (rpath(iGhent, iAntwerp) = 0 & rpath(iAntwerp, iGhent) = v0 & cowlThing(iGhent) = 0 & cowlThing(iAntwerp) = 0 & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (rpath(v7, v6) = v5) | ~ (rpath(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (xsd_string(v6) = v5) | ~ (xsd_string(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (xsd_integer(v6) = v5) | ~ (xsd_integer(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (cowlNothing(v6) = v5) | ~ (cowlNothing(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (cowlThing(v6) = v5) | ~ (cowlThing(v6) = v4)) & ! [v4] : ! [v5] : (v5 = 0 | ~ (xsd_string(v4) = v5) | xsd_integer(v4) = 0) & ! [v4] : ! [v5] : (v5 = 0 | ~ (cowlThing(v4) = v5)) & ! [v4] : ! [v5] : ( ~ (rpath(v4, v5) = 0) | rpath(v5, v4) = 0) & ! [v4] : ( ~ (xsd_string(v4) = 0) | ? [v5] : ( ~ (v5 = 0) & xsd_integer(v4) = v5)) & ! [v4] : ~ (cowlNothing(v4) = 0) & ( ~ (v0 = 0) | (xsd_string(v1) = v2 & xsd_integer(v1) = v3 & ((v3 = 0 & v2 = 0) | ( ~ (v3 = 0) & ~ (v2 = 0)))) | (cowlNothing(v1) = v3 & cowlThing(v1) = v2 & ( ~ (v2 = 0) | v3 = 0)))) % 3.09/1.59 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 3.09/1.59 | (1) rpath(iGhent, iAntwerp) = 0 & rpath(iAntwerp, iGhent) = all_0_3_3 & cowlThing(iGhent) = 0 & cowlThing(iAntwerp) = 0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (rpath(v3, v2) = v1) | ~ (rpath(v3, 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] : ! [v1] : ( ~ (rpath(v0, v1) = 0) | rpath(v1, v0) = 0) & ! [v0] : ( ~ (xsd_string(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) & ! [v0] : ~ (cowlNothing(v0) = 0) & ( ~ (all_0_3_3 = 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))) % 3.09/1.59 | % 3.09/1.59 | Applying alpha-rule on (1) yields: % 3.09/1.59 | (2) rpath(iAntwerp, iGhent) = all_0_3_3 % 3.09/1.59 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 3.09/1.59 | (4) cowlThing(iGhent) = 0 % 3.09/1.59 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (rpath(v3, v2) = v1) | ~ (rpath(v3, v2) = v0)) % 3.09/1.59 | (6) ! [v0] : ( ~ (xsd_string(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) % 3.09/1.59 | (7) ! [v0] : ! [v1] : ( ~ (rpath(v0, v1) = 0) | rpath(v1, v0) = 0) % 3.09/1.59 | (8) ! [v0] : ! [v1] : (v1 = 0 | ~ (xsd_string(v0) = v1) | xsd_integer(v0) = 0) % 3.09/1.60 | (9) ! [v0] : ! [v1] : (v1 = 0 | ~ (cowlThing(v0) = v1)) % 3.09/1.60 | (10) ! [v0] : ~ (cowlNothing(v0) = 0) % 3.09/1.60 | (11) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) % 3.09/1.60 | (12) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) % 3.09/1.60 | (13) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 3.09/1.60 | (14) ~ (all_0_3_3 = 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)) % 3.09/1.60 | (15) cowlThing(iAntwerp) = 0 % 3.09/1.60 | (16) rpath(iGhent, iAntwerp) = 0 % 3.09/1.60 | % 3.09/1.60 | Instantiating formula (7) with iAntwerp, iGhent and discharging atoms rpath(iGhent, iAntwerp) = 0, yields: % 3.09/1.60 | (17) rpath(iAntwerp, iGhent) = 0 % 3.09/1.60 | % 3.09/1.60 | Instantiating formula (5) with iAntwerp, iGhent, 0, all_0_3_3 and discharging atoms rpath(iAntwerp, iGhent) = all_0_3_3, rpath(iAntwerp, iGhent) = 0, yields: % 3.31/1.60 | (18) all_0_3_3 = 0 % 3.31/1.60 | % 3.31/1.60 +-Applying beta-rule and splitting (14), into two cases. % 3.31/1.60 |-Branch one: % 3.31/1.60 | (19) ~ (all_0_3_3 = 0) % 3.31/1.60 | % 3.31/1.60 | Equations (18) can reduce 19 to: % 3.31/1.60 | (20) $false % 3.31/1.60 | % 3.31/1.60 |-The branch is then unsatisfiable % 3.31/1.60 |-Branch two: % 3.31/1.60 | (18) all_0_3_3 = 0 % 3.31/1.60 | (22) (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)) % 3.31/1.60 | % 3.31/1.60 +-Applying beta-rule and splitting (22), into two cases. % 3.31/1.60 |-Branch one: % 3.31/1.60 | (23) 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))) % 3.31/1.60 | % 3.31/1.60 | Applying alpha-rule on (23) yields: % 3.31/1.60 | (24) xsd_string(all_0_2_2) = all_0_1_1 % 3.31/1.60 | (25) xsd_integer(all_0_2_2) = all_0_0_0 % 3.31/1.60 | (26) (all_0_0_0 = 0 & all_0_1_1 = 0) | ( ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0)) % 3.31/1.60 | % 3.31/1.60 | Instantiating formula (6) with all_0_2_2 yields: % 3.31/1.61 | (27) ~ (xsd_string(all_0_2_2) = 0) | ? [v0] : ( ~ (v0 = 0) & xsd_integer(all_0_2_2) = v0) % 3.31/1.61 | % 3.31/1.61 | Instantiating formula (8) with all_0_1_1, all_0_2_2 and discharging atoms xsd_string(all_0_2_2) = all_0_1_1, yields: % 3.31/1.61 | (28) all_0_1_1 = 0 | xsd_integer(all_0_2_2) = 0 % 3.31/1.61 | % 3.31/1.61 +-Applying beta-rule and splitting (28), into two cases. % 3.31/1.61 |-Branch one: % 3.31/1.61 | (29) xsd_integer(all_0_2_2) = 0 % 3.31/1.61 | % 3.31/1.61 | 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: % 3.31/1.61 | (30) all_0_0_0 = 0 % 3.31/1.61 | % 3.31/1.61 | From (30) and (25) follows: % 3.31/1.61 | (29) xsd_integer(all_0_2_2) = 0 % 3.31/1.61 | % 3.31/1.61 +-Applying beta-rule and splitting (27), into two cases. % 3.31/1.61 |-Branch one: % 3.31/1.61 | (32) ~ (xsd_string(all_0_2_2) = 0) % 3.31/1.61 | % 3.31/1.61 +-Applying beta-rule and splitting (26), into two cases. % 3.31/1.61 |-Branch one: % 3.31/1.61 | (33) all_0_0_0 = 0 & all_0_1_1 = 0 % 3.31/1.61 | % 3.31/1.61 | Applying alpha-rule on (33) yields: % 3.31/1.61 | (30) all_0_0_0 = 0 % 3.31/1.61 | (35) all_0_1_1 = 0 % 3.31/1.61 | % 3.31/1.61 | From (35) and (24) follows: % 3.31/1.61 | (36) xsd_string(all_0_2_2) = 0 % 3.31/1.61 | % 3.31/1.61 | Using (36) and (32) yields: % 3.31/1.61 | (37) $false % 3.31/1.61 | % 3.31/1.61 |-The branch is then unsatisfiable % 3.31/1.61 |-Branch two: % 3.31/1.61 | (38) ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0) % 3.31/1.61 | % 3.31/1.61 | Applying alpha-rule on (38) yields: % 3.31/1.61 | (39) ~ (all_0_0_0 = 0) % 3.31/1.61 | (40) ~ (all_0_1_1 = 0) % 3.31/1.61 | % 3.31/1.61 | Equations (30) can reduce 39 to: % 3.31/1.61 | (20) $false % 3.31/1.61 | % 3.31/1.61 |-The branch is then unsatisfiable % 3.31/1.61 |-Branch two: % 3.31/1.61 | (36) xsd_string(all_0_2_2) = 0 % 3.31/1.61 | (43) ? [v0] : ( ~ (v0 = 0) & xsd_integer(all_0_2_2) = v0) % 3.31/1.61 | % 3.31/1.61 | Instantiating (43) with all_42_0_4 yields: % 3.31/1.61 | (44) ~ (all_42_0_4 = 0) & xsd_integer(all_0_2_2) = all_42_0_4 % 3.31/1.61 | % 3.31/1.61 | Applying alpha-rule on (44) yields: % 3.31/1.61 | (45) ~ (all_42_0_4 = 0) % 3.31/1.61 | (46) xsd_integer(all_0_2_2) = all_42_0_4 % 3.31/1.61 | % 3.31/1.61 | Instantiating formula (3) with all_0_2_2, all_42_0_4, 0 and discharging atoms xsd_integer(all_0_2_2) = all_42_0_4, xsd_integer(all_0_2_2) = 0, yields: % 3.31/1.61 | (47) all_42_0_4 = 0 % 3.31/1.61 | % 3.31/1.61 | Equations (47) can reduce 45 to: % 3.31/1.61 | (20) $false % 3.31/1.61 | % 3.31/1.61 |-The branch is then unsatisfiable % 3.31/1.61 |-Branch two: % 3.31/1.61 | (49) ~ (xsd_integer(all_0_2_2) = 0) % 3.31/1.61 | (35) all_0_1_1 = 0 % 3.31/1.61 | % 3.31/1.61 +-Applying beta-rule and splitting (26), into two cases. % 3.31/1.61 |-Branch one: % 3.31/1.61 | (33) all_0_0_0 = 0 & all_0_1_1 = 0 % 3.31/1.61 | % 3.31/1.61 | Applying alpha-rule on (33) yields: % 3.31/1.61 | (30) all_0_0_0 = 0 % 3.31/1.61 | (35) all_0_1_1 = 0 % 3.31/1.61 | % 3.31/1.61 | From (30) and (25) follows: % 3.31/1.61 | (29) xsd_integer(all_0_2_2) = 0 % 3.31/1.61 | % 3.31/1.61 | Using (29) and (49) yields: % 3.31/1.61 | (37) $false % 3.31/1.61 | % 3.31/1.61 |-The branch is then unsatisfiable % 3.31/1.61 |-Branch two: % 3.31/1.61 | (38) ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0) % 3.31/1.61 | % 3.31/1.62 | Applying alpha-rule on (38) yields: % 3.31/1.62 | (39) ~ (all_0_0_0 = 0) % 3.31/1.62 | (40) ~ (all_0_1_1 = 0) % 3.31/1.62 | % 3.31/1.62 | Equations (35) can reduce 40 to: % 3.31/1.62 | (20) $false % 3.31/1.62 | % 3.31/1.62 |-The branch is then unsatisfiable % 3.31/1.62 |-Branch two: % 3.31/1.62 | (60) 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) % 3.31/1.62 | % 3.31/1.62 | Applying alpha-rule on (60) yields: % 3.31/1.62 | (61) cowlNothing(all_0_2_2) = all_0_0_0 % 3.31/1.62 | (62) cowlThing(all_0_2_2) = all_0_1_1 % 3.31/1.62 | (63) ~ (all_0_1_1 = 0) | all_0_0_0 = 0 % 3.31/1.62 | % 3.31/1.62 | Instantiating formula (10) with all_0_2_2 yields: % 3.31/1.62 | (64) ~ (cowlNothing(all_0_2_2) = 0) % 3.31/1.62 | % 3.31/1.62 | 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: % 3.31/1.62 | (35) all_0_1_1 = 0 % 3.31/1.62 | % 3.31/1.62 +-Applying beta-rule and splitting (63), into two cases. % 3.31/1.62 |-Branch one: % 3.31/1.62 | (40) ~ (all_0_1_1 = 0) % 3.31/1.62 | % 3.31/1.62 | Equations (35) can reduce 40 to: % 3.31/1.62 | (20) $false % 3.31/1.62 | % 3.31/1.62 |-The branch is then unsatisfiable % 3.31/1.62 |-Branch two: % 3.31/1.62 | (35) all_0_1_1 = 0 % 3.31/1.62 | (30) all_0_0_0 = 0 % 3.31/1.62 | % 3.31/1.62 | From (30) and (61) follows: % 3.31/1.62 | (70) cowlNothing(all_0_2_2) = 0 % 3.31/1.62 | % 3.31/1.62 | Using (70) and (64) yields: % 3.31/1.62 | (37) $false % 3.31/1.62 | % 3.31/1.62 |-The branch is then unsatisfiable % 3.31/1.62 % SZS output end Proof for theBenchmark % 3.31/1.62 % 3.31/1.62 1005ms %------------------------------------------------------------------------------