%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS075+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n032.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:29 EDT 2022 % Result : Unsatisfiable 1.79s 1.09s % Output : Proof 2.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : KRS075+1 : TPTP v8.1.0. Released v3.1.0. % 0.00/0.10 % Command : ePrincess-casc -timeout=%d %s % 0.09/0.29 % Computer : n032.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 600 % 0.09/0.29 % DateTime : Tue Jun 7 18:01:20 EDT 2022 % 0.09/0.29 % CPUTime : % 0.15/0.48 ____ _ % 0.15/0.48 ___ / __ \_____(_)___ ________ __________ % 0.15/0.48 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.15/0.48 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.15/0.48 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.15/0.48 % 0.15/0.48 A Theorem Prover for First-Order Logic % 0.15/0.48 (ePrincess v.1.0) % 0.15/0.48 % 0.15/0.48 (c) Philipp Rümmer, 2009-2015 % 0.15/0.48 (c) Peter Backeman, 2014-2015 % 0.15/0.48 (contributions by Angelo Brillout, Peter Baumgartner) % 0.15/0.48 Free software under GNU Lesser General Public License (LGPL). % 0.15/0.48 Bug reports to peter@backeman.se % 0.15/0.48 % 0.15/0.48 For more information, visit http://user.uu.se/~petba168/breu/ % 0.15/0.48 % 0.15/0.48 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.15/0.53 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.28/0.81 Prover 0: Preprocessing ... % 1.58/0.96 Prover 0: Warning: ignoring some quantifiers % 1.58/0.98 Prover 0: Constructing countermodel ... % 1.79/1.09 Prover 0: proved (556ms) % 1.79/1.09 % 1.79/1.09 No countermodel exists, formula is valid % 1.79/1.09 % SZS status Unsatisfiable for theBenchmark % 1.79/1.09 % 1.79/1.09 Generating proof ... Warning: ignoring some quantifiers % 2.59/1.27 found it (size 18) % 2.59/1.27 % 2.59/1.27 % SZS output start Proof for theBenchmark % 2.59/1.27 Assumed formulas after preprocessing and simplification: % 2.59/1.27 | (0) cUnsatisfiable(i2003_11_14_17_19_02584) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ rs(v0, v2) | ~ rf1(v0, v3) | ~ rf(v0, v1) | ~ cp(v1) | ~ cowlThing(v2) | cp(v3) | cUnsatisfiable(v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rs(v0, v2) | ~ rs(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf(v0, v2) | ~ rf(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v1, v0) | rinvS(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf1(v0, v1)) & ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf(v0, v1)) & ! [v0] : ! [v1] : ( ~ rinvS(v0, v1) | rs(v1, v0)) & ! [v0] : ! [v1] : ( ~ rinvF1(v0, v1) | rf1(v1, v0)) & ! [v0] : ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0)) & ! [v0] : ! [v1] : ( ~ rf1(v1, v0) | rinvF1(v0, v1)) & ! [v0] : ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rs(v0, v1) & cowlThing(v1))) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf1(v0, v1) & ~ cp(v1))) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf(v0, v1) & cp(v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0) % 2.59/1.28 | Applying alpha-rule on (0) yields: % 2.59/1.28 | (1) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 2.59/1.28 | (2) ? [v0] : (xsd_string(v0) | xsd_integer(v0)) % 2.59/1.28 | (3) ! [v0] : ! [v1] : ( ~ rf1(v1, v0) | rinvF1(v0, v1)) % 2.59/1.29 | (4) ! [v0] : ! [v1] : ( ~ rinvF1(v0, v1) | rf1(v1, v0)) % 2.59/1.29 | (5) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rs(v0, v1) & cowlThing(v1))) % 2.59/1.29 | (6) ! [v0] : ! [v1] : ( ~ rinvS(v0, v1) | rs(v1, v0)) % 2.59/1.29 | (7) ! [v0] : ! [v1] : ( ~ rs(v1, v0) | rinvS(v0, v1)) % 2.59/1.29 | (8) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rs(v0, v2) | ~ rs(v0, v1)) % 2.59/1.29 | (9) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf(v0, v1)) % 2.59/1.29 | (10) ! [v0] : ~ cowlNothing(v0) % 2.59/1.29 | (11) cUnsatisfiable(i2003_11_14_17_19_02584) % 2.59/1.29 | (12) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf1(v0, v1) & ~ cp(v1))) % 2.59/1.29 | (13) ? [v0] : cowlThing(v0) % 2.59/1.29 | (14) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf1(v0, v2) | ~ rf1(v0, v1)) % 2.59/1.29 | (15) ! [v0] : ! [v1] : ( ~ rs(v0, v1) | rf1(v0, v1)) % 2.59/1.29 | (16) ! [v0] : ! [v1] : ( ~ rf(v1, v0) | rinvF(v0, v1)) % 2.59/1.29 | (17) ! [v0] : ! [v1] : ( ~ rinvF(v0, v1) | rf(v1, v0)) % 2.59/1.29 | (18) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rf(v0, v1) & cp(v1))) % 2.59/1.29 | (19) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rf(v0, v2) | ~ rf(v0, v1)) % 2.59/1.29 | (20) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ rs(v0, v2) | ~ rf1(v0, v3) | ~ rf(v0, v1) | ~ cp(v1) | ~ cowlThing(v2) | cp(v3) | cUnsatisfiable(v0)) % 2.59/1.29 | % 2.59/1.29 | Instantiating formula (5) with i2003_11_14_17_19_02584 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_02584), yields: % 2.59/1.29 | (21) ? [v0] : (rs(i2003_11_14_17_19_02584, v0) & cowlThing(v0)) % 2.59/1.29 | % 2.59/1.29 | Instantiating formula (12) with i2003_11_14_17_19_02584 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_02584), yields: % 2.59/1.29 | (22) ? [v0] : (rf1(i2003_11_14_17_19_02584, v0) & ~ cp(v0)) % 2.59/1.29 | % 2.59/1.29 | Instantiating formula (18) with i2003_11_14_17_19_02584 and discharging atoms cUnsatisfiable(i2003_11_14_17_19_02584), yields: % 2.59/1.29 | (23) ? [v0] : (rf(i2003_11_14_17_19_02584, v0) & cp(v0)) % 2.59/1.29 | % 2.59/1.29 | Instantiating (23) with all_10_0_2 yields: % 2.59/1.29 | (24) rf(i2003_11_14_17_19_02584, all_10_0_2) & cp(all_10_0_2) % 2.59/1.30 | % 2.59/1.30 | Applying alpha-rule on (24) yields: % 2.59/1.30 | (25) rf(i2003_11_14_17_19_02584, all_10_0_2) % 2.59/1.30 | (26) cp(all_10_0_2) % 2.59/1.30 | % 2.59/1.30 | Instantiating (21) with all_12_0_3 yields: % 2.59/1.30 | (27) rs(i2003_11_14_17_19_02584, all_12_0_3) & cowlThing(all_12_0_3) % 2.59/1.30 | % 2.59/1.30 | Applying alpha-rule on (27) yields: % 2.59/1.30 | (28) rs(i2003_11_14_17_19_02584, all_12_0_3) % 2.59/1.30 | (29) cowlThing(all_12_0_3) % 2.59/1.30 | % 2.59/1.30 | Instantiating (22) with all_14_0_4 yields: % 2.59/1.30 | (30) rf1(i2003_11_14_17_19_02584, all_14_0_4) & ~ cp(all_14_0_4) % 2.59/1.30 | % 2.59/1.30 | Applying alpha-rule on (30) yields: % 2.59/1.30 | (31) rf1(i2003_11_14_17_19_02584, all_14_0_4) % 2.59/1.30 | (32) ~ cp(all_14_0_4) % 2.59/1.30 | % 2.59/1.30 | Instantiating formula (15) with all_12_0_3, i2003_11_14_17_19_02584 and discharging atoms rs(i2003_11_14_17_19_02584, all_12_0_3), yields: % 2.59/1.30 | (33) rf1(i2003_11_14_17_19_02584, all_12_0_3) % 2.59/1.30 | % 2.59/1.30 | Instantiating formula (9) with all_12_0_3, i2003_11_14_17_19_02584 and discharging atoms rs(i2003_11_14_17_19_02584, all_12_0_3), yields: % 2.59/1.30 | (34) rf(i2003_11_14_17_19_02584, all_12_0_3) % 2.59/1.30 | % 2.59/1.30 | Instantiating formula (14) with all_12_0_3, all_14_0_4, i2003_11_14_17_19_02584 and discharging atoms rf1(i2003_11_14_17_19_02584, all_14_0_4), rf1(i2003_11_14_17_19_02584, all_12_0_3), yields: % 2.59/1.30 | (35) all_14_0_4 = all_12_0_3 % 2.59/1.30 | % 2.59/1.30 | Instantiating formula (19) with all_12_0_3, all_10_0_2, i2003_11_14_17_19_02584 and discharging atoms rf(i2003_11_14_17_19_02584, all_12_0_3), rf(i2003_11_14_17_19_02584, all_10_0_2), yields: % 2.59/1.30 | (36) all_12_0_3 = all_10_0_2 % 2.59/1.30 | % 2.59/1.30 | Combining equations (36,35) yields a new equation: % 2.59/1.30 | (37) all_14_0_4 = all_10_0_2 % 2.59/1.30 | % 2.59/1.30 | From (37) and (32) follows: % 2.59/1.30 | (38) ~ cp(all_10_0_2) % 2.59/1.30 | % 2.59/1.30 | Using (26) and (38) yields: % 2.59/1.30 | (39) $false % 2.59/1.30 | % 2.59/1.30 |-The branch is then unsatisfiable % 2.59/1.30 % SZS output end Proof for theBenchmark % 2.59/1.30 % 2.83/1.30 807ms %------------------------------------------------------------------------------