%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS088+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n027.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:31 EDT 2022 % Result : Unsatisfiable 1.98s 1.15s % Output : Proof 2.69s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : KRS088+1 : TPTP v8.1.0. Released v3.1.0. % 0.04/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n027.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:51:55 EDT 2022 % 0.12/0.33 % CPUTime : % 0.60/0.58 ____ _ % 0.60/0.58 ___ / __ \_____(_)___ ________ __________ % 0.60/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.60/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.60/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.60/0.58 % 0.60/0.58 A Theorem Prover for First-Order Logic % 0.60/0.58 (ePrincess v.1.0) % 0.60/0.58 % 0.60/0.58 (c) Philipp Rümmer, 2009-2015 % 0.60/0.58 (c) Peter Backeman, 2014-2015 % 0.60/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.60/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.60/0.58 Bug reports to peter@backeman.se % 0.60/0.58 % 0.60/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.60/0.58 % 0.60/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.75/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.47/0.92 Prover 0: Preprocessing ... % 1.81/1.05 Prover 0: Warning: ignoring some quantifiers % 1.81/1.07 Prover 0: Constructing countermodel ... % 1.98/1.15 Prover 0: proved (518ms) % 1.98/1.15 % 1.98/1.15 No countermodel exists, formula is valid % 1.98/1.15 % SZS status Unsatisfiable for theBenchmark % 1.98/1.15 % 1.98/1.15 Generating proof ... Warning: ignoring some quantifiers % 2.69/1.33 found it (size 12) % 2.69/1.33 % 2.69/1.33 % SZS output start Proof for theBenchmark % 2.69/1.33 Assumed formulas after preprocessing and simplification: % 2.69/1.33 | (0) cUnsatisfiable(i2003_11_14_17_19_49673) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf(v0, v2) | ~ rf(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ rr(v1, v2) | ~ rr(v0, v1) | rr(v0, v2)) & ! [v0] : ! [v1] : ( ~ rr(v1, v0) | rinvR(v0, v1)) & ! [v0] : ! [v1] : ( ~ rinvR(v0, v1) | rr(v1, v0)) & ! [v0] : ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0)) & ! [v0] : ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1)) & ! [v0] : ! [v1] : ( ~ rf(v0, v1) | ~ cp1(v1) | cUnsatisfiable(v0) | ? [v2] : (rinvF(v1, v2) & ! [v3] : ( ~ rf(v2, v3) | cp1(v3)))) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf(v0, v1) & cp1(v1) & ! [v2] : ( ~ rinvF(v1, v2) | ? [v3] : (rf(v2, v3) & ~ cp1(v3))))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0) % 2.69/1.34 | Applying alpha-rule on (0) yields: % 2.69/1.34 | (1) ! [v0] : ! [v1] : ( ~ rf(v0, v1) | ~ cp1(v1) | cUnsatisfiable(v0) | ? [v2] : (rinvF(v1, v2) & ! [v3] : ( ~ rf(v2, v3) | cp1(v3)))) % 2.69/1.34 | (2) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf(v0, v1) & cp1(v1) & ! [v2] : ( ~ rinvF(v1, v2) | ? [v3] : (rf(v2, v3) & ~ cp1(v3))))) % 2.69/1.34 | (3) ! [v0] : ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1)) % 2.69/1.34 | (4) ! [v0] : ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0)) % 2.69/1.35 | (5) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 2.69/1.35 | (6) cUnsatisfiable(i2003_11_14_17_19_49673) % 2.69/1.35 | (7) ! [v0] : ~ cowlNothing(v0) % 2.69/1.35 | (8) ? [v0] : cowlThing(v0) % 2.69/1.35 | (9) ! [v0] : ! [v1] : ( ~ rinvR(v0, v1) | rr(v1, v0)) % 2.69/1.35 | (10) ! [v0] : ! [v1] : ( ~ rr(v1, v0) | rinvR(v0, v1)) % 2.69/1.35 | (11) ? [v0] : (xsd_string(v0) | xsd_integer(v0)) % 2.69/1.35 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ rr(v1, v2) | ~ rr(v0, v1) | rr(v0, v2)) % 2.69/1.35 | (13) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf(v0, v2) | ~ rf(v0, v1)) % 2.69/1.35 | % 2.69/1.35 | Instantiating formula (2) with i2003_11_14_17_19_49673 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_49673), yields: % 2.69/1.35 | (14) ? [v0] : (rf(i2003_11_14_17_19_49673, v0) & cp1(v0) & ! [v1] : ( ~ rinvF(v0, v1) | ? [v2] : (rf(v1, v2) & ~ cp1(v2)))) % 2.69/1.35 | % 2.69/1.35 | Instantiating (14) with all_10_0_2 yields: % 2.69/1.35 | (15) rf(i2003_11_14_17_19_49673, all_10_0_2) & cp1(all_10_0_2) & ! [v0] : ( ~ rinvF(all_10_0_2, v0) | ? [v1] : (rf(v0, v1) & ~ cp1(v1))) % 2.69/1.35 | % 2.69/1.35 | Applying alpha-rule on (15) yields: % 2.69/1.35 | (16) rf(i2003_11_14_17_19_49673, all_10_0_2) % 2.69/1.35 | (17) cp1(all_10_0_2) % 2.69/1.35 | (18) ! [v0] : ( ~ rinvF(all_10_0_2, v0) | ? [v1] : (rf(v0, v1) & ~ cp1(v1))) % 2.69/1.35 | % 2.69/1.35 | Instantiating formula (3) with i2003_11_14_17_19_49673, all_10_0_2 and discharging atoms rf(i2003_11_14_17_19_49673, all_10_0_2), yields: % 2.69/1.35 | (19) rinvF(all_10_0_2, i2003_11_14_17_19_49673) % 2.69/1.35 | % 2.69/1.35 | Instantiating formula (18) with i2003_11_14_17_19_49673 and discharging atoms rinvF(all_10_0_2, i2003_11_14_17_19_49673), yields: % 2.69/1.35 | (20) ? [v0] : (rf(i2003_11_14_17_19_49673, v0) & ~ cp1(v0)) % 2.69/1.35 | % 2.69/1.35 | Instantiating (20) with all_24_0_3 yields: % 2.69/1.35 | (21) rf(i2003_11_14_17_19_49673, all_24_0_3) & ~ cp1(all_24_0_3) % 2.69/1.35 | % 2.69/1.35 | Applying alpha-rule on (21) yields: % 2.69/1.35 | (22) rf(i2003_11_14_17_19_49673, all_24_0_3) % 2.69/1.35 | (23) ~ cp1(all_24_0_3) % 2.69/1.35 | % 2.69/1.35 | Instantiating formula (13) with all_24_0_3, all_10_0_2, i2003_11_14_17_19_49673 and discharging atoms rf(i2003_11_14_17_19_49673, all_24_0_3), rf(i2003_11_14_17_19_49673, all_10_0_2), yields: % 2.69/1.35 | (24) all_24_0_3 = all_10_0_2 % 2.69/1.35 | % 2.69/1.35 | From (24) and (23) follows: % 2.69/1.35 | (25) ~ cp1(all_10_0_2) % 2.69/1.35 | % 2.69/1.35 | Using (17) and (25) yields: % 2.69/1.35 | (26) $false % 2.69/1.35 | % 2.69/1.36 |-The branch is then unsatisfiable % 2.69/1.36 % SZS output end Proof for theBenchmark % 2.69/1.36 % 2.69/1.36 764ms %------------------------------------------------------------------------------