%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET575+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n018.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 : Tue Jul 19 00:20:21 EDT 2022 % Result : Theorem 1.50s 0.98s % Output : Proof 2.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SET575+3 : TPTP v8.1.0. Released v2.2.0. % 0.00/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n018.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 14:42:57 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.56 ____ _ % 0.18/0.56 ___ / __ \_____(_)___ ________ __________ % 0.18/0.56 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.56 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.56 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.56 % 0.18/0.56 A Theorem Prover for First-Order Logic % 0.18/0.56 (ePrincess v.1.0) % 0.18/0.56 % 0.18/0.56 (c) Philipp Rümmer, 2009-2015 % 0.18/0.56 (c) Peter Backeman, 2014-2015 % 0.18/0.56 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.56 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.56 Bug reports to peter@backeman.se % 0.18/0.56 % 0.18/0.56 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.56 % 0.18/0.56 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.62/0.61 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.13/0.84 Prover 0: Preprocessing ... % 1.39/0.91 Prover 0: Constructing countermodel ... % 1.50/0.98 Prover 0: proved (369ms) % 1.50/0.98 % 1.50/0.98 No countermodel exists, formula is valid % 1.50/0.98 % SZS status Theorem for theBenchmark % 1.50/0.98 % 1.50/0.98 Generating proof ... found it (size 7) % 2.02/1.10 % 2.02/1.10 % SZS output start Proof for theBenchmark % 2.02/1.10 Assumed formulas after preprocessing and simplification: % 2.02/1.10 | (0) ? [v0] : ? [v1] : (intersect(v0, v1) & ! [v2] : ! [v3] : ! [v4] : ( ~ member(v4, v3) | ~ member(v4, v2) | intersect(v2, v3)) & ! [v2] : ! [v3] : ( ~ intersect(v2, v3) | intersect(v3, v2)) & ! [v2] : ! [v3] : ( ~ intersect(v2, v3) | ? [v4] : (member(v4, v3) & member(v4, v2))) & ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0))) % 2.02/1.11 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 2.02/1.11 | (1) intersect(all_0_1_1, all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0) | intersect(v0, v1)) & ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0)) & ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | ? [v2] : (member(v2, v1) & member(v2, v0))) & ! [v0] : ( ~ member(v0, all_0_0_0) | ~ member(v0, all_0_1_1)) % 2.02/1.11 | % 2.02/1.11 | Applying alpha-rule on (1) yields: % 2.02/1.11 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0) | intersect(v0, v1)) % 2.02/1.11 | (3) intersect(all_0_1_1, all_0_0_0) % 2.02/1.11 | (4) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0)) % 2.02/1.11 | (5) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | ? [v2] : (member(v2, v1) & member(v2, v0))) % 2.02/1.11 | (6) ! [v0] : ( ~ member(v0, all_0_0_0) | ~ member(v0, all_0_1_1)) % 2.02/1.11 | % 2.02/1.11 | Instantiating formula (5) with all_0_0_0, all_0_1_1 and discharging atoms intersect(all_0_1_1, all_0_0_0), yields: % 2.02/1.11 | (7) ? [v0] : (member(v0, all_0_0_0) & member(v0, all_0_1_1)) % 2.02/1.11 | % 2.02/1.11 | Instantiating (7) with all_9_0_2 yields: % 2.02/1.11 | (8) member(all_9_0_2, all_0_0_0) & member(all_9_0_2, all_0_1_1) % 2.02/1.11 | % 2.02/1.11 | Applying alpha-rule on (8) yields: % 2.02/1.11 | (9) member(all_9_0_2, all_0_0_0) % 2.02/1.11 | (10) member(all_9_0_2, all_0_1_1) % 2.02/1.12 | % 2.02/1.12 | Instantiating formula (6) with all_9_0_2 and discharging atoms member(all_9_0_2, all_0_0_0), member(all_9_0_2, all_0_1_1), yields: % 2.02/1.12 | (11) $false % 2.02/1.12 | % 2.02/1.12 |-The branch is then unsatisfiable % 2.02/1.12 % SZS output end Proof for theBenchmark % 2.02/1.12 % 2.02/1.12 545ms %------------------------------------------------------------------------------