%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : KRS091+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n026.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:32 EDT 2022 % Result : Unsatisfiable 1.64s 1.03s % Output : Proof 2.08s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : KRS091+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.11/0.33 % Computer : n026.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Tue Jun 7 15:23:01 EDT 2022 % 0.18/0.33 % CPUTime : % 0.18/0.57 ____ _ % 0.18/0.57 ___ / __ \_____(_)___ ________ __________ % 0.18/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.57 % 0.18/0.57 A Theorem Prover for First-Order Logic % 0.18/0.57 (ePrincess v.1.0) % 0.18/0.57 % 0.18/0.57 (c) Philipp Rümmer, 2009-2015 % 0.18/0.57 (c) Peter Backeman, 2014-2015 % 0.18/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.57 Bug reports to peter@backeman.se % 0.18/0.57 % 0.18/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.57 % 0.18/0.57 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.65/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.29/0.88 Prover 0: Preprocessing ... % 1.29/0.95 Prover 0: Warning: ignoring some quantifiers % 1.29/0.96 Prover 0: Constructing countermodel ... % 1.64/1.03 Prover 0: proved (414ms) % 1.64/1.03 % 1.64/1.03 No countermodel exists, formula is valid % 1.64/1.03 % SZS status Unsatisfiable for theBenchmark % 1.64/1.03 % 1.64/1.03 Generating proof ... Warning: ignoring some quantifiers % 2.08/1.15 found it (size 5) % 2.08/1.15 % 2.08/1.15 % SZS output start Proof for theBenchmark % 2.08/1.15 Assumed formulas after preprocessing and simplification: % 2.08/1.15 | (0) cUnsatisfiable(i2003_11_14_17_20_00819) & ! [v0] : ( ~ cf(v0) | cd(v0)) & ! [v0] : ( ~ ce3(v0) | cc(v0)) & ! [v0] : ( ~ cd1(v0) | ~ cc1(v0)) & ! [v0] : ( ~ cc1(v0) | cd1(v0)) & ! [v0] : ( ~ cc(v0) | ~ cd(v0) | cUnsatisfiable(v0)) & ! [v0] : ( ~ cc(v0) | ~ cd(v0)) & ! [v0] : ( ~ cUnsatisfiable(v0) | cc(v0)) & ! [v0] : ( ~ cUnsatisfiable(v0) | cd(v0)) & ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) & ! [v0] : ~ cowlNothing(v0) & ? [v0] : (xsd_integer(v0) | xsd_string(v0)) & ? [v0] : cowlThing(v0) % 2.08/1.16 | Applying alpha-rule on (0) yields: % 2.08/1.16 | (1) ! [v0] : ( ~ cd1(v0) | ~ cc1(v0)) % 2.08/1.16 | (2) ? [v0] : cowlThing(v0) % 2.08/1.16 | (3) ! [v0] : ( ~ xsd_integer(v0) | ~ xsd_string(v0)) % 2.08/1.16 | (4) ! [v0] : ( ~ cc(v0) | ~ cd(v0)) % 2.08/1.16 | (5) ! [v0] : ( ~ ce3(v0) | cc(v0)) % 2.08/1.17 | (6) ! [v0] : ( ~ cc1(v0) | cd1(v0)) % 2.08/1.17 | (7) cUnsatisfiable(i2003_11_14_17_20_00819) % 2.08/1.17 | (8) ! [v0] : ( ~ cc(v0) | ~ cd(v0) | cUnsatisfiable(v0)) % 2.08/1.17 | (9) ! [v0] : ~ cowlNothing(v0) % 2.08/1.17 | (10) ! [v0] : ( ~ cUnsatisfiable(v0) | cd(v0)) % 2.08/1.17 | (11) ? [v0] : (xsd_integer(v0) | xsd_string(v0)) % 2.08/1.17 | (12) ! [v0] : ( ~ cf(v0) | cd(v0)) % 2.08/1.17 | (13) ! [v0] : ( ~ cUnsatisfiable(v0) | cc(v0)) % 2.08/1.17 | % 2.08/1.17 | Instantiating formula (13) with i2003_11_14_17_20_00819 and discharging atoms cUnsatisfiable(i2003_11_14_17_20_00819), yields: % 2.08/1.17 | (14) cc(i2003_11_14_17_20_00819) % 2.08/1.17 | % 2.08/1.17 | Instantiating formula (10) with i2003_11_14_17_20_00819 and discharging atoms cUnsatisfiable(i2003_11_14_17_20_00819), yields: % 2.08/1.17 | (15) cd(i2003_11_14_17_20_00819) % 2.08/1.17 | % 2.08/1.17 | Instantiating formula (4) with i2003_11_14_17_20_00819 and discharging atoms cc(i2003_11_14_17_20_00819), cd(i2003_11_14_17_20_00819), yields: % 2.08/1.17 | (16) $false % 2.08/1.17 | % 2.08/1.17 |-The branch is then unsatisfiable % 2.08/1.17 % SZS output end Proof for theBenchmark % 2.08/1.17 % 2.08/1.17 593ms %------------------------------------------------------------------------------