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