%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n017.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:38 EDT 2022 % Result : Unsatisfiable 1.87s 1.14s % Output : Proof 2.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n017.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 12:57:32 EDT 2022 % 0.12/0.33 % CPUTime : % 0.56/0.58 ____ _ % 0.56/0.58 ___ / __ \_____(_)___ ________ __________ % 0.56/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.56/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.56/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.56/0.58 % 0.56/0.58 A Theorem Prover for First-Order Logic % 0.56/0.58 (ePrincess v.1.0) % 0.56/0.58 % 0.56/0.58 (c) Philipp Rümmer, 2009-2015 % 0.56/0.58 (c) Peter Backeman, 2014-2015 % 0.56/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.56/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.56/0.58 Bug reports to peter@backeman.se % 0.56/0.58 % 0.56/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.56/0.58 % 0.56/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.72/0.63 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.76/1.02 Prover 0: Warning: ignoring some quantifiers % 1.76/1.04 Prover 0: Constructing countermodel ... % 1.87/1.14 Prover 0: proved (512ms) % 1.87/1.14 % 1.87/1.14 No countermodel exists, formula is valid % 1.87/1.14 % SZS status Unsatisfiable for theBenchmark % 1.87/1.14 % 1.87/1.14 Generating proof ... Warning: ignoring some quantifiers % 2.65/1.31 found it (size 11) % 2.65/1.31 % 2.65/1.31 % SZS output start Proof for theBenchmark % 2.65/1.31 Assumed formulas after preprocessing and simplification: % 2.65/1.32 | (0) cUnsatisfiable(i2003_11_14_17_22_31584) & ! [v0] : ! [v1] : ( ~ ca_Cx4xcomp(v0) | ~ ra_Px4(v0, v1)) & ! [v0] : ! [v1] : ( ~ ra_Px4(v0, v1) | ca_Cx4(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ ce(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cexcomp(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | ~ cdxcomp(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | cd(v0)) & ! [v0] : ! [v1] : ( ~ cexcomp(v1) | ~ rr(v0, v1) | cUnsatisfiable(v0) | ? [v2] : ((rr(v0, v2) & ~ ca_Cx4(v2)) | (rr(v0, v2) & ~ cd(v2)))) & ! [v0] : ! [v1] : ( ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | ca_Cx4(v1)) & ! [v0] : ! [v1] : ( ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | cd(v1)) & ! [v0] : ( ~ ca_Cx4xcomp(v0) | cd(v0)) & ! [v0] : ( ~ ca_Cx4xcomp(v0) | cexcomp(v0)) & ! [v0] : ( ~ cc(v0) | cdxcomp(v0)) & ! [v0] : ( ~ ca_Cx4(v0) | ? [v1] : ra_Px4(v0, v1)) & ! [v0] : ( ~ cd(v0) | ~ cexcomp(v0) | ca_Cx4xcomp(v0)) & ! [v0] : ( ~ cd(v0) | ? [v1] : ra_Px2(v0, v1)) & ! [v0] : ( ~ cexcomp(v0) | ? [v1] : ra_Px1(v0, v1)) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (cexcomp(v1) & rr(v0, v1))) & ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) & ! [v0] : ~ cowlNothing(v0) & ? [v0] : (ca_Cx4xcomp(v0) | ? [v1] : ra_Px4(v0, v1)) & ? [v0] : (ce(v0) | ? [v1] : ra_Px1(v0, v1)) & ? [v0] : (cdxcomp(v0) | ? [v1] : ra_Px2(v0, v1)) & ? [v0] : (xsd_integer(v0) | xsd_string(v0)) & ? [v0] : cowlThing(v0) % 2.65/1.33 | Applying alpha-rule on (0) yields: % 2.65/1.33 | (1) ? [v0] : (ca_Cx4xcomp(v0) | ? [v1] : ra_Px4(v0, v1)) % 2.65/1.33 | (2) ! [v0] : ! [v1] : ( ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | ca_Cx4(v1)) % 2.65/1.33 | (3) ? [v0] : cowlThing(v0) % 2.65/1.33 | (4) cUnsatisfiable(i2003_11_14_17_22_31584) % 2.65/1.33 | (5) ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) % 2.65/1.33 | (6) ! [v0] : ( ~ cc(v0) | cdxcomp(v0)) % 2.65/1.33 | (7) ! [v0] : ( ~ ca_Cx4xcomp(v0) | cexcomp(v0)) % 2.65/1.33 | (8) ! [v0] : ( ~ cd(v0) | ~ cexcomp(v0) | ca_Cx4xcomp(v0)) % 2.65/1.33 | (9) ! [v0] : ( ~ cexcomp(v0) | ? [v1] : ra_Px1(v0, v1)) % 2.65/1.33 | (10) ! [v0] : ! [v1] : ( ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | cd(v1)) % 2.65/1.33 | (11) ? [v0] : (ce(v0) | ? [v1] : ra_Px1(v0, v1)) % 2.65/1.33 | (12) ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | ~ cdxcomp(v0)) % 2.65/1.33 | (13) ! [v0] : ( ~ ca_Cx4xcomp(v0) | cd(v0)) % 2.65/1.33 | (14) ? [v0] : (cdxcomp(v0) | ? [v1] : ra_Px2(v0, v1)) % 2.65/1.33 | (15) ! [v0] : ! [v1] : ( ~ cexcomp(v1) | ~ rr(v0, v1) | cUnsatisfiable(v0) | ? [v2] : ((rr(v0, v2) & ~ ca_Cx4(v2)) | (rr(v0, v2) & ~ cd(v2)))) % 2.65/1.34 | (16) ! [v0] : ( ~ ca_Cx4(v0) | ? [v1] : ra_Px4(v0, v1)) % 2.65/1.34 | (17) ! [v0] : ( ~ cd(v0) | ? [v1] : ra_Px2(v0, v1)) % 2.65/1.34 | (18) ! [v0] : ! [v1] : ( ~ ca_Cx4xcomp(v0) | ~ ra_Px4(v0, v1)) % 2.65/1.34 | (19) ! [v0] : ~ cowlNothing(v0) % 2.65/1.34 | (20) ! [v0] : ! [v1] : ( ~ ra_Px4(v0, v1) | ca_Cx4(v0)) % 2.65/1.34 | (21) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ ce(v0)) % 2.65/1.34 | (22) ? [v0] : (xsd_integer(v0) | xsd_string(v0)) % 2.65/1.34 | (23) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cexcomp(v0)) % 2.65/1.34 | (24) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (cexcomp(v1) & rr(v0, v1))) % 2.65/1.34 | (25) ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | cd(v0)) % 2.65/1.34 | % 2.65/1.34 | Instantiating formula (24) with i2003_11_14_17_22_31584 and discharging atoms cUnsatisfiable(i2003_11_14_17_22_31584), yields: % 2.65/1.34 | (26) ? [v0] : (cexcomp(v0) & rr(i2003_11_14_17_22_31584, v0)) % 2.65/1.34 | % 2.65/1.34 | Instantiating (26) with all_13_0_5 yields: % 2.65/1.34 | (27) cexcomp(all_13_0_5) & rr(i2003_11_14_17_22_31584, all_13_0_5) % 2.65/1.34 | % 2.65/1.34 | Applying alpha-rule on (27) yields: % 2.65/1.34 | (28) cexcomp(all_13_0_5) % 2.65/1.34 | (29) rr(i2003_11_14_17_22_31584, all_13_0_5) % 2.65/1.34 | % 2.65/1.34 | Instantiating formula (2) with all_13_0_5, i2003_11_14_17_22_31584 and discharging atoms rr(i2003_11_14_17_22_31584, all_13_0_5), cUnsatisfiable(i2003_11_14_17_22_31584), yields: % 2.65/1.34 | (30) ca_Cx4(all_13_0_5) % 2.65/1.34 | % 2.65/1.34 | Instantiating formula (10) with all_13_0_5, i2003_11_14_17_22_31584 and discharging atoms rr(i2003_11_14_17_22_31584, all_13_0_5), cUnsatisfiable(i2003_11_14_17_22_31584), yields: % 2.65/1.34 | (31) cd(all_13_0_5) % 2.65/1.34 | % 2.65/1.34 | Instantiating formula (16) with all_13_0_5 and discharging atoms ca_Cx4(all_13_0_5), yields: % 2.65/1.34 | (32) ? [v0] : ra_Px4(all_13_0_5, v0) % 2.65/1.34 | % 2.65/1.34 | Instantiating formula (8) with all_13_0_5 and discharging atoms cd(all_13_0_5), cexcomp(all_13_0_5), yields: % 2.65/1.34 | (33) ca_Cx4xcomp(all_13_0_5) % 2.65/1.34 | % 2.65/1.34 | Instantiating (32) with all_29_0_7 yields: % 2.65/1.34 | (34) ra_Px4(all_13_0_5, all_29_0_7) % 2.65/1.34 | % 2.65/1.34 | Instantiating formula (18) with all_29_0_7, all_13_0_5 and discharging atoms ca_Cx4xcomp(all_13_0_5), ra_Px4(all_13_0_5, all_29_0_7), yields: % 2.65/1.34 | (35) $false % 2.65/1.34 | % 2.65/1.34 |-The branch is then unsatisfiable % 2.65/1.34 % SZS output end Proof for theBenchmark % 2.65/1.34 % 2.65/1.34 755ms %------------------------------------------------------------------------------