%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS079+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:30 EDT 2022 % Result : Unsatisfiable 10.99s 3.25s % Output : Proof 13.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : KRS079+1 : TPTP v8.1.0. Released v3.1.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n019.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:51:40 EDT 2022 % 0.13/0.33 % CPUTime : % 0.66/0.63 ____ _ % 0.66/0.63 ___ / __ \_____(_)___ ________ __________ % 0.66/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.66/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.66/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.66/0.63 % 0.66/0.63 A Theorem Prover for First-Order Logic % 0.66/0.63 (ePrincess v.1.0) % 0.66/0.63 % 0.66/0.63 (c) Philipp Rümmer, 2009-2015 % 0.66/0.63 (c) Peter Backeman, 2014-2015 % 0.66/0.63 (contributions by Angelo Brillout, Peter Baumgartner) % 0.66/0.63 Free software under GNU Lesser General Public License (LGPL). % 0.66/0.63 Bug reports to peter@backeman.se % 0.66/0.63 % 0.66/0.63 For more information, visit http://user.uu.se/~petba168/breu/ % 0.66/0.63 % 0.66/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.83/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.64/1.01 Prover 0: Preprocessing ... % 1.98/1.15 Prover 0: Warning: ignoring some quantifiers % 2.09/1.16 Prover 0: Constructing countermodel ... % 2.50/1.32 Prover 0: gave up % 2.50/1.32 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.79/1.35 Prover 1: Preprocessing ... % 3.19/1.49 Prover 1: Constructing countermodel ... % 3.78/1.59 Prover 1: gave up % 3.78/1.59 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 3.78/1.61 Prover 2: Preprocessing ... % 4.29/1.71 Prover 2: Warning: ignoring some quantifiers % 4.29/1.72 Prover 2: Constructing countermodel ... % 4.75/1.84 Prover 2: gave up % 4.75/1.84 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 4.75/1.85 Prover 3: Preprocessing ... % 4.97/1.87 Prover 3: Warning: ignoring some quantifiers % 4.97/1.87 Prover 3: Constructing countermodel ... % 4.97/1.90 Prover 3: gave up % 4.97/1.90 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 4.97/1.91 Prover 4: Preprocessing ... % 5.57/1.99 Prover 4: Warning: ignoring some quantifiers % 5.57/2.00 Prover 4: Constructing countermodel ... % 8.35/2.64 Prover 4: gave up % 8.35/2.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 8.35/2.66 Prover 5: Preprocessing ... % 8.78/2.74 Prover 5: Constructing countermodel ... % 9.11/2.81 Prover 5: gave up % 9.11/2.81 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 9.11/2.83 Prover 6: Preprocessing ... % 9.11/2.87 Prover 6: Warning: ignoring some quantifiers % 9.44/2.88 Prover 6: Constructing countermodel ... % 9.63/2.94 Prover 6: gave up % 9.63/2.94 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 9.63/2.96 Prover 7: Preprocessing ... % 9.63/2.97 Prover 7: Proving ... % 10.99/3.25 Prover 7: proved (309ms) % 10.99/3.25 % 10.99/3.25 % SZS status Unsatisfiable for theBenchmark % 10.99/3.25 % 10.99/3.25 Generating proof ... found it (size 40) % 13.10/3.77 % 13.10/3.77 % SZS output start Proof for theBenchmark % 13.10/3.77 Assumed formulas after preprocessing and simplification: % 13.10/3.77 | (0) ? [v0] : (cUnsatisfiable(v0) & ! [v1] : ! [v2] : ( ~ rr(v1, v2) | rf2(v1, v2)) & ! [v1] : ! [v2] : ( ~ rr(v1, v2) | rf1(v1, v2)) & ! [v1] : ( ~ xsd_string(v1) | ~ xsd_integer(v1)) & ! [v1] : ( ~ cp2(v1) | ~ cp1(v1)) & ! [v1] : ( ~ cowlThing(v1) | ! [v2] : ! [v3] : (v3 = v2 | ~ rf2(v1, v3) | ~ rf2(v1, v2))) & ! [v1] : ( ~ cowlThing(v1) | ! [v2] : ! [v3] : (v3 = v2 | ~ rf1(v1, v3) | ~ rf1(v1, v2))) & ! [v1] : ~ cowlNothing(v1) & ! [v1] : ( ~ cUnsatisfiable(v1) | ( ? [v2] : (rr(v1, v2) & cowlThing(v2)) & ? [v2] : (rf2(v1, v2) & cp2(v2)) & ? [v2] : (rf1(v1, v2) & cp1(v2)))) & ! [v1] : (xsd_string(v1) | xsd_integer(v1)) & ! [v1] : cowlThing(v1) & ! [v1] : (cUnsatisfiable(v1) | ! [v2] : ( ~ rr(v1, v2) | ~ cowlThing(v2)) | ! [v2] : ( ~ rf2(v1, v2) | ~ cp2(v2)) | ! [v2] : ( ~ rf1(v1, v2) | ~ cp1(v2)))) % 13.10/3.78 | Instantiating (0) with all_0_0_0 yields: % 13.10/3.78 | (1) cUnsatisfiable(all_0_0_0) & ! [v0] : ! [v1] : ( ~ rr(v0, v1) | rf2(v0, v1)) & ! [v0] : ! [v1] : ( ~ rr(v0, v1) | rf1(v0, v1)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ( ~ cp2(v0) | ~ cp1(v0)) & ! [v0] : ( ~ cowlThing(v0) | ! [v1] : ! [v2] : (v2 = v1 | ~ rf2(v0, v2) | ~ rf2(v0, v1))) & ! [v0] : ( ~ cowlThing(v0) | ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1))) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cUnsatisfiable(v0) | ( ? [v1] : (rr(v0, v1) & cowlThing(v1)) & ? [v1] : (rf2(v0, v1) & cp2(v1)) & ? [v1] : (rf1(v0, v1) & cp1(v1)))) & ! [v0] : (xsd_string(v0) | xsd_integer(v0)) & ! [v0] : cowlThing(v0) & ! [v0] : (cUnsatisfiable(v0) | ! [v1] : ( ~ rr(v0, v1) | ~ cowlThing(v1)) | ! [v1] : ( ~ rf2(v0, v1) | ~ cp2(v1)) | ! [v1] : ( ~ rf1(v0, v1) | ~ cp1(v1))) % 13.10/3.78 | % 13.10/3.78 | Applying alpha-rule on (1) yields: % 13.10/3.78 | (2) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 13.10/3.78 | (3) ! [v0] : (xsd_string(v0) | xsd_integer(v0)) % 13.10/3.78 | (4) cUnsatisfiable(all_0_0_0) % 13.10/3.78 | (5) ! [v0] : cowlThing(v0) % 13.10/3.78 | (6) ! [v0] : ~ cowlNothing(v0) % 13.10/3.78 | (7) ! [v0] : ( ~ cp2(v0) | ~ cp1(v0)) % 13.10/3.78 | (8) ! [v0] : ! [v1] : ( ~ rr(v0, v1) | rf2(v0, v1)) % 13.10/3.78 | (9) ! [v0] : ! [v1] : ( ~ rr(v0, v1) | rf1(v0, v1)) % 13.10/3.78 | (10) ! [v0] : ( ~ cowlThing(v0) | ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1))) % 13.10/3.78 | (11) ! [v0] : ( ~ cUnsatisfiable(v0) | ( ? [v1] : (rr(v0, v1) & cowlThing(v1)) & ? [v1] : (rf2(v0, v1) & cp2(v1)) & ? [v1] : (rf1(v0, v1) & cp1(v1)))) % 13.10/3.78 | (12) ! [v0] : (cUnsatisfiable(v0) | ! [v1] : ( ~ rr(v0, v1) | ~ cowlThing(v1)) | ! [v1] : ( ~ rf2(v0, v1) | ~ cp2(v1)) | ! [v1] : ( ~ rf1(v0, v1) | ~ cp1(v1))) % 13.10/3.79 | (13) ! [v0] : ( ~ cowlThing(v0) | ! [v1] : ! [v2] : (v2 = v1 | ~ rf2(v0, v2) | ~ rf2(v0, v1))) % 13.10/3.79 | % 13.10/3.79 | Instantiating formula (11) with all_0_0_0 and discharging atoms cUnsatisfiable(all_0_0_0), yields: % 13.10/3.79 | (14) ? [v0] : (rr(all_0_0_0, v0) & cowlThing(v0)) & ? [v0] : (rf2(all_0_0_0, v0) & cp2(v0)) & ? [v0] : (rf1(all_0_0_0, v0) & cp1(v0)) % 13.10/3.79 | % 13.10/3.79 | Applying alpha-rule on (14) yields: % 13.10/3.79 | (15) ? [v0] : (rr(all_0_0_0, v0) & cowlThing(v0)) % 13.10/3.79 | (16) ? [v0] : (rf2(all_0_0_0, v0) & cp2(v0)) % 13.10/3.79 | (17) ? [v0] : (rf1(all_0_0_0, v0) & cp1(v0)) % 13.10/3.79 | % 13.10/3.79 | Instantiating (17) with all_8_0_1 yields: % 13.10/3.79 | (18) rf1(all_0_0_0, all_8_0_1) & cp1(all_8_0_1) % 13.10/3.79 | % 13.10/3.79 | Applying alpha-rule on (18) yields: % 13.10/3.79 | (19) rf1(all_0_0_0, all_8_0_1) % 13.10/3.79 | (20) cp1(all_8_0_1) % 13.10/3.79 | % 13.10/3.79 | Instantiating (16) with all_10_0_2 yields: % 13.10/3.79 | (21) rf2(all_0_0_0, all_10_0_2) & cp2(all_10_0_2) % 13.10/3.79 | % 13.10/3.79 | Applying alpha-rule on (21) yields: % 13.10/3.79 | (22) rf2(all_0_0_0, all_10_0_2) % 13.10/3.79 | (23) cp2(all_10_0_2) % 13.10/3.79 | % 13.10/3.79 | Instantiating (15) with all_12_0_3 yields: % 13.10/3.79 | (24) rr(all_0_0_0, all_12_0_3) & cowlThing(all_12_0_3) % 13.10/3.79 | % 13.10/3.79 | Applying alpha-rule on (24) yields: % 13.10/3.79 | (25) rr(all_0_0_0, all_12_0_3) % 13.10/3.79 | (26) cowlThing(all_12_0_3) % 13.10/3.79 | % 13.10/3.79 | Instantiating formula (7) with all_8_0_1 and discharging atoms cp1(all_8_0_1), yields: % 13.10/3.79 | (27) ~ cp2(all_8_0_1) % 13.10/3.79 | % 13.10/3.79 | Instantiating formula (8) with all_12_0_3, all_0_0_0 and discharging atoms rr(all_0_0_0, all_12_0_3), yields: % 13.10/3.79 | (28) rf2(all_0_0_0, all_12_0_3) % 13.10/3.79 | % 13.10/3.79 | Instantiating formula (9) with all_12_0_3, all_0_0_0 and discharging atoms rr(all_0_0_0, all_12_0_3), yields: % 13.10/3.79 | (29) rf1(all_0_0_0, all_12_0_3) % 13.49/3.79 | % 13.49/3.79 | Introducing new symbol ex_32_0_4 defined by: % 13.49/3.79 | (30) ex_32_0_4 = all_0_0_0 % 13.49/3.79 | % 13.49/3.79 | Instantiating formula (5) with ex_32_0_4 yields: % 13.49/3.79 | (31) cowlThing(ex_32_0_4) % 13.49/3.79 | % 13.49/3.79 | Instantiating formula (13) with ex_32_0_4 and discharging atoms cowlThing(ex_32_0_4), yields: % 13.49/3.79 | (32) ! [v0] : ! [v1] : (v1 = v0 | ~ rf2(ex_32_0_4, v1) | ~ rf2(ex_32_0_4, v0)) % 13.49/3.79 | % 13.49/3.79 | Instantiating formula (10) with ex_32_0_4 and discharging atoms cowlThing(ex_32_0_4), yields: % 13.49/3.79 | (33) ! [v0] : ! [v1] : (v1 = v0 | ~ rf1(ex_32_0_4, v1) | ~ rf1(ex_32_0_4, v0)) % 13.49/3.79 | % 13.49/3.79 | Instantiating formula (33) with all_8_0_1, all_12_0_3 yields: % 13.49/3.79 | (34) all_12_0_3 = all_8_0_1 | ~ rf1(ex_32_0_4, all_12_0_3) | ~ rf1(ex_32_0_4, all_8_0_1) % 13.49/3.79 | % 13.49/3.79 | Instantiating formula (32) with all_10_0_2, all_12_0_3 yields: % 13.49/3.79 | (35) all_12_0_3 = all_10_0_2 | ~ rf2(ex_32_0_4, all_12_0_3) | ~ rf2(ex_32_0_4, all_10_0_2) % 13.49/3.79 | % 13.49/3.79 +-Applying beta-rule and splitting (34), into two cases. % 13.49/3.79 |-Branch one: % 13.49/3.79 | (36) ~ rf1(ex_32_0_4, all_12_0_3) % 13.49/3.79 | % 13.49/3.79 | From (30) and (36) follows: % 13.49/3.79 | (37) ~ rf1(all_0_0_0, all_12_0_3) % 13.49/3.79 | % 13.49/3.79 | Using (29) and (37) yields: % 13.49/3.79 | (38) $false % 13.49/3.79 | % 13.49/3.79 |-The branch is then unsatisfiable % 13.49/3.79 |-Branch two: % 13.49/3.79 | (39) all_12_0_3 = all_8_0_1 | ~ rf1(ex_32_0_4, all_8_0_1) % 13.49/3.79 | % 13.49/3.79 +-Applying beta-rule and splitting (35), into two cases. % 13.49/3.79 |-Branch one: % 13.49/3.79 | (40) ~ rf2(ex_32_0_4, all_12_0_3) % 13.49/3.79 | % 13.49/3.79 | From (30) and (40) follows: % 13.49/3.79 | (41) ~ rf2(all_0_0_0, all_12_0_3) % 13.49/3.79 | % 13.49/3.79 | Using (28) and (41) yields: % 13.49/3.79 | (38) $false % 13.49/3.79 | % 13.49/3.79 |-The branch is then unsatisfiable % 13.49/3.79 |-Branch two: % 13.49/3.79 | (43) all_12_0_3 = all_10_0_2 | ~ rf2(ex_32_0_4, all_10_0_2) % 13.49/3.79 | % 13.49/3.79 +-Applying beta-rule and splitting (39), into two cases. % 13.49/3.79 |-Branch one: % 13.49/3.79 | (44) ~ rf1(ex_32_0_4, all_8_0_1) % 13.49/3.79 | % 13.49/3.79 | From (30) and (44) follows: % 13.49/3.79 | (45) ~ rf1(all_0_0_0, all_8_0_1) % 13.49/3.79 | % 13.49/3.79 | Using (19) and (45) yields: % 13.49/3.79 | (38) $false % 13.49/3.79 | % 13.49/3.79 |-The branch is then unsatisfiable % 13.49/3.79 |-Branch two: % 13.49/3.79 | (47) all_12_0_3 = all_8_0_1 % 13.49/3.79 | % 13.49/3.79 +-Applying beta-rule and splitting (43), into two cases. % 13.49/3.79 |-Branch one: % 13.49/3.79 | (48) ~ rf2(ex_32_0_4, all_10_0_2) % 13.49/3.79 | % 13.49/3.79 | From (30) and (48) follows: % 13.49/3.79 | (49) ~ rf2(all_0_0_0, all_10_0_2) % 13.49/3.79 | % 13.49/3.79 | Using (22) and (49) yields: % 13.49/3.79 | (38) $false % 13.49/3.79 | % 13.49/3.79 |-The branch is then unsatisfiable % 13.49/3.79 |-Branch two: % 13.49/3.79 | (51) all_12_0_3 = all_10_0_2 % 13.49/3.79 | % 13.49/3.79 | Combining equations (51,47) yields a new equation: % 13.49/3.79 | (52) all_10_0_2 = all_8_0_1 % 13.49/3.79 | % 13.49/3.79 | Simplifying 52 yields: % 13.49/3.79 | (53) all_10_0_2 = all_8_0_1 % 13.49/3.79 | % 13.49/3.79 | From (53) and (23) follows: % 13.49/3.79 | (54) cp2(all_8_0_1) % 13.49/3.79 | % 13.49/3.79 | Using (54) and (27) yields: % 13.49/3.79 | (38) $false % 13.49/3.79 | % 13.49/3.79 |-The branch is then unsatisfiable % 13.49/3.79 % SZS output end Proof for theBenchmark % 13.49/3.79 % 13.49/3.79 3145ms %------------------------------------------------------------------------------