%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS135+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n028.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 4.47s 1.90s % Output : Proof 5.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KRS135+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n028.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue Jun 7 18:33:00 EDT 2022 % 0.19/0.33 % CPUTime : % 0.58/0.58 ____ _ % 0.58/0.58 ___ / __ \_____(_)___ ________ __________ % 0.58/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.58/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.58/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.58/0.58 % 0.58/0.58 A Theorem Prover for First-Order Logic % 0.58/0.58 (ePrincess v.1.0) % 0.58/0.58 % 0.58/0.58 (c) Philipp Rümmer, 2009-2015 % 0.58/0.58 (c) Peter Backeman, 2014-2015 % 0.58/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.58/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.58/0.58 Bug reports to peter@backeman.se % 0.58/0.58 % 0.58/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.58/0.58 % 0.58/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.77/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.39/0.91 Prover 0: Preprocessing ... % 1.47/0.97 Prover 0: Warning: ignoring some quantifiers % 1.47/0.99 Prover 0: Constructing countermodel ... % 1.83/1.09 Prover 0: gave up % 1.83/1.09 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.83/1.11 Prover 1: Preprocessing ... % 2.21/1.18 Prover 1: Constructing countermodel ... % 2.28/1.22 Prover 1: gave up % 2.28/1.22 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.35/1.23 Prover 2: Preprocessing ... % 2.35/1.29 Prover 2: Warning: ignoring some quantifiers % 2.35/1.30 Prover 2: Constructing countermodel ... % 2.62/1.37 Prover 2: gave up % 2.62/1.37 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.62/1.38 Prover 3: Preprocessing ... % 2.62/1.39 Prover 3: Warning: ignoring some quantifiers % 2.86/1.39 Prover 3: Constructing countermodel ... % 2.86/1.40 Prover 3: gave up % 2.86/1.40 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 2.86/1.41 Prover 4: Preprocessing ... % 2.86/1.45 Prover 4: Warning: ignoring some quantifiers % 2.86/1.46 Prover 4: Constructing countermodel ... % 3.45/1.53 Prover 4: gave up % 3.45/1.53 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 3.45/1.54 Prover 5: Preprocessing ... % 3.45/1.57 Prover 5: Constructing countermodel ... % 3.45/1.58 Prover 5: gave up % 3.45/1.58 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 3.45/1.59 Prover 6: Preprocessing ... % 3.45/1.61 Prover 6: Warning: ignoring some quantifiers % 3.45/1.62 Prover 6: Constructing countermodel ... % 3.89/1.65 Prover 6: gave up % 3.89/1.65 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 3.89/1.66 Prover 7: Preprocessing ... % 3.89/1.67 Prover 7: Proving ... % 4.47/1.90 Prover 7: proved (241ms) % 4.47/1.90 % 4.47/1.90 % SZS status Theorem for theBenchmark % 4.47/1.90 % 4.47/1.90 Generating proof ... found it (size 36) % 5.23/2.14 % 5.23/2.14 % SZS output start Proof for theBenchmark % 5.23/2.14 Assumed formulas after preprocessing and simplification: % 5.23/2.14 | (0) ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cowlThing(v0) | ! [v1] : ( ~ rprop(v0, v1) | cA(v1))) & ! [v0] : (xsd_integer(v0) | xsd_string(v0)) & ! [v0] : cowlThing(v0) & ( ? [v0] : ? [v1] : (rprop(v0, v1) & ~ cA(v1)) | ? [v0] : ( ~ cowlThing(v0) | cowlNothing(v0)) | ? [v0] : ((xsd_integer(v0) & xsd_string(v0)) | ( ~ xsd_integer(v0) & ~ xsd_string(v0)))) % 5.23/2.14 | Applying alpha-rule on (0) yields: % 5.23/2.14 | (1) ! [v0] : cowlThing(v0) % 5.23/2.14 | (2) ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) % 5.23/2.14 | (3) ? [v0] : ? [v1] : (rprop(v0, v1) & ~ cA(v1)) | ? [v0] : ( ~ cowlThing(v0) | cowlNothing(v0)) | ? [v0] : ((xsd_integer(v0) & xsd_string(v0)) | ( ~ xsd_integer(v0) & ~ xsd_string(v0))) % 5.23/2.14 | (4) ! [v0] : (xsd_integer(v0) | xsd_string(v0)) % 5.23/2.15 | (5) ! [v0] : ~ cowlNothing(v0) % 5.23/2.15 | (6) ! [v0] : ( ~ cowlThing(v0) | ! [v1] : ( ~ rprop(v0, v1) | cA(v1))) % 5.23/2.15 | % 5.23/2.15 +-Applying beta-rule and splitting (3), into two cases. % 5.23/2.15 |-Branch one: % 5.23/2.15 | (7) ? [v0] : ? [v1] : (rprop(v0, v1) & ~ cA(v1)) | ? [v0] : ( ~ cowlThing(v0) | cowlNothing(v0)) % 5.23/2.15 | % 5.23/2.15 +-Applying beta-rule and splitting (7), into two cases. % 5.23/2.15 |-Branch one: % 5.23/2.15 | (8) ? [v0] : ? [v1] : (rprop(v0, v1) & ~ cA(v1)) % 5.23/2.15 | % 5.23/2.15 | Instantiating (8) with all_2_0_0, all_2_1_1 yields: % 5.23/2.15 | (9) rprop(all_2_1_1, all_2_0_0) & ~ cA(all_2_0_0) % 5.23/2.15 | % 5.23/2.15 | Applying alpha-rule on (9) yields: % 5.23/2.15 | (10) rprop(all_2_1_1, all_2_0_0) % 5.23/2.15 | (11) ~ cA(all_2_0_0) % 5.23/2.15 | % 5.23/2.15 | Introducing new symbol ex_19_0_5 defined by: % 5.23/2.15 | (12) ex_19_0_5 = all_2_1_1 % 5.23/2.15 | % 5.23/2.15 | Instantiating formula (1) with ex_19_0_5 yields: % 5.23/2.15 | (13) cowlThing(ex_19_0_5) % 5.23/2.15 | % 5.23/2.15 | Instantiating formula (6) with ex_19_0_5 and discharging atoms cowlThing(ex_19_0_5), yields: % 5.23/2.15 | (14) ! [v0] : ( ~ rprop(ex_19_0_5, v0) | cA(v0)) % 5.23/2.15 | % 5.23/2.15 | Instantiating formula (14) with all_2_0_0 and discharging atoms ~ cA(all_2_0_0), yields: % 5.23/2.15 | (15) ~ rprop(ex_19_0_5, all_2_0_0) % 5.23/2.15 | % 5.23/2.15 | From (12) and (15) follows: % 5.23/2.15 | (16) ~ rprop(all_2_1_1, all_2_0_0) % 5.23/2.15 | % 5.23/2.15 | Using (10) and (16) yields: % 5.23/2.15 | (17) $false % 5.23/2.15 | % 5.23/2.15 |-The branch is then unsatisfiable % 5.23/2.15 |-Branch two: % 5.23/2.15 | (18) ? [v0] : ( ~ cowlThing(v0) | cowlNothing(v0)) % 5.23/2.15 | % 5.23/2.15 | Instantiating (18) with all_2_0_2 yields: % 5.23/2.15 | (19) ~ cowlThing(all_2_0_2) | cowlNothing(all_2_0_2) % 5.23/2.15 | % 5.23/2.15 +-Applying beta-rule and splitting (19), into two cases. % 5.23/2.15 |-Branch one: % 5.23/2.15 | (20) ~ cowlThing(all_2_0_2) % 5.23/2.15 | % 5.23/2.15 | Introducing new symbol ex_20_0_8 defined by: % 5.23/2.15 | (21) ex_20_0_8 = all_2_0_2 % 5.23/2.15 | % 5.23/2.15 | Instantiating formula (1) with ex_20_0_8 yields: % 5.23/2.15 | (22) cowlThing(ex_20_0_8) % 5.23/2.15 | % 5.23/2.15 | From (21) and (22) follows: % 5.23/2.15 | (23) cowlThing(all_2_0_2) % 5.23/2.15 | % 5.23/2.15 | Using (23) and (20) yields: % 5.23/2.15 | (17) $false % 5.23/2.15 | % 5.23/2.15 |-The branch is then unsatisfiable % 5.23/2.15 |-Branch two: % 5.23/2.15 | (25) cowlNothing(all_2_0_2) % 5.23/2.15 | % 5.23/2.15 | Instantiating formula (5) with all_2_0_2 and discharging atoms cowlNothing(all_2_0_2), yields: % 5.23/2.15 | (17) $false % 5.23/2.15 | % 5.23/2.15 |-The branch is then unsatisfiable % 5.23/2.15 |-Branch two: % 5.23/2.15 | (27) ? [v0] : ((xsd_integer(v0) & xsd_string(v0)) | ( ~ xsd_integer(v0) & ~ xsd_string(v0))) % 5.23/2.15 | % 5.23/2.15 | Instantiating (27) with all_2_0_3 yields: % 5.23/2.15 | (28) (xsd_integer(all_2_0_3) & xsd_string(all_2_0_3)) | ( ~ xsd_integer(all_2_0_3) & ~ xsd_string(all_2_0_3)) % 5.23/2.15 | % 5.23/2.15 +-Applying beta-rule and splitting (28), into two cases. % 5.23/2.15 |-Branch one: % 5.23/2.15 | (29) xsd_integer(all_2_0_3) & xsd_string(all_2_0_3) % 5.23/2.15 | % 5.23/2.15 | Applying alpha-rule on (29) yields: % 5.23/2.15 | (30) xsd_integer(all_2_0_3) % 5.23/2.15 | (31) xsd_string(all_2_0_3) % 5.23/2.15 | % 5.23/2.15 | Instantiating formula (2) with all_2_0_3 and discharging atoms xsd_integer(all_2_0_3), xsd_string(all_2_0_3), yields: % 5.23/2.15 | (17) $false % 5.23/2.15 | % 5.23/2.15 |-The branch is then unsatisfiable % 5.23/2.15 |-Branch two: % 5.23/2.15 | (33) ~ xsd_integer(all_2_0_3) & ~ xsd_string(all_2_0_3) % 5.23/2.15 | % 5.23/2.15 | Applying alpha-rule on (33) yields: % 5.23/2.15 | (34) ~ xsd_integer(all_2_0_3) % 5.23/2.15 | (35) ~ xsd_string(all_2_0_3) % 5.23/2.16 | % 5.23/2.16 | Introducing new symbol ex_11_0_10 defined by: % 5.23/2.16 | (36) ex_11_0_10 = all_2_0_3 % 5.23/2.16 | % 5.23/2.16 | Instantiating formula (4) with ex_11_0_10 yields: % 5.23/2.16 | (37) xsd_integer(ex_11_0_10) | xsd_string(ex_11_0_10) % 5.23/2.16 | % 5.23/2.16 +-Applying beta-rule and splitting (37), into two cases. % 5.23/2.16 |-Branch one: % 5.23/2.16 | (38) xsd_integer(ex_11_0_10) % 5.23/2.16 | % 5.23/2.16 | From (36) and (38) follows: % 5.23/2.16 | (30) xsd_integer(all_2_0_3) % 5.23/2.16 | % 5.23/2.16 | Using (30) and (34) yields: % 5.23/2.16 | (17) $false % 5.23/2.16 | % 5.23/2.16 |-The branch is then unsatisfiable % 5.23/2.16 |-Branch two: % 5.23/2.16 | (41) xsd_string(ex_11_0_10) % 5.23/2.16 | % 5.23/2.16 | From (36) and (41) follows: % 5.23/2.16 | (31) xsd_string(all_2_0_3) % 5.23/2.16 | % 5.23/2.16 | Using (31) and (35) yields: % 5.23/2.16 | (17) $false % 5.23/2.16 | % 5.23/2.16 |-The branch is then unsatisfiable % 5.23/2.16 % SZS output end Proof for theBenchmark % 5.23/2.16 % 5.23/2.16 1560ms %------------------------------------------------------------------------------