%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS127+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:38 EDT 2022 % Result : Unsatisfiable 1.55s 0.99s % Output : Proof 2.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.07 % Problem : KRS127+1 : TPTP v8.1.0. Released v3.1.0. % 0.00/0.08 % Command : ePrincess-casc -timeout=%d %s % 0.07/0.26 % Computer : n032.cluster.edu % 0.07/0.26 % Model : x86_64 x86_64 % 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.26 % Memory : 8042.1875MB % 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.26 % CPULimit : 300 % 0.07/0.26 % WCLimit : 600 % 0.07/0.26 % DateTime : Tue Jun 7 09:00:50 EDT 2022 % 0.07/0.26 % CPUTime : % 0.11/0.45 ____ _ % 0.11/0.45 ___ / __ \_____(_)___ ________ __________ % 0.11/0.45 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.11/0.45 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.11/0.45 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.11/0.45 % 0.11/0.45 A Theorem Prover for First-Order Logic % 0.11/0.46 (ePrincess v.1.0) % 0.11/0.46 % 0.11/0.46 (c) Philipp Rümmer, 2009-2015 % 0.11/0.46 (c) Peter Backeman, 2014-2015 % 0.11/0.46 (contributions by Angelo Brillout, Peter Baumgartner) % 0.11/0.46 Free software under GNU Lesser General Public License (LGPL). % 0.11/0.46 Bug reports to peter@backeman.se % 0.11/0.46 % 0.11/0.46 For more information, visit http://user.uu.se/~petba168/breu/ % 0.11/0.46 % 0.11/0.46 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.11/0.50 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.06/0.75 Prover 0: Preprocessing ... % 1.31/0.87 Prover 0: Warning: ignoring some quantifiers % 1.31/0.89 Prover 0: Constructing countermodel ... % 1.55/0.99 Prover 0: proved (490ms) % 1.55/0.99 % 1.55/0.99 No countermodel exists, formula is valid % 1.55/0.99 % SZS status Unsatisfiable for theBenchmark % 1.55/0.99 % 1.55/0.99 Generating proof ... Warning: ignoring some quantifiers % 2.26/1.13 found it (size 14) % 2.26/1.13 % 2.26/1.13 % SZS output start Proof for theBenchmark % 2.26/1.13 Assumed formulas after preprocessing and simplification: % 2.26/1.13 | (0) cUnsatisfiable(i2003_11_14_17_22_27794) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cd(v1) | ~ cc(v2) | cUnsatisfiable(v0) | ? [v3] : ? [v4] : ( ~ (v4 = v3) & rr(v0, v4) & rr(v0, v3))) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ cd(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cdxcomp(v0)) & ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) & ! [v0] : ~ cowlNothing(v0) & ! [v0] : ( ~ cdxcomp(v0) | ? [v1] : ra_Px1(v0, v1)) & ! [v0] : ( ~ cc(v0) | cdxcomp(v0)) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rr(v0, v1) & cd(v1))) & ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rr(v0, v1) & cc(v1))) & ? [v0] : (xsd_string(v0) | xsd_integer(v0)) & ? [v0] : cowlThing(v0) & ? [v0] : (cd(v0) | ? [v1] : ra_Px1(v0, v1)) % 2.31/1.14 | Applying alpha-rule on (0) yields: % 2.31/1.14 | (1) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ cd(v0)) % 2.31/1.14 | (2) ? [v0] : cowlThing(v0) % 2.31/1.14 | (3) ! [v0] : ! [v1] : ! [v2] : ( ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cd(v1) | ~ cc(v2) | cUnsatisfiable(v0) | ? [v3] : ? [v4] : ( ~ (v4 = v3) & rr(v0, v4) & rr(v0, v3))) % 2.31/1.15 | (4) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cdxcomp(v0)) % 2.31/1.15 | (5) ! [v0] : ~ cowlNothing(v0) % 2.31/1.15 | (6) ! [v0] : ( ~ cc(v0) | cdxcomp(v0)) % 2.31/1.15 | (7) ? [v0] : (xsd_string(v0) | xsd_integer(v0)) % 2.31/1.15 | (8) ? [v0] : (cd(v0) | ? [v1] : ra_Px1(v0, v1)) % 2.31/1.15 | (9) ! [v0] : ( ~ xsd_string(v0) | ~ xsd_integer(v0)) % 2.31/1.15 | (10) cUnsatisfiable(i2003_11_14_17_22_27794) % 2.31/1.15 | (11) ! [v0] : ( ~ cdxcomp(v0) | ? [v1] : ra_Px1(v0, v1)) % 2.31/1.15 | (12) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rr(v0, v1) & cc(v1))) % 2.31/1.15 | (13) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0)) % 2.31/1.15 | (14) ! [v0] : ( ~ cUnsatisfiable(v0) | ? [v1] : (rr(v0, v1) & cd(v1))) % 2.31/1.15 | % 2.31/1.15 | Instantiating formula (14) with i2003_11_14_17_22_27794 and discharging atoms cUnsatisfiable(i2003_11_14_17_22_27794), yields: % 2.31/1.15 | (15) ? [v0] : (rr(i2003_11_14_17_22_27794, v0) & cd(v0)) % 2.31/1.15 | % 2.31/1.15 | Instantiating formula (12) with i2003_11_14_17_22_27794 and discharging atoms cUnsatisfiable(i2003_11_14_17_22_27794), yields: % 2.31/1.15 | (16) ? [v0] : (rr(i2003_11_14_17_22_27794, v0) & cc(v0)) % 2.31/1.15 | % 2.31/1.15 | Instantiating (16) with all_11_0_3 yields: % 2.31/1.15 | (17) rr(i2003_11_14_17_22_27794, all_11_0_3) & cc(all_11_0_3) % 2.31/1.15 | % 2.31/1.15 | Applying alpha-rule on (17) yields: % 2.31/1.15 | (18) rr(i2003_11_14_17_22_27794, all_11_0_3) % 2.31/1.15 | (19) cc(all_11_0_3) % 2.31/1.15 | % 2.31/1.15 | Instantiating (15) with all_13_0_4 yields: % 2.31/1.15 | (20) rr(i2003_11_14_17_22_27794, all_13_0_4) & cd(all_13_0_4) % 2.31/1.15 | % 2.31/1.15 | Applying alpha-rule on (20) yields: % 2.31/1.15 | (21) rr(i2003_11_14_17_22_27794, all_13_0_4) % 2.31/1.15 | (22) cd(all_13_0_4) % 2.31/1.15 | % 2.31/1.15 | Instantiating formula (13) with all_11_0_3, all_13_0_4, i2003_11_14_17_22_27794 and discharging atoms rr(i2003_11_14_17_22_27794, all_13_0_4), rr(i2003_11_14_17_22_27794, all_11_0_3), cUnsatisfiable(i2003_11_14_17_22_27794), yields: % 2.31/1.15 | (23) all_13_0_4 = all_11_0_3 % 2.31/1.15 | % 2.31/1.15 | From (23) and (22) follows: % 2.31/1.16 | (24) cd(all_11_0_3) % 2.31/1.16 | % 2.31/1.16 | Instantiating formula (6) with all_11_0_3 and discharging atoms cc(all_11_0_3), yields: % 2.31/1.16 | (25) cdxcomp(all_11_0_3) % 2.31/1.16 | % 2.31/1.16 | Instantiating formula (11) with all_11_0_3 and discharging atoms cdxcomp(all_11_0_3), yields: % 2.31/1.16 | (26) ? [v0] : ra_Px1(all_11_0_3, v0) % 2.31/1.16 | % 2.31/1.16 | Instantiating (26) with all_30_0_5 yields: % 2.31/1.16 | (27) ra_Px1(all_11_0_3, all_30_0_5) % 2.31/1.16 | % 2.31/1.16 | Instantiating formula (1) with all_30_0_5, all_11_0_3 and discharging atoms ra_Px1(all_11_0_3, all_30_0_5), cd(all_11_0_3), yields: % 2.31/1.16 | (28) $false % 2.31/1.16 | % 2.31/1.16 |-The branch is then unsatisfiable % 2.31/1.16 % SZS output end Proof for theBenchmark % 2.31/1.16 % 2.31/1.16 695ms %------------------------------------------------------------------------------