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