%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS126+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.82s 1.12s % Output : Proof 2.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS126+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n017.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 7 18:59:32 EDT 2022 % 0.13/0.34 % CPUTime : % 0.59/0.60 ____ _ % 0.59/0.60 ___ / __ \_____(_)___ ________ __________ % 0.59/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.60 % 0.59/0.60 A Theorem Prover for First-Order Logic % 0.59/0.60 (ePrincess v.1.0) % 0.59/0.60 % 0.59/0.60 (c) Philipp Rümmer, 2009-2015 % 0.59/0.60 (c) Peter Backeman, 2014-2015 % 0.59/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.60 Bug reports to peter@backeman.se % 0.59/0.60 % 0.59/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.60 % 0.59/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.69/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.40/0.92 Prover 0: Preprocessing ... % 1.45/1.02 Prover 0: Warning: ignoring some quantifiers % 1.66/1.04 Prover 0: Constructing countermodel ... % 1.82/1.12 Prover 0: proved (463ms) % 1.82/1.12 % 1.82/1.12 No countermodel exists, formula is valid % 1.82/1.12 % SZS status Unsatisfiable for theBenchmark % 1.82/1.12 % 1.82/1.12 Generating proof ... Warning: ignoring some quantifiers % 2.33/1.25 found it (size 7) % 2.33/1.25 % 2.33/1.25 % SZS output start Proof for theBenchmark % 2.33/1.25 Assumed formulas after preprocessing and simplification: % 2.33/1.25 | (0) cUnsatisfiable(i2003_11_14_17_22_23554) & ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | ~ cd1xcomp(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | cd1(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ cd(v0)) & ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cdxcomp(v0)) & ! [v0] : ( ~ cf(v0) | cd(v0)) & ! [v0] : ( ~ ce3(v0) | cc(v0)) & ! [v0] : ( ~ cdxcomp(v0) | ? [v1] : ra_Px1(v0, v1)) & ! [v0] : ( ~ cc(v0) | cdxcomp(v0)) & ! [v0] : ( ~ cd1(v0) | ? [v1] : ra_Px2(v0, v1)) & ! [v0] : ( ~ cUnsatisfiable(v0) | cd1(v0)) & ! [v0] : ( ~ cUnsatisfiable(v0) | cd1xcomp(v0)) & ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) & ! [v0] : ~ cowlNothing(v0) & ? [v0] : (cd(v0) | ? [v1] : ra_Px1(v0, v1)) & ? [v0] : (cd1xcomp(v0) | ? [v1] : ra_Px2(v0, v1)) & ? [v0] : (xsd_integer(v0) | xsd_string(v0)) & ? [v0] : cowlThing(v0) % 2.33/1.26 | Applying alpha-rule on (0) yields: % 2.33/1.26 | (1) ! [v0] : ( ~ cd1(v0) | ? [v1] : ra_Px2(v0, v1)) % 2.33/1.27 | (2) ! [v0] : ( ~ cUnsatisfiable(v0) | cd1(v0)) % 2.33/1.27 | (3) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | cdxcomp(v0)) % 2.33/1.27 | (4) ! [v0] : ! [v1] : ( ~ ra_Px1(v0, v1) | ~ cd(v0)) % 2.33/1.27 | (5) ? [v0] : cowlThing(v0) % 2.33/1.27 | (6) ? [v0] : (cd(v0) | ? [v1] : ra_Px1(v0, v1)) % 2.33/1.27 | (7) ! [v0] : ( ~ cdxcomp(v0) | ? [v1] : ra_Px1(v0, v1)) % 2.33/1.27 | (8) ! [v0] : ( ~ cUnsatisfiable(v0) | cd1xcomp(v0)) % 2.33/1.27 | (9) ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) % 2.33/1.27 | (10) ! [v0] : ( ~ cf(v0) | cd(v0)) % 2.33/1.27 | (11) cUnsatisfiable(i2003_11_14_17_22_23554) % 2.33/1.27 | (12) ! [v0] : ( ~ ce3(v0) | cc(v0)) % 2.33/1.27 | (13) ? [v0] : (cd1xcomp(v0) | ? [v1] : ra_Px2(v0, v1)) % 2.33/1.27 | (14) ! [v0] : ~ cowlNothing(v0) % 2.33/1.27 | (15) ? [v0] : (xsd_integer(v0) | xsd_string(v0)) % 2.33/1.27 | (16) ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | cd1(v0)) % 2.33/1.27 | (17) ! [v0] : ! [v1] : ( ~ ra_Px2(v0, v1) | ~ cd1xcomp(v0)) % 2.33/1.27 | (18) ! [v0] : ( ~ cc(v0) | cdxcomp(v0)) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (2) with i2003_11_14_17_22_23554 and discharging atoms cUnsatisfiable(i2003_11_14_17_22_23554), yields: % 2.33/1.27 | (19) cd1(i2003_11_14_17_22_23554) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (8) with i2003_11_14_17_22_23554 and discharging atoms cUnsatisfiable(i2003_11_14_17_22_23554), yields: % 2.33/1.27 | (20) cd1xcomp(i2003_11_14_17_22_23554) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (1) with i2003_11_14_17_22_23554 and discharging atoms cd1(i2003_11_14_17_22_23554), yields: % 2.33/1.27 | (21) ? [v0] : ra_Px2(i2003_11_14_17_22_23554, v0) % 2.33/1.27 | % 2.33/1.27 | Instantiating (21) with all_18_0_4 yields: % 2.33/1.27 | (22) ra_Px2(i2003_11_14_17_22_23554, all_18_0_4) % 2.33/1.27 | % 2.33/1.27 | Instantiating formula (17) with all_18_0_4, i2003_11_14_17_22_23554 and discharging atoms ra_Px2(i2003_11_14_17_22_23554, all_18_0_4), cd1xcomp(i2003_11_14_17_22_23554), yields: % 2.33/1.27 | (23) $false % 2.33/1.27 | % 2.33/1.27 |-The branch is then unsatisfiable % 2.33/1.28 % SZS output end Proof for theBenchmark % 2.33/1.28 % 2.33/1.28 662ms %------------------------------------------------------------------------------